amorim-algorithms 0.6.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 588b03be1dd0e9aafdb59ff3bb9f16ea1bc34493
+  data.tar.gz: 6dcaf86182d26f05a25f42d55bf822e7ab061819
+SHA512:
+  metadata.gz: d0fc04e9d6fc6b96498924baceecdef51b23247e72510b99a743e88a8099dc44ae015a56f96232f5fd3fecd7b450215a491f28fa91786bcb580c11db63f8357b
+  data.tar.gz: d5268551194ea05b17f218098214eedcd7dfc36dacbf9b4485f73b1c7fe51530e2a3added6a1f2d490f1e1655de82c1fb35aa720267a0d7eb9f6d5957c12fe94

data/CHANGELOG.markdown

@@ -0,0 +1,193 @@
+=== January 22, 2013
+    
+    * JRuby support
+
+=== April 15, 2012
+
+    * Use long instead of int for string methods
+    * Use VALUE instead of int for comparison vars
+    * Now compiles without warnings (OS X 10.7)
+
+=== April 19, 2012
+
+    * Pulled in fix for ruby 1.9 compilation error (sorry!!)
+    * Fix specs that broke with new rspec
+    * Migration to rubygems.org
+    * 0.4.0 release
+
+=== Jan 3, 2009
+
+    * Levenshtein distance in C
+
+=== April 3, 2009
+
+	* Finished C refactorization of SplayTree
+
+=== March 28, 2009
+
+	* Implemented SplayTree in C
+	* Made recursively_free_nodes methods static to fix a SEGFAULT
+	* Improved CBst
+	* Moved to Markdown for README
+	* 0.2.0 release
+
+=== January 19, 2009
+
+  * kd-tree for points in multi-dimensional space
+
+=== November 25, 2008
+
+  * Checked in gnufied's C BST
+  
+=== November 13, 2008
+
+  * Removed #each for Hash and Priority Queue (Feature)
+  
+=== September 15, 2008
+
+  * Added comb sort
+  * Benchmark work on sorting algorithms
+
+=== September 1, 2008
+
+  * Switched to Hanna rdoc template
+  * RBTree#isred now private
+
+=== August 20, 2008
+
+  * Implemented Knuth-Morris-Pratt substring algorithm
+  
+=== August 15, 2008
+
+  * Updated README to reflect progress
+
+=== August 10, 2008
+
+  * Implemented mergesort, insertion_sort, shell_sort, quicksort
+
+=== August 8, 2008
+
+  * Implemented bubble_sort, selection_sort, heapsort
+
+=== August 5, 2008
+
+  * Started Algorithms portion
+  * Implemented Search#binary_search
+
+=== July 20, 2008
+
+  * Iterate over trees iteratively instead of recursively
+  * Implemented Deque in C
+
+=== July 15, 2008
+
+  * Refactored namespaces, thank you Austin Ziegler!
+
+=== July 14, 2008
+
+  * Use alias_method instead of alias
+  * Found and fixed RBTree#delete bug (finally!)
+  * Refactored Trie, SuffixArray, SplayTreeMap
+
+=== July 13, 2008
+
+  * Refactored Deque
+  * Implemented Deque#reverse_each (like Array's)
+
+=== July 12, 2008
+
+  * Reformatted some specs to be more idiomatic (Thank you Federico Builes)
+
+=== July 10, 2008
+
+  * Added algorithm complexity information for all Containers
+  * Implemented Trie for string representation
+  * Implmented SuffixArray for fast substring search
+  * Fixed memory leak in CRBTree
+  * Updated Manifest and algorithms.rb to match progress
+
+=== July 9, 2008
+
+  * Implemented Deque
+  * Stack and Queue now use Deque
+  * Fixed issues with CRBTree's #empty? and delete methods
+
+=== July 8, 2008
+
+  * Can now iterate over a heap
+  * Renamed #contains_key -> has_key? since it's more idiomatic
+  * Implented #change_key and #delete for Heap
+  * Priority Queue is now implemented with the new Fibonacci Heap
+  * Removed old Priority Queue code as a result
+  * Heap: fixed #delete bug not checking if item exists, #has_key? bug 
+          for not returning boolean
+  * Heap: value field is now optional and defaults to the key if not specified
+  * More refactoring of RBTreeMap (both Ruby and C)
+  
+=== July 7, 2008
+
+  * Heap is now implemented with a Fibonacci Heap, not a binomial heap
+
+=== July 4, 2008
+
+  * Implemented SplayTreeMap
+  * Heap now uses kind_of? to check for other heaps when doing #merge
+  * Renamed some Heap methods for consistency with the rest of the library
+  * RBTreeMap#contains? -> contains_key?
+  * Refactored RBTreeMap to be more object-oriented
+  * More documentation for RBTreeMap
+
+=== July 3, 2008
+  
+  * Added documentation for Stack and Queue
+
+=== June 24, 2008
+  
+  * Imported Brian Amberg's priority queue implementation
+  * Now uses Echoe to build gem
+  * Gem builds for the first time
+
+=== June 18, 2008
+  
+  * Can now enumerate over RBTreeMap
+
+=== June 17, 2008
+
+  * RBTreemap#delete now returns deleted value
+  * Added delete method to C implementation
+
+=== June 16, 2008
+
+  * Implemented delete methods for RBTreeMap
+
+=== June 14, 2008
+
+  * Renamed the data structures module to "Containers"
+  * Removed dependence on stdbool.h
+  * Renamed RBTree to RBTreeMap
+
+=== June 13, 2008
+
+  * Implemented Sedgewick's Left Leaning Red Black Tree in C!
+
+=== June 12, 2008
+
+  * Implemented Sedgewick's Left Leaning Red Black Tree
+
+=== June 10, 2008
+
+  * Implemented merge! for other heaps and heap initialization from an array
+  * Implemented Queue
+
+=== June 9, 2008
+
+  * Finished binomial heap implementation
+
+=== June 8, 2008
+
+  * Added Stack
+  * Working on heap
+
+=== April 20
+
+  * Accepted to Google Summer of Code!

