Classes | |
class | const_iterator |
class | iterator |
class | value_type |
Public Types | |
typedef ETraits::INARGTYPE | INARGTYPE |
Friends | |
class | iterator |
class | const_iterator |
Linked List that can be processed with extremely fast.
E | clause type of collection |
ETraits | characteristic that handles collection clause |
AllocT | one of the values of AllocType |
|
inline |
An empty header without data is added.
|
inline |
Add a header
element | Data to be inserted to a new header |
|
inline |
A new list is added to the header
plNew | List to be added to the header |
|
inline |
An empty node is added to the end of the list.
|
inline |
Add a node at the end of the list
element | Data to be inserted to the last node |
|
inline |
A new list is added to the last node of the list
plNew | List to be added |
|
inline |
Performs the same role as the same named method of STL
|
inline |
Performs the same role as the same named method of STL
|
inline |
Delete all data. Same as RemoveAll()
|
inline |
Performs the same role as the same named method of STL
|
inline |
Performs the same role as the same named method of STL
|
inline |
|
inline |
Performs the same role as the same named method of STL
|
inline |
Find a node with data
element | Data of the node to be searched for |
posStartAfter | Search by comparing after this position |
|
inline |
Return the position of the next node for the number if iElement from the header
iElement | Number of the node to be passed after iElement |
|
inline |
Obtain the data of the current node
pos | Position of the current node |
|
inline |
Obtain the data of the current node as a const variable
pos | Position of the current node |
|
inline |
Return the first data in the
|
inline |
|
inline |
|
inline |
Obtain the next node position of the position inserted as a factor
pos | Current position. |
|
inline |
Obtain the next node position of the position inserted as a factor
pos | Current position |
|
inline |
Obtain the previous node position of the position inserted as a factor
pos | Current position |
|
inline |
Obtain the previous node position of the position inserted as a factor
pos | Current position |
|
inline |
|
inline |
|
inline |
|
inline |
Add a new node behind the node pointed by the current position
pos | Position pointing the current node |
element | Data of the new node to be added |
|
inline |
Add a new node in front of the node pointed by the current position
pos | Position pointing the current node |
element | Data of the new node to be added |
|
inline |
If there is no data then true, otherwise return false.
|
inline |
Send the node pointed by the current position to the beginning of the list
pos | Position of the current node |
|
inline |
Send the node pointed by the current position to the end of the list
pos | Position of the current node |
|
inline |
Delete all data. Same as Clear()
|
inline |
Delete the node pointed by the current position and then return the next position
pos | Position of the node to be deleted |
|
inline |
Deletes the first data within the list and returns it.
|
inline |
First data of the list is deleted.
|
inline |
Deletes the first data within the list and returns it.
|
inline |
Last data of the list is deleted.
|
inline |
Configure the data of the node pointed by the current position
pos | Position of the current node |
element | Data to be configured |
|
inline |
Switch the position of the two nodes. As a big waste may occur if you directly swap the elements so you change the relevant pointers of the two nodes.
pos1 | Position of the first node to be changed |
pos2 | Position of the second node to be changed |