Extension methods for Linked<> and LinkedHeadTail<>. More...

Static Public Member Functions
static LinkedHeadTail< K, T >	InsertionSort< K, T > (LinkedHeadTail< K, T > input, Comparison< K > comparison, bool ascending)
	Sorts the specified list using the specified comparison and ordering using an insertion sort algorithm. More...

static LinkedHeadTail< T >	InsertionSort< T > (LinkedHeadTail< T > input, Comparison< T > comparison, bool ascending)
	Sorts the specified list using the specified comparison and ordering using an insertion sort algorithm. More...

static LinkedHeadTail< K, T >	Merge< K, T > (LinkedHeadTail< K, T > left, LinkedHeadTail< K, T > right, Comparison< K > comparison, bool ascending)
	Merges the specified sorted lists using the specified comparison and ordering. Elements from the left list will appear before elements from the right on equal comparisons. More...

static LinkedHeadTail< T >	Merge< T > (LinkedHeadTail< T > left, LinkedHeadTail< T > right, Comparison< T > comparison, bool ascending)
	Merges the specified sorted lists using the specified comparison and ordering. Elements from the left list will appear before elements from the right on equal comparisons. More...

static LinkedHeadTail< K, T >	Reverse< K, T > (this LinkedHeadTail< K, T > list)
	Reverses the specified list. More...

static LinkedHeadTail< T >	Reverse< T > (this LinkedHeadTail< T > list)
	Reverses the specified list. More...

static LinkedHeadTail< K, T >	Sort< K, T > (LinkedHeadTail< K, T > input, Comparison< K > comparison, bool ascending)
	Sorts the specified list using the specified comparison and ordering. More...

static LinkedHeadTail< T >	Sort< T > (LinkedHeadTail< T > input, Comparison< T > comparison, bool ascending)
	Sorts the specified list using the specified comparison and ordering. More...

Detailed Description

Extension methods for Linked<> and LinkedHeadTail<>.

Member Function Documentation

static LinkedHeadTail<K, T> Smooth.Slinq.Collections.Linked.InsertionSort< K, T >	(	LinkedHeadTail< K, T >	input,
		Comparison< K >	comparison,
		bool	ascending
	)

inlinestatic

Sorts the specified list using the specified comparison and ordering using an insertion sort algorithm.

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.

static LinkedHeadTail<T> Smooth.Slinq.Collections.Linked.InsertionSort< T >	(	LinkedHeadTail< T >	input,
		Comparison< T >	comparison,
		bool	ascending
	)

inlinestatic

Sorts the specified list using the specified comparison and ordering using an insertion sort algorithm.

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.

static LinkedHeadTail<K, T> Smooth.Slinq.Collections.Linked.Merge< K, T >	(	LinkedHeadTail< K, T >	left,
		LinkedHeadTail< K, T >	right,
		Comparison< K >	comparison,
		bool	ascending
	)

inlinestatic

Merges the specified sorted lists using the specified comparison and ordering. Elements from the left list will appear before elements from the right on equal comparisons.

The specified lists 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 lists and any variables containing their nodes.

static LinkedHeadTail<T> Smooth.Slinq.Collections.Linked.Merge< T >	(	LinkedHeadTail< T >	left,
		LinkedHeadTail< T >	right,
		Comparison< T >	comparison,
		bool	ascending
	)

inlinestatic

Merges the specified sorted lists using the specified comparison and ordering. Elements from the left list will appear before elements from the right on equal comparisons.

The specified lists 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 lists and any variables containing their nodes.

static LinkedHeadTail<K, T> Smooth.Slinq.Collections.Linked.Reverse< K, T > ( this LinkedHeadTail< K, T > list )

inlinestatic

Reverses the specified list.

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.

static LinkedHeadTail<T> Smooth.Slinq.Collections.Linked.Reverse< T > ( this LinkedHeadTail< T > list )

inlinestatic

Reverses the specified list.

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.

static LinkedHeadTail<K, T> Smooth.Slinq.Collections.Linked.Sort< K, T >	(	LinkedHeadTail< K, T >	input,
		Comparison< K >	comparison,
		bool	ascending
	)

inlinestatic

Sorts the specified list using the specified comparison and ordering.

This method uses an introspective merge sort algorithm that will optimally sort rather than split lists with 3 or fewer nodes.

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.

static LinkedHeadTail<T> Smooth.Slinq.Collections.Linked.Sort< T >	(	LinkedHeadTail< T >	input,
		Comparison< T >	comparison,
		bool	ascending
	)

inlinestatic

Sorts the specified list using the specified comparison and ordering.

This method uses an introspective merge sort algorithm that will optimally sort rather than split lists with 3 or fewer nodes.

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.

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

KSP/Assets/Scripts/Util Scripts/SmoothFoundations/Slinq/Collections/Linked.cs

Static Public Member Functions

Detailed Description

Member Function Documentation