ListMap

Container used internally by IniLikeFile and IniLikeGroup. Technically this is a list with optional value access by key.

Postblit

this(this) this(this)

Members

Functions

addAfter Node* addAfter(Node* node, V value): Add value after some node in the list.
addBefore Node* addBefore(Node* node, V value): Add value before some node in the list.
append Node* append(V value): Add value at the end of list.
byEntry auto byEntry(): Iterate over nodes mapped to Entry elements (useful for testing).
byNode auto byNode(): Iterate over list nodes.
getNode inout(Node)* getNode(K key): Get list node by key.
insertAfter Node* insertAfter(Node* node, K key, V value): Insert key-value pair after some node in the list.
insertBack Node* insertBack(K key, V value): Insert key-value pair to the back of list.
insertBefore Node* insertBefore(Node* node, K key, V value): Insert key-value pair before some node in the list.
insertFront Node* insertFront(K key, V value): Insert key-value pair to the front of list.
moveAfter void moveAfter(Node* other, Node* toMove): Move node to the location after other node.
moveBefore void moveBefore(Node* other, Node* toMove): Move node to the location before other node.
moveToBack void moveToBack(Node* toMove): Move node to the back of list.
moveToFront void moveToFront(Node* toMove): Move node to the front of list.
prepend Node* prepend(V value): Add value at the start of list.
remove void remove(Node* toRemove): Remove node from list. It also becomes unaccessible via key lookup.
remove bool remove(K key): Remove value by key.
removeBack void removeBack(): Remove the last node.
removeFront void removeFront(): Remove the first node.

Structs

Entry struct Entry(T = V): Mapping of Node to structure.
Node struct Node: Represenation of list node.

ListMap

Postblit

Members

Functions

Structs

Meta

Source