trie.hpp (cpp-lecture/trie/trie.hpp)

       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

#ifndef TRIE_TRIE_HPP
#define TRIE_TRIE_HPP

#include <algorithm>
#include <cassert>
#include <string>

struct KeyMap
{
    static constexpr size_t
    numKeys()
    {
        return ('Z' - 'A' + 1) + ('z' - 'a' + 1);
    }

    static constexpr size_t
    get(char c)
    {
        assert(c >= 'a' && c<= 'z' ||c >= 'A' && c<= 'Z');
        if (c >= 'a' && c <= 'z') {
            return c - 'a';
        }
        return c - 'A' + 'z' - 'a' + 1;
    }
};

template <typename Object>
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)
        {
            std::swap(lhs.node, rhs.node);
            std::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
        get_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(const Object *value= nullptr)
                : node{}, object{nullptr}
            {
                if (value) {
                    object = new Object(*value);
                }
            }

            Node(const Node &rhs)
                : object{nullptr}
            {
                if (rhs.object) {
                    object = new Object(*rhs.object);
                }
                for (std::size_t i=0; i<KeyMap::numKeys(); ++i) {
                    node[i] = (rhs.node[i]) ? new Node(*rhs.node[i])
                                            : nullptr;
                }
            }

            ~Node()
            {
                for (std::size_t i=0; i<KeyMap::numKeys(); ++i) {
                    delete node[i];
                }
                delete object;
            }

            Node    *node[KeyMap::numKeys()];
            Object  *object;
        };

        void
        recursive_insert(Node *&root, const char *c, const Object &value)
        {
            if (!root) {
                root = new Node();
            }

            if (*c) {
                std::size_t key = KeyMap::get(*c);
                recursive_insert(root->node[key], c+1, value);
            } else {
                if (root->object) {
                    delete root->object;
                } else {
                    ++size;
                }
                root->object = new Object(value);
            }
        }

        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 = KeyMap::get(*c);
                recursive_visit(root->node[key], c+1, visitor);
            } else {
                if (root->object) {
                    visitor(*root->object);
                }
                for (std::size_t i=0; i<KeyMap::numKeys(); ++i) {
                    recursive_visit(root->node[i], 0, visitor);
                }
            }
        }

        Node            *node;
        std::size_t     size;
};

#endif // TRIE_TRIE_HPP