| void Impala::Util::TestSort | ( | ) |
Definition at line 24 of file Test.h.
References Impala::Core::Table::Sort().
00025 { 00026 // quicksort only 'kicks in' if testLength > Util::cQuicksortTreshold 00027 int testLength = 20; 00028 namespace blabla = Domain::Classifier; 00029 using namespace blabla; 00030 RankingTableType* rank = MakeRankingTable(testLength); 00031 int i; 00032 for(i=0 ; i<testLength ; ++i) 00033 rank->Add(std::string(3, 'd'-i), i, (double)testLength/(i+1.), (i+1.)/(double)testLength); 00034 for(i=0 ; i<4 ; ++i) 00035 { 00036 Sort(rank,i+1); 00037 rank->Dump(); 00038 } 00039 }
Here is the call graph for this function:
