Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. toList :: RAList a -> [a]

   ral	Data.RAList

   No documentation available.

2. newtype NERAList a

   ral	Data.RAList.NonEmpty

   Non-empty random access list.

3. data NERAList' (f :: Type -> Type) a

   ral	Data.RAList.NonEmpty

   Non-empty random access list, underlying representation. The structure doesn't need to be hidden, as polymorphic recursion of Nodes starting from Leaf keeps the NERAList values well-formed.

4. fromList :: forall (b :: Bin) a . SBinI b => [a] -> Maybe (RAVec b a)

   ral	Data.RAVec

   Convert a list [a] to RAVec b a. Returns Nothing if lengths don't match.

   >>> fromList "foo" :: Maybe (RAVec B.Bin3 Char)
   Just (NonEmpty (NE (Cons1 (Leaf 'f') (Last (Node (Leaf 'o') (Leaf 'o'))))))
   

   >>> fromList "quux" :: Maybe (RAVec B.Bin3 Char)
   Nothing
   

   >>> fromList "xy" :: Maybe (RAVec B.Bin3 Char)
   Nothing
   

5. reifyList :: [a] -> (forall (b :: Bin) . SBinI b => RAVec b a -> r) -> r

   ral	Data.RAVec

   >>> reifyList "foo" print
   NonEmpty (NE (Cons1 (Leaf 'f') (Last (Node (Leaf 'o') (Leaf 'o')))))
   

   >>> reifyList "xyzzy" toList
   "xyzzy"
   

6. toList :: forall (b :: Bin) a . RAVec b a -> [a]

   ral	Data.RAVec

   No documentation available.

7. toList :: forall (b :: BinP) a . NERAVec b a -> [a]

   ral	Data.RAVec.NonEmpty

   No documentation available.

8. toList' :: forall (n :: Nat) (b :: BinP) a . NERAVec' n b a -> [a]

   ral	Data.RAVec.NonEmpty

   No documentation available.

9. toList :: forall (n :: Nat) a . Tree n a -> [a]

   ral	Data.RAVec.Tree

   Convert Tree to list.

   >>> toList $ Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))
   "abcd"
   

10. toList :: forall (n :: Nat) a . SNatI n => Tree n a -> [a]

    ral	Data.RAVec.Tree.DF

    Convert Tree to list.

    >>> toList $ Node (Node (Leaf 'f') (Leaf 'o')) (Node (Leaf 'o') (Leaf 'd'))
    "food"
    

Page 213 of many | Previous | Next