DeSiGNAR
0.5a
Data Structures General Library
|
#include <nodesdef.H>
Classes | |
class | Iterator |
Public Member Functions | |
DLNode () | |
DLNode (const T &i) | |
DLNode (T &&i) | |
DLNode (const DLNode &)=delete | |
DLNode (DLNode &&n) | |
DLNode & | operator= (const DLNode &)=delete |
DLNode & | operator= (DLNode &&n) |
T & | get_item () |
const T & | get_item () const |
DLNode *& | get_next () |
const DLNode *& | get_next () const |
DLNode *& | get_prev () |
const DLNode *& | get_prev () const |
DLNode * | remove_next () |
DLNode * | remove_prev () |
Public Member Functions inherited from Designar::DL | |
DL () | |
DL (const DL &) | |
DL (DL &&l) | |
DL & | operator= (const DL &) |
DL & | operator= (DL &&l) |
void | reset () |
bool | is_empty () const |
bool | is_unitarian_or_empty () const |
bool | is_unitarian () const |
DL *& | get_next () |
const DL *& | get_next () const |
DL *& | get_prev () |
const DL *& | get_prev () const |
void | insert_next (DL *node) |
void | insert_prev (DL *node) |
void | del () |
DL * | remove_next () |
DL * | remove_prev () |
void | swap (DL *node) |
void | swap (DL &node) |
void | concat (DL *l) |
void | concat (DL &l) |
void | split (DL &, DL &) |
|
inline |
|
inline |
|
inline |
|
delete |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
delete |
|
inline |
|
inline |
|
inline |