CurryInfo: graph-inductive-3.0.0 / Data.GraphInductive.inn'

definition: Info
 
inn' :: Context _ b -> [LEdge b] 
inn' (p,v,_,_) = map (\(l,w)->(w,v,l)) p
demand: Info
 argument 1
deterministic: Info
 deterministic operation
documentation: Info
 
All inward-directed 'LEdge's in a 'Context'.
failfree: Info
 _
indeterministic: Info
 referentially transparent operation
infix: Info
 no fixity defined
iotype: Info
 {({(,,,)}) |-> {:,[]}}
name: Info
 inn'
precedence: Info
 no precedence defined
result-values: Info
 {:,[]}
signature: Info
 ([(a, Prelude.Int)], Prelude.Int, b, [(a, Prelude.Int)])
-> [(Prelude.Int, Prelude.Int, a)]
solution-complete: Info
 operation might suspend on free variables
terminating: Info
 yes
totally-defined: Info
 reducible on all ground data terms