rbtree-pure 0.1.0

data/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+- 
+features/**/*.feature
+LICENSE.txt

data/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>rbtree-pure</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>com.aptana.ide.core.unifiedBuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>com.aptana.ruby.core.rubynature</nature>
+	</natures>
+</projectDescription>

data/Gemfile

@@ -0,0 +1,11 @@
+source 'http://rubygems.org'
+# Add dependencies required to use your gem here.
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem 'bundler', '~> 1.0.0'
+  gem 'jeweler', '~> 1.6.2'
+  gem 'rcov', '>= 0', :platform => :mri
+  gem 'rdoc', '>= 0'
+end

data/Gemfile.lock

@@ -0,0 +1,20 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    git (1.2.5)
+    jeweler (1.6.4)
+      bundler (~> 1.0)
+      git (>= 1.2.5)
+      rake
+    rake (0.9.2)
+    rcov (0.9.9)
+    rdoc (3.8)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.0.0)
+  jeweler (~> 1.6.2)
+  rcov
+  rdoc

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2011 Victor Costan
+
+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.rdoc

@@ -0,0 +1,17 @@
+= rbtree-pure
+
+Pure-ruby implementation of the rbtree gem, providing red-black trees.
+
+== Contributing to rbtree-pure
+ 
+* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
+* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
+* Fork the project
+* Start a feature/bugfix branch
+* Commit and push until you are happy with your contribution
+* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+== Copyright
+
+Copyright (c) 2011 Victor Costan. See LICENSE.txt for further details.

data/Rakefile

