Moduleunlifted-0.2.2.0Haskell2010

Data.Unlifted

8 types

Packageunlifted-0.2.2.0
Exports10
LanguageHaskell2010
LicenceBSD-3-Clause
SourceUnlifted.hs

Base

3 declarations

newtypenewtype Maybe# (a :: TYPE r) where

Unboxed variant of Maybe.

Constructors

Maybe# :: (# (# #) | a #) -> Maybe# a

newtypenewtype Either# (a :: TYPE ra) (b :: TYPE rb) where

Unboxed variant of Either.

Constructors

Either# :: (# a | b #) -> Either# a b

newtypenewtype ST# a (b :: TYPE r) where

Variant of ST where the argument type does not have to be lifted. This does not have a monad instance and is difficult to use.

Constructors

ST# :: (State# a -> (# State# a, b #)) -> ST# a b
- unST# :: State# a -> (# State# a, b #)

Text

2 declarations

newtypenewtype ShortText# where

Unlifted variant of ShortText.

Constructors

ShortText# :: ByteArray# -> ShortText#

newtypenewtype Text# where

Unboxed variant of Text. This includes a somewhat dubious restriction that on the offset and length that prevents byte arrays larger than 2GiB from being used as the backing store.

This decision makes the type work well in the vext library, and it makes the in-memory format close to what Apache Arrow uses.

Constructors

Text# :: (# ByteArray#, Int32#, Int32# #) -> Text#

Arrays

2 declarations

newtypenewtype PrimArray# (a :: TYPE r) where

This resembles the PrimArray type from primitive, but the phantom parameter is an unboxed type, not a lifted type. For example:

```
PrimArray Word8
```
```
PrimArray# Word8#
```

Constructors

PrimArray# :: ByteArray# -> PrimArray# a

newtypenewtype MutablePrimArray# a (b :: TYPE r) where

Mutable variant of PrimArray#.

Constructors

MutablePrimArray# :: MutableByteArray# a -> MutablePrimArray# a b

Boolean

3 declarations

newtypenewtype Bool# where

Unboxed variant of Bool.

Constructors

Bool# :: Word# -> Bool#

patternpattern True# :: Bool#

patternpattern False# :: Bool#