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

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