113 template <
class R,
class N,
int n>
class DListInRoot {
127 void remove(N& node);
128 void remove(N* node);
131 N*
last()
const {
return last_; }
134 #if __cplusplus < 201101L
158 template <
class R,
class N,
int n>
class DListInNode {
177 R*
root()
const {
return root_; }
178 N*
next()
const {
return next_; }
179 N*
prev()
const {
return prev_; }
182 #if __cplusplus < 201101L
~DListInNode()
Definition: DListIn.hpp:348
void addTo(R &root)
Definition: DListIn.hpp:283
N * first() const
Definition: DListIn.h:130
DListInRoot()
Definition: DListIn.hpp:303
N * prev() const
Return pointer to previous node on list.
Definition: DListIn.h:179
DListInNode(R *root=0)
Definition: DListIn.hpp:322
void addFirst(N &node)
Definition: DListIn.hpp:104
void add(N &node)
Definition: DListIn.hpp:176
void addLast(N &node)
Definition: DListIn.hpp:137
void addAfter(N &node)
Definition: DListIn.hpp:247
R * root() const
Return pointer to list we are on.
Definition: DListIn.h:177
N * last() const
Definition: DListIn.h:131
void addToEnd(R &root)
Definition: DListIn.hpp:221
~DListInRoot()
Definition: DListIn.hpp:313
N * next() const
Return pointer to next node on list.
Definition: DListIn.h:178
void addToFront(R &root)
Definition: DListIn.hpp:198