radix_tree_node.h

/*
** libutil++
** $Id: radix_tree_node.h 1653 2016-02-28 19:54:59Z sella $
** Copyright (c) 2011-2016 Digital Genesis, LLC. All Rights Reserved.
** Released under the LGPL Version 2.1 License.
** http://www.digitalgenesis.com
*/

#ifndef __libutilxx__sella__container__radix_tree_node_H__
#define __libutilxx__sella__container__radix_tree_node_H__

#include <map>

namespace sella {
        namespace container {
                template <typename K, typename T>
                class radix_tree_node {
                        friend class radix_tree<K, T>;
                        friend class radix_tree_it<K, T>;

                        typedef std::pair<const K, T> value_type;
                        typedef typename std::map<K, radix_tree_node<K, T>* >::iterator it_child;

                private:
                        radix_tree_node() : m_children(), m_parent(NULL), m_value(NULL), m_depth(0), m_is_leaf(false), m_key() { }
                        radix_tree_node(const value_type &val);
                        radix_tree_node(const radix_tree_node&); // delete
                        radix_tree_node& operator=(const radix_tree_node&); // delete

                        ~radix_tree_node();

                        std::map<K, radix_tree_node<K, T>*> m_children;
                        radix_tree_node<K, T> *m_parent;
                        value_type *m_value;
                        int m_depth;
                        bool m_is_leaf;
                        K m_key;
                };

                template <typename K, typename T>
                radix_tree_node<K, T>::radix_tree_node(const value_type &val) :
                        m_children(),
                        m_parent(NULL),
                        m_value(NULL),
                        m_depth(0),
                        m_is_leaf(false),
                        m_key()
                {
                        m_value = new value_type(val);
                }

                template <typename K, typename T>
                radix_tree_node<K, T>::~radix_tree_node()
                {
                        it_child it;
                        for (it = m_children.begin(); it != m_children.end(); ++it) {
                                delete it->second;
                        }
                        delete m_value;
                }
        }
}


#endif

/*
** vim: noet ts=3 sw=3
*/