NodeList

Undocumented in source.

class NodeList {

mixin Signal!(Node) nodeAdded;

mixin Signal!(Node) nodeRemoved;

void add(Node node_a);

void remove(Node node_a);

Node[] allNodes();

void removeAll();

bool isEmpty();

void swap(Node node1_a, Node node2_a);

void insertionSort(SortFuncType sortFunction_a);

void mergeSort(SortFuncType sortFunction_a);

Node merge(Node head1_a, Node head2_a, SortFuncType sortFunction_a);

}

Constructors

this this(): Undocumented in source.

Members

Functions

add void add(Node node_a): Undocumented in source. Be warned that the author may not have intended to support it.
allNodes Node[] allNodes(): Collect all nodes into array
head Node head(): access head node
insertionSort void insertionSort(SortFuncType sortFunction_a): Performs an insertion sort on the node list. In general, insertion sort is very efficient with short lists and with lists that are mostly sorted, but is inefficient with large lists that are randomly ordered.
isEmpty bool isEmpty(): true if the list is empty, false otherwise.
merge Node merge(Node head1_a, Node head2_a, SortFuncType sortFunction_a): Undocumented in source. Be warned that the author may not have intended to support it.
mergeSort void mergeSort(SortFuncType sortFunction_a): Performs a merge sort on the node list. In general, merge sort is more efficient than insertion sort with long lists that are very unsorted.
remove void remove(Node node_a): Undocumented in source. Be warned that the author may not have intended to support it.
removeAll void removeAll(): Remove all nodes from list
swap void swap(Node node1_a, Node node2_a): Swaps the positions of two nodes in the list. Useful when sorting a list.

Mixins

nodeAdded mixin Signal!(Node) nodeAdded: A signal that is dispatched whenever a node is added to the node list.
nodeRemoved mixin Signal!(Node) nodeRemoved: A signal that is dispatched whenever a node is removed from the node list.

Meta

Source

See Implementation

ashd core nodelist aliases

SortFuncType

classes

NodeList