Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

  1. putUInt32List :: WireTag -> Seq Word32 -> Put

    protobuf-simple Data.ProtoBufInt

    Encode a repeated uint32 field.

  2. putUInt64List :: WireTag -> Seq Word64 -> Put

    protobuf-simple Data.ProtoBufInt

    Encode a repeated uint64 field.

  3. module Data.RAList

    Random access list. This module is designed to imported qualifed.

  4. data RAList a

    ral Data.RAList

    Random access list.

  5. fromList :: [a] -> RAList a

    ral Data.RAList 

    >>> fromList ['a' .. 'f']
fromList "abcdef"

    >>> explicitShow $ fromList ['a' .. 'f']
"NonEmpty (NE (Cons0 (Cons1 (Nd (Lf 'a') (Lf 'b')) (Last (Nd (Nd (Lf 'c') (Lf 'd')) (Nd (Lf 'e') (Lf 'f')))))))"

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

    ral Data.RAList

    No documentation available.

  7. newtype NERAList a

    ral Data.RAList.NonEmpty

    Non-empty random access list.

  8. 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.

  9. 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

  10. 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"

Page 213 of many | Previous | Next