Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Non-empty radix tree key internals, and unsafe functions for building and destroying them.
Synopsis
- newtype Build1 = Build1 (YtpmeNon ByteArray)
- data YtpmeNon a = (Tsil a) :/ a
- data Tsil a
- unsafeBuildText :: Build1 -> Text
- data Feed1 = Feed1 !Word8 (forall a. (forall x. (x -> Step Word8 x) -> x -> a) -> a)
- data Step a b
- unsafeFeedByteString :: ByteString -> Feed1
- unsafeFeedShortByteString :: ShortByteString -> Feed1
- unsafeFeedLazyByteString :: ByteString -> ByteString -> Feed1
- unsafeFeedText :: Text -> Feed1
- unsafeFeedLazyText :: Text -> Text -> Feed1
Build
Non-empty key as stored in the radix tree.
Text
unsafeBuildText :: Build1 -> Text Source #
Convert a key into a non-empty strict Text
.
No checks are made to ensure the resulting value is a valid sequence of UTF-8 code units.
Feed
Key as a non-empty sequence of individual bytes.
ByteString
unsafeFeedByteString :: ByteString -> Feed1 Source #
Convert a strict ByteString
into a key.
The ByteString
is assumed to be non-empty.
unsafeFeedShortByteString :: ShortByteString -> Feed1 Source #
Convert a ShortByteString
into a key.
The ShortByteString
is assumed to be non-empty.
unsafeFeedLazyByteString :: ByteString -> ByteString -> Feed1 Source #
Convert a lazy ByteString
, in the form of the first chunk plus the rest,
into a key.
The first chunk is assumed to be non-empty.
Text
unsafeFeedText :: Text -> Feed1 Source #