Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- class GetAvro a where
- data ContainerHeader = ContainerHeader {
- syncBytes :: !ByteString
- decompress :: forall a. Decompress a
- containedSchema :: !Schema
- nrSyncBytes :: Integral sb => sb
- getCodec :: Monad m => Maybe ByteString -> m Codec
- getBoolean :: Get Bool
- getInt :: Get Int32
- getLong :: Get Int64
- getZigZag :: (Bits i, Integral i, DecodeRaw i) => Get i
- getBytes :: Get ByteString
- getString :: Get Text
- getFloat :: Get Float
- getDouble :: Get Double
- getArray :: GetAvro ty => Get [ty]
- getMap :: GetAvro ty => Get (Map Text ty)
- decodeBlocks :: Get a -> Get [a]
- sFromIntegral :: forall a b m. (Monad m, Bounded a, Bounded b, Integral a, Integral b) => a -> m b
Documentation
class GetAvro a where Source #
Instances
GetAvro Bool Source # | |
GetAvro Double Source # | |
GetAvro Float Source # | |
GetAvro Int32 Source # | |
GetAvro Int64 Source # | |
GetAvro ByteString Source # | |
Defined in Data.Avro.Decode.Get getAvro :: Get ByteString Source # | |
GetAvro ByteString Source # | |
Defined in Data.Avro.Decode.Get getAvro :: Get ByteString Source # | |
GetAvro Text Source # | |
GetAvro String Source # | |
GetAvro ContainerHeader Source # | |
Defined in Data.Avro.Decode.Get | |
GetAvro a => GetAvro [a] Source # | |
Defined in Data.Avro.Decode.Get | |
GetAvro a => GetAvro (Maybe a) Source # | |
(GetAvro a, Ord a) => GetAvro (Set a) Source # | |
GetAvro a => GetAvro (Vector a) Source # | |
GetAvro ty => GetAvro (Map Text ty) Source # | |
GetAvro a => GetAvro (Array Int a) Source # | |
data ContainerHeader Source #
ContainerHeader | |
|
Instances
GetAvro ContainerHeader Source # | |
Defined in Data.Avro.Decode.Get |
nrSyncBytes :: Integral sb => sb Source #
getBoolean :: Get Bool Source #
getZigZag :: (Bits i, Integral i, DecodeRaw i) => Get i Source #
Get an zigzag encoded integral value consuming bytes till the msb is 0.
getBytes :: Get ByteString Source #
decodeBlocks :: Get a -> Get [a] Source #
Avro encodes arrays and maps as a series of blocks. Each block starts with a count of the elements in the block. A series of blocks is always terminated with an empty block (encoded as a 0).