57         LinkNode* node = bucket[index];  variable
60         while (node != nullptr) {
61             if (node->entry.first == key) {
62                 return node->entry.second;
64             prev = node;
65             node = node->next;
68         node = new LinkNode();
69         node->entry.first = key;
70         node->next = nullptr;
72             bucket[index] = node;
74             prev->next = node;
76         return node->entry.second;
85             next = node->next;
87                 node = next;
94                     node = next;
99             node = nullptr;
104             return node == other.node && bucket_index == other.bucket_index &&
109             return node != other.node || bucket_index != other.bucket_index ||
114             return node->entry;
118         iterator(size_t index, LinkNode* n, const Map* m) : bucket_index(index), node(n), map(m) {}  in iterator()
122         LinkNode* node;  variable
128             LinkNode* node = bucket[i];  in begin()  local
129             if (node != nullptr) {  in begin()
130                 return iterator(i, node, this);  in begin()
145         LinkNode* node = bucket[index];  in find()  local
147         while (node != nullptr) {  in find()
148             if (node->entry.first == key) {  in find()
149                 return iterator(index, node, this);  in find()
151             node = node->next;  in find()