data/Gemfile

@@ -0,0 +1,9 @@
+source "https://rubygems.org"
+
+gemspec
+
+group :development do
+    gem "rspec"
+    gem "rake-compiler"
+end
+

data/Manifest

@@ -0,0 +1,51 @@
+CHANGELOG.markdown
+Manifest
+README.markdown
+Rakefile
+algorithms.gemspec
+benchmarks/deque.rb
+benchmarks/sorts.rb
+benchmarks/treemaps.rb
+ext/algorithms/string/extconf.rb
+ext/algorithms/string/string.c
+ext/containers/bst/bst.c
+ext/containers/bst/extconf.rb
+ext/containers/deque/deque.c
+ext/containers/deque/extconf.rb
+ext/containers/rbtree_map/extconf.rb
+ext/containers/rbtree_map/rbtree.c
+ext/containers/splaytree_map/extconf.rb
+ext/containers/splaytree_map/splaytree.c
+lib/algorithms.rb
+lib/algorithms/search.rb
+lib/algorithms/sort.rb
+lib/algorithms/string.rb
+lib/containers/deque.rb
+lib/containers/heap.rb
+lib/containers/kd_tree.rb
+lib/containers/priority_queue.rb
+lib/containers/queue.rb
+lib/containers/rb_tree_map.rb
+lib/containers/splay_tree_map.rb
+lib/containers/stack.rb
+lib/containers/suffix_array.rb
+lib/containers/trie.rb
+spec/bst_gc_mark_spec.rb
+spec/bst_spec.rb
+spec/deque_gc_mark_spec.rb
+spec/deque_spec.rb
+spec/heap_spec.rb
+spec/kd_expected_out.txt
+spec/kd_test_in.txt
+spec/kd_tree_spec.rb
+spec/map_gc_mark_spec.rb
+spec/priority_queue_spec.rb
+spec/queue_spec.rb
+spec/rb_tree_map_spec.rb
+spec/search_spec.rb
+spec/sort_spec.rb
+spec/splay_tree_map_spec.rb
+spec/stack_spec.rb
+spec/string_spec.rb
+spec/suffix_array_spec.rb
+spec/trie_spec.rb

data/README.markdown

