#include "TSeqCollection.h"
#include "TCollection.h"
#include "TVirtualMutex.h"
ClassImp(TSeqCollection)
Int_t TSeqCollection::IndexOf(const TObject *obj) const
{
Int_t idx = 0;
TIter next(this);
TObject *ob;
while ((ob = next())) {
if (ob->IsEqual(obj)) return idx;
idx++;
}
return -1;
}
Int_t TSeqCollection::ObjCompare(TObject *a, TObject *b)
{
if (a == 0 && b == 0) return 0;
if (a == 0) return 1;
if (b == 0) return -1;
return a->Compare(b);
}
void TSeqCollection::QSort(TObject **a, Int_t first, Int_t last)
{
R__LOCKGUARD2(gCollectionMutex);
static TObject *tmp;
static int i;
int j;
while (last - first > 1) {
i = first;
j = last;
for (;;) {
while (++i < last && ObjCompare(a[i], a[first]) < 0)
;
while (--j > first && ObjCompare(a[j], a[first]) > 0)
;
if (i >= j)
break;
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
if (j == first) {
++first;
continue;
}
tmp = a[first];
a[first] = a[j];
a[j] = tmp;
if (j - first < last - (j + 1)) {
QSort(a, first, j);
first = j + 1;
} else {
QSort(a, j + 1, last);
last = j;
}
}
}
void TSeqCollection::QSort(TObject **a, TObject **b, Int_t first, Int_t last)
{
R__LOCKGUARD2(gCollectionMutex);
static TObject *tmp1, *tmp2;
static int i;
int j;
while (last - first > 1) {
i = first;
j = last;
for (;;) {
while (++i < last && ObjCompare(a[i], a[first]) < 0)
;
while (--j > first && ObjCompare(a[j], a[first]) > 0)
;
if (i >= j)
break;
tmp1 = a[i]; tmp2 = b[i];
a[i] = a[j]; b[i] = b[j];
a[j] = tmp1; b[j] = tmp2;
}
if (j == first) {
++first;
continue;
}
tmp1 = a[first]; tmp2 = b[first];
a[first] = a[j]; b[first] = b[j];
a[j] = tmp1; b[j] = tmp2;
if (j - first < last - (j + 1)) {
QSort(a, b, first, j);
first = j + 1;
} else {
QSort(a, b, j + 1, last);
last = j;
}
}
}
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.