Skip to content

DoublyLinkedListWrap

Synopsis

Declared in <support/DoublyLinkedList.h>

template<class T>
class DoublyLinkedListWrap;

Types

Name
Iterator
const_iterator
iterator

Member Functions

Name Description
DoublyLinkedListWrap
DoublyLinkedListWrap(); [constructor]
Constructors
~DoublyLinkedListWrap
~DoublyLinkedListWrap(); [destructor]
Destructor
operator=
void operator=(DoublyLinkedListWrap<T> const& that);
AppendLast
DoublyLinkedEntryWrap<T>* AppendLast(T const& o);
Delete
void Delete(DoublyLinkedEntryWrap<T>* e);
DeleteAll
void DeleteAll();
First
DoublyLinkedEntryWrap<T>* First() const;
InsertAfter
DoublyLinkedEntryWrap<T>* InsertAfter( T const& o, DoublyLinkedEntryWrap<T>* pos);
InsertBefore
DoublyLinkedEntryWrap<T>* InsertBefore( T const& o, DoublyLinkedEntryWrap<T>* pos);
Last
DoublyLinkedEntryWrap<T>* Last() const;
LinkAfter
void LinkAfter( DoublyLinkedEntryWrap<T>* e, DoublyLinkedEntryWrap<T>* pos);
LinkBefore
void LinkBefore( DoublyLinkedEntryWrap<T>* e, DoublyLinkedEntryWrap<T>* pos);
Next
DoublyLinkedEntryWrap<T>* Next(DoublyLinkedEntryWrap<T> const* cur) const;
NumberOfEntries
unsigned int NumberOfEntries() const;
Prev
DoublyLinkedEntryWrap<T>* Prev(DoublyLinkedEntryWrap<T>* cur) const;
PushFirst
DoublyLinkedEntryWrap<T>* PushFirst(T const& o);
Reverse
void Reverse();
Sort
void Sort(CompareObject<T>& f);
Unlink
void Unlink(DoublyLinkedEntryWrap<T>* e);
back
T& back() const;
begin
const_iterator begin() const;
clear
void clear();
end
const_iterator end() const;
erase
void erase(iterator& p);
front
T& front() const;
push_back
void push_back(T const& o);
push_front
void push_front(T const& o);
reverse
void reverse();
size
unsigned int size() const;

Private Data Members

Name
count
head

Derived Classes

Name Description
LatticeElemList

Created with MrDocs