Documentation

type C_TableRBT t0 t1 = C_RedBlackTree (T2 t0 t1)Source

c_emptyTableRBT :: (Curry t0, Curry t1) => Prim (t0 -> State -> Prim (t0 -> State -> C_Bool)) -> State -> C_RedBlackTree (T2 t0 t1)Source

c_emptyTableRBT'46_'35lambda2 :: (Curry t22, Curry t23) => T2 t22 t23 -> T2 t22 t23 -> State -> C_BoolSource

c_emptyTableRBT'46_'35lambda3 :: (Curry t22, Curry t23) => T2 t22 t23 -> T2 t22 t23 -> State -> C_BoolSource

c_emptyTableRBT'46_'35lambda4 :: (Curry t22, Curry t23) => Prim (t22 -> State -> Prim (t22 -> State -> C_Bool)) -> T2 t22 t23 -> T2 t22 t23 -> State -> C_BoolSource

c_isEmptyTable :: (Curry t0, Curry t1) => State -> Prim (C_RedBlackTree (T2 t0 t1) -> State -> C_Bool)Source

c_lookupRBT :: (Curry t0, Curry t1) => t0 -> State -> Prim (C_RedBlackTree (T2 t0 t1) -> State -> C_Maybe t1)Source

c_updateRBT :: (Curry t0, Curry t1) => t0 -> t1 -> State -> Prim (C_RedBlackTree (T2 t0 t1) -> State -> C_RedBlackTree (T2 t0 t1))Source

c_tableRBT2list :: (Curry t0, Curry t1) => State -> Prim (C_RedBlackTree (T2 t0 t1) -> State -> List (T2 t0 t1))Source

c_deleteRBT :: (Curry t0, Curry t1) => t0 -> State -> Prim (C_RedBlackTree (T2 t0 t1) -> State -> C_RedBlackTree (T2 t0 t1))Source