This repository has been archived by the owner on Feb 11, 2022. It is now read-only.
forked from fraugster/parquet-go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
type_boolean.go
211 lines (175 loc) · 4.23 KB
/
type_boolean.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
package goparquet
import (
"io"
"github.com/fraugster/parquet-go/parquet"
"github.com/pkg/errors"
)
type booleanPlainDecoder struct {
r io.Reader
left []bool
}
// copy the left overs from the previous call. instead of returning an empty subset of the old slice,
// it delete the slice (by returning nil) so there is no memory leak because of the underlying array
// the return value is the new left over and the number of read message
func copyLeftOvers(dst []interface{}, src []bool) ([]bool, int) {
size := len(dst)
var clean bool
if len(src) <= size {
size = len(src)
clean = true
}
for i := 0; i < size; i++ {
dst[i] = src[i]
}
if clean {
return nil, size
}
return src[size:], size
}
func (b *booleanPlainDecoder) init(r io.Reader) error {
b.r = r
b.left = nil
return nil
}
func (b *booleanPlainDecoder) decodeValues(dst []interface{}) (int, error) {
var start int
if len(b.left) > 0 {
// there is a leftover from the last run
b.left, start = copyLeftOvers(dst, b.left)
if b.left != nil {
return len(dst), nil
}
}
buf := make([]byte, 1)
for i := start; i < len(dst); i += 8 {
if _, err := io.ReadFull(b.r, buf); err != nil {
return i, err
}
d := unpack8int32_1(buf)
for j := 0; j < 8; j++ {
if i+j < len(dst) {
dst[i+j] = d[j] == 1
} else {
b.left = append(b.left, d[j] == 1)
}
}
}
return len(dst), nil
}
type booleanPlainEncoder struct {
w io.Writer
data *packedArray
}
func (b *booleanPlainEncoder) Close() error {
b.data.flush()
return writeFull(b.w, b.data.data)
}
func (b *booleanPlainEncoder) init(w io.Writer) error {
b.w = w
b.data = &packedArray{}
b.data.reset(1)
return nil
}
func (b *booleanPlainEncoder) encodeValues(values []interface{}) error {
for i := range values {
var v int32
if values[i].(bool) {
v = 1
}
b.data.appendSingle(v)
}
return nil
}
type booleanRLEDecoder struct {
decoder *hybridDecoder
}
func (b *booleanRLEDecoder) init(r io.Reader) error {
b.decoder = newHybridDecoder(1)
return b.decoder.initSize(r)
}
func (b *booleanRLEDecoder) decodeValues(dst []interface{}) (int, error) {
total := len(dst)
for i := 0; i < total; i++ {
n, err := b.decoder.next()
if err != nil {
return i, err
}
dst[i] = n == 1
}
return total, nil
}
type booleanRLEEncoder struct {
encoder *hybridEncoder
}
func (b *booleanRLEEncoder) Close() error {
return b.encoder.Close()
}
func (b *booleanRLEEncoder) init(w io.Writer) error {
b.encoder = newHybridEncoder(1)
return b.encoder.initSize(w)
}
func (b *booleanRLEEncoder) encodeValues(values []interface{}) error {
buf := make([]int32, len(values))
for i := range values {
if values[i].(bool) {
buf[i] = 1
} else {
buf[i] = 0
}
}
return b.encoder.encode(buf)
}
type booleanStore struct {
repTyp parquet.FieldRepetitionType
*ColumnParameters
}
func (b *booleanStore) params() *ColumnParameters {
if b.ColumnParameters == nil {
panic("ColumnParameters is nil")
}
return b.ColumnParameters
}
func (b *booleanStore) sizeOf(v interface{}) int {
// Cheating here. boolean size is one bit, but the size is in byte. so zero to make sure
// we never use dictionary on this.
return 0
}
func (b *booleanStore) parquetType() parquet.Type {
return parquet.Type_BOOLEAN
}
func (b *booleanStore) repetitionType() parquet.FieldRepetitionType {
return b.repTyp
}
func (b *booleanStore) reset(repetitionType parquet.FieldRepetitionType) {
b.repTyp = repetitionType
}
func (b *booleanStore) maxValue() []byte {
return nil
}
func (b *booleanStore) minValue() []byte {
return nil
}
func (b *booleanStore) getValues(v interface{}) ([]interface{}, error) {
var vals []interface{}
switch typed := v.(type) {
case bool:
vals = []interface{}{typed}
case []bool:
if b.repTyp != parquet.FieldRepetitionType_REPEATED {
return nil, errors.Errorf("the value is not repeated but it is an array")
}
vals = make([]interface{}, len(typed))
for j := range typed {
vals[j] = typed[j]
}
default:
return nil, errors.Errorf("unsupported type for storing in bool column: %T => %+v", v, v)
}
return vals, nil
}
func (b *booleanStore) append(arrayIn interface{}, value interface{}) interface{} {
if arrayIn == nil {
arrayIn = make([]bool, 0, 1)
}
return append(arrayIn.([]bool), value.(bool))
}