mirror of
https://github.com/wader/fq.git
synced 2024-12-24 13:52:02 +03:00
50 lines
1.5 KiB
Go
50 lines
1.5 KiB
Go
package decoders
|
|
|
|
import (
|
|
"errors"
|
|
"fmt"
|
|
"github.com/wader/fq/format/avro/schema"
|
|
"github.com/wader/fq/pkg/decode"
|
|
)
|
|
|
|
func decodeMapFn(s schema.SimplifiedSchema) (func(string, *decode.D), error) {
|
|
if s.Values == nil {
|
|
return nil, errors.New("map schema must have values")
|
|
}
|
|
|
|
//Maps are encoded as a series of blocks. Each block consists of a long count value, followed by that many
|
|
//key/value pairs. A block with count zero indicates the end of the map. Each item is encoded per the map's
|
|
//value schema.
|
|
|
|
//If a block's count is negative, its absolute value is used, and the count is followed immediately by a long
|
|
//block size indicating the number of bytes in the block. This block size permits fast skipping through data,
|
|
//e.g., when projecting a record to a subset of its fields.
|
|
|
|
//The blocked representation permits one to read and write maps larger than can be buffered in memory, since one
|
|
//can start writing items without knowing the full length of the map.
|
|
|
|
//This is the exact same as the array decoder, with the value being a KV record, so we just use the array decoder
|
|
|
|
subSchema := schema.SimplifiedSchema{
|
|
Type: schema.ARRAY,
|
|
Items: &schema.SimplifiedSchema{
|
|
Type: schema.RECORD,
|
|
Fields: []schema.Field{
|
|
{
|
|
Name: "key",
|
|
Type: schema.SimplifiedSchema{Type: schema.STRING},
|
|
},
|
|
{
|
|
Name: "value",
|
|
Type: *s.Values,
|
|
},
|
|
},
|
|
},
|
|
}
|
|
subFn, err := DecodeFnForSchema(subSchema)
|
|
if err != nil {
|
|
return nil, fmt.Errorf("decode map: %v", err)
|
|
}
|
|
return subFn, nil
|
|
}
|