Safe Haskell | Safe-Infered |
---|
Documentation
type C_SetRBT t0 = C_RedBlackTree t0Source
c_emptySetRBT :: Curry t0 => State -> Prim (Prim (t0 -> State -> Prim (t0 -> State -> C_Bool)) -> State -> C_RedBlackTree t0)Source
c_insertRBT :: Curry t0 => State -> Prim (t0 -> State -> Prim (C_RedBlackTree t0 -> State -> C_RedBlackTree t0))Source
c_insertMultiRBT :: Curry t0 => t0 -> State -> Prim (C_RedBlackTree t0 -> State -> C_RedBlackTree t0)Source
c_insertMultiRBT'46_'35lambda2 :: Curry t27 => t27 -> t27 -> State -> C_BoolSource
c_deleteRBT :: Curry t0 => State -> Prim (t0 -> State -> Prim (C_RedBlackTree t0 -> State -> C_RedBlackTree t0))Source
c_setRBT2list :: Curry t0 => State -> Prim (C_RedBlackTree t0 -> State -> List t0)Source
c_unionRBT :: Curry t0 => C_RedBlackTree t0 -> C_RedBlackTree t0 -> State -> C_RedBlackTree t0Source
c_intersectRBT :: Curry t0 => C_RedBlackTree t0 -> C_RedBlackTree t0 -> State -> C_RedBlackTree t0Source
c_intersectRBT'46_'35lambda3 :: Curry t46 => C_RedBlackTree t46 -> t46 -> State -> C_BoolSource