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 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 |
#ifndef TRIE_TRIE_HPP
#define TRIE_TRIE_HPP #include <algorithm> #include <cassert> #include <string> template <typename Object, typename Key> class Trie { public: Trie() : node{nullptr}, size_{0} { } Trie(const Trie &rhs) : node(rhs.node ? new Node(*rhs.node) : nullptr), size_{rhs.size_} { } Trie(Trie &&trie) : Trie() { swap(*this, trie); } friend void swap(Trie &lhs, Trie &rhs) { using std::swap; swap(lhs.node, rhs.node); swap(lhs.size_, rhs.size_); } ~Trie() { delete node; } Trie & operator=(Trie rhs) { swap(*this, rhs); return *this; } Trie & insert(const std::string &key, const Object &obj) { recursive_insert(node, key.c_str(), obj); return *this; } std::size_t size() const { return size_; } template <typename Visitor> const Trie & visit(const std::string &key, const Visitor &visitor) const { recursive_visit(node, key.c_str(), visitor); return *this; } private: struct Node { Node() : node{}, object{}, hasObject{false} { } Node(const Object &value) : node{}, object{value}, hasObject{true} { } Node(const Node &rhs) : object{rhs.object}, hasObject{rhs.hasObject} { for (std::size_t i=0; i<Key::size(); ++i) { node[i] = (rhs.node[i]) ? new Node(*rhs.node[i]) : nullptr; } } ~Node() { for (std::size_t i=0; i<Key::size(); ++i) { delete node[i]; } } Node *node[Key::size()]; Object object; bool hasObject; }; void recursive_insert(Node *&root, const char *c, const Object &value) { if (!root) { root = new Node(); } if (*c) { std::size_t key = Key::map(*c); recursive_insert(root->node[key], c+1, value); } else { if (!root->hasObject) { ++size_; } root->object = value; root->hasObject = true; } } template <typename Visitor> void recursive_visit(Node *root, const char *c, const Visitor &visitor) const { if (!root) { return; } if (c && *c) { std::size_t key = Key::map(*c); recursive_visit(root->node[key], c+1, visitor); } else { if (root->hasObject) { visitor(root->object); } for (std::size_t i=0; i<Key::size(); ++i) { recursive_visit(root->node[i], nullptr, visitor); } } } // // Aufgabe 8: Navigieren in Tries // public: class Pointer { public: Pointer(Node *node) : node(node) { } bool defined() const { return node!=nullptr; } bool exists() const { assert(defined()); return node->hasObject; } bool descend(char c) { assert(defined()); node = node->node[Key::map(c)]; return defined(); } Object & operator*() { assert(exists()); return node->object; } private: Node *node; }; Node *node; std::size_t size_; Pointer descend() { return Pointer(node); } }; #endif // TRIE_TRIE_HPP |