ffi-radix_tree 0.1.0

data/vendor/radixtree/radix_tree_it.hpp

@@ -0,0 +1,117 @@
+#ifndef RADIX_TREE_IT
+#define RADIX_TREE_IT
+
+#include <iterator>
+
+// forward declaration
+template <typename K, typename T> class radix_tree;
+template <typename K, typename T> class radix_tree_node;
+
+template <typename K, typename T>
+class radix_tree_it : public std::iterator<std::forward_iterator_tag, std::pair<K, T> > {
+    friend class radix_tree<K, T>;
+
+public:
+    radix_tree_it() : m_pointee(0) { }
+    radix_tree_it(const radix_tree_it& r) : m_pointee(r.m_pointee) { }
+    radix_tree_it& operator=(const radix_tree_it& r) { m_pointee = r.m_pointee; return *this; }
+    ~radix_tree_it() { }
+
+    std::pair<const K, T>& operator*  () const;
+    std::pair<const K, T>* operator-> () const;
+    const radix_tree_it<K, T>& operator++ ();
+    radix_tree_it<K, T> operator++ (int);
+    // const radix_tree_it<K, T>& operator-- ();
+    bool operator!= (const radix_tree_it<K, T> &lhs) const;
+    bool operator== (const radix_tree_it<K, T> &lhs) const;
+
+private:
+    radix_tree_node<K, T> *m_pointee;
+    radix_tree_it(radix_tree_node<K, T> *p) : m_pointee(p) { }
+
+    radix_tree_node<K, T>* increment(radix_tree_node<K, T>* node) const;
+    radix_tree_node<K, T>* descend(radix_tree_node<K, T>* node) const;
+};
+
+template <typename K, typename T>
+radix_tree_node<K, T>* radix_tree_it<K, T>::increment(radix_tree_node<K, T>* node) const
+{
+    radix_tree_node<K, T>* parent = node->m_parent;
+
+    if (parent == NULL)
+        return NULL;
+
+    typename radix_tree_node<K, T>::it_child it = parent->m_children.find(node->m_key);
+    assert(it != parent->m_children.end());
+    ++it;
+
+    if (it == parent->m_children.end())
+        return increment(parent);
+    else
+        return descend(it->second);
+}
+
+template <typename K, typename T>
+radix_tree_node<K, T>* radix_tree_it<K, T>::descend(radix_tree_node<K, T>* node) const
+{
+    if (node->m_is_leaf)
+        return node;
+
+    typename radix_tree_node<K, T>::it_child it = node->m_children.begin();
+
+    assert(it != node->m_children.end());
+
+    return descend(it->second);
+}
+
+template <typename K, typename T>
+std::pair<const K, T>& radix_tree_it<K, T>::operator* () const
+{
+    return *m_pointee->m_value;
+}
+
+template <typename K, typename T>
+std::pair<const K, T>* radix_tree_it<K, T>::operator-> () const
+{
+    return m_pointee->m_value;
+}
+
+template <typename K, typename T>
+bool radix_tree_it<K, T>::operator!= (const radix_tree_it<K, T> &lhs) const
+{
+    return m_pointee != lhs.m_pointee;
+}
+
+template <typename K, typename T>
+bool radix_tree_it<K, T>::operator== (const radix_tree_it<K, T> &lhs) const
+{
+    return m_pointee == lhs.m_pointee;
+}
+
+template <typename K, typename T>
+const radix_tree_it<K, T>& radix_tree_it<K, T>::operator++ ()
+{
+    if (m_pointee != NULL) // it is undefined behaviour to dereference iterator that is out of bounds...
+        m_pointee = increment(m_pointee);
+    return *this;
+}
+
+template <typename K, typename T>
+radix_tree_it<K, T> radix_tree_it<K, T>::operator++ (int)
+{
+    radix_tree_it<K, T> copy(*this);
+    ++(*this);
+    return copy;
+}
+
+/*
+template <typename K, typename T>
+const radix_tree_it<K, T>& radix_tree_it<K, T>::operator-- ()
+{
+    assert(m_pointee != NULL);
+
+    return *this;
+}
+*/
+
+#endif // RADIX_TREE_IT

data/vendor/radixtree/radix_tree_node.hpp

@@ -0,0 +1,53 @@
+#ifndef RADIX_TREE_NODE_HPP
+#define RADIX_TREE_NODE_HPP
+
+#include <map>
+
+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 // RADIX_TREE_NODE_HPP

metadata

@@ -0,0 +1,134 @@
+--- !ruby/object:Gem::Specification
+name: ffi-radix_tree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Brandon Dewitt
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-10-09 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: msgpack
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: ffi
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+description: " radix tree implementation in c++ with FFI bindings "
+email:
+- brandonsdewitt@gmail.com
+executables: []
+extensions:
+- ext/ffi/radixtree/Rakefile
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- ext/ffi/radixtree/Rakefile
+- ffi-radix_tree.gemspec
+- lib/ffi/radix_tree.rb
+- lib/ffi/radix_tree/version.rb
+- vendor/radixtree/CMakeLists.txt
+- vendor/radixtree/COPYING
+- vendor/radixtree/ffi_radix_tree.cpp
+- vendor/radixtree/radix_tree.hpp
+- vendor/radixtree/radix_tree_it.hpp
+- vendor/radixtree/radix_tree_node.hpp
+homepage: https://www.github.com/abrandoned/ffi-radix_tree
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.6.13
+signing_key: 
+specification_version: 4
+summary: radix tree implementation in c++ with FFI bindings
+test_files: []