-
Notifications
You must be signed in to change notification settings - Fork 47
/
Copy pathdict.rn
73 lines (62 loc) · 1.79 KB
/
dict.rn
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
// Copyright 2021 Google LLC.
//
// 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
//
// https://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.
class Dict(self, <key>, <value>) {
class Entry(self, dict, <key>, <value>) {
self.key = key
self.value = value
dict.insertEntry(self)
}
func insert(self, key, value) {
if !isnull(self.findEntry(key)) {
raise Status.AlreadyExists, "Key already exists in dictionary"
}
Dict.Entry(self, key, value)
}
func remove(self, key) {
entry = self.findEntry(key)
if isnull(entry) {
raise Status.NotFound, "Key not found in dictionary"
}
self.removeEntry(entry!)
}
func find(self, key) {
entry = self.findEntry(key)
if isnull(entry) {
raise Status.NotFound, "Key not found in dictionary"
}
return entry.value
}
operator [] (dict: Dict, key) {
return dict.find(dict, key)
}
operator in (key, dict: Dict) {
return !isnull(dict.findEntry(key))
}
iterator values(self) {
for entry in self.entries() {
yield entry.value
}
}
iterator keys(self) {
for entry in self.entries() {
yield entry.key
}
}
iterator items(self) {
for entry in self.entries() {
yield (entry.key, entry.value)
}
}
}
relation Hashed Dict<key, value> Dict.Entry<key, value> cascade ("key", "Entries")