|
SortPartition Method |
Overload List| Name | Description | |
|---|---|---|
  | PartitionT(T, Int32, Int32, Boolean) |
Reorders the elements in the range [left, right) in such a way that all elements that
are smaller than the pivot precede those that are greater than the pivot. Relative order
of the elements is not preserved. This function should be equivalent to C++'s std::partition.
|
| PartitionT(T, Int32, Int32, FuncT, T, Int32, Boolean) |
Reorders the elements in the range [left, right) in such a way that all elements for which
the function compare returns true precede the elements for which compare
returns false. Relative order of the elements is not preserved. This function should be equivalent
to C++'s std::partition.
|
| PartitionTKey, TValue(TKey, TValue, Int32, Int32, Boolean) |
Reorders the elements in the range [left, right) in such a way that all elements that
are smaller than the pivot precede those that are greater than the pivot. Relative order
of the elements is not preserved. This function should be equivalent to C++'s std::partition.
|
| PartitionTKey, TValue(TKey, TValue, Int32, Int32, FuncTKey, TKey, Int32, Boolean) |
Reorders the elements in the range [left, right) in such a way that all elements for which
the function compare returns true precede the elements for which compare
returns false. Relative order of the elements is not preserved. This function should be equivalent
to C++'s std::partition.
|
See Also