LibBeamApi: BList< T > Class Template Reference Support Website

Search

Home Status Documentation Design Packages Packages 2.0.5 Admin

Local Home Links Home Alpha Data CERN Beam CERN Demo Sys CERN Alphadata/BEAM Admin

BList< T > Class Template Reference Template based list class. More... #include <BList.h> Inheritance diagram for BList< T >: List of all members. Public Types typedef int(*)  SortFunc (T &a, T &b)   Prototype for sorting function. Public Member Functions   BList ()   BList (const BList< T > &l) virtual  ~BList () void  start (BIter &i) const   Iterator to start of list. BIter  begin () const   Iterator for start of list. BIter  end () const   Iterator for end of list. BIter  end (BIter &i) const   Iterator for end of list. void  next (BIter &i) const   Iterator for next item in list. void  prev (BIter &i)   Iterator for previous item in list. BIter  goTo (int pos)   Iterator for pos item in list. int  position (BIter i)   Postition in list item with iterator i. unsigned int  number ()   Number of items in list. int  isEnd (BIter i) const   True if iterator refers to last item. T &  front ()   Get first item in list. T &  rear ()   Get last item in list. T &  get (BIter i)   Get item specified by iterator in list. const T &  get (BIter i) const   Get item specified by iterator in list. void  append (const T &item)   Append item to list. virtual void  insert (BIter &i, const T &item)   Insert item before item. void  insertAfter (BIter &i, const T &item)   Insert item after item. virtual void  clear ()   Clear the list. virtual void  del (BIter &i)   Delete specified item. void  deleteLast ()   Delete last item. void  deleteFirst ()   Delete fisrt item. void  push (const T &i)   Push item onto list. T  pop ()   Pop item from list deleteing item. void  queueAdd (const T &i)   Add item to end of list. T  queueGet ()   Get item from front of list deleteing item. void  append (const BList< T > &l)   Append list to list. void  swap (BIter i1, BIter i2)   Swap two items in list. void  sort ()   Sort list based on get(i) values. void  sort (SortFunc func)   Sort list based on Sort func. BList< T > &  operator= (const BList< T > &l) T &  operator[] (int i) const T &  operator[] (int i) const T &  operator[] (BIter i) const T &  operator[] (BIter i) const BList< T >  operator+ (const BList< T > &l) const Protected Member Functions virtual Node *  nodeGet (BIter i) virtual const Node *  nodeGet (BIter i) const virtual Node *  nodeCreate (const T &item) Protected Attributes Node *  onodes unsigned int  olength Private Member Functions virtual Node *  nodeCreate () Classes class   Node Detailed Description template<class T> class BList< T > Template based list class. Member Typedef Documentation template<class T> typedef int(*) BList< T >::SortFunc(T &a, T &b) Prototype for sorting function. Constructor & Destructor Documentation template<class T> BList< T >::BList (  )  template<class T> BList< T >::BList ( const BList< T > &  l  )  template<class T> BList< T >::~BList (  )  [virtual] Member Function Documentation template<class T> void BList< T >::start ( BIter &  i  )  const Iterator to start of list. template<class T> BIter BList< T >::begin (  )  const Iterator for start of list. template<class T> BIter BList< T >::end (  )  const Iterator for end of list. template<class T> BIter BList< T >::end ( BIter &  i  )  const Iterator for end of list. template<class T> void BList< T >::next ( BIter &  i  )  const Iterator for next item in list. template<class T> void BList< T >::prev ( BIter &  i  )  Iterator for previous item in list. template<class T> BIter BList< T >::goTo ( int  pos  )  Iterator for pos item in list. template<class T> int BList< T >::position ( BIter  i  )  Postition in list item with iterator i. template<class T> unsigned int BList< T >::number (  )  Number of items in list. template<class T> int BList< T >::isEnd ( BIter  i  )  const True if iterator refers to last item. template<class T> T & BList< T >::front (  )  Get first item in list. template<class T> T & BList< T >::rear (  )  Get last item in list. template<class T> T & BList< T >::get ( BIter  i  )  Get item specified by iterator in list. template<class T> const T & BList< T >::get ( BIter  i  )  const Get item specified by iterator in list. template<class T> void BList< T >::append ( const T &  item  )  Append item to list. template<class T> void BList< T >::insert ( BIter &  i, const T &  item   ) [virtual] Insert item before item. Reimplemented in BEntryList. template<class T> void BList< T >::insertAfter ( BIter &  i, const T &  item   ) Insert item after item. template<class T> void BList< T >::clear (  )  [virtual] Clear the list. Reimplemented in BDir, BEntryList, and BEntryFile. template<class T> void BList< T >::del ( BIter &  i  )  [virtual] Delete specified item. Reimplemented in BEntryList. template<class T> void BList< T >::deleteLast (  )  Delete last item. template<class T> void BList< T >::deleteFirst (  )  Delete fisrt item. template<class T> void BList< T >::push ( const T &  i  )  Push item onto list. template<class T> T BList< T >::pop (  )  Pop item from list deleteing item. template<class T> void BList< T >::queueAdd ( const T &  i  )  Add item to end of list. template<class T> T BList< T >::queueGet (  )  Get item from front of list deleteing item. template<class T> void BList< T >::append ( const BList< T > &  l  )  Append list to list. template<class T> void BList< T >::swap ( BIter  i1, BIter  i2   ) Swap two items in list. template<class T> void BList< T >::sort (  )  Sort list based on get(i) values. template<class T> void BList< T >::sort ( SortFunc  func  )  Sort list based on Sort func. template<class T> BList< T > & BList< T >::operator= ( const BList< T > &  l  )  template<class T> T & BList< T >::operator[] ( int  i  )  template<class T> const T & BList< T >::operator[] ( int  i  )  const template<class T> T & BList< T >::operator[] ( BIter  i  )  template<class T> const T & BList< T >::operator[] ( BIter  i  )  const template<class T> BList< T > BList< T >::operator+ ( const BList< T > &  l  )  const template<class T> BList< T >::Node * BList< T >::nodeGet ( BIter  i  )  [protected, virtual] template<class T> const BList< T >::Node * BList< T >::nodeGet ( BIter  i  )  const [protected, virtual] template<class T> BList< T >::Node * BList< T >::nodeCreate ( const T &  item  )  [protected, virtual] template<class T> BList< T >::Node * BList< T >::nodeCreate (  )  [private, virtual] Member Data Documentation template<class T> Node* BList< T >::onodes [protected] template<class T> unsigned int BList< T >::olength [protected] The documentation for this class was generated from the following files: BList.h BList_func.h

© BEAM Ltd 2006 - 2018