LexSort function optimization

This commit is contained in:
Pavel Vaynerman 2015-10-26 23:28:25 +03:00
parent b3b2352045
commit 3fc8a8c82c
2 changed files with 2 additions and 2 deletions

View File

@ -22,7 +22,7 @@
namespace Catch {
struct LexSort {
bool operator() (TestCase i,TestCase j) const { return (i<j);}
bool operator() (const TestCase& i, const TestCase& j) const { return (i<j);}
};
struct RandomNumberGenerator {
int operator()( int n ) const { return std::rand() % n; }

View File

@ -5926,7 +5926,7 @@ namespace Catch {
namespace Catch {
struct LexSort {
bool operator() (TestCase i,TestCase j) const { return (i<j);}
bool operator() (const TestCase& i, const TestCase& j) const { return (i<j);}
};
struct RandomNumberGenerator {
int operator()( int n ) const { return std::rand() % n; }