18 #include "TTableIter.h"
19 #include "TTableSorter.h"
26 TTableIter::TTableIter(
const TTableSorter *table, Float_t &keyvalue)
27 : fTableSorter(table), fIndx(0), fFirstIndx(0)
35 TTableIter::TTableIter(
const TTableSorter *table, Long_t &keyvalue)
36 : fTableSorter(table), fIndx(0), fFirstIndx(0)
45 : fTableSorter(table), fIndx(0), fFirstIndx(0)
53 TTableIter::TTableIter(
const TTableSorter *table, Short_t &keyvalue)
54 : fTableSorter(table), fIndx(0), fFirstIndx(0)
62 TTableIter::TTableIter(
const TTableSorter *table, Double_t &keyvalue)
63 : fTableSorter(table), fIndx(0), fFirstIndx(0)
73 fTotalKeys = fTableSorter->
CountKey(&keyvalue,0,kTRUE,&fFirstIndx);
81 fTotalKeys = fTableSorter->
CountKey(&keyvalue,0,kTRUE,&fFirstIndx);
90 fTotalKeys = fTableSorter->
CountKey(&keyvalue,0,kTRUE,&fFirstIndx);
99 fTotalKeys = fTableSorter->
CountKey(&keyvalue,0,kTRUE,&fFirstIndx);
108 fTotalKeys = fTableSorter->
CountKey(&keyvalue,0,kTRUE,&fFirstIndx);
118 if (fIndx < fTotalKeys) {
119 rowIndx = fTableSorter->
GetIndex(UInt_t(fFirstIndx+fIndx));
131 if (idx < fTotalKeys)
132 rowIndx = fTableSorter->
GetIndex(UInt_t(fFirstIndx+idx));
141 Int_t oldIdx = fIndx;
142 fIndx = TMath::Min(indx,fTotalKeys);
Int_t Reset(Int_t indx=0)
to be documented
Int_t GetIndex(UInt_t sortedIndex) const
returns the original index of the row by its sorted index
virtual Long_t GetNRows() const
Returns the number of the used rows for the wrapped table.
Int_t Next()
to be documented
Int_t CountKey(Float_t &keyvalue)
to be documented
virtual Int_t CountKey(const void *key, Int_t firstIndx=0, Bool_t bSearch=kTRUE, Int_t *firstRow=0) const