algorithms 0.3.0 → 0.4.0

data/{History.txt → CHANGELOG.markdown}

@@ -1,3 +1,14 @@
+=== 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

data/Manifest

@@ -1,4 +1,4 @@
-History.txt
+CHANGELOG.markdown
 Manifest
 README.markdown
 Rakefile
@@ -6,6 +6,10 @@ 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
@@ -15,6 +19,7 @@ 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
@@ -25,6 +30,8 @@ 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
@@ -39,5 +46,6 @@ 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/Rakefile

@@ -4,28 +4,10 @@ require 'echoe'
 Echoe.new('algorithms') do |p|
   p.author               = 'Kanwei Li'
   p.email                = 'kanwei@gmail.com'
-  p.summary              = 'A library of algorithms and containers.'
-  p.url                  = 'http://rubyforge.org/projects/algorithms/'
-  p.version              = "0.3.0"
+  p.summary              = 'A library of algorithms and data structures (containers).'
+  p.url                  = 'https://rubygems.org/gems/algorithms'
+  p.version              = "0.4.0"
+  p.retain_gemspec       = true
   p.runtime_dependencies = []
+  p.development_dependencies = ["rspec", "echoe"]
 end
-
-task :default => :spec
-
-task :spec do
-  sh "spec spec/*.rb --color"
-end
-
-task :push do
-  sh "git push"    # Rubyforge
-  sh "git push --tags"    # Rubyforge
-  sh "git push gh" # Github
-  sh "git push gh --tags" # Github
-end
-
-task :hanna do
-  sh "rm -fr doc"
-  sh "hanna -SN lib/ -m Algorithms"
-  sh "scp -rq doc/* kanwei@rubyforge.org:/var/www/gforge-projects/algorithms"
-end
-

data/algorithms.gemspec

@@ -1,32 +1,36 @@
 # -*- encoding: utf-8 -*-
 
 Gem::Specification.new do |s|
-  s.name = %q{algorithms}
-  s.version = "0.3.0"
+  s.name = "algorithms"
+  s.version = "0.4.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 1.2") if s.respond_to? :required_rubygems_version=
   s.authors = ["Kanwei Li"]
-  s.date = %q{2009-11-16}
-  s.description = %q{A library of algorithms and containers.}
-  s.email = %q{kanwei@gmail.com}
-  s.extensions = ["ext/containers/deque/extconf.rb", "ext/containers/rbtree_map/extconf.rb", "ext/containers/splaytree_map/extconf.rb"]
-  s.extra_rdoc_files = ["README.markdown", "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/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"]
-  s.files = ["History.txt", "Manifest", "README.markdown", "Rakefile", "algorithms.gemspec", "benchmarks/deque.rb", "benchmarks/sorts.rb", "benchmarks/treemaps.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/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/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/suffix_array_spec.rb", "spec/trie_spec.rb"]
-  s.has_rdoc = true
-  s.homepage = %q{http://rubyforge.org/projects/algorithms/}
+  s.date = "2012-04-19"
+  s.description = "A library of algorithms and data structures (containers)."
+  s.email = "kanwei@gmail.com"
+  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"]
+  s.extra_rdoc_files = ["CHANGELOG.markdown", "README.markdown", "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"]
+  s.files = ["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://rubygems.org/gems/algorithms"
   s.rdoc_options = ["--line-numbers", "--inline-source", "--title", "Algorithms", "--main", "README.markdown"]
   s.require_paths = ["lib", "ext"]
-  s.rubyforge_project = %q{algorithms}
-  s.rubygems_version = %q{1.3.1}
-  s.summary = %q{A library of algorithms and containers.}
+  s.rubyforge_project = "algorithms"
+  s.rubygems_version = "1.8.15"
+  s.summary = "A library of algorithms and data structures (containers)."
 
   if s.respond_to? :specification_version then
-    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
-    s.specification_version = 2
+    s.specification_version = 3
 
-    if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<rspec>, [">= 0"])
+      s.add_development_dependency(%q<echoe>, [">= 0"])
     else
+      s.add_dependency(%q<rspec>, [">= 0"])
+      s.add_dependency(%q<echoe>, [">= 0"])
     end
   else
+    s.add_dependency(%q<rspec>, [">= 0"])
+    s.add_dependency(%q<echoe>, [">= 0"])
   end
 end

data/ext/algorithms/string/extconf.rb

@@ -0,0 +1,4 @@
+require 'mkmf'
+extension_name = "CString"
+dir_config(extension_name)
+create_makefile(extension_name)

data/ext/algorithms/string/string.c

@@ -0,0 +1,68 @@
+#include "ruby.h"
+
+int min(int a, int b, int c) {
+	int min = a;
+	if (b < min)
+		min = b;
+	if( c < min)
+		min = c;
+	return min;
+}
+
+int levenshtein_distance(VALUE str1, VALUE str2) {
+	int i, j, s1_len, s2_len, *d;
+	char * s = RSTRING_PTR(str1);
+	char * t = RSTRING_PTR(str2);
+	s1_len = RSTRING_LEN(str1); 
+	s2_len = RSTRING_LEN(str2);
+	
+	if (s1_len == 0) {
+		return s2_len;
+	} else if (s2_len == 0) {
+		return s1_len;
+	}
+	
+	// We need one extra col and row for the matrix for starting values
+	s1_len++;
+	s2_len++;
+	
+	d = malloc(sizeof(int) * (s1_len) * (s2_len));
+	
+	for (i = 0; i < s1_len; i++) {
+		d[i] = i; // d[i, 0] = i
+	}
+	for (j = 0; j < s2_len; j++) {
+		d[j*s1_len] = j; // d[0, j] = j
+	}
+	
+	for (i = 1; i < s1_len; i++) {
+		for (j = 1; j < s2_len; j++) {
+			if (s[i-1] == t[j-1]) {
+				d[j * s1_len + i] = d[(j-1) * s1_len + (i-1)];
+			} else {
+				d[j * s1_len + i] = min(
+					d[j * s1_len + (i-1)],
+					d[(j-1) * s1_len + i],
+					d[(j-1) * s1_len + (i-1)]
+				) + 1;
+			}
+		}
+	}
+	i = d[s1_len * s2_len -1];
+	free(d);
+	return i;
+}
+
+static VALUE lev_dist(VALUE self, VALUE str1, VALUE str2) {
+	return INT2FIX(levenshtein_distance( str1, str2 ));
+}
+
+static VALUE mAlgorithms;
+static VALUE mString;
+
+void Init_CString() {	
+	mAlgorithms = rb_define_module("Algorithms");
+	mString = rb_define_module_under(mAlgorithms, "String");
+	rb_define_singleton_method(mString, "levenshtein_dist", lev_dist, 2);
+}
+

data/ext/containers/bst/bst.c

@@ -0,0 +1,247 @@
+#include "ruby.h"
+
+typedef struct struct_bst_node {
+	VALUE key;
+	VALUE value;
+	struct struct_bst_node *left;
+	struct struct_bst_node *right;
+	struct struct_bst_node *parent;
+} bst_node;
+
+typedef struct struct_bst {
+	bst_node *root;
+	int (*compare_function)(VALUE key1, VALUE key2);
+	unsigned int size; 
+} bst;
+
+static VALUE bst_initialize(VALUE self) {
+	return self;
+}
+
+static bst* get_bst_from_self(VALUE self) {
+	bst *tree;
+	Data_Get_Struct(self, bst, tree);
+	return tree;
+}
+
+static bst* bst_each_node(bst *tree, bst_node *node, void (*each)(bst *tree_, bst_node *node_, void* args), void* arguments) {
+	if (!node)
+		return NULL;
+	
+		if (node->left)
+			bst_each_node(tree, node->left, each, arguments);
+		
+		(*each)(tree, node, arguments);
+		
+		if (node->right)
+			bst_each_node(tree, node->right, each, arguments);
+	return tree;
+}
+
+static bst* bst_each(bst *tree, void (*each)(bst *tree, bst_node *node, void *args), void* arguments) {
+	if (tree->root)
+		bst_each_node(tree, tree->root, each, arguments);
+	return tree;
+}
+
+static int id_compare_operator;
+
+static int bst_compare_function(VALUE a, VALUE b) {
+	if (a == b) return 0;
+	if (FIXNUM_P(a) && FIXNUM_P(b)) {
+		long x = FIX2LONG(a), y = FIX2LONG(b);
+		if (x == y) return 0;
+		if (x > y) return 1;
+		return -1;
+	}
+	if (TYPE(a) == T_STRING && rb_obj_is_kind_of(a, rb_cString) &&
+            TYPE(b) == T_STRING && rb_obj_is_kind_of(b, rb_cString)) {
+		return rb_str_cmp(a, b);
+	}
+	return FIX2INT(rb_funcall((VALUE) a, id_compare_operator, 1, (VALUE) b));
+}
+
+static void insert_element(bst *tree, bst_node **t,bst_node *newElement) {
+	int cmp;
+	bst_node *y = NULL;
+	bst_node *x = *t;
+	while (x != NULL) {
+		y = x;
+		cmp = tree->compare_function(newElement->key, x->key);
+		if (cmp < 0) x = x->left;
+		else x = x->right;
+	}
+	newElement->parent = y;
+	if (y == NULL) *t = newElement;
+	else {
+		cmp = tree->compare_function(newElement->key, y->key);
+		if (cmp < 0)
+		 	y->left = newElement;
+		else 
+			y->right = newElement;
+	}
+}
+
+
+static bst_node* create_node(VALUE key_value,VALUE value) {
+	bst_node *new_node = ALLOC(bst_node);
+	new_node->value = value;
+	new_node->key = key_value;
+	new_node->left = NULL;
+	new_node->right = NULL;
+	new_node->parent = NULL;
+	return new_node;	 
+}
+
+static bst_node* tree_minimum (bst_node *tree) {
+	bst_node *x = tree;
+	while (x->left) x = x->left;
+	return x;
+}
+
+static bst_node* tree_maximum (bst_node *tree) {
+	bst_node *x = tree;
+	while (x->right) x = x->right;
+	return x;
+}
+
+static bst_node* node_successor (bst_node *tree,bst_node *x) {
+	if (x->right) return tree_minimum(x->right);
+	bst_node *y = x->parent;
+	while (y && x == y->right) {
+		x = y;
+		y = x->parent;
+	}
+	return y;
+}
+
+
+static bst_node* delete_node (bst_node **tree,bst_node *tobeDeleted) {
+	bst_node *y,*x;
+
+	if ((tobeDeleted->left == NULL) || (tobeDeleted->right == NULL)) y = tobeDeleted;
+	else y = node_successor(*tree,tobeDeleted);
+
+	if (y->left) x = y->left;
+	else x = y->right;
+
+	if (x) x->parent = y->parent;
+
+	if (y->parent == NULL) {
+		*tree = x;
+		return y;
+	} else if (y == y->parent->left) {
+		y->parent->left = x;
+	} else {
+		y->parent->right = x;
+	}
+
+	if (tobeDeleted != y) tobeDeleted->key = y->key;
+	return y;
+}
+
+static bst_node* search_node(bst *tree, bst_node *node, VALUE key) {
+	bst_node *x = node;
+	int cmp;
+	
+	while(x) {
+		cmp = tree->compare_function(key, x->key);
+		if (cmp == 0) return x;
+		else if (cmp < 0) { x = x->left; }
+		else { x = x->right; }
+	}
+	return NULL;
+}
+
+static void recursively_mark_nodes(bst_node *node) {
+	if(node) {
+		rb_gc_mark(node->key);
+		rb_gc_mark(node->value);
+		recursively_mark_nodes(node->left);
+		recursively_mark_nodes(node->right);
+	}
+}
+
+static void bst_mark(bst *tree) {
+	if (tree) {
+		recursively_mark_nodes(tree->root);
+	}
+}
+
+static void recursively_free_nodes(bst_node *node) {
+	if(node) {
+		recursively_free_nodes(node->left);
+		recursively_free_nodes(node->right);
+		free(node);
+	}
+}
+
+static void bst_free(bst *tree) {
+	if (tree) {
+		recursively_free_nodes(tree->root);
+	}
+}
+
+static bst* create_bst(int (*compare_function)(VALUE, VALUE)) {
+	bst *tree = ALLOC(bst);
+	tree->compare_function = compare_function;
+	tree->root = NULL;
+	tree->size = 0;
+	return tree;
+}
+
+static VALUE bst_alloc(VALUE klass) {
+	bst *tree = create_bst(&bst_compare_function);
+	return Data_Wrap_Struct(klass, bst_mark, bst_free, tree);
+}
+
+static VALUE rb_bst_push_value(VALUE self, VALUE key, VALUE value) {
+	bst *tree = get_bst_from_self(self);
+	insert_element(tree, &(tree->root), create_node(key,value));
+	tree->size++;
+	return self;
+}
+
+static void bst_each_helper(bst *tree, bst_node *node, void *args) {
+	rb_yield(rb_ary_new3(2, node->key, node->value));
+};
+
+static VALUE rb_bst_each(VALUE self) {
+	bst *tree = get_bst_from_self(self);
+	bst_each(tree, &bst_each_helper, NULL);
+	return self;
+}
+
+static VALUE rb_bst_delete(VALUE self, VALUE key) {
+	bst *tree = get_bst_from_self(self);
+	bst_node *tobeDeleted = search_node(tree, tree->root, key);
+	if(tobeDeleted) { 
+		tree->size -= 1;
+		bst_node *deletedNode = delete_node(&(tree->root),tobeDeleted);
+		return deletedNode->value;
+	}
+	return Qnil;
+}
+
+static VALUE rb_bst_size(VALUE self) { 
+	bst *tree;
+	Data_Get_Struct(self,bst,tree);
+	return INT2FIX(tree->size);
+}
+
+static VALUE CBst;
+static VALUE mContainers;
+
+void Init_CBst() {
+	id_compare_operator = rb_intern("<=>");
+
+	mContainers = rb_define_module("Containers");
+	CBst = rb_define_class_under(mContainers, "CBst", rb_cObject);
+	rb_define_alloc_func(CBst, bst_alloc);
+	rb_define_method(CBst, "initialize", bst_initialize, 0);
+	rb_define_method(CBst, "push", rb_bst_push_value, 2);
+	rb_define_alias(CBst, "[]=", "push");
+	rb_define_method(CBst, "each", rb_bst_each, 0);
+	rb_define_method(CBst, "delete", rb_bst_delete, 1);
+	rb_define_method(CBst, "size", rb_bst_size, 0);
+}

data/ext/containers/bst/extconf.rb

@@ -0,0 +1,4 @@
+require 'mkmf'
+extension_name = "CBst"
+dir_config(extension_name)
+create_makefile(extension_name)

data/lib/algorithms.rb

@@ -43,19 +43,16 @@
     - Shell sort            - Algorithms::Sort.shell_sort
     - Quicksort             - Algorithms::Sort.quicksort
     - Mergesort             - Algorithms::Sort.mergesort
+  * String algorithms
+    - Levenshtein distance  - Algorithms::String.levenshtein_dist
 =end
 
 module Algorithms; end
 module Containers; end
 
-begin
-  require 'CBst'
-  Containers::Bst = Containers::CBst
-rescue LoadError # C Version could not be found
-end
-
 require 'algorithms/search'
 require 'algorithms/sort'
+require 'algorithms/string'
 require 'containers/heap'
 require 'containers/stack'
 require 'containers/deque'

data/lib/algorithms/string.rb

@@ -0,0 +1,8 @@
+=begin rdoc
+    This module implements string algorithms. Documentation is provided for each algorithm.
+    
+=end
+
+begin
+  require 'CString'
+end

data/lib/containers/heap.rb

@@ -117,6 +117,22 @@ class Containers::Heap
     @next && @next.value
   end
   
+  # call-seq:
+  #     next_key -> key
+  #     next_key -> nil
+  #
+  # Returns the key associated with the next item in heap order, but does not remove the value.
+  #
+  # Complexity: O(1)
+  #
+  #     minheap = MinHeap.new
+  #     minheap.push(1, :a)
+  #     minheap.next_key #=> 1
+  #
+  def next_key
+    @next && @next.key
+  end
+  
   # call-seq:
   #     clear -> nil
   #

data/spec/bst_gc_mark_spec.rb

@@ -0,0 +1,25 @@
+# $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+# require 'algorithms'
+# 
+# if defined? Containers::CBst
+#   describe "CBst" do
+#     it "should mark ruby object references" do
+#       anon_key_class = Class.new do
+#         attr :value
+#         def initialize(x); @value = x; end
+#         def <=>(other); value <=> other.value; end
+#       end
+#       anon_val_class = Class.new
+#       @bst = Containers::CBst.new
+#       100.times { |x| @bst.push(anon_key_class.new(x), anon_val_class.new) }
+#       # Mark and sweep
+#       ObjectSpace.garbage_collect
+#       # Check if any instances were swept
+#       count = 0
+#       ObjectSpace.each_object(anon_key_class) { |x| count += 1 }
+#       count.should eql(100)
+#       ObjectSpace.each_object(anon_val_class) { |x| count += 1 }
+#       count.should eql(200)
+#     end
+#   end
+# end

data/spec/bst_spec.rb

@@ -0,0 +1,25 @@
+# $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+# require "algorithms"
+# 
+# begin
+#   Containers::CBst
+#   describe "binary search tree" do
+#     it "should let user push new elements with key" do
+#       @bst = Containers::CBst.new
+#       100.times { |x| @bst.push(x, "hello : #{x}") }
+#       @bst.size.should eql(100)
+#     end
+# 
+#     it "should allow users to delete elements" do
+#       @bst = Containers::CBst.new
+#       @bst.push(10, "hello world")
+#       @bst.push(11, "hello world")
+#       @bst.delete(11)
+#       @bst.size.should eql(1)
+#       @bst.delete(10)
+#       @bst.size.should eql(0)
+#     end
+#     
+#   end
+# rescue Exception
+# end

data/spec/deque_spec.rb

@@ -1,7 +1,7 @@
 $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
 require 'algorithms'
 
-describe "(empty deque)", :shared => true do
+shared_examples "(empty deque)" do
   it "should return nil when popping objects" do
     @deque.pop_front.should be_nil
     @deque.pop_back.should be_nil
@@ -31,7 +31,7 @@ describe "(empty deque)", :shared => true do
   end
 end
 
-describe "(non-empty deque)", :shared => true do
+shared_examples "(non-empty deque)" do
   before(:each) do
     @deque.push_back(10)
     @deque.push_back("10")

data/spec/heap_spec.rb

@@ -46,6 +46,11 @@ describe Containers::Heap do
       @heap.size.should eql(@num_items)
     end
     
+    it "should have a next value" do
+      @heap.next.should be_true
+      @heap.next_key.should be_true
+    end
+    
     it "should delete random keys" do
       @heap.delete(@random_array[0]).should eql(@random_array[0])
       @heap.delete(@random_array[1]).should eql(@random_array[1])

data/spec/rb_tree_map_spec.rb

@@ -1,7 +1,7 @@
 $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
 require 'algorithms'
 
-describe "empty rbtree", :shared => true do
+shared_examples "empty rbtree" do
   it "should let you push stuff in" do
     100.times { |x| @tree[x] = x }
     @tree.size.should eql(100)
@@ -31,7 +31,7 @@ describe "empty rbtree", :shared => true do
   end
 end
 
-describe "non-empty rbtree", :shared => true do
+shared_examples "non-empty rbtree" do
   before(:each) do
     @num_items = 1000
     @random_array = Array.new(@num_items) { rand(@num_items) }

data/spec/splay_tree_map_spec.rb

@@ -1,7 +1,7 @@
 $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
 require 'algorithms'
   
-describe "empty splaytree", :shared => true do
+shared_examples "empty splaytree" do
   it "should let you push stuff in" do
     100.times { |x| @tree[x] = x }
     @tree.size.should eql(100)
@@ -25,7 +25,7 @@ describe "empty splaytree", :shared => true do
   end
 end
 
-describe "non-empty splaytree", :shared => true do
+shared_examples "non-empty splaytree" do
   before(:each) do
     @num_items = 100
     @random_array = []

data/spec/string_spec.rb

@@ -0,0 +1,13 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+describe "string algorithms" do
+  it "should do levenshtein distance" do    
+    Algorithms::String.levenshtein_dist("Hello", "Hel").should eql(2)
+    Algorithms::String.levenshtein_dist("Hello", "").should eql(5)
+    Algorithms::String.levenshtein_dist("", "Hello").should eql(5)
+    Algorithms::String.levenshtein_dist("Hello", "Hello").should eql(0)
+    Algorithms::String.levenshtein_dist("Hello", "ello").should eql(1)
+    Algorithms::String.levenshtein_dist("Hello", "Mello").should eql(1)
+  end
+end

metadata

@@ -1,28 +1,54 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: algorithms
-version: !ruby/object:Gem::Version 
-  version: 0.3.0
+version: !ruby/object:Gem::Version
+  version: 0.4.0
+  prerelease: 
 platform: ruby
-authors: 
+authors:
 - Kanwei Li
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2009-11-16 00:00:00 -05:00
-default_executable: 
-dependencies: []
-
-description: A library of algorithms and containers.
+date: 2012-04-19 00:00:00.000000000Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: &70335276597400 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *70335276597400
+- !ruby/object:Gem::Dependency
+  name: echoe
+  requirement: &70335276596820 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *70335276596820
+description: A library of algorithms and data structures (containers).
 email: kanwei@gmail.com
 executables: []
-
-extensions: 
+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
-extra_rdoc_files: 
+extra_rdoc_files:
+- CHANGELOG.markdown
 - README.markdown
+- 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
@@ -32,6 +58,7 @@ extra_rdoc_files:
 - 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
@@ -42,8 +69,8 @@ extra_rdoc_files:
 - lib/containers/stack.rb
 - lib/containers/suffix_array.rb
 - lib/containers/trie.rb
-files: 
-- History.txt
+files:
+- CHANGELOG.markdown
 - Manifest
 - README.markdown
 - Rakefile
@@ -51,6 +78,10 @@ files:
 - 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
@@ -60,6 +91,7 @@ files:
 - 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
@@ -70,6 +102,8 @@ files:
 - 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
@@ -84,39 +118,38 @@ files:
 - 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
-has_rdoc: true
-homepage: http://rubyforge.org/projects/algorithms/
+homepage: https://rubygems.org/gems/algorithms
+licenses: []
 post_install_message: 
-rdoc_options: 
+rdoc_options:
 - --line-numbers
 - --inline-source
 - --title
 - Algorithms
 - --main
 - README.markdown
-require_paths: 
+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: 
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '1.2'
 requirements: []
-
 rubyforge_project: algorithms
-rubygems_version: 1.3.1
+rubygems_version: 1.8.15
 signing_key: 
-specification_version: 2
-summary: A library of algorithms and containers.
+specification_version: 3
+summary: A library of algorithms and data structures (containers).
 test_files: []
-