CurryInfo: combinatorial-3.2.0 / Combinatorial.sizedSubset

definition:
sizedSubset     :: Int -> [a] -> [a]
sizedSubset c l = if c == 0 then [] else aux l
 where aux (x:xs) = x:sizedSubset (c-1) xs ? sizedSubset c xs
demand:
no demanded arguments
deterministic:
possibly non-deterministic operation
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,_) |-> {:,[]}}
name:
sizedSubset
precedence:
no precedence defined
result-values:
{:,[]}
signature:
Prelude.Int -> [a] -> [a]
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term