@@ -0,0 +1,87 @@
+# algorithms [![Build Status](https://travis-ci.org/kanwei/algorithms.png)](https://travis-ci.org/kanwei/algorithms)
+
+[API Documentation](http://kanwei.github.io/algorithms/)
+
+## DESCRIPTION:
+
+Started as a [Google Summer of Code 2008](http://code.google.com/soc/2008/ruby/about.html) project
+
+Written by [Kanwei Li](http://kanwei.com/), mentored by Austin Ziegler
+
+### Original Proposal: ###
+
+Using the right data structure or algorithm for the situation is an important
+aspect of programming. In computer science literature, many data structures
+and algorithms have been researched and extensively documented. However, there
+is still no standard library in Ruby implementing useful structures and
+algorithms like Red/Black Trees, tries, different sorting algorithms, etc.
+This project will create such a library with documentation on when to use a
+particular structure/algorithm. It will also come with a benchmark suite to
+compare performance in different situations.
+
+## COMPLETED:
+
+    * Heaps              Containers::Heap, Containers::MaxHeap, Containers::MinHeap
+    * Priority Queue     Containers::PriorityQueue
+    * Deque              Containers::Deque, Containers::CDeque (C ext)
+    * Stack              Containers::Stack
+    * Queue              Containers::Queue
+    * Red-Black Trees    Containers::RBTreeMap, Containers::CRBTreeMap (C ext)
+    * Splay Trees        Containers::SplayTreeMap, Containers::CSplayTreeMap (C ext)
+    * Tries              Containers::Trie
+    * Suffix Array       Containers::SuffixArray
+
+    * Search algorithms
+      - Binary Search            Algorithms::Search.binary_search
+      - Knuth-Morris-Pratt       Algorithms::Search.kmp_search
+    * Sorting algorithms           
+      - Bubble sort              Algorithms::Sort.bubble_sort
+      - Comb sort                Algorithms::Sort.comb_sort
+      - Selection sort           Algorithms::Sort.selection_sort
+      - Heapsort                 Algorithms::Sort.heapsort
+      - Insertion sort           Algorithms::Sort.insertion_sort
+      - Shell sort               Algorithms::Sort.shell_sort
+      - Quicksort                Algorithms::Sort.quicksort
+      - Mergesort                Algorithms::Sort.mergesort
+      - Dual-Pivot Quicksort     Algorithms::Sort.dualpivotquicksort
+
+## SYNOPSIS:
+
+    require 'rubygems'
+    require 'algorithms'
+
+    max_heap = Containers::MaxHeap.new
+
+    # To not have to type "Containers::" before each class, use:
+    include Containers
+    max_heap = MaxHeap.new
+
+## REQUIREMENTS:
+
+* Ruby 1.8, Ruby 1.9, JRuby
+* C extensions (optional, but very much recommended for vast performance benefits)
+
+## LICENSE:
+
+(The MIT License)
+
+Ruby Algorithms and Containers project is Copyright (c) 2009 Kanwei Li
+
+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/Rakefile

@@ -0,0 +1,22 @@
+require 'rubygems'
+require 'rake/extensiontask'
+require 'rspec/core/rake_task'
+require 'bundler/gem_tasks'
+
+Rake::ExtensionTask.new('algorithms/string')        { |ext| ext.name = "CString" }
+Rake::ExtensionTask.new('containers/deque')         { |ext| ext.name = "CDeque" }
+Rake::ExtensionTask.new('containers/bst')           { |ext| ext.name = "CBst" }
+Rake::ExtensionTask.new('containers/rbtree_map')    { |ext| ext.name = "CRBTreeMap" }
+Rake::ExtensionTask.new('containers/splaytree_map') { |ext| ext.name = "CSplayTreeMap" }
+
+RSpec::Core::RakeTask.new
+
+if defined?(RUBY_ENGINE) && RUBY_ENGINE == 'jruby'
+  task :default => [:spec]
+else
+  task :default => [:compile, :spec]
+end
+
+task :rdoc do
+    `rdoc -f hanna --main algorithms.rb -t "Ruby Algorithms and Containers Documentation"`
+end

data/algorithms.gemspec

@@ -0,0 +1,23 @@
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = "amorim-algorithms"
+  s.version = "0.6.1"
+
+  s.authors = ["Kanwei Li"]
+  s.email = "kanwei@gmail.com"
+  s.license = 'MIT'
+  s.date = "2013-01-22"
+  s.summary = "Useful algorithms and data structures for Ruby. Optional C extensions."
+  s.description = "Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more"
+  if defined?(RUBY_ENGINE) && RUBY_ENGINE == 'jruby'
+    s.platform = "java"
+  else
+    s.extensions = ["ext/algorithms/string/extconf.rb", "ext/containers/bst/extconf.rb", "ext/containers/deque/extconf.rb", "ext/containers/rbtree_map/extconf.rb", "ext/containers/splaytree_map/extconf.rb"]
+  end
+  s.files = ["Gemfile", "CHANGELOG.markdown", "Manifest", "README.markdown", "Rakefile", "algorithms.gemspec", "benchmarks/deque.rb", "benchmarks/sorts.rb", "benchmarks/treemaps.rb", "ext/algorithms/string/extconf.rb", "ext/algorithms/string/string.c", "ext/containers/bst/bst.c", "ext/containers/bst/extconf.rb", "ext/containers/deque/deque.c", "ext/containers/deque/extconf.rb", "ext/containers/rbtree_map/extconf.rb", "ext/containers/rbtree_map/rbtree.c", "ext/containers/splaytree_map/extconf.rb", "ext/containers/splaytree_map/splaytree.c", "lib/algorithms.rb", "lib/algorithms/search.rb", "lib/algorithms/sort.rb", "lib/algorithms/string.rb", "lib/containers/deque.rb", "lib/containers/heap.rb", "lib/containers/kd_tree.rb", "lib/containers/priority_queue.rb", "lib/containers/queue.rb", "lib/containers/rb_tree_map.rb", "lib/containers/splay_tree_map.rb", "lib/containers/stack.rb", "lib/containers/suffix_array.rb", "lib/containers/trie.rb", "spec/bst_gc_mark_spec.rb", "spec/bst_spec.rb", "spec/deque_gc_mark_spec.rb", "spec/deque_spec.rb", "spec/heap_spec.rb", "spec/kd_expected_out.txt", "spec/kd_test_in.txt", "spec/kd_tree_spec.rb", "spec/map_gc_mark_spec.rb", "spec/priority_queue_spec.rb", "spec/queue_spec.rb", "spec/rb_tree_map_spec.rb", "spec/search_spec.rb", "spec/sort_spec.rb", "spec/splay_tree_map_spec.rb", "spec/stack_spec.rb", "spec/string_spec.rb", "spec/suffix_array_spec.rb", "spec/trie_spec.rb"]
+  s.homepage = "https://github.com/kanwei/algorithms"
+  s.rdoc_options = ["--line-numbers", "--inline-source", "--title", "Algorithms", "--main", "README.markdown"]
+  s.require_paths = ["lib", "ext"]
+  s.rubyforge_project = "algorithms"
+end

data/benchmarks/deque.rb

@@ -0,0 +1,17 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '../lib')
+require 'algorithms'
+include Algorithms
+
+require 'rubygems'
+require 'rbench'
+
+RBench.run(2) do
+  %w(array deque).each { |s| self.send(:column, s.intern) }
+  deque = Containers::Deque.new
+  array = []
+  
+  report "Insertion at end" do
+    array { 1000000.times  { |x| array << x } }
+    deque { 1000000.times  { |x| deque.push_back(x) } }
+  end
+end

data/benchmarks/sorts.rb

@@ -0,0 +1,34 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '../lib')
+require 'algorithms'
+include Algorithms
+
+require 'rubygems'
+require 'rbench'
+
+RBench.run(5) do
+  
+  sorts = %w(ruby comb_sort heapsort insertion_sort shell_sort quicksort mergesort)
+  sorts.each { |sort| self.send(:column, sort.intern) }
+  
+  n = 1000
+  
+  proc = lambda { |scope, ary|
+    scope.ruby { ary.dup.sort }
+    scope.comb_sort { Sort.comb_sort(ary.dup) }
+    scope.heapsort { Sort.heapsort(ary.dup) }
+    scope.insertion_sort { Sort.insertion_sort(ary.dup) }
+    scope.shell_sort { Sort.shell_sort(ary.dup) }
+    scope.quicksort { Sort.quicksort(ary.dup) }
+    scope.mergesort { Sort.mergesort(ary.dup) }
+  }
+
+  report "Already sorted" do
+    sorted_array = Array.new(n) { rand(n) }.sort
+    proc.call(self, sorted_array)
+  end
+  
+  report "Random" do
+    random_array = Array.new(n) { rand(n) }
+    proc.call(self, random_array)
+  end
+end