fCompare
AVLTreeCompare* fCompare;
return fCompare(a, GetKey(b));
return fCompare(GetKey(a), GetKey(b));
KeyOrder fCompare;
return fCompare(a, b);
KeyOrder fCompare;
return fCompare(a, b);
KeyOrder fCompare;
int cmp = fCompare(fElements[mid], value);
exists = (lower < Count() && fCompare(value, fElements[lower]) == 0);
ElementOrder fCompare;
int cmp = fCompare->CompareKeyNode(key, node);
int cmp = fCompare->CompareKeyNode(key, node);
int cmp = fCompare->CompareKeyNode(key, node);
int cmp = fCompare->CompareKeyNode(key, node);
int cmp = fCompare->CompareNodes(nodeToInsert, *node);
{ return fCompare(a, b) < 0; }
Compare fCompare;
CPPUNIT_ASSERT(fCompare(fMyMap.Begin()->Key(), key) > 0);
CPPUNIT_ASSERT(fCompare((--MyIterator(myIt))->Key(), key) < 0);
CPPUNIT_ASSERT(fCompare(myIt->Key(), key) <= 0);
CPPUNIT_ASSERT(fCompare(nextMyIt->Key(), key) > 0);
CPPUNIT_ASSERT(fCompare(myIt->Key(), key) >= 0);
CPPUNIT_ASSERT(fCompare(prevMyIt->Key(), key) < 0);
CPPUNIT_ASSERT(fCompare(fMyMap.Begin()->Key(), key) > 0);
CPPUNIT_ASSERT(fCompare((--MyConstIterator(myIt))->Key(), key) < 0);
CPPUNIT_ASSERT(fCompare(myIt->Key(), key) <= 0);
CPPUNIT_ASSERT(fCompare(nextMyIt->Key(), key) > 0);
CPPUNIT_ASSERT(fCompare(myIt->Key(), key) >= 0);
CPPUNIT_ASSERT(fCompare(prevMyIt->Key(), key) < 0);
Compare fCompare;
CPPUNIT_ASSERT(fCompare(*fMySet.Begin(), value) > 0);
CPPUNIT_ASSERT(fCompare(*--MyIterator(myIt), value) < 0);
CPPUNIT_ASSERT(fCompare(*myIt, value) <= 0);
CPPUNIT_ASSERT(fCompare(*nextMyIt, value) > 0);
CPPUNIT_ASSERT(fCompare(*myIt, value) >= 0);
CPPUNIT_ASSERT(fCompare(*prevMyIt, value) < 0);
CPPUNIT_ASSERT(fCompare(*fMySet.Begin(), value) > 0);
CPPUNIT_ASSERT(fCompare(*--MyConstIterator(myIt), value) < 0);
CPPUNIT_ASSERT(fCompare(*myIt, value) <= 0);
CPPUNIT_ASSERT(fCompare(*nextMyIt, value) > 0);
CPPUNIT_ASSERT(fCompare(*myIt, value) >= 0);
CPPUNIT_ASSERT(fCompare(*prevMyIt, value) < 0);
Compare fCompare;
inline bool operator()(const Value& a, const Value& b) const { return fCompare(a, b) < 0; }
Compare fCompare;