definition: |
deleteIndex :: Int -> [a] -> [a] deleteIndex _ [] = [] deleteIndex n (x:xs) | n==0 = xs | otherwise = x : deleteIndex (n-1) xs |
demand: |
argument 2 |
deterministic: |
deterministic operation |
failfree: |
(_, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,{[]}) |-> {[]} || (_,{:}) |-> _} |
name: |
deleteIndex |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
Prelude.Int -> [a] -> [a] |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
possibly non-reducible on same data term |