Safe Haskell	None
Language	Haskell2010

DataFrame.IO.Parquet.Levels

Synopsis

readLevelsV1 :: Int -> Int -> Int -> ByteString -> (Vector Int, Vector Int, Int, ByteString)
readLevelsV2 :: Int -> Int -> Int -> Int32 -> Int32 -> ByteString -> (Vector Int, Vector Int, Int, ByteString)
stitchList :: Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe a]]
stitchList2 :: Int -> Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe [Maybe a]]]
stitchList3 :: Int -> Int -> Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe [Maybe [Maybe a]]]]

Documentation

readLevelsV1 Source #

Arguments

:: Int	Total number of values in the page
-> Int	maxDefinitionLevel
-> Int	maxRepetitionLevel
-> ByteString
-> (Vector Int, Vector Int, Int, ByteString)

readLevelsV2 Source #

Arguments

:: Int	Total number of values
-> Int	maxDefinitionLevel
-> Int	maxRepetitionLevel
-> Int32	Repetition-level byte length (from page header)
-> Int32	Definition-level byte length (from page header)
-> ByteString
-> (Vector Int, Vector Int, Int, ByteString)

stitchList :: Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe a]] Source #

Stitch a singly-nested list column (maxRep == 1) from vector-format definition and repetition levels plus a compact present-values vector. Returns one Maybe [Maybe a] per top-level row.

stitchList2 :: Int -> Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe [Maybe a]]] Source #

Stitch a doubly-nested list column (maxRep == 2). defT1 is the def threshold at which the depth-1 element is present.

stitchList3 :: Int -> Int -> Int -> Vector Int -> Vector Int -> Vector a -> [Maybe [Maybe [Maybe [Maybe a]]]] Source #

Stitch a triply-nested list column (maxRep == 3). defT1 and defT2 are the def thresholds for depth-1 and depth-2 elements respectively.