| void Impala::Core::Table::SortOnColumn5 | ( | TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T > * | t, | |
| bool | ascending | |||
| ) |
Definition at line 170 of file Sort.h.
References Impala::Util::ApplyOrder(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn1(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn2(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn3(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn4(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn5(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn6(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn7(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn8(), Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn9(), Impala::Util::QuickSortCo(), Impala::Util::QuickSortDescCo(), and Impala::Core::Table::Table::Size().
Referenced by Impala::Core::Feature::HarrisLaplaceDetector::CHLDetector(), Impala::Core::Feature::HarrisLaplaceDetector::HLDetector(), Impala::Core::Feature::LaplacianDetector(), and Sort().
00171 { 00172 int i; 00173 ColumnInt32 rank(t->Size()); 00174 for(i=0 ; i<t->Size() ; i++) 00175 rank.Set(i, i); 00176 00177 if(ascending) 00178 Util::QuickSortCo(t->GetColumn5()->GetData(), rank.GetData(), 0, t->Size()-1); 00179 else 00180 Util::QuickSortDescCo(t->GetColumn5()->GetData(), rank.GetData(), 0, t->Size()-1); 00181 00182 /* compute order from the rank, so fill an array with numbers 00183 at the positions they are found in the array 'rank'. 00184 this is the 'inverse of the ordering' so to say... */ 00185 ColumnInt32 order(t->Size()); 00186 for(i=0 ; i<t->Size() ; i++) 00187 order.Set(rank.Get(i), i); 00188 00189 ApplyOrder(t->GetColumn1(), &order); 00190 ApplyOrder(t->GetColumn2(), &order); 00191 ApplyOrder(t->GetColumn3(), &order); 00192 ApplyOrder(t->GetColumn4(), &order); 00193 ApplyOrder(t->GetColumn6(), &order); 00194 ApplyOrder(t->GetColumn7(), &order); 00195 ApplyOrder(t->GetColumn8(), &order); 00196 ApplyOrder(t->GetColumn9(), &order); 00197 }
Here is the call graph for this function:
