This repository has been archived by the owner on Jan 29, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lit_dict.go
159 lines (148 loc) · 3.19 KB
/
lit_dict.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
package lit
import (
"bytes"
"github.com/mb0/xelf/bfr"
"github.com/mb0/xelf/cor"
"github.com/mb0/xelf/lex"
"github.com/mb0/xelf/typ"
)
// Keyed is a key associated with a literal.
type Keyed struct {
Key string
Lit
}
// Dict is a generic container implementing the dict type.
type Dict struct {
Elem typ.Type
List []Keyed
}
// MakeDict returns a new abstract dict literal with the given type or an error.
func MakeDict(t typ.Type) (*Dict, error) {
return MakeDictCap(t, 0)
}
// MakeDictCap returns a new abstract dict literal with the given type and cap or an error.
func MakeDictCap(t typ.Type, cap int) (*Dict, error) {
if t.Kind&typ.MaskElem != typ.KindDict {
return nil, typ.ErrInvalid
}
list := make([]Keyed, 0, cap)
return &Dict{t.Elem(), list}, nil
}
func (d *Dict) Typ() typ.Type { return typ.Dict(d.Elem) }
func (d *Dict) Element() (Proxy, error) { return ZeroProxy(d.Elem), nil }
func (d *Dict) IsZero() bool { return d == nil || len(d.List) == 0 }
func (d *Dict) Len() int {
if d == nil {
return 0
}
return len(d.List)
}
func (d *Dict) Keys() []string {
if d == nil {
return nil
}
res := make([]string, 0, len(d.List))
for _, v := range d.List {
res = append(res, v.Key)
}
return res
}
func (d *Dict) Key(k string) (Lit, error) {
if d == nil {
return Nil, nil
}
for _, v := range d.List {
if v.Key == k {
return v.Lit, nil
}
}
if d.Elem != typ.Void {
return Null(d.Elem), nil
}
return Nil, nil
}
func (d *Dict) SetKey(k string, el Lit) (_ Keyer, err error) {
if d == nil {
return &Dict{List: []Keyed{{k, el}}}, nil
}
if el == nil {
el = Nil
}
if d.Elem != typ.Void && d.Elem != typ.Any {
el, err = Convert(el, d.Elem, 0)
if err != nil {
return d, err
}
}
for i, v := range d.List {
if v.Key == k {
if el != nil {
d.List[i].Lit = el
} else {
d.List = append(d.List[:i], d.List[i+1:]...)
}
return d, nil
}
}
d.List = append(d.List, Keyed{k, el})
return d, nil
}
func (d *Dict) IterKey(it func(string, Lit) error) error {
if d == nil {
return nil
}
for _, el := range d.List {
if err := it(el.Key, el.Lit); err != nil {
if err == BreakIter {
return nil
}
return err
}
}
return nil
}
func (d *Dict) String() string { return bfr.String(d) }
func (d *Dict) MarshalJSON() ([]byte, error) { return bfr.JSON(d) }
func (d *Dict) UnmarshalJSON(b []byte) error {
t, err := lex.Read(bytes.NewReader(b))
if err != nil {
return err
}
_, err = parseDict(t, d)
return err
}
func (d *Dict) WriteBfr(b *bfr.Ctx) error {
b.WriteByte('{')
for i, e := range d.List {
if i > 0 {
b.Sep()
}
b.RecordKey(e.Key)
writeLit(b, e.Lit)
}
return b.WriteByte('}')
}
func (d *Dict) New() Proxy { return &Dict{Elem: d.Elem} }
func (d *Dict) Ptr() interface{} { return d }
func (d *Dict) Assign(l Lit) error {
if d == nil {
return cor.Errorf("nil keyer")
}
switch ld := Deopt(l).(type) {
case *Dict:
*d = *ld
case Keyer:
res := d.List[:0]
err := ld.IterKey(func(k string, e Lit) error {
res = append(res, Keyed{k, e})
return nil
})
if err != nil {
return err
}
d.List = res
default:
return cor.Errorf("%q %T not assignable to %q", l.Typ(), l, d.Typ())
}
return nil
}