Kerbal Space Program
1.12.4
|
Represents a singly linked list. More...
Public Member Functions | |
Lookup< K, T > | AddTo< K > (Lookup< K, T > lookup, DelegateFunc< T, K > selector) |
Adds the nodes in the list to the specified lookup using the specified key selector. More... | |
Lookup< K, T > | AddTo< K, P > (Lookup< K, T > lookup, DelegateFunc< T, P, K > selector, P parameter) |
Adds the nodes in the list to the specified lookup using the specified key selector. More... | |
void | Append (T value) |
Appends a pooled node with with specified value to the end of the list. More... | |
void | Append (Linked< T > node) |
Appends the specified node to the end of the list. More... | |
void | Append (LinkedHeadTail< T > other) |
Appends the specified list to the end of this list. More... | |
void | Dispose () |
Releases the head of the list to the node pool. More... | |
void | DisposeInBackground () |
Adds the head of the list to the disposal queue. More... | |
override bool | Equals (object other) |
bool | Equals (LinkedHeadTail< T > other) |
override int | GetHashCode () |
LinkedHeadTail (T value) | |
Returns a list containing a single node with the specified value. More... | |
LinkedHeadTail (Linked< T > head) | |
Returns a list that starts with the specified node. More... | |
Slinq< T, LinkedContext< T > > | SlinqAndDispose () |
Returns a Slinq that enumerates the values contained in the list. More... | |
Slinq< T, LinkedContext< T > > | SlinqAndKeep () |
Returns a Slinq that enumerates the values contained in the list without reliquishing ownership of the nodes. More... | |
Slinq< T, LinkedContext< T > > | SlinqAndKeep (BacktrackDetector bd) |
Returns a Slinq that enumerates the values contained in the list without reliquishing ownership of the nodes. More... | |
Lookup< K, T > | ToLookup< K > (DelegateFunc< T, K > selector) |
Returns a pooled lookup with the default key comparer containing the nodes in the list as partitioned by the specified key selector. More... | |
Lookup< K, T > | ToLookup< K > (DelegateFunc< T, K > selector, IEqualityComparer< K > comparer) |
Returns a pooled lookup with the specified key comparer containing the nodes in the list as partitioned by the specified key selector. More... | |
Lookup< K, T > | ToLookup< K, P > (DelegateFunc< T, P, K > selector, P parameter) |
Returns a pooled lookup with the default key comparer containing the nodes in the list as partitioned by the specified key selector. More... | |
Lookup< K, T > | ToLookup< K, P > (DelegateFunc< T, P, K > selector, P parameter, IEqualityComparer< K > comparer) |
Returns a pooled lookup with the specified key comparer containing the nodes in the list as partitioned by the specified key selector. More... | |
Static Public Member Functions | |
static bool | operator!= (LinkedHeadTail< T > lhs, LinkedHeadTail< T > rhs) |
static bool | operator== (LinkedHeadTail< T > lhs, LinkedHeadTail< T > rhs) |
Public Attributes | |
int | count |
The number of elements in the list. More... | |
Linked< T > | head |
The first node in the list. More... | |
Linked< T > | tail |
The last node in the list. More... | |
Represents a singly linked list.
|
inline |
Returns a list containing a single node with the specified value.
|
inline |
Returns a list that starts with the specified node.
The constructor will traverse the node links to set the tail and count fields.
If the specified node is null, the resulting list will be empty.
|
inline |
Adds the nodes in the list to the specified lookup using the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
|
inline |
Adds the nodes in the list to the specified lookup using the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
|
inline |
Appends a pooled node with with specified value to the end of the list.
|
inline |
Appends the specified node to the end of the list.
The node links will be traversed to determine the new tail and count.
If the specified node is null, the list will not be modified.
|
inline |
Appends the specified list to the end of this list.
This list and the specified list must be well formed when calling this method or the program will enter an invalid state, resulting in unspecified behaviour.
Calling this method will invalidate the specified list and any variables containing its nodes.
|
inline |
Releases the head of the list to the node pool.
The list must be well formed when calling this method or the program will enter an invalid state, resulting in unspecified behaviour.
|
inline |
Adds the head of the list to the disposal queue.
The list must be well formed when calling this method or the program will enter an invalid state, resulting in unspecified behaviour.
|
inline |
|
inline |
|
inline |
|
inlinestatic |
|
inlinestatic |
|
inline |
|
inline |
|
inline |
Returns a Slinq that enumerates the values contained in the list without reliquishing ownership of the nodes.
The caller of this method is responsible for making sure the returned Slinq is not used after the nodes are modified or returned to the pool.
If backtrack detection is enabled, the supplied backtrack detector can be returned to the pool using its TryReleaseShared method to prevent subsequent enumeration of the returned Slinq.
|
inline |
Returns a pooled lookup with the default key comparer containing the nodes in the list as partitioned by the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
|
inline |
Returns a pooled lookup with the specified key comparer containing the nodes in the list as partitioned by the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
|
inline |
Returns a pooled lookup with the default key comparer containing the nodes in the list as partitioned by the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
|
inline |
Returns a pooled lookup with the specified key comparer containing the nodes in the list as partitioned by the specified key selector.
Ownership of the nodes contained in this list is transerred to the lookup.
int Smooth.Slinq.Collections.LinkedHeadTail< T >.count |
The number of elements in the list.
Linked<T> Smooth.Slinq.Collections.LinkedHeadTail< T >.head |
The first node in the list.
Linked<T> Smooth.Slinq.Collections.LinkedHeadTail< T >.tail |
The last node in the list.