BDE 4.14.0 Production release
|
#include <bslalg_bidirectionallink.h>
Public Member Functions | |
BidirectionalLink ()=default | |
BidirectionalLink (const BidirectionalLink &original)=default | |
~BidirectionalLink ()=default | |
BidirectionalLink & | operator= (const BidirectionalLink &rhs)=default |
void | setNextLink (BidirectionalLink *next) |
Set the successor of this node to be the specified next link. | |
void | setPreviousLink (BidirectionalLink *previous) |
Set the predecessor of this node to be the specified prev link. | |
void | reset () |
Set the nextLink and previousLink attributes of this value to 0. | |
BidirectionalLink * | nextLink () const |
Return the address of the next node linked from this node. | |
BidirectionalLink * | previousLink () const |
Return the address of the preceding node linked from this node. | |
This POD-like class
describes a node suitable for use in a doubly- linked (bidirectional) list, holding the addresses of the preceding and succeeding nodes, either or both of which may be 0. This class is "POD-like" to facilitate efficient allocation and use in the context of a container implementations. In order to meet the essential requirements of a POD type, this class
does not declare a constructor or destructor. However its data members are private. It satisfies the requirements of a trivial type and a standard layout type defined by the C++11 standard. Note that this type does not contain any "payload" member data: Clients creating a doubly-linked list of data must define an appropriate node type that incorporates BidirectionalLink
(generally via inheritance), and that holds the "value" of any data stored in that node.
|
default |
|
default |
|
default |
|
inline |
|
default |
|
inline |
|
inline |
|
inline |
|
inline |