Represents a node in a singly linked list of key, value pairs. More...

Inheritance diagram for Smooth.Slinq.Collections.Linked< K, T >:

Public Member Functions
void	Dispose ()
	Traverses the node list that starts with this node, clears the key and value of each node, and releases the resulting node list to the pool. More...

void	DisposeInBackground ()
	Relinquishes ownership of the node and adds it to the disposal queue. More...

void	TrimAndDispose ()
	Detaches the node's tail, clears the node's key and value, and releases the node to the pool. More...

Static Public Member Functions
static Linked< K, T >	Borrow (K key, T value)
	Returns a pooled list node with the specified key and value. More...

Public Attributes
K	key
	The key contained in the node. More...

Linked< K, T >	next
	The next node in the list. More...

T	value
	The value contained in the node. More...

Detailed Description

Represents a node in a singly linked list of key, value pairs.

Member Function Documentation

static Linked<K, T> Smooth.Slinq.Collections.Linked< K, T >.Borrow	(	K	key,
		T	value
	)

inlinestatic

Returns a pooled list node with the specified key and value.

void Smooth.Slinq.Collections.Linked< K, T >.Dispose ( )

inline

Traverses the node list that starts with this node, clears the key and value of each node, and releases the resulting node list to the pool.

void Smooth.Slinq.Collections.Linked< K, T >.DisposeInBackground ( )

inline

Relinquishes ownership of the node and adds it to the disposal queue.

void Smooth.Slinq.Collections.Linked< K, T >.TrimAndDispose ( )

inline

Detaches the node's tail, clears the node's key and value, and releases the node to the pool.

Note: Nodes should generally not be released one at a time as it will incur much greater overhead than batching releases using LinkedHeadTail<T>s.

The key contained in the node.

The next node in the list.

The value contained in the node.

The documentation for this class was generated from the following file: