algorithms 0.0.1

data/spec/queue_spec.rb

@@ -0,0 +1,53 @@
+require 'lib/algorithms'
+
+describe Containers::Queue do
+  before(:each) do
+    @queue = Containers::Queue.new
+  end
+  
+  describe "(empty)" do
+    it "should return nil when sent #get" do
+      @queue.get.should eql(nil)
+    end
+
+    it "should return a size of 1 when sent #put" do
+      @queue.put(1).size.should eql(1)
+    end
+    
+    it "should return nil when peeked" do
+      @queue.peek.should eql(nil)
+    end
+    
+    it "should return empty?" do
+      @queue.empty?.should eql(true)
+    end
+  end
+  
+  describe "(non-empty)" do
+    before(:each) do
+      @queue.put(10)
+      @queue.put("10")
+    end
+    
+    it "should return first put object" do
+      @queue.get.should eql(10)
+    end
+    
+    it "should return the size" do
+      @queue.size.should eql(2)
+    end
+    
+    it "should not return empty?" do
+      @queue.empty?.should eql(false)
+    end
+    
+    it "should return nil after all gets" do
+      @queue.get
+      @queue.get
+      @queue.get.should eql(nil)
+      @queue.peek.should eql(nil)
+    end
+    
+  end
+  
+end

data/spec/stack_spec.rb

@@ -0,0 +1,53 @@
+require 'lib/algorithms'
+
+describe Containers::Stack do
+  before(:each) do
+    @stack = Containers::Stack.new
+  end
+  
+  describe "(empty)" do
+    it "should return nil when sent #pop" do
+      @stack.pop.should eql(nil)
+    end
+
+    it "should return a size of 1 when sent #push" do
+      @stack.push(1).size.should eql(1)
+    end
+    
+    it "should return nil when peeked" do
+      @stack.peek.should eql(nil)
+    end
+    
+    it "should return empty?" do
+      @stack.empty?.should eql(true)
+    end
+  end
+  
+  describe "(non-empty)" do
+    before(:each) do
+      @stack.push(10)
+      @stack.push("10")
+    end
+    
+    it "should return last pushed object" do
+      @stack.pop.should eql("10")
+    end
+    
+    it "should return the size" do
+      @stack.size.should eql(2)
+    end
+    
+    it "should not return empty?" do
+      @stack.empty?.should eql(false)
+    end
+    
+    it "should return nil after all pops" do
+      @stack.pop
+      @stack.pop
+      @stack.pop.should eql(nil)
+      @stack.peek.should eql(nil)
+    end
+    
+  end
+  
+end

data/spec/tree_map_spec.rb

@@ -0,0 +1,99 @@
+require 'lib/algorithms'
+  
+describe "(empty)", :shared => true do
+  it "should let you put stuff in" do
+    100.times { |x| @tree[x] = x }
+    @tree.size.should eql(100)
+  end
+  
+  it "should return 0 for height" do
+    @tree.height.should eql(0)
+  end
+  
+  it "should return 0 for size" do
+    @tree.size.should eql(0)
+  end
+  
+  it "should return nil for #min_key and #max_key" do
+    @tree.min_key.should eql(nil)
+    @tree.max_key.should eql(nil)
+  end
+  
+  it "should not delete" do
+    @tree.delete(:non_existing).should eql(nil)
+  end
+end
+
+describe "(non-empty)", :shared => true do
+  before(:each) do
+    @num_items = 100
+    @random_array = []
+    @num_items.times { @random_array << rand(@num_items) }
+    @random_array.each { |x| @tree[x] = x }
+  end
+  
+  it "should return correct size (uniqify items first)" do
+    @tree.size.should eql(@random_array.uniq.size)
+  end
+  
+  it "should return correct max and min keys" do
+    @tree.min_key.should eql(@random_array.min)
+    @tree.max_key.should eql(@random_array.max)
+  end
+  
+  it "should not #contain? keys it doesn't have" do
+    @tree.contains?(10000).should eql(false)
+  end
+  
+  it "should #contain? keys it does have" do
+    @tree.contains?(@random_array[0]).should eql(true)
+  end
+  
+  it "should remove any key" do
+    random_key = @random_array[rand(@num_items)]
+    @tree.contains?(random_key).should eql(true)
+    @tree.delete(random_key).should eql(random_key)
+    @tree.contains?(random_key).should eql(false)
+  end
+  
+  it "should let you iterate with #each" do
+    counter = 0
+    sorted_array = @random_array.uniq.sort
+    @tree.each do |key, val|
+      key.should eql(sorted_array[counter])
+      counter += 1
+    end
+  end
+end
+
+describe Containers::CTreeMap do
+  describe "empty" do
+    before(:each) do
+      @tree = Containers::CTreeMap.new
+    end
+    it_should_behave_like "(empty)"
+  end
+  
+  describe "full" do
+    before(:each) do
+      @tree = Containers::CTreeMap.new
+    end
+    it_should_behave_like "(non-empty)"
+  end
+end
+
+describe Containers::RubyTreeMap do
+  describe "empty" do
+    before(:each) do
+      @tree = Containers::RubyTreeMap.new
+    end
+    it_should_behave_like "(empty)"
+  end
+  
+  describe "full" do
+    before(:each) do
+      @tree = Containers::RubyTreeMap.new
+    end
+    it_should_behave_like "(non-empty)"
+  end
+end

metadata

@@ -0,0 +1,104 @@
+--- !ruby/object:Gem::Specification 
+name: algorithms
+version: !ruby/object:Gem::Version 
+  version: 0.0.1
+platform: ruby
+authors: 
+- Kanwei Li
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2008-06-25 00:00:00 -04:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: echoe
+  type: :development
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+    version: 
+description: A library of algorithms and containers.
+email: kanwei@gmail.com
+executables: []
+
+extensions: 
+- ext/containers/priority_queue/extconf.rb
+- ext/containers/tree_map/extconf.rb
+extra_rdoc_files: 
+- ext/containers/priority_queue/extconf.rb
+- ext/containers/priority_queue/priority_queue.c
+- ext/containers/tree_map/extconf.rb
+- ext/containers/tree_map/Rakefile
+- ext/containers/tree_map/rbtree.c
+- lib/algorithms.rb
+- lib/containers/hash.rb
+- lib/containers/heap.rb
+- lib/containers/priority_queue.rb
+- lib/containers/queue.rb
+- lib/containers/stack.rb
+- lib/containers/tree_map.rb
+- README.txt
+files: 
+- benchmark.rb
+- ext/containers/priority_queue/extconf.rb
+- ext/containers/priority_queue/priority_queue.c
+- ext/containers/tree_map/extconf.rb
+- ext/containers/tree_map/Rakefile
+- ext/containers/tree_map/rbtree.c
+- History.txt
+- lib/algorithms.rb
+- lib/containers/hash.rb
+- lib/containers/heap.rb
+- lib/containers/priority_queue.rb
+- lib/containers/queue.rb
+- lib/containers/stack.rb
+- lib/containers/tree_map.rb
+- Manifest
+- Rakefile
+- README.txt
+- spec/heap_spec.rb
+- spec/priority_queue_spec.rb
+- spec/priority_queue_test.rb
+- spec/queue_spec.rb
+- spec/stack_spec.rb
+- spec/tree_map_spec.rb
+- algorithms.gemspec
+has_rdoc: true
+homepage: http://rubyforge.org/projects/algorithms/
+post_install_message: 
+rdoc_options: 
+- --line-numbers
+- --inline-source
+- --title
+- Algorithms
+- --main
+- README.txt
+require_paths: 
+- lib
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - "="
+    - !ruby/object:Gem::Version 
+      version: "1.2"
+  version: 
+requirements: []
+
+rubyforge_project: algorithms
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: A library of algorithms and containers.
+test_files: []
+