This repository has been archived by the owner on Jun 24, 2024. It is now read-only.
forked from h2oai/wave
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mapbuf.go
64 lines (56 loc) · 1.5 KB
/
mapbuf.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
// Copyright 2020 H2O.ai, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package wave
// MapBuf represents a map (dictionary) buffer.
type MapBuf struct {
t Typ
tups map[string][]interface{}
}
func newMapBuf(t Typ) *MapBuf {
return &MapBuf{t, make(map[string][]interface{})}
}
func (b *MapBuf) put(ixs interface{}) {
if xs, ok := ixs.(map[string]interface{}); ok {
tups := make(map[string][]interface{})
for k, x := range xs {
if tup, ok := b.t.match(x); ok {
tups[k] = tup
}
}
b.tups = tups
}
}
func (b *MapBuf) set(k string, v interface{}) {
if v == nil {
delete(b.tups, k)
} else if tup, ok := b.t.match(v); ok {
b.tups[k] = tup
}
}
func (b *MapBuf) get(k string) (Cur, bool) {
if tup, ok := b.tups[k]; ok {
return Cur{b.t, tup}, true
}
return Cur{}, false
}
func (b *MapBuf) dump() BufD {
return BufD{M: &MapBufD{b.t.f, b.tups}}
}
func loadMapBuf(ns *Namespace, b *MapBufD) *MapBuf {
t := ns.make(b.F)
if b.D == nil {
return newMapBuf(t)
}
return &MapBuf{t, b.D}
}