44 previous = current = begin = end = 0;
49 current = begin = end = f;
74 for (; nd; nd = nd->
Next()) {
121 if (!curr || curr->
Buck() != b || (prev && curr != prev->
Next())) {
125 for (; curr; curr = curr->
Next()) {
126 if (curr->
Buck() == b)
138 current = curr->
Next();
141 }
else if (curr == begin) {
143 current = curr->
Next();
161 return current->
Buck();
172 current = current->
Next();
174 return current->
Buck();
void SetNext(XrdSutBuckListNode *n)
XrdSutBuckListNode * Next() const
XrdSutBucket * Buck() const
void Remove(XrdSutBucket *b)
void PushBack(XrdSutBucket *b)
XrdSutBuckList(XrdSutBucket *b=0)
virtual ~XrdSutBuckList()
void PutInFront(XrdSutBucket *b)