HomeSort by: relevance | last modified time | path
    Searched refs:unstable (Results 1 - 5 of 5) sorted by relevancy

  /src/sys/external/isc/libsodium/dist/src/libsodium/sodium/
core.c 25 # warning *** This is unstable, untested, development code.
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
mutation.d 1732 unstable).
1742 unstable). As (semi-)stability is not needed very often, the ordering
1744 choose `SwapStrategy.unstable` as the default.
1753 unstable,
1772 assert(remove!(SwapStrategy.unstable)(a, 1) == [0, 3, 2]);
1790 assert(partition!(a => a > 3, SwapStrategy.unstable)(arr) == [3, 2, 1]);
1878 pass `SwapStrategy.unstable` to `remove`.
1882 assert(remove!(SwapStrategy.unstable)(a, 1) == [ 0, 3, 2 ]);
1895 $(LI If $(D s == SwapStrategy.unstable && isRandomAccessRange!Range &&
1900 SwapStrategy.unstable && isBidirectionalRange!Range && hasLength!Rang
    [all...]
sorting.d 117 void completeSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
379 Performs $(BIGOH r.length) (if unstable or semistable) or $(BIGOH
381 The unstable version computes the minimum possible evaluations of `swap`
423 Range partition(alias predicate, SwapStrategy ss = SwapStrategy.unstable, Range)(Range r)
832 auto partition3(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable, Range, E)
834 if (ss == SwapStrategy.unstable && isRandomAccessRange!Range
970 SwapStrategy ss = SwapStrategy.unstable,
993 SwapStrategy ss = SwapStrategy.unstable,
1517 enum ss = SwapStrategy.unstable;
1541 multiSort!("a.x < b.x", "a.y < b.y", SwapStrategy.unstable)(pts1)
    [all...]
setops.d 895 _ror = remove!("a.empty", SwapStrategy.unstable)(ror);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
concurrency.d 1169 remove!(SwapStrategy.unstable)(*allNames, pos);

Completed in 20 milliseconds