augmented_interval_tree 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 2591f2d25e1de25e701a3115d5eb647334a67a74
+  data.tar.gz: e224077f0534ff854255a2d3ba840278148ac466
+SHA512:
+  metadata.gz: 88911836bf22f53b32cb414ec7583ac91bb4dee0c4d72e11af929c8873fc4cc49206d18db427e4c7dca29e5c6b7a1c68ce5bfc3843fadc53f0b05163cf695224
+  data.tar.gz: 02dea2fac6b40520bb156cdc429f936c42b8c919e27cd958cec8e3ca9731c422cc8f18d03c6a95e527e991fa13f09a6660400fdb6aae80312f5044e14e646429

data/lib/interval_tree.rb

@@ -0,0 +1,130 @@
+#!/usr/bin/env ruby
+#
+# Title:: the IntervalTree module using "augmented tree"
+# Author::   Hiroyuki Mishima, Simeon Simeonov, Carlos Alonso
+# Copyright:: The MIT/X11 license
+#
+# see also ....
+#  description in Wikipedia
+#    http://en.wikipedia.org/wiki/Interval_tree
+#  implementation in Python by Tyler Kahn
+#    http://forrst.com/posts/Interval_Tree_implementation_in_python-e0K
+#
+# Usage:
+#  require "interval_tree"
+#  itv = [(0...3), (1...4), (3...5),]
+#  t = IntervalTree::Tree.new(itv)
+#  p t.search(2) => [0...3, 1...4]
+#  p t.search(1...3) => [0...3, 1...4, 3...5]
+#
+# note: result intervals are always returned
+# in the "left-closed and right-open" style that can be expressed
+# by three-dotted Range object literals (first...last)
+
+module IntervalTree
+
+  class Tree
+    def initialize(ranges, &range_factory)
+      range_factory = lambda { |l, r| (l ... r+1) } unless block_given?
+      ranges_excl = ensure_exclusive_end([ranges].flatten, range_factory)
+      @top_node = divide_intervals(ranges_excl)
+    end
+    attr_reader :top_node
+
+    def divide_intervals(intervals)
+      return nil if intervals.empty?
+      x_center = center(intervals)
+      s_center = Array.new
+      s_left = Array.new
+      s_right = Array.new
+
+      intervals.each do |k|
+        case
+        when k.last < x_center
+          s_left << k
+        when k.first > x_center
+          s_right << k
+        else
+          s_center << k
+        end
+      end
+      Node.new(x_center, s_center,
+               divide_intervals(s_left), divide_intervals(s_right))
+    end
+
+
+    def search(interval)
+      return nil unless @top_node
+      if interval.respond_to?(:first)
+        first = interval.first
+        last = interval.last
+      else
+        first = interval
+        last = nil
+      end
+
+      if last
+        result = Array.new
+        (first...last).each do |j|
+          search(j).each{|k|result << k}
+          result.uniq!
+        end
+        result.sort_by{|x|[x.first, x.last]}
+      else
+        point_search(self.top_node, first, []).sort_by{|x|[x.first, x.last]}
+      end
+    end
+
+    private
+
+    def ensure_exclusive_end(ranges, range_factory)
+      ranges.map do |range|
+        case
+        when !range.respond_to?(:exclude_end?)
+          range
+        when range.exclude_end?
+          range
+        else
+          range_factory.call(range.first, range.end)
+        end
+      end
+    end
+
+    # augmented tree
+    # using a start point as resresentative value of the node
+    def center(intervals)
+      i = intervals.reduce([intervals.first.first, intervals.first.last]) { |acc, int| [[acc.first, int.first].min, [acc.last, int.last].max] }
+      i.first + (i.last - i.first) / 2
+    end
+
+    def point_search(node, point, result)
+      node.s_center.each do |k|
+        if k.include?(point)
+          result << k
+        end
+      end
+      if node.left_node && ( point < node.x_center )
+        point_search(node.left_node, point, []).each{|k|result << k}
+      end
+      if node.right_node && ( point >= node.x_center )
+        point_search(node.right_node, point, []).each{|k|result << k}
+      end
+      result.uniq
+    end
+  end # class Tree
+
+  class Node
+    def initialize(x_center, s_center, left_node, right_node)
+      @x_center = x_center
+      @s_center = s_center
+      @left_node = left_node
+      @right_node = right_node
+    end
+    attr_reader :x_center, :s_center, :left_node, :right_node
+  end # class Node
+
+end # module IntervalTree
+
+if  __FILE__ == $0
+  puts "This is the Augmented Interval Tree library."
+end

metadata

@@ -0,0 +1,64 @@
+--- !ruby/object:Gem::Specification
+name: augmented_interval_tree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Hiroyuki Mishima
+- Simeon Simeonov
+- Carlos Alonso
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-11-09 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.11'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.11'
+description: |
+  A Ruby implementation of the Augmented Interval Tree data structure.
+  See also: http://en.wikipedia.org/wiki/Interval_tree
+email:
+- missy@be.to
+- info@mrcalonso.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/interval_tree.rb
+homepage: https://github.com/misshie/interval-tree
+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.4.5
+signing_key: 
+specification_version: 4
+summary: A Ruby implementation of the Augmented Interval Tree data structure
+test_files: []