Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- type RangedNatL n m = RangeL n m ()
- natL :: Unfoldr 0 n n => RangedNatL n n
- toIntL :: Foldable (RangeL n m) => RangedNatL n m -> Int
- fromIntL :: Unfoldr 0 n m => Int -> Maybe (RangedNatL n m)
- splitAtL :: ZipL n m v w => RangedNatL n m -> RangeL v w a -> (RangeL n m a, RangeL (v - m) (w - n) a)
- type RangedNatR n m = RangeR n m ()
- natR :: Unfoldl 0 n n => RangedNatR n n
- toIntR :: Foldable (RangeR n m) => RangedNatR n m -> Int
- fromIntR :: Unfoldl 0 n m => Int -> Maybe (RangedNatR n m)
- splitAtR :: ZipR n m v w => RangeR n m a -> RangedNatR v w -> (RangeR (n - w) (m - v) a, RangeR v w a)
RangedNatL
type RangedNatL n m = RangeL n m () Source #
natL :: Unfoldr 0 n n => RangedNatL n n Source #
To make RangedNatL
.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
loosenL (natL @5) :: RangedNatL 3 8
() :. (() :. (() :. (() :.. (() :.. NilL))))
toIntL :: Foldable (RangeL n m) => RangedNatL n m -> Int Source #
To convert from RangedNatL
to Int
.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
toIntL (loosenL (natL @5) :: RangedNatL 3 8)
5
fromIntL :: Unfoldr 0 n m => Int -> Maybe (RangedNatL n m) Source #
To convert from Int
to RangedNatL
.
>>>
:set -XDataKinds
>>>
fromIntL 5 :: Maybe (RangedNatL 3 8)
Just (() :. (() :. (() :. (() :.. (() :.. NilL)))))
splitAtL :: ZipL n m v w => RangedNatL n m -> RangeL v w a -> (RangeL n m a, RangeL (v - m) (w - n) a) Source #
To split a list at position which is specified by number.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
xs = 'h' :. 'e' :. 'l' :. 'l' :.. 'o' :.. NilL :: RangeL 3 8 Char
>>>
splitAtL (natL @2) xs
('h' :. ('e' :. NilL),'l' :. ('l' :.. ('o' :.. NilL)))>>>
:type splitAtL (natL @2) xs
splitAtL (natL @2) xs :: (RangeL 2 2 Char, RangeL 1 6 Char)
RangedNatR
type RangedNatR n m = RangeR n m () Source #
natR :: Unfoldl 0 n n => RangedNatR n n Source #
To make RangedNatR
.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
loosenR (natR @5) :: RangedNatR 3 8
((((NilR :++ ()) :++ ()) :+ ()) :+ ()) :+ ()
toIntR :: Foldable (RangeR n m) => RangedNatR n m -> Int Source #
To convert from RangedNatR
to Int
.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
toIntR (loosenR (natR @5) :: RangedNatR 3 8)
5
fromIntR :: Unfoldl 0 n m => Int -> Maybe (RangedNatR n m) Source #
To convert Int
to RangedNatR
.
>>>
:set -XDataKinds
>>>
fromIntR 5 :: Maybe (RangedNatR 3 8)
Just (((((NilR :++ ()) :++ ()) :+ ()) :+ ()) :+ ())
splitAtR :: ZipR n m v w => RangeR n m a -> RangedNatR v w -> (RangeR (n - w) (m - v) a, RangeR v w a) Source #
To split a list at position which is specified by number.
>>>
:set -XTypeApplications -XDataKinds
>>>
:module + Data.List.Range
>>>
xs = NilR :++ 'h' :++ 'e' :+ 'l' :+ 'l' :+ 'o' :: RangeR 3 8 Char
>>>
splitAtR xs (natR @2)
(((NilR :++ 'h') :++ 'e') :+ 'l',(NilR :+ 'l') :+ 'o')>>>
:type splitAtR xs (natR @2)
splitAtR xs (natR @2) :: (RangeR 1 6 Char, RangeR 2 2 Char)