phobos-next ~master (2024-03-19T05:49:32Z)
Home
Dub
Repo
countsAtLeast
nxt
algorithm_ex
Check if
r
counts to at least
minCount
elements.
@"complexity", "O(minCount)"
bool
countsAtLeast
(
R
)
(
R
r
,
size_t
minCount
)
if
(
isInputRange
!
R
)
Meta
Source
See Implementation
nxt
algorithm_ex
aliases
Pair
Quadruple
Sink
Source
Triple
doN
dropAllOf
dropUntil
elementCombinations
halved
isPermutationOf
loop
lstrip
packBPRL
repeat
retroCycle
sadd
smul
ssub
stripFront
tail
takeAllOf
takeUntil
enums
Reduction
isIntLike
functions
apply
areColinear
areStrictlyOrdered
areUnstrictlyOrdered
bruteCast
collect
countsAtLeast
countsAtMost
countsExactly
distinct
doTimes
dropWhile
eitherRef
equalLength
every
fibonacci
findAllOfAnyInOrder
findFirstOfAnyInOrder
findInOrder
findPopAfter
findPopBefore
forwardDifference
hasContents
hasHoles
isAmong
isAnagramOf
isDefaulted
isLinearRamp
isPalindrome
isSliceOf
isSymmetric
len
moveUntil
moveWhile
orderInPlace
packBitParallelRunLengths
pair
quadruple
reset
resetAllMembers
set
spliced2
spliced3
splicer2
splicer3
splicerN
split
splitAfter
splitBefore
splitterN
stableSort
str
takeWhile
times
triple
tryEvery
use
windowedReduce
zipWith
templates
endsWith
expand
naryFun
sort
startsWith
Check if r counts to at least minCount elements.