Home
last modified time | relevance | path

Searched refs:minCount (Results 1 – 3 of 3) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/ProfileData/
H A DGCOV.cpp453 uint64_t minCount = succ->cycleCount; in augmentOneCycle() local
455 minCount = std::min(minCount, v->incoming->cycleCount); in augmentOneCycle()
460 succ->cycleCount -= minCount; in augmentOneCycle()
462 v->incoming->cycleCount -= minCount; in augmentOneCycle()
467 return minCount; in augmentOneCycle()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
H A Dsearching.d3147 minCount(alias pred = "a < b", Range)(Range range)
3238 return range.minCount!((a, b) => binaryFun!pred(b, a));
3249 assert(a.minCount == tuple(1, 3));
3261 auto c = minCount!("a[0] < b[0]")(b);
3265 assertThrown(minCount(b[$..$]));
3268 assert(minCount(new ReferenceInputRange!int([1, 2, 1, 0, 2, 0])) == tuple(0, 2));
3269 assert(minCount(new ReferenceForwardRange!int([1, 2, 1, 0, 2, 0])) == tuple(0, 2));
3286 assert(minCount(a) == tuple(1, 3));
3287 assert(minCount(b) == tuple(1, 3));
3288 assert(minCount!((ref immutable int a, ref immutable int b) => (a > b))(a) == tuple(4, 2));
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/
H A Dsearching.d3382 minCount(alias pred = "a < b", Range)(Range range)
3473 return range.minCount!((a, b) => binaryFun!pred(b, a));
3484 assert(a.minCount == tuple(1, 3));
3496 auto c = minCount!("a[0] < b[0]")(b);
3500 assertThrown(minCount(b[$..$]));
3503 assert(minCount(new ReferenceInputRange!int([1, 2, 1, 0, 2, 0])) == tuple(0, 2));
3504 assert(minCount(new ReferenceForwardRange!int([1, 2, 1, 0, 2, 0])) == tuple(0, 2));
3521 assert(minCount(a) == tuple(1, 3));
3522 assert(minCount(b) == tuple(1, 3));
3523 assert(minCount!((ref immutable int a, ref immutable int b) => (a > b))(a) == tuple(4, 2));
[all …]