| Append(K key, T value) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| Append(Linked< K, T > node) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| Append(LinkedHeadTail< K, T > other) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| count | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | |
| Dispose() | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| DisposeInBackground() | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| Equals(object other) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| Equals(LinkedHeadTail< K, T > other) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| GetHashCode() | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| head | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | |
| LinkedHeadTail(K key, T value) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| LinkedHeadTail(Linked< K, T > head) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| operator!=(LinkedHeadTail< K, T > lhs, LinkedHeadTail< K, T > rhs) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inlinestatic |
| operator==(LinkedHeadTail< K, T > lhs, LinkedHeadTail< K, T > rhs) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inlinestatic |
| SlinqAndDispose() | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| SlinqAndKeep() | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| SlinqAndKeep(BacktrackDetector bd) | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | inline |
| tail | Smooth.Slinq.Collections.LinkedHeadTail< K, T > | |
1.8.7