Safe Haskell | Safe-Infered |
---|
Documentation
c_matchLast_case_2 :: Curry t0 => C_Int -> List t0 -> C_Int -> List t0 -> State -> C_Maybe (T2 t0 (C_Queue t0))Source
c_matchLast_case_1 :: (BaseCurry t, Curry t0) => List t -> State -> C_Maybe (T2 t (C_Queue t0))Source
c_matchLast_case_0 :: (BaseCurry t, BaseCurry t0, Curry t1) => t0 -> List t -> State -> C_Maybe (T2 t0 (C_Queue t1))Source
c_matchHead_case_5 :: Curry t0 => C_Int -> C_Int -> List t0 -> List t0 -> State -> C_Maybe (T2 t0 (C_Queue t0))Source
c_matchHead_case_4 :: (BaseCurry t, Curry t0) => List t -> State -> C_Maybe (T2 t (C_Queue t0))Source
c_matchHead_case_3 :: (BaseCurry t, BaseCurry t0, Curry t1) => t0 -> List t -> State -> C_Maybe (T2 t0 (C_Queue t1))Source
c_check_case_7 :: Curry t0 => C_Int -> List t0 -> C_Int -> List t0 -> C_Int -> C_Int -> T2 (List t0) (List t0) -> C_Bool -> State -> C_Queue t0Source
c_check_case_6 :: Curry t0 => List t0 -> C_Int -> C_Int -> T2 (List t0) (List t0) -> C_Bool -> State -> C_Queue t0Source
c_deqLast_case_10 :: BaseCurry b => b -> t -> b -> C_Bool -> State -> bSource
c_deqHead_case_11 :: BaseCurry b => t -> b -> b -> C_Bool -> State -> bSource