r2ree 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 92e4940115abf3167b0f3789add6c1e2409bf16a
+  data.tar.gz: e75b0fd689d3f08caa23326a4d4c4976ba21a749
+SHA512:
+  metadata.gz: 6bbadaa7576826f70536a006168216ff981fad5993a1cfc558ee4797afb19b11bdab828a1ee2f9d2ff52645f03dd66ccce3e984b18feefccfc0df4afc70277a8
+  data.tar.gz: f087b59bc48b93d189eed595e2e83b7363bb995206dd8f200db1dd7ff52fd7e5434b86b60b202444bf50b5d310f8a0e80647b560b5a18039a67c45085ff8cabe

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.travis.yml

@@ -0,0 +1,6 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.3.1
+before_install: gem install bundler -v 1.12.5
+before_script: bundle exec rake build

data/Gemfile

@@ -0,0 +1,7 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in r2ree.gemspec
+
+  gem 'bundler', '~> 1.12'
+  gem 'rake', '~> 10.0'
+  gem 'test-unit'

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Kunpei Sakai
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,39 @@
+# R2ree
+
+[r2ree](https://github.com/namusyaka/r2ree) bindings for Ruby
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'r2ree'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install r2ree
+
+## Usage
+
+```ruby
+tree = R2ree.new(['/a', '/b', '/c'])
+
+tree.size #=> 3
+tree.find('/b') #=> 1
+tree.exist?('/c') #=> true
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/namusyaka/r2ree-ruby.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,13 @@
+require 'rake/testtask'
+
+Rake::TestTask.new do |t|
+  t.libs << 'test'
+  t.test_files = Dir['test/**/test_*.rb']
+  t.verbose = true
+end
+
+task :build do |t|
+  sh 'cd ext/r2ree && ruby extconf.rb && make'
+end
+
+task default: :test

data/ext/r2ree/extconf.rb

@@ -0,0 +1,17 @@
+require 'mkmf'
+
+CWD = File.expand_path(__dir__)
+R2REE_DIR = File.join(CWD, '..', '..', 'vendor', 'r2ree')
+
+Dir.chdir(R2REE_DIR) do
+  FileUtils.cp File.join('include', 'r2ree.hh'), File.join('..', '..', 'ext', 'r2ree', 'libr2ree.hh')
+  FileUtils.cp File.join('src',     'r2ree.cc'), File.join('..', '..', 'ext', 'r2ree', 'libr2ree.cc')
+end
+
+$CXXFLAGS +=
+  case cc_command
+  when /clang\+\+/ then " -std=c++11 -Wall -Wextra -I#{R2REE_DIR}/include"
+  when /g++/       then " -std=c++0x -Wall -Wextra -I#{R2REE_DIR}/include"
+  end
+
+create_makefile('r2ree/r2ree')

data/ext/r2ree/r2ree.cc

@@ -0,0 +1,104 @@
+#include "libr2ree.hh"
+#include "string"
+#include "iostream"
+#include "ruby.h"
+
+#define R2REE_VERSION "0.0.1"
+
+using std::ignore;
+using std::tie;
+
+static VALUE rb_r2ree;
+
+static void r2ree_free(r2ree::radix_tree *tree);
+static r2ree::radix_tree *get_r2ree_radix_tree(VALUE klass);
+static r2ree::parse_result match(VALUE klass, const char *path);
+static VALUE r2ree_size(VALUE self); 
+static VALUE r2ree_s_new(int argc, VALUE *argv, VALUE self); 
+static VALUE r2ree_find(int argc, VALUE *argv, VALUE self); 
+static VALUE r2ree_exist(int argc, VALUE *argv, VALUE self); 
+static VALUE r2ree_size(VALUE self); 
+
+static void r2ree_free(r2ree::radix_tree *tree) {
+  tree->~radix_tree();
+  ruby_xfree(tree);
+}
+
+static r2ree::radix_tree *get_r2ree_radix_tree(VALUE klass) {
+  r2ree::radix_tree *tree;
+  return Data_Get_Struct(klass, r2ree::radix_tree, tree);
+}
+
+static r2ree::parse_result match(VALUE klass, const char *path) {
+  r2ree::radix_tree *tree = get_r2ree_radix_tree(klass);
+  return tree->get(path);
+}
+
+static VALUE r2ree_s_new(int argc, VALUE *argv, VALUE self) {
+  int i = 0;
+  VALUE paths, path;
+  r2ree::radix_tree *tree = new r2ree::radix_tree();
+  rb_scan_args(argc, argv, "1", &paths);
+
+  if (TYPE(paths) == T_ARRAY) {
+    while (!NIL_P(path = rb_ary_entry(paths, i))) {
+      if (TYPE(path) != T_STRING)
+        rb_raise(rb_eArgError, "wrong argument type, expected String");
+      tree->insert(StringValuePtr(path));
+      ++i;
+    }
+  }
+
+  return Data_Wrap_Struct(self, NULL, r2ree_free, tree);
+};
+
+static VALUE r2ree_size(VALUE self) {
+  r2ree::radix_tree *tree = get_r2ree_radix_tree(self);
+  int cid = tree->cid;
+  return INT2NUM(cid >= 0 ? cid + 1 : 0);
+};
+
+static VALUE r2ree_exist(int argc, VALUE *argv, VALUE self) {
+  VALUE path;
+  bool existence, leaf;
+
+  rb_scan_args(argc, argv, "1", &path);
+
+  if (TYPE(path) == T_STRING) {
+    tie(existence, ignore, ignore, leaf) = match(self, StringValuePtr(path));
+    return (existence && leaf) ? Qtrue : Qfalse;
+  } else {
+    return Qfalse;
+  }
+};
+
+static VALUE r2ree_find(int argc, VALUE *argv, VALUE self) {
+  int cid;
+  VALUE path;
+  bool existence, leaf;
+
+  rb_scan_args(argc, argv, "1", &path);
+
+  if (TYPE(path) == T_STRING) {
+    tie(existence, cid, ignore, leaf) = match(self, StringValuePtr(path));
+    return (existence && leaf) ? INT2NUM(cid) : INT2NUM(-1);
+  } else {
+    rb_raise(rb_eArgError, "wrong argument type, expected String");
+  }
+};
+
+extern "C" void Init_r2ree() {
+  VALUE tmp;
+
+  rb_r2ree = rb_define_class("R2ree", rb_cObject);
+
+  tmp = rb_str_new2(R2REE_VERSION);
+  rb_obj_freeze(tmp);
+  rb_const_set(rb_r2ree, rb_intern("VERSION"), tmp);
+
+  rb_define_singleton_method(rb_r2ree, "new",        RUBY_METHOD_FUNC(r2ree_s_new), -1);
+  rb_define_method(rb_r2ree,           "exist?",     RUBY_METHOD_FUNC(r2ree_exist), -1);
+  rb_define_method(rb_r2ree,           "find",       RUBY_METHOD_FUNC(r2ree_find),  -1);
+  rb_define_method(rb_r2ree,           "size",       RUBY_METHOD_FUNC(r2ree_size),   0);
+  rb_define_alias(rb_r2ree, "length", "size");
+};

data/r2ree.gemspec

@@ -0,0 +1,20 @@
+# coding: utf-8
+require File.expand_path('ext/r2ree/r2ree', __dir__)
+
+Gem::Specification.new do |spec|
+  spec.name          = "r2ree"
+  spec.version       = R2ree::VERSION
+  spec.authors       = ["namusyaka"]
+  spec.email         = ["namusyaka@gmail.com"]
+
+  spec.summary       = %q{r2ree radix tree implementation for ruby}
+  spec.description   = spec.summary
+  spec.homepage      = "https://github.com/namusyaka/r2ree-ruby"
+  spec.license       = "MIT"
+  spec.extensions    = %w[ext/r2ree/extconf.rb]
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+end

data/vendor/r2ree/.travis.yml

@@ -0,0 +1,21 @@
+language: cpp
+os:
+  - linux
+  - osx
+cache:
+  - apt
+compiler:
+  - clang
+  - gcc
+before_install:
+  - if [ "$TRAVIS_OS_NAME" == "linux" ]; then sudo apt-get update; fi
+install:
+  - wget https://github.com/google/googletest/archive/release-1.7.0.zip -O googletest-release-1.7.0.zip
+  - if [ "$TRAVIS_OS_NAME" == "linux" ]; then unzip -q googletest-release-1.7.0.zip && cd googletest-release-1.7.0 && sudo cp -r include/gtest /usr/local/include && g++ src/gtest-all.cc -I. -Iinclude -c && g++ src/gtest_main.cc -I. -Iinclude -c && ar -rv libgtest.a gtest-all.o && ar -rv libgtest_main.a gtest_main.o && sudo mv *.a /usr/local/lib && g++ -m32 src/gtest-all.cc -I. -Iinclude -c && g++ -m32 src/gtest_main.cc -I. -Iinclude -c && ar -rv libgtest.a gtest-all.o && ar -rv libgtest_main.a gtest_main.o && sudo mkdir /usr/local/lib32 && sudo mv *.a /usr/local/lib32 && cd ..; fi
+  - if [ "$TRAVIS_OS_NAME" == "osx" ]; then unzip -q googletest-release-1.7.0.zip && cd googletest-release-1.7.0 && sudo cp -r include/gtest /usr/local/include && clang++ src/gtest-all.cc -I. -Iinclude -c && g++ src/gtest_main.cc -I. -Iinclude -c && ar -rv libgtest.a gtest-all.o && ar -rv libgtest_main.a gtest_main.o && sudo mv *.a /usr/local/lib && cd ..; fi
+matrix:
+  exclude:
+    - os: osx
+      compiler: gcc
+script:
+  - mkdir build && cd build && cmake .. && make && ./r2ree_test

data/vendor/r2ree/CMakeLists.txt

@@ -0,0 +1,56 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+set(PROJECT_NAME_STR r2ree)
+project(${PROJECT_NAME_STR} C CXX)
+
+find_package(Threads REQUIRED)
+
+if(CMAKE_COMPILER_IS_GNUCXX)
+    add_definitions(-Wall -ansi -Wno-deprecated -pthread)
+endif()
+
+if(MSVC)
+    #vc 2012 fix for vararg templates
+    set(MSVC_COMPILER_DEFS "-D_VARIADIC_MAX=10")
+endif() 
+#-------------------
+# set common include folder for module
+#-------------------
+set(COMMON_INCLUDES ${PROJECT_SOURCE_DIR}/include)
+set(EXT_PROJECTS_DIR ${PROJECT_SOURCE_DIR}/ext)
+
+add_subdirectory(${EXT_PROJECTS_DIR}/gtest)
+
+set(CMAKE_CXX_FLAGS "-std=c++11 -stdlib=libc++ -Iinclude -include ${PROJECT_SOURCE_DIR}/src/r2ree.cc")
+
+#-------------------
+# Test
+#-------------------
+add_definitions(${MSVC_COMPILER_DEFS})
+enable_testing()
+set(PROJECT_TEST_NAME ${PROJECT_NAME_STR}_test)
+include_directories(${GTEST_INCLUDE_DIRS} ${COMMON_INCLUDES})
+
+file(GLOB TEST_SRC_FILES ${PROJECT_SOURCE_DIR}/test/*.cc)
+add_executable(${PROJECT_TEST_NAME} ${TEST_SRC_FILES})
+add_dependencies(${PROJECT_TEST_NAME} googletest)
+
+
+if(NOT WIN32 OR MINGW)
+    target_link_libraries(${PROJECT_TEST_NAME}
+        ${GTEST_LIBS_DIR}/libgtest.a
+        ${GTEST_LIBS_DIR}/libgtest_main.a
+        )
+else()
+    target_link_libraries(${PROJECT_TEST_NAME}
+        debug ${GTEST_LIBS_DIR}/DebugLibs/${CMAKE_FIND_LIBRARY_PREFIXES}gtest${CMAKE_FIND_LIBRARY_SUFFIXES}
+        optimized ${GTEST_LIBS_DIR}/ReleaseLibs/${CMAKE_FIND_LIBRARY_PREFIXES}gtest${CMAKE_FIND_LIBRARY_SUFFIXES}
+        )
+    target_link_libraries(${PROJECT_TEST_NAME}
+        debug ${GTEST_LIBS_DIR}/DebugLibs/${CMAKE_FIND_LIBRARY_PREFIXES}gtest_main${CMAKE_FIND_LIBRARY_SUFFIXES}
+        optimized ${GTEST_LIBS_DIR}/ReleaseLibs/${CMAKE_FIND_LIBRARY_PREFIXES}gtest_main${CMAKE_FIND_LIBRARY_SUFFIXES}
+        )
+endif()
+
+target_link_libraries(${PROJECT_TEST_NAME} ${CMAKE_THREAD_LIBS_INIT})
+
+add_test(test1 ${PROJECT_TEST_NAME})

data/vendor/r2ree/README.md

@@ -0,0 +1,5 @@
+# r2ree
+
+Radix tree implementation for use in HTTP routing.
+
+r2ree is written in C++ and licensed under the MIT License, it can be used as a library.

data/vendor/r2ree/ext/gtest/CMakeLists.txt

@@ -0,0 +1,31 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+project(gtest_builder C CXX)
+include(ExternalProject)
+
+set(GTEST_FORCE_SHARED_CRT ON)
+set(GTEST_DISABLE_PTHREADS OFF)
+
+if(MINGW)
+    set(GTEST_DISABLE_PTHREADS ON)
+endif()
+
+ExternalProject_Add(googletest
+    GIT_REPOSITORY https://github.com/google/googletest.git
+    CMAKE_ARGS -DCMAKE_ARCHIVE_OUTPUT_DIRECTORY_DEBUG:PATH=DebugLibs
+    -DCMAKE_ARCHIVE_OUTPUT_DIRECTORY_RELEASE:PATH=ReleaseLibs
+    -DCMAKE_CXX_FLAGS=${MSVC_COMPILER_DEFS}
+    -Dgtest_force_shared_crt=${GTEST_FORCE_SHARED_CRT}
+    -Dgtest_disable_pthreads=${GTEST_DISABLE_PTHREADS}
+    -DBUILD_GTEST=ON
+    PREFIX "${CMAKE_CURRENT_BINARY_DIR}"
+    # Disable install step
+    INSTALL_COMMAND ""
+    )
+
+# Specify include dir
+ExternalProject_Get_Property(googletest source_dir)
+set(GTEST_INCLUDE_DIRS ${source_dir}/googletest/include PARENT_SCOPE)
+
+# Specify MainTest's link libraries
+ExternalProject_Get_Property(googletest binary_dir)
+set(GTEST_LIBS_DIR ${binary_dir}/googlemock/gtest PARENT_SCOPE)

data/vendor/r2ree/include/r2ree.hh

@@ -0,0 +1,59 @@
+#ifndef r2ree_h
+#define r2ree_h
+
+#include <string>
+#include <vector>
+#include <tuple>
+
+namespace r2ree {
+  using std::string;
+  using std::vector;
+  using std::tuple;
+  using std::pair;
+
+  const char asterisk = '*';
+  const char colon    = ':';
+  const char slash    = '/';
+
+  typedef pair<string, string> parameter;
+
+  struct parameters {
+    parameter *params;
+    int size;
+  };
+
+  typedef tuple<bool, int, parameters, bool> parse_result;
+
+  struct radix_tree_node {
+    string path;
+    string indices;
+    vector<radix_tree_node*> children;
+    int id;
+    int type;
+    int max_parameters;
+    bool leaf;
+
+    radix_tree_node() = default;
+    explicit radix_tree_node(const string &path);
+    ~radix_tree_node();
+
+    radix_tree_node* insert_child(char index, radix_tree_node *child);
+    radix_tree_node* get_child(char index);
+    int get_index_position(char target);
+  };
+
+  int find(const string &str, char target, int start);
+
+  class radix_tree {
+    public:
+      int cid;
+      radix_tree();
+      ~radix_tree();
+      int insert(const string &path);
+      parse_result get(const string &path);
+    private:
+      radix_tree_node *root;
+  };
+}; // namespace r2ree
+
+#endif

data/vendor/r2ree/src/r2ree.cc

@@ -0,0 +1,193 @@
+/*
+ * The MIT License (MIT)
+ *
+ * Copyright (c) 2016 namusyaka
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#include "r2ree.hh"
+
+namespace r2ree {
+  int find(const string &str, char target, int start) {
+    auto i = str.find(target, start);
+    return i == -1 ? str.size() : i;
+  }
+
+  radix_tree_node::radix_tree_node(const string &path) {
+    this->id   = -1;
+    this->leaf = false;
+    this->path = path;
+  }
+
+  radix_tree_node::~radix_tree_node() {
+    for (auto &c : this->children)
+      delete c;
+  }
+
+  radix_tree_node* radix_tree_node::insert_child(char index, radix_tree_node *child) {
+    auto i = this->get_index_position(index);
+    this->indices.insert(this->indices.begin() + i, index);
+    this->children.insert(this->children.begin() + i, child);
+    return child;
+  }
+
+  radix_tree_node* radix_tree_node::get_child(char index) {
+    auto i = this->get_index_position(index);
+    return this->indices[i] != index ? nullptr : this->children[i];
+  }
+
+  int radix_tree_node::get_index_position(char target) {
+    int low = 0, high = this->indices.size(), mid;
+    while (low < high) {
+      mid = low + ((high - low) >> 1);
+      if (this->indices[mid] < target)
+        low = mid + 1;
+      else
+        high = mid;
+    }
+    return low;
+  }
+
+  radix_tree::radix_tree() {
+    this->cid = -1;
+    this->root = new radix_tree_node();
+  }
+
+  radix_tree::~radix_tree() {
+    delete this->root;
+  }
+
+  int radix_tree::insert(const string &path) {
+    auto root = this->root;
+    int i = 0, n = path.size(), param_count = 0, code = 0, cid = ++this->cid;
+
+    while (i < n) {
+      if (!root->indices.empty() && (root->indices[0] == asterisk ||
+        path[i] == asterisk ||
+        (path[i] != colon && root->indices[0] == colon) ||
+        (path[i] == colon && root->indices[0] != colon) ||
+        (path[i] == colon && root->indices[0] == colon && path.substr(
+          i + 1, find(path, slash, i) - i - 1) != root->children[0]->path))) {
+        code = -1;
+        break;
+      }
+
+      auto child = root->get_child(path[i]);
+      if (!child) {
+        auto p = find(path, colon, i);
+        if (p == n) {
+          p = find(path, asterisk, i);
+
+          if (path[i] == slash) {
+            root = root->insert_child(slash, new radix_tree_node(path.substr(i, 1)));
+
+            if (i == 0 && path[i + 1] == 0)
+              break;
+
+            ++i;
+          }
+
+          root = root->insert_child(path[i], new radix_tree_node(path.substr(i, p - i)));
+
+          if (p < n) {
+            root = root->insert_child(asterisk, new radix_tree_node(path.substr(p + 1)));
+            ++param_count;
+          }
+
+          break;
+        }
+
+        root = root->insert_child(path[i], new radix_tree_node(path.substr(i, p - i)));
+        i = find(path, slash, p);
+
+        root = root->insert_child(colon, new radix_tree_node(path.substr(p + 1, i - p - 1)));
+        ++param_count;
+
+        if (i == n)
+          break;
+      } else {
+        root = child;
+
+        if (path[i] == colon) {
+          ++param_count;
+          i += root->path.size() + 1;
+
+          if (i == n)
+            break;
+        } else {
+          auto j = 0UL, m = root->path.size();
+
+          for (; i < n && j < m && path[i] == root->path[j]; ++i, ++j)
+            continue;
+
+          if (j < m) {
+            auto child = new radix_tree_node(root->path.substr(j));
+
+            child->indices = root->indices;
+            child->children = root->children;
+
+            root->path = root->path.substr(0, j);
+            root->indices = child->path[0];
+            root->children = {child};
+          }
+
+          if (i == n)
+            break;
+        }
+      }
+    }
+
+    if (param_count > this->root->max_parameters)
+      this->root->max_parameters = param_count;
+
+    root->id = cid;
+    root->leaf = true;
+    return code;
+  }
+
+  parse_result radix_tree::get(const string &path) {
+    parameters params = parameters{ new parameter[root->max_parameters] };
+
+    auto root = this->root;
+    int i = 0, n = path.size(), p;
+
+    while (i < n) {
+      if (root->indices.empty())
+        return parse_result();
+
+      if (root->indices[0] == colon) {
+        root = root->children[0];
+        p = find(path, slash, i);
+        params.params[params.size++] = parameter{ root->path, path.substr(i, p - i) };
+        i = p;
+      } else if (root->indices[0] == asterisk) {
+        root = root->children[0];
+        params.params[params.size++] = parameter{ root->path, path.substr(i) };
+        break;
+      } else {
+        root = root->get_child(path[i]);
+        if (!root || path.substr(i, root->path.size()) != root->path)
+          return parse_result();
+        i += root->path.size();
+      }
+    }
+    return parse_result{true, root->id, params, root->leaf};
+  }
+}  // namespace r2ree

data/vendor/r2ree/test/gtest_r2ree.cc

@@ -0,0 +1,76 @@
+#include "gtest/gtest.h"
+#include "r2ree.hh"
+
+namespace {
+  class r2ree_test : public ::testing::Test{
+    protected:
+      r2ree::radix_tree tree;
+  };
+
+  TEST_F(r2ree_test, insert_basic) {
+    tree.insert("/user");
+    ASSERT_EQ(0, tree.cid);
+  }
+
+  TEST_F(r2ree_test, insert_with_multiple_routes) {
+    tree.insert("/user");
+    tree.insert("/123");
+    ASSERT_EQ(1, tree.cid);
+  }
+
+  TEST_F(r2ree_test, insert_with_no_route) {
+    ASSERT_EQ(-1, tree.cid);
+  }
+
+  TEST_F(r2ree_test, get_basic) {
+    r2ree::parse_result actual;
+
+    tree.insert("/user");
+    actual = tree.get("/user");
+    ASSERT_EQ(true, std::get<0>(actual));
+    ASSERT_EQ(0,    std::get<1>(actual));
+    ASSERT_EQ(0,    std::get<2>(actual).size);
+    ASSERT_EQ(true, std::get<3>(actual));
+  }
+
+  TEST_F(r2ree_test, get_with_nonexistence_pattern) {
+    r2ree::parse_result actual;
+
+    tree.insert("/user");
+    actual = tree.get("/users");
+    ASSERT_EQ(false, std::get<0>(actual));
+    ASSERT_EQ(0,     std::get<1>(actual));
+    ASSERT_EQ(0,     std::get<2>(actual).size);
+    ASSERT_EQ(false, std::get<3>(actual));
+  }
+
+  TEST_F(r2ree_test, get_with_only_root) {
+    r2ree::parse_result actual;
+
+    tree.insert("/");
+    actual = tree.get("/");
+    ASSERT_EQ(true, std::get<0>(actual));
+    ASSERT_EQ(0,    std::get<1>(actual));
+    ASSERT_EQ(0,    std::get<2>(actual).size);
+    ASSERT_EQ(true, std::get<3>(actual));
+  }
+
+  TEST_F(r2ree_test, get_with_captured_params) {
+    r2ree::parse_result actual;
+    r2ree::parameters params;
+
+    tree.insert("/users/:name/tags/:tag_id");
+
+    actual = tree.get("/users/namusyaka/tags/foo");
+    params = std::get<2>(actual);
+
+    ASSERT_EQ(true,        std::get<0>(actual));
+    ASSERT_EQ(0,           std::get<1>(actual));
+    ASSERT_EQ(2,           params.size);
+    ASSERT_EQ("name",      params.params[0].first);
+    ASSERT_EQ("namusyaka", params.params[0].second);
+    ASSERT_EQ("tag_id",    params.params[1].first);
+    ASSERT_EQ("foo",       params.params[1].second);
+    ASSERT_EQ(true,        std::get<3>(actual));
+  }
+}

metadata

@@ -0,0 +1,61 @@
+--- !ruby/object:Gem::Specification
+name: r2ree
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- namusyaka
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-10-09 00:00:00.000000000 Z
+dependencies: []
+description: r2ree radix tree implementation for ruby
+email:
+- namusyaka@gmail.com
+executables: []
+extensions:
+- ext/r2ree/extconf.rb
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- ext/r2ree/extconf.rb
+- ext/r2ree/r2ree.cc
+- r2ree.gemspec
+- vendor/r2ree/.travis.yml
+- vendor/r2ree/CMakeLists.txt
+- vendor/r2ree/README.md
+- vendor/r2ree/ext/gtest/CMakeLists.txt
+- vendor/r2ree/include/r2ree.hh
+- vendor/r2ree/src/r2ree.cc
+- vendor/r2ree/test/gtest_r2ree.cc
+homepage: https://github.com/namusyaka/r2ree-ruby
+licenses:
+- MIT
+metadata: {}
+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.5.1
+signing_key: 
+specification_version: 4
+summary: r2ree radix tree implementation for ruby
+test_files: []