XrdSutBuckList Class Reference

#include <XrdSutBuckList.hh>

Collaboration diagram for XrdSutBuckList:

Public Member Functions
	XrdSutBuckList (XrdSutBucket *b=0)
virtual	~XrdSutBuckList ()
XrdSutBucket *	Begin ()
XrdSutBucket *	End () const
XrdSutBucket *	Next ()
void	PushBack (XrdSutBucket *b)
void	PutInFront (XrdSutBucket *b)
void	Remove (XrdSutBucket *b)
int	Size () const

Detailed Description

Definition at line 61 of file XrdSutBuckList.hh.

Constructor & Destructor Documentation

XrdSutBuckList()

XrdSutBuckList::XrdSutBuckList

(

XrdSutBucket *

b = 0

)

Definition at line 40 of file XrdSutBuckList.cc.

{
   // Constructor
 
   previous = current = begin = end = 0;
   size = 0; 
 
   if (b) {
      XrdSutBuckListNode *f = new XrdSutBuckListNode(b,0);
      current = begin = end = f;
      size++;
   }
} 

~XrdSutBuckList()

XrdSutBuckList::~XrdSutBuckList ( )

virtual

Definition at line 55 of file XrdSutBuckList.cc.

{
   // Destructor
 
   XrdSutBuckListNode *n = 0;
   XrdSutBuckListNode *b = begin;
   while (b) {
      n = b->Next();
      delete (b);
      b = n;
   }
}

References XrdSutBuckListNode::Next().

Here is the call graph for this function:

Member Function Documentation

Begin()

XrdSutBucket * XrdSutBuckList::Begin

(

)

Definition at line 154 of file XrdSutBuckList.cc.

{ 
   // Iterator functionality: init
 
   previous = 0;
   current = begin;
   if (current)
      return current->Buck();
   return (XrdSutBucket *)0;
}

End()

XrdSutBucket * XrdSutBuckList::End ( ) const

inline

Definition at line 78 of file XrdSutBuckList.hh.

{ return end->Buck(); }

Next()

XrdSutBucket * XrdSutBuckList::Next

(

)

Definition at line 166 of file XrdSutBuckList.cc.

{ 
   // Iterator functionality: get next
 
   previous = current;
   if (current) {
      current = current->Next();
      if (current)
         return current->Buck();
   }
   return (XrdSutBucket *)0;
}

PushBack()

void XrdSutBuckList::PushBack

(

XrdSutBucket *

b

)

Definition at line 97 of file XrdSutBuckList.cc.

{
   // Add at the end of the list
   // Check to avoid duplicates
 
   if (!Find(b)) {
      XrdSutBuckListNode *nb = new XrdSutBuckListNode(b,0);
      if (!begin)
         begin = nb;
      if (end)
         end->SetNext(nb);
      end = nb;
      size++;
   }
}

References XrdSutBuckListNode::SetNext().

Here is the call graph for this function:

PutInFront()

void XrdSutBuckList::PutInFront

(

XrdSutBucket *

b

)

Definition at line 82 of file XrdSutBuckList.cc.

{
   // Add at the beginning of the list
   // Check to avoid duplicates
 
   if (!Find(b)) {
      XrdSutBuckListNode *nb = new XrdSutBuckListNode(b,begin);
      begin = nb;     
      if (!end)
         end = nb;
      size++;
   }
}

Remove()

void XrdSutBuckList::Remove

(

XrdSutBucket *

b

)

Definition at line 114 of file XrdSutBuckList.cc.

{
   // Remove node containing bucket b
 
   XrdSutBuckListNode *curr = current;
   XrdSutBuckListNode *prev = previous;
 
   if (!curr || curr->Buck() != b || (prev && curr != prev->Next())) {
      // We need first to find the address
      curr = begin;
      prev = 0;
      for (; curr; curr = curr->Next()) {
         if (curr->Buck() == b)
            break;
         prev = curr;
      }
   }
 
   // The bucket is not in the list
   if (!curr)
      return;
 
   // Now we have all the information to remove
   if (prev) {
      current  = curr->Next();
      prev->SetNext(current);
      previous = curr;
   } else if (curr == begin) {
      // First buffer
      current  = curr->Next();
      begin = current;
      previous = 0;
   }
 
   // Cleanup and update size
   delete curr;      
   size--;
}

References XrdSutBuckListNode::Buck(), XrdSutBuckListNode::Next(), and XrdSutBuckListNode::SetNext().

Here is the call graph for this function:

Size()

int XrdSutBuckList::Size ( ) const

inline

Definition at line 77 of file XrdSutBuckList.hh.

{ return size; }

---

The documentation for this class was generated from the following files:

• XrdSutBuckList.hh
• XrdSutBuckList.cc