DeSiGNAR  0.5a
Data Structures General Library
Classes | Public Member Functions | List of all members
Designar::DL Class Reference

#include <nodesdef.H>

Inheritance diagram for Designar::DL:
Inheritance graph
[legend]

Classes

class  Iterator
 

Public Member Functions

 DL ()
 
 DL (const DL &)
 
 DL (DL &&l)
 
DLoperator= (const DL &)
 
DLoperator= (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 ()
 
DLremove_next ()
 
DLremove_prev ()
 
void swap (DL *node)
 
void swap (DL &node)
 
void concat (DL *l)
 
void concat (DL &l)
 
void split (DL &, DL &)
 

Constructor & Destructor Documentation

Designar::DL::DL ( )
inline
Designar::DL::DL ( const DL )
inline
Designar::DL::DL ( DL &&  l)
inline

Member Function Documentation

void Designar::DL::concat ( DL l)
inline
void Designar::DL::concat ( DL l)
inline
void Designar::DL::del ( )
inline
DL*& Designar::DL::get_next ( )
inline
const DL*& Designar::DL::get_next ( ) const
inline
DL*& Designar::DL::get_prev ( )
inline
const DL*& Designar::DL::get_prev ( ) const
inline
void Designar::DL::insert_next ( DL node)
inline
void Designar::DL::insert_prev ( DL node)
inline
bool Designar::DL::is_empty ( ) const
inline
bool Designar::DL::is_unitarian ( ) const
inline
bool Designar::DL::is_unitarian_or_empty ( ) const
inline
DL& Designar::DL::operator= ( const DL )
inline
DL& Designar::DL::operator= ( DL &&  l)
inline
DL* Designar::DL::remove_next ( )
inline
DL* Designar::DL::remove_prev ( )
inline
void Designar::DL::reset ( )
inline
void Designar::DL::split ( DL ,
DL  
)
void Designar::DL::swap ( DL node)
inline
void Designar::DL::swap ( DL node)
inline

The documentation for this class was generated from the following file: