Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Newer
Older
100644 193 lines (118 sloc) 4.353 kb
dfd7768 @kanwei Release 0.6.0
authored
1 === January 22, 2013
2
3 * JRuby support
4
6520662 @kanwei Release 0.5.0
authored
5 === April 15, 2012
6
7 * Use long instead of int for string methods
8 * Use VALUE instead of int for comparison vars
9 * Now compiles without warnings (OS X 10.7)
10
f8661f3 @kanwei History.txt -> CHANGELOG
authored
11 === April 19, 2012
12
13 * Pulled in fix for ruby 1.9 compilation error (sorry!!)
14 * Fix specs that broke with new rspec
15 * Migration to rubygems.org
8401d48 @kanwei Release 0.4.0
authored
16 * 0.4.0 release
f8661f3 @kanwei History.txt -> CHANGELOG
authored
17
fb40819 @kanwei Add Levenshtein distance in C as part of String algorithms
authored
18 === Jan 3, 2009
19
20 * Levenshtein distance in C
21
856a421 @kanwei History
authored
22 === April 3, 2009
23
24 * Finished C refactorization of SplayTree
25
affc787 @kanwei Implemented SplayTree in C
authored
26 === March 28, 2009
27
28 * Implemented SplayTree in C
9e4725f @kanwei fixed C bug
authored
29 * Made recursively_free_nodes methods static to fix a SEGFAULT
001262e @kanwei move to markdown for readme
authored
30 * Improved CBst
31 * Moved to Markdown for README
ea6eb94 @kanwei Release 0.2.0
authored
32 * 0.2.0 release
affc787 @kanwei Implemented SplayTree in C
authored
33
0d1fc02 @kanwei Added kd-tree
authored
34 === January 19, 2009
35
36 * kd-tree for points in multi-dimensional space
37
52b5503 @kanwei Cleanup for CBst
authored
38 === November 25, 2008
39
40 * Checked in gnufied's C BST
41
67f69ad @kanwei removed #each for Heap and Priority Queue (Feature)
authored
42 === November 13, 2008
43
44 * Removed #each for Hash and Priority Queue (Feature)
45
d0a22c1 @kanwei Reflect changes
authored
46 === September 15, 2008
47
48 * Added comb sort
49 * Benchmark work on sorting algorithms
50
a250723 @kanwei RBTree#isred now private
authored
51 === September 1, 2008
52
53 * Switched to Hanna rdoc template
54 * RBTree#isred now private
55
c09a7b0 @kanwei Updated History and README
authored
56 === August 20, 2008
57
58 * Implemented Knuth-Morris-Pratt substring algorithm
59
60 === August 15, 2008
61
62 * Updated README to reflect progress
63
64 === August 10, 2008
65
66 * Implemented mergesort, insertion_sort, shell_sort, quicksort
67
68 === August 8, 2008
69
70 * Implemented bubble_sort, selection_sort, heapsort
71
72 === August 5, 2008
73
74 * Started Algorithms portion
75 * Implemented Search#binary_search
76
77 === July 20, 2008
78
79 * Iterate over trees iteratively instead of recursively
80 * Implemented Deque in C
81
82 === July 15, 2008
83
84 * Refactored namespaces, thank you Austin Ziegler!
85
86 === July 14, 2008
87
88 * Use alias_method instead of alias
89 * Found and fixed RBTree#delete bug (finally!)
90 * Refactored Trie, SuffixArray, SplayTreeMap
91
92 === July 13, 2008
93
94 * Refactored Deque
95 * Implemented Deque#reverse_each (like Array's)
96
97 === July 12, 2008
98
99 * Reformatted some specs to be more idiomatic (Thank you Federico Builes)
100
101 === July 10, 2008
102
103 * Added algorithm complexity information for all Containers
104 * Implemented Trie for string representation
105 * Implmented SuffixArray for fast substring search
106 * Fixed memory leak in CRBTree
107 * Updated Manifest and algorithms.rb to match progress
108
109 === July 9, 2008
110
111 * Implemented Deque
112 * Stack and Queue now use Deque
113 * Fixed issues with CRBTree's #empty? and delete methods
114
115 === July 8, 2008
116
117 * Can now iterate over a heap
118 * Renamed #contains_key -> has_key? since it's more idiomatic
119 * Implented #change_key and #delete for Heap
120 * Priority Queue is now implemented with the new Fibonacci Heap
121 * Removed old Priority Queue code as a result
122 * Heap: fixed #delete bug not checking if item exists, #has_key? bug
123 for not returning boolean
124 * Heap: value field is now optional and defaults to the key if not specified
125 * More refactoring of RBTreeMap (both Ruby and C)
126
127 === July 7, 2008
128
129 * Heap is now implemented with a Fibonacci Heap, not a binomial heap
130
131 === July 4, 2008
132
133 * Implemented SplayTreeMap
134 * Heap now uses kind_of? to check for other heaps when doing #merge
135 * Renamed some Heap methods for consistency with the rest of the library
136 * RBTreeMap#contains? -> contains_key?
137 * Refactored RBTreeMap to be more object-oriented
138 * More documentation for RBTreeMap
139
140 === July 3, 2008
141
142 * Added documentation for Stack and Queue
143
144 === June 24, 2008
145
146 * Imported Brian Amberg's priority queue implementation
147 * Now uses Echoe to build gem
148 * Gem builds for the first time
149
150 === June 18, 2008
151
152 * Can now enumerate over RBTreeMap
153
154 === June 17, 2008
155
156 * RBTreemap#delete now returns deleted value
157 * Added delete method to C implementation
158
159 === June 16, 2008
160
161 * Implemented delete methods for RBTreeMap
162
163 === June 14, 2008
164
165 * Renamed the data structures module to "Containers"
166 * Removed dependence on stdbool.h
167 * Renamed RBTree to RBTreeMap
168
790fddc @kanwei Red black trees in C!
authored
169 === June 13, 2008
170
171 * Implemented Sedgewick's Left Leaning Red Black Tree in C!
172
888e817 @kanwei Implemented Red-Black Tree
authored
173 === June 12, 2008
174
175 * Implemented Sedgewick's Left Leaning Red Black Tree
176
fd478ba @kanwei Added Queue
authored
177 === June 10, 2008
178
179 * Implemented merge! for other heaps and heap initialization from an array
180 * Implemented Queue
181
0c00b54 @kanwei Initial import
authored
182 === June 9, 2008
183
0e2cffc @kanwei First edition of binomial heap
authored
184 * Finished binomial heap implementation
0c00b54 @kanwei Initial import
authored
185
186 === June 8, 2008
187
188 * Added Stack
189 * Working on heap
c09a7b0 @kanwei Updated History and README
authored
190
191 === April 20
192
193 * Accepted to Google Summer of Code!
Something went wrong with that request. Please try again.