@@ -0,0 +1,57 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+  gem.name = "rbtree-pure"
+  gem.homepage = "http://github.com/pwnall/rbtree-pure"
+  gem.license = "MIT"
+  gem.summary = %Q{Pure-ruby implementation of red-black trees.}
+  gem.description = %Q{This is a pure-ruby implementation of the rbtree gem.}
+  gem.email = "victor@costan.us"
+  gem.authors = ["Victor Costan"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+  test.libs << 'lib' << 'test'
+  test.pattern = 'test/**/*_test.rb'
+  test.verbose = true
+end
+
+begin
+  require 'rcov/rcovtask'
+  Rcov::RcovTask.new do |test|
+    test.libs << 'test'
+    test.pattern = 'test/**/test_*.rb'
+    test.verbose = true
+    test.rcov_opts << '--exclude "gems/*"'
+  end
+rescue LoadError
+  # No rcov outside MRI.
+end
+
+task :default => :test
+
+require 'rdoc/task'
+Rake::RDocTask.new do |rdoc|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "rbtree-pure #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+0.1.0

data/lib/rbtree.rb

@@ -0,0 +1,10 @@
+# :nodoc: namespace
+class RBTree  
+end
+
+require 'rbtree/node.rb'
+require 'rbtree/guard_node.rb'
+require 'rbtree/tree.rb'
+require 'rbtree/tree_cmp.rb'
+require 'rbtree/multi_rb_tree.rb'
+require 'rbtree/rb_tree.rb'

data/lib/rbtree/guard_node.rb

@@ -0,0 +1,28 @@
+# :nodoc: namespace
+class RBTree
+  
+# Node instance used as a guard.
+class GuardNode < Node
+  def initialize
+    @color = :black
+    @key = nil
+    @value = nil
+    @left = nil
+    @right = nil
+    @parent = nil
+  end
+
+  def nil?
+    true
+  end
+  
+  def to_a
+    nil
+  end
+  
+  def inspect
+    'RBTree::GuardNode'
+  end
+end
+
+end  # namespace RBTree

data/lib/rbtree/multi_rb_tree.rb

@@ -0,0 +1,317 @@
+# Sorted hash that supports multiple keys for its values.
+class MultiRBTree < RBTree
+  def initialize(default = nil, &default_proc)
+    super(default, &default_proc)
+    @size = 0
+  end
+  
+  def lower_bound(key)
+    node = @tree.lower_bound(key)
+    [node.key, node.value.first]
+  end
+  
+  def upper_bound(key)
+    node = @tree.lower_bound(key)
+    [node.key, node.value.last]
+  end
+  
+  def bound(lower_key, upper_key = nil)
+    result = []
+    bound_nodes lower_key, upper_key do |node|
+      if block_given?
+        node.value.each { |value| yield node.key, value }
+      else
+        node.value.each { |value| result << [node.key, value] }
+      end
+    end
+    block_given? ? self : result
+  end
+
+  def to_rbtree
+    self
+  end
+
+  def replace(other)
+    raise TypeError, 'cannot modify rbtree in iteration' if @lock_count > 0
+    unless other.kind_of? RBTree
+      raise TypeError, "expected RBTree, got #{other.class}"
+    end
+
+    @tree = other.tree.dup
+    @default_proc = other.default_proc
+    @default = other.default
+    @cmp_proc = other.cmp_proc
+    @size = other.size
+    
+    unless other.instance_of? MultiRBTree
+      # Wrap values in arrays to convert RBTree -> MultiRBTree.
+      @tree.inorder do |node|
+        node.value = [node.value]
+      end
+    end
+    
+    self
+  end
+end
+
+# :nodoc: array behavior
+class MultiRBTree
+  # The [key, value] for the smallest key in the tree.
+  def first
+    node = @tree.minimum
+    node.nil? ? default : [node.key, node.value.first]
+  end
+  
+  # The [key, value] for the largest key in the tree.
+  def last
+    node = @tree.maximum
+    node.nil? ? default : [node.key, node.value.last]
+  end
+  
+  # Removes the largest key in the tree.
+  def pop
+    return default if (node = @tree.maximum).nil? 
+    value = node.value.pop
+    @tree.delete node if node.value.empty?
+    @size -= 1
+    [node.key, value]
+  end
+  
+  # Removes the smallest key in the tree.
+  def shift
+    return default if (node = @tree.minimum).nil? 
+    value = node.value.shift
+    @tree.delete node if node.value.empty?
+    @size -= 1
+    [node.key, value]
+  end
+end
+
+# :nodoc: hash behavior
+class MultiRBTree
+  # See Hash#[]
+  def [](key)
+    node = tree.search key
+    node ? node.value.first : default(key)
+  end
+  
+  # See Hash#[]=
+  def []=(key, value)
+    raise TypeError, 'cannot modify rbtree in iteration' if @lock_count > 0
+
+    key = key.clone.freeze if key.kind_of? String
+    @tree.insert(@tree.node(key, [])).value << value
+    @size += 1
+    value
+  end
+  
+  # See Hash#size
+  attr_reader :size
+  
+  # See Hash#empty
+  def empty?
+    @tree.empty?
+  end
+
+  # See Hash#clear
+  def clear
+    super
+    @size = 0
+  end
+  
+  # See Hash#each
+  def each
+    if block_given?
+      lock_changes do
+        @tree.inorder do |node|
+          node.value.each { |value| yield node.key, value }
+        end
+      end
+    else
+      Enumerator.new self, :each
+    end
+  end
+  alias :each_pair :each
+  
+  # See Hash#reverse_each
+  def reverse_each
+    if block_given?
+      lock_changes do
+        @tree.reverse_inorder do |node|
+          node.value.each { |value| yield node.key, value }
+        end
+      end
+    else
+      Enumerator.new self, :reverse_each
+    end
+  end
+  
+  # See Hash#index
+  def index(value)
+    each { |k, v| return k if v.include? value }
+    nil
+  end
+  
+  # See Hash#fetch
+  def fetch(key, *default)
+    if default.length > 1
+      raise ArgumentError, "expected at most 1 default, got #{default.length}"
+    end
+    if default.length == 1 && block_given?
+      $stderr << "warning: block supersedes default value argument"
+    end
+    
+    node = tree.search key
+    return node.value.first if node
+    if block_given?
+      yield key
+    else
+      if default.length == 1
+        default.first
+      else
+        raise IndexError, 'key not found'
+      end
+    end
+  end
+  
+  # See Hash#delete
+  def delete(key)
+    node = @tree.search key
+    unless node
+      return block_given? ? yield : nil
+    end
+    value = node.value.shift
+    @tree.delete node if node.value.empty?
+    @size -= 1
+    value
+  end
+  
+  # See Hash#reject!
+  def reject!
+    if block_given?
+      dead_nodes = []
+      lock_changes do
+        @tree.inorder do |node|
+          node.value.reject! do |value|
+            @size -= 1 if result = yield(node.key, value)
+            result
+          end
+          dead_nodes << node if node.value.empty?
+        end
+      end
+      dead_nodes.each { |node| @tree.delete node }
+      dead_nodes.empty? ? nil : self
+    else
+      Enumerator.new self, :each
+    end
+  end
+  
+  # See Hash#reject
+  def reject(&block)
+    copy = self.dup
+    copy.reject!(&block)
+    # NOTE: the correct answer should be "copy", but we're copying RBTree
+    #       bug-for-bug
+    # copy
+  end
+  
+  # See Hash#each_key.
+  def each_key
+    if block_given?
+      lock_changes do
+        @tree.inorder { |node| node.value.each { yield node.key } }
+      end
+    else
+      Enumerator.new self, :each_key
+    end
+  end
+
+  
+  # See Hash#each_value.
+  def each_value
+    if block_given?
+      lock_changes do
+        @tree.inorder { |node| node.value.each { |value| yield value } }
+      end
+    else
+      Enumerator.new self, :each_value
+    end
+  end
+  
+  # See Hash#merge!
+  def merge!(other)
+    unless other.instance_of? RBTree
+      raise TypeError, "wrong argument type #{other.class} (expected RBTree)"
+    end
+    
+    if block_given?
+      other.each do |key, value|
+        if node = @tree.search(key)
+          self[key] = yield key, node.value.first, value
+        else
+          self[key] = value
+        end
+      end
+    else
+      other.each { |key, value| self[key] = value }
+    end
+    self
+  end
+  alias :update :merge!
+  
+  # See Hash#merge
+  def merge(other)
+    copy = self.dup
+    copy.merge! other
+    copy
+  end
+  
+  # A new Hash with the same contents and defaults as this RBTree instance.
+  def to_hash
+    raise TypeError, "can't convert MultiRBTree to Hash"
+  end
+  
+  # :nodoc:
+  def inspect
+    contents = map { |k, v|
+      k_inspect = k.equal?(self) ? '#<RBTree: ...>' : k.inspect
+      v_inspect = v.equal?(self) ? '#<RBTree: ...>' : v.inspect
+      "#{k_inspect}=>#{v_inspect}"
+    }.join(', ')
+    default_inspect = default.equal?(self) ? '#<RBTree: ...>' : default.inspect
+    "#<MultiRBTree: {#{contents}}, default=#{default_inspect}, cmp_proc=#{@cmp_proc.inspect}>"
+  end
+  
+  # :nodoc: custom pp output
+  def pretty_print(q)
+    q.group(1, "#<#{self.class.name}: ", '>') do
+      q.group(1, '{', '}') do
+        first = true
+        each do |key, value|
+          if first
+            first = false
+          else
+            q.text ','
+            q.breakable ' '
+          end
+          q.pp key
+          q.text '=>'
+          q.pp value
+        end
+      end
+      q.text ','
+      q.breakable ' '
+      q.text 'default='
+      q.pp default
+      q.text ','
+      q.breakable ' '
+      q.text 'cmp_proc='
+      q.pp cmp_proc
+    end
+  end
+  
+  # :nodoc: custom pp output
+  def pretty_print_cycle(q)
+    q.text '"#<MultiRBTree: ...>"'
+  end
+end  # class RBTree::MultiRBTree