Search  

---

C:/temp/src/j2k/DataType/Link/SList.hpp

Go to the documentation of this file.

// SList.hpp - Class interface for a Single-Linked list node with freelist 

#ifndef __J2K__SList_HPP__
#define __J2K__SList_HPP__

#include <j2k/Fred/Standard.hpp>
#include <j2k/DataType/Link/SLink.hpp>

/////////////////////////////////////////////////////////////////////////////
/// WARNING:  curr->next  is the OFFICIAL current element !               ///
/// This is to avoid prev(), when adding or removing elements !           ///
/////////////////////////////////////////////////////////////////////////////

class SList {                          // Single-Linked list class
public:
  SList();                             // Default Constructor
  virtual ~SList();                    // Destructor

  void   clear();                      // Remove all Elems from list
  void   insert( Elem  item );         // Insert Elem at current pos
  void   append( Elem  item );         // Insert Elem at tail of list
  Elem   remove();                     // Remove + return current Elem
  void   setFirst();                   // Set curr to first position
  void   next();                       // Move curr to next position
  void   prev();                       // Move curr to previous pos ( COSTLY )
  ULONG  length() const;               // Return current length of list
  void   setPos( ULONG pos );          // Set curr to specified pos
  void   setValue( Elem  item );       // Set current Elem's value
  Elem   currValue() const;            // Return current Elem's value
  Elem   getValue() const;             // Return current Elem's value
  BOOL   isEmpty() const;              // Return TRUE if list is empty
  BOOL   isInList() const;             // TRUE if curr is within list
  long   find( Elem  item );           // Find value (from current pos)

  void   display();

  long   getPos() const;
  long   size() const;

  inline void  enqueue( Elem item );
  inline Elem  dequeue();

private:
  SLink*  head;                        // Pointer to list header
  SLink*  tail;                        // Pointer to last Elem in list 
  SLink*  curr;                        // Position of "current" Elem

  ULONG   pos;
  ULONG   nbElements;            // Actual number of items in list
};

#endif

---