| definition: |
times :: (Semiring s, CGFunction s, Ord c, Eq s) => [Int] -> Int -> Int ->
Reg c s -> Reg c s
times l n m r =
if m < n || n < 0
then Reg {emptyRe = zero, final = zero, cg = l, reg = Times (n,m) r}
else if n == 0
then Reg {emptyRe = one, final = final r, cg = l, reg =
Times (n,m) r}
else Reg {emptyRe = emptyRe r, final = final r * time n, cg = l,
reg = Times (n,m) r}
where time k = if k == 0 then one else zero
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- α{n,m}
|
| failfree: |
(_, _, _, _, _, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_,_,_,_,_) |-> {Reg}}
|
| name: |
times |
| precedence: |
no precedence defined |
| result-values: |
{Reg}
|
| signature: |
(Semiring b, CGFunction b, Prelude.Ord a, Prelude.Eq b) => [Prelude.Int] -> Prelude.Int -> Prelude.Int -> Reg a b -> Reg a b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |