Lines Matching refs:entries
58 entries: make(entries, 0, len(kwargs)),
63 s.entries = append(s.entries, entry{k, v})
65 sort.Sort(s.entries)
77 entries: make(entries, 0, len(d)),
80 s.entries = append(s.entries, entry{k, v})
82 sort.Sort(s.entries)
103 entries entries // sorted by name member
110 type entries []entry type
112 func (a entries) Len() int { return len(a) }
113 func (a entries) Less(i, j int) bool { return a[i].name < a[j].name }
114 func (a entries) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
128 for _, e := range s.entries {
143 for i, e := range s.entries {
163 for _, e := range s.entries {
176 for _, e := range s.entries {
196 for _, e := range x.entries {
199 for _, e := range y.entries {
213 n := len(s.entries)
217 if s.entries[h].name < name {
223 if i < n && s.entries[i].name == name {
224 return s.entries[i].value, nil
235 func (s *Struct) len() int { return len(s.entries) }
239 names := make([]string, len(s.entries))
240 for i, e := range s.entries {
272 if x.entries[i].name != y.entries[i].name {
274 …} else if eq, err := starlark.EqualDepth(x.entries[i].value, y.entries[i].value, depth-1); err != …