stakach-algorithms 1.0.4 → 1.0.5

data/README.markdown

@@ -1,97 +1,97 @@
-# algorithms
-
-* Official homes are here on github, and at [rubyforge](http://rubyforge.org/projects/algorithms/)
-* Documentation: [http://algorithms.rubyforge.org/](http://algorithms.rubyforge.org/)
-
-## 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.
-
-## FEATURES:
-
-Done so far:
-
-		* Heaps              Algorithms::Containers::Heap, Containers::MaxHeap, Containers::MinHeap
-		* Priority Queue     Algorithms::Containers::PriorityQueue
-		* Deque              Algorithms::Containers::Deque, Containers::CDeque (C extension), Containers::RubyDeque
-		* Stack              Algorithms::Containers::Stack (uses Deque)
-		* Queue              Algorithms::Containers::Queue (uses Deque)
-		* Red-Black Trees    Algorithms::Containers::RBTreeMap, Containers::CRBTreeMap (C extension), Containers::RubyRBTreeMap
-		* Splay Trees        Algorithms::Containers::SplayTreeMap, Containers::CSplayTreeMap (C extension), Containers::RubySplayTreeMap
-		* Tries              Algorithms::Containers::Trie
-		* Suffix Array       Algorithms::Containers::SuffixArray
-		* kd Tree            Algorithms::Containers::KDTree
-
-		* Search algorithms
-		  - Binary Search            Algorithms::Algorithms::Search.binary_search
-		  - Knuth-Morris-Pratt       Algorithms::Algorithms::Search.kmp_search
-		* Sort algorithms           
-		  - Bubble sort              Algorithms::Algorithms::Sort.bubble_sort
-		  - Comb sort                Algorithms::Algorithms::Sort.comb_sort
-		  - Selection sort           Algorithms::Algorithms::Sort.selection_sort
-		  - Heapsort                 Algorithms::Algorithms::Sort.heapsort
-		  - Insertion sort           Algorithms::Algorithms::Sort.insertion_sort
-		  - Shell sort               Algorithms::Algorithms::Sort.shell_sort
-		  - Quicksort                Algorithms::Algorithms::Sort.quicksort
-		  - Mergesort                Algorithms::Algorithms::Sort.mergesort
-
-## SYNOPSIS:
-
-		require 'rubygems'
-		require 'algorithms'
-		max_heap = Algorithms::Containers::MaxHeap.new
-		
-		# To not have to type "Algorithms::" before each class, use:
-		include 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 compatible Ruby, or Ruby 1.9
-* C compiler for C extensions (optional, but very much recommended for vast performance benefits)
-
-## INSTALL:
-
-* sudo gem install algorithms
-
-## LICENSE:
-
-(The MIT License)
-
-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.
+# algorithms
+
+* Official homes are here on github, and at [rubyforge](http://rubyforge.org/projects/algorithms/)
+* Documentation: [http://algorithms.rubyforge.org/](http://algorithms.rubyforge.org/)
+
+## 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.
+
+## FEATURES:
+
+Done so far:
+
+		* Heaps              Algorithms::Containers::Heap, Containers::MaxHeap, Containers::MinHeap
+		* Priority Queue     Algorithms::Containers::PriorityQueue
+		* Deque              Algorithms::Containers::Deque, Containers::CDeque (C extension), Containers::RubyDeque
+		* Stack              Algorithms::Containers::Stack (uses Deque)
+		* Queue              Algorithms::Containers::Queue (uses Deque)
+		* Red-Black Trees    Algorithms::Containers::RBTreeMap, Containers::CRBTreeMap (C extension), Containers::RubyRBTreeMap
+		* Splay Trees        Algorithms::Containers::SplayTreeMap, Containers::CSplayTreeMap (C extension), Containers::RubySplayTreeMap
+		* Tries              Algorithms::Containers::Trie
+		* Suffix Array       Algorithms::Containers::SuffixArray
+		* kd Tree            Algorithms::Containers::KDTree
+
+		* Search algorithms
+		  - Binary Search            Algorithms::Algorithms::Search.binary_search
+		  - Knuth-Morris-Pratt       Algorithms::Algorithms::Search.kmp_search
+		* Sort algorithms           
+		  - Bubble sort              Algorithms::Algorithms::Sort.bubble_sort
+		  - Comb sort                Algorithms::Algorithms::Sort.comb_sort
+		  - Selection sort           Algorithms::Algorithms::Sort.selection_sort
+		  - Heapsort                 Algorithms::Algorithms::Sort.heapsort
+		  - Insertion sort           Algorithms::Algorithms::Sort.insertion_sort
+		  - Shell sort               Algorithms::Algorithms::Sort.shell_sort
+		  - Quicksort                Algorithms::Algorithms::Sort.quicksort
+		  - Mergesort                Algorithms::Algorithms::Sort.mergesort
+
+## SYNOPSIS:
+
+		require 'rubygems'
+		require 'algorithms'
+		max_heap = Algorithms::Containers::MaxHeap.new
+		
+		# To not have to type "Algorithms::" before each class, use:
+		include 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 compatible Ruby, or Ruby 1.9, should also work with jRuby
+* C compiler for C extensions (optional, but very much recommended for vast performance benefits)
+
+## INSTALL:
+
+* sudo gem install stakach-algorithms
+
+## LICENSE:
+
+(The MIT License)
+
+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

@@ -1,27 +1,27 @@
-require 'echoe'
-require "rake/clean"
-OBJ = FileList['**/*.rbc']
-CLEAN.include(OBJ)
- 
-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.2.0"
-  p.runtime_dependencies = []
-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
-
+require 'echoe'
+require "rake/clean"
+OBJ = FileList['**/*.rbc']
+CLEAN.include(OBJ)
+ 
+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.2.0"
+  p.runtime_dependencies = []
+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/ext/algorithms/string/extconf.rb

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

data/ext/algorithms/string/string.c

@@ -1,70 +1,70 @@
-#include "ruby.h"
-
-int get_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] = get_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 namespace;
-static VALUE mAlgorithms;
-static VALUE mString;
-
-void Init_CString() {	
-	namespace = rb_define_module("Algorithms");
-	mAlgorithms = rb_define_module_under(namespace,"Algorithms");
-	mString = rb_define_module_under(mAlgorithms, "String");
-	rb_define_singleton_method(mString, "levenshtein_dist", lev_dist, 2);
-}
-
+#include "ruby.h"
+
+int get_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] = get_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 namespace;
+static VALUE mAlgorithms;
+static VALUE mString;
+
+void Init_CString() {	
+	namespace = rb_define_module("Algorithms");
+	mAlgorithms = rb_define_module_under(namespace,"Algorithms");
+	mString = rb_define_module_under(mAlgorithms, "String");
+	rb_define_singleton_method(mString, "levenshtein_dist", lev_dist, 2);
+}
+