Wintellect.PowerCollections Namespace
Algorithms Class
Algorithms Members
Algorithms Methods
BinarySearch Method
CartesianProduct(TFirst, TSecond) Method
Concatenate(T) Method
Convert(TSource, TDest) Method
Copy Method
Count(T) Method
CountEqual Method
CountWhere(T) Method
DisjointSets Method
EqualCollections Method
EqualSets Method
Exists(T) Method
Fill Method
FillRange Method
FindFirstIndexWhere(T) Method
FindFirstWhere(T) Method
FindIndicesWhere(T) Method
FindLastIndexWhere(T) Method
FindLastWhere(T) Method
FindWhere(T) Method
FirstConsecutiveEqual Method
FirstConsecutiveWhere(T) Method
FirstIndexOf Method
FirstIndexOfMany Method
ForEach(T) Method
GeneratePermutations(T) Method
GenerateSortedPermutations Method
GetCollectionEqualityComparer Method
GetComparerFromComparison(T) Method
GetComparisonFromComparer(T) Method
GetCount Method
GetDictionaryConverter Method
GetIdentityComparer(T) Method
GetLexicographicalComparer Method
GetReverseComparer(T) Method
GetReverseComparison(T) Method
GetSetEqualityComparer Method
IndexOfMaximum Method
IndexOfMinimum Method
IndicesOf Method
IndicesOfMany Method
IsProperSubsetOf Method
IsSubsetOf Method
LastIndexOf Method
LastIndexOfMany Method
LexicographicalCompare Method
Maximum Method
MergeSorted Method
Minimum Method
NCopiesOf(T) Method
Partition(T) Method
RandomShuffle Method
RandomShuffleInPlace Method
RandomSubset Method
Range Method
ReadOnly Method
ReadWriteList(T) Method
RemoveDuplicates Method
RemoveDuplicatesInPlace Method
RemoveWhere(T) Method
Replace Method
ReplaceInPlace Method
Reverse(T) Method
ReverseInPlace(T) Method
Rotate(T) Method
RotateInPlace(T) Method
SearchForSubsequence Method
SetDifference Method
SetIntersection Method
SetSymmetricDifference Method
SetUnion Method
Sort Method
SortInPlace Method
StablePartition(T) Method
StableSort Method
StableSortInPlace Method
ToArray(T) Method
ToString Method
TrueForAll(T) Method
TryFindFirstWhere(T) Method
TryFindLastWhere(T) Method
TypedAs Method
Untyped Method
Bag(T) Class
BigList(T) Class
BinaryPredicate(T) Delegate
CollectionBase(T) Class
Deque(T) Class
DictionaryBase(TKey, TValue) Class
ListBase(T) Class
MultiDictionary(TKey, TValue) Class
MultiDictionaryBase(TKey, TValue) Class
OrderedBag(T) Class
OrderedBag(T).View Class
OrderedDictionary(TKey, TValue) Class
OrderedDictionary(TKey, TValue).View Class
OrderedMultiDictionary(TKey, TValue) Class
OrderedMultiDictionary(TKey, TValue).View Class
OrderedSet(T) Class
OrderedSet(T).View Class
Pair(TFirst, TSecond) Structure
ReadOnlyCollectionBase(T) Class
ReadOnlyDictionaryBase(TKey, TValue) Class
ReadOnlyListBase(T) Class
ReadOnlyMultiDictionaryBase(TKey, TValue) Class
Set(T) Class
Triple(TFirst, TSecond, TThird) Structure
GhostDoc Pro Sample Help File

Algorithms..::..Partition<(Of <(<'T>)>)> Method

Partition a list or array based on a predicate. After partitioning, all items for which the predicate returned true precede all items for which the predicate returned false.

Namespace:  Wintellect.PowerCollections
Assembly:  PowerCollections (in PowerCollections.dll)

Syntax

public static int Partition<T>(
	IList<T> list,
	Predicate<T> predicate
)

Public Shared Function Partition(Of T) ( _
	list As IList(Of T), _
	predicate As Predicate(Of T) _
) As Integer
public:
generic<typename T>
static int^ Partition(
	IList<T>^ list, 
	Predicate<T>^ predicate
)

Type Parameters

T

Parameters

list
Type: IList<(Of <(<'T>)>)>
The list or array to partition.
predicate
Type: Predicate<(Of <(<'T>)>)>
A delegate that defines the partitioning condition.

Return Value

The index of the first item in the second half of the partition; i.e., the first item for which predicate returned false. If the predicate was true for all items in the list, list.Count is returned.

Remarks

Although arrays cast to IList<T> are normally read-only, this method will work correctly and modify an array passed as list.

See Also

Algorithms Class
Wintellect.PowerCollections Namespace