#include <nodesdef.H>
Designar::DL::DL |
( |
const DL & |
| ) |
|
|
inline |
Designar::DL::DL |
( |
DL && |
l | ) |
|
|
inline |
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: