grosser-algorithms 0.4.0 → 0.4.1

Sign up to get free protection for your applications and to get access to all the features.
Files changed (47) hide show
  1. data/Manifest +45 -0
  2. data/VERSION +1 -0
  3. data/ext/containers/bst/bst.c +249 -0
  4. data/ext/containers/bst/extconf.rb +4 -0
  5. data/grosser-algorithms.gemspec +4 -4
  6. data/rdoc/classes/Algorithms.html +221 -0
  7. data/rdoc/classes/Algorithms/Algorithms.html +115 -0
  8. data/rdoc/classes/Algorithms/Algorithms/Sort.html +569 -0
  9. data/rdoc/classes/Algorithms/Containers.html +162 -0
  10. data/rdoc/classes/Algorithms/Containers/Heap.html +690 -0
  11. data/rdoc/classes/Algorithms/Containers/KDTree.html +195 -0
  12. data/rdoc/classes/Algorithms/Containers/MaxHeap.html +238 -0
  13. data/rdoc/classes/Algorithms/Containers/MinHeap.html +238 -0
  14. data/rdoc/classes/Algorithms/Containers/PriorityQueue.html +456 -0
  15. data/rdoc/classes/Algorithms/Containers/Queue.html +363 -0
  16. data/rdoc/classes/Algorithms/Containers/RubyDeque.html +617 -0
  17. data/rdoc/classes/Algorithms/Containers/RubyRBTreeMap.html +662 -0
  18. data/rdoc/classes/Algorithms/Containers/RubySplayTreeMap.html +623 -0
  19. data/rdoc/classes/Algorithms/Containers/Stack.html +363 -0
  20. data/rdoc/classes/Algorithms/Containers/SuffixArray.html +246 -0
  21. data/rdoc/classes/Algorithms/Containers/Trie.html +555 -0
  22. data/rdoc/classes/Algorithms/Search.html +273 -0
  23. data/rdoc/created.rid +1 -0
  24. data/rdoc/files/History_txt.html +281 -0
  25. data/rdoc/files/README_markdown.html +248 -0
  26. data/rdoc/files/lib/algorithms/search_rb.html +108 -0
  27. data/rdoc/files/lib/algorithms/sort_rb.html +108 -0
  28. data/rdoc/files/lib/algorithms/string_rb.html +115 -0
  29. data/rdoc/files/lib/algorithms_rb.html +252 -0
  30. data/rdoc/files/lib/containers/deque_rb.html +119 -0
  31. data/rdoc/files/lib/containers/heap_rb.html +124 -0
  32. data/rdoc/files/lib/containers/kd_tree_rb.html +135 -0
  33. data/rdoc/files/lib/containers/priority_queue_rb.html +108 -0
  34. data/rdoc/files/lib/containers/queue_rb.html +108 -0
  35. data/rdoc/files/lib/containers/rb_tree_map_rb.html +109 -0
  36. data/rdoc/files/lib/containers/splay_tree_map_rb.html +109 -0
  37. data/rdoc/files/lib/containers/stack_rb.html +108 -0
  38. data/rdoc/files/lib/containers/suffix_array_rb.html +113 -0
  39. data/rdoc/files/lib/containers/trie_rb.html +117 -0
  40. data/rdoc/fr_class_index.html +43 -0
  41. data/rdoc/fr_file_index.html +42 -0
  42. data/rdoc/fr_method_index.html +147 -0
  43. data/rdoc/index.html +24 -0
  44. data/rdoc/rdoc-style.css +208 -0
  45. data/spec/bst_gc_mark_spec.rb +25 -0
  46. data/spec/bst_spec.rb +25 -0
  47. metadata +50 -3
data/rdoc/fr_class_index.html ADDED
@@ -0,0 +1,43 @@
1
+
2
+ <?xml version="1.0" encoding="iso-8859-1"?>
3
+ <!DOCTYPE html
4
+ PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
5
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
6
+
7
+ <!--
8
+
9
+ Classes
10
+
11
+ -->
12
+ <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
13
+ <head>
14
+ <title>Classes</title>
15
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
16
+ <link rel="stylesheet" href="rdoc-style.css" type="text/css" />
17
+ <base target="docwin" />
18
+ </head>
19
+ <body>
20
+ <div id="index">
21
+ <h1 class="section-bar">Classes</h1>
22
+ <div id="index-entries">
23
+ <a href="classes/Algorithms.html">Algorithms</a><br />
24
+ <a href="classes/Algorithms/Algorithms.html">Algorithms::Algorithms</a><br />
25
+ <a href="classes/Algorithms/Algorithms/Sort.html">Algorithms::Algorithms::Sort</a><br />
26
+ <a href="classes/Algorithms/Containers.html">Algorithms::Containers</a><br />
27
+ <a href="classes/Algorithms/Containers/Heap.html">Algorithms::Containers::Heap</a><br />
28
+ <a href="classes/Algorithms/Containers/KDTree.html">Algorithms::Containers::KDTree</a><br />
29
+ <a href="classes/Algorithms/Containers/MaxHeap.html">Algorithms::Containers::MaxHeap</a><br />
30
+ <a href="classes/Algorithms/Containers/MinHeap.html">Algorithms::Containers::MinHeap</a><br />
31
+ <a href="classes/Algorithms/Containers/PriorityQueue.html">Algorithms::Containers::PriorityQueue</a><br />
32
+ <a href="classes/Algorithms/Containers/Queue.html">Algorithms::Containers::Queue</a><br />
33
+ <a href="classes/Algorithms/Containers/RubyDeque.html">Algorithms::Containers::RubyDeque</a><br />
34
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html">Algorithms::Containers::RubyRBTreeMap</a><br />
35
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html">Algorithms::Containers::RubySplayTreeMap</a><br />
36
+ <a href="classes/Algorithms/Containers/Stack.html">Algorithms::Containers::Stack</a><br />
37
+ <a href="classes/Algorithms/Containers/SuffixArray.html">Algorithms::Containers::SuffixArray</a><br />
38
+ <a href="classes/Algorithms/Containers/Trie.html">Algorithms::Containers::Trie</a><br />
39
+ <a href="classes/Algorithms/Search.html">Algorithms::Search</a><br />
40
+ </div>
41
+ </div>
42
+ </body>
43
+ </html>
data/rdoc/fr_file_index.html ADDED
@@ -0,0 +1,42 @@
1
+
2
+ <?xml version="1.0" encoding="iso-8859-1"?>
3
+ <!DOCTYPE html
4
+ PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
5
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
6
+
7
+ <!--
8
+
9
+ Files
10
+
11
+ -->
12
+ <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
13
+ <head>
14
+ <title>Files</title>
15
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
16
+ <link rel="stylesheet" href="rdoc-style.css" type="text/css" />
17
+ <base target="docwin" />
18
+ </head>
19
+ <body>
20
+ <div id="index">
21
+ <h1 class="section-bar">Files</h1>
22
+ <div id="index-entries">
23
+ <a href="files/History_txt.html">History.txt</a><br />
24
+ <a href="files/README_markdown.html">README.markdown</a><br />
25
+ <a href="files/lib/algorithms_rb.html">lib/algorithms.rb</a><br />
26
+ <a href="files/lib/algorithms/search_rb.html">lib/algorithms/search.rb</a><br />
27
+ <a href="files/lib/algorithms/sort_rb.html">lib/algorithms/sort.rb</a><br />
28
+ <a href="files/lib/algorithms/string_rb.html">lib/algorithms/string.rb</a><br />
29
+ <a href="files/lib/containers/deque_rb.html">lib/containers/deque.rb</a><br />
30
+ <a href="files/lib/containers/heap_rb.html">lib/containers/heap.rb</a><br />
31
+ <a href="files/lib/containers/kd_tree_rb.html">lib/containers/kd_tree.rb</a><br />
32
+ <a href="files/lib/containers/priority_queue_rb.html">lib/containers/priority_queue.rb</a><br />
33
+ <a href="files/lib/containers/queue_rb.html">lib/containers/queue.rb</a><br />
34
+ <a href="files/lib/containers/rb_tree_map_rb.html">lib/containers/rb_tree_map.rb</a><br />
35
+ <a href="files/lib/containers/splay_tree_map_rb.html">lib/containers/splay_tree_map.rb</a><br />
36
+ <a href="files/lib/containers/stack_rb.html">lib/containers/stack.rb</a><br />
37
+ <a href="files/lib/containers/suffix_array_rb.html">lib/containers/suffix_array.rb</a><br />
38
+ <a href="files/lib/containers/trie_rb.html">lib/containers/trie.rb</a><br />
39
+ </div>
40
+ </div>
41
+ </body>
42
+ </html>
data/rdoc/fr_method_index.html ADDED
@@ -0,0 +1,147 @@
1
+
2
+ <?xml version="1.0" encoding="iso-8859-1"?>
3
+ <!DOCTYPE html
4
+ PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
5
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
6
+
7
+ <!--
8
+
9
+ Methods
10
+
11
+ -->
12
+ <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
13
+ <head>
14
+ <title>Methods</title>
15
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
16
+ <link rel="stylesheet" href="rdoc-style.css" type="text/css" />
17
+ <base target="docwin" />
18
+ </head>
19
+ <body>
20
+ <div id="index">
21
+ <h1 class="section-bar">Methods</h1>
22
+ <div id="index-entries">
23
+ <a href="classes/Algorithms/Containers/Queue.html#M000099"><< (Algorithms::Containers::Queue)</a><br />
24
+ <a href="classes/Algorithms/Containers/Stack.html#M000107"><< (Algorithms::Containers::Stack)</a><br />
25
+ <a href="classes/Algorithms/Containers/Heap.html#M000055"><< (Algorithms::Containers::Heap)</a><br />
26
+ <a href="classes/Algorithms/Containers/Trie.html#M000033">[] (Algorithms::Containers::Trie)</a><br />
27
+ <a href="classes/Algorithms/Containers/SuffixArray.html#M000021">[] (Algorithms::Containers::SuffixArray)</a><br />
28
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000088">[] (Algorithms::Containers::RubySplayTreeMap)</a><br />
29
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000011">[] (Algorithms::Containers::RubyRBTreeMap)</a><br />
30
+ <a href="classes/Algorithms/Containers/Trie.html#M000029">[]= (Algorithms::Containers::Trie)</a><br />
31
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000082">[]= (Algorithms::Containers::RubySplayTreeMap)</a><br />
32
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000006">[]= (Algorithms::Containers::RubyRBTreeMap)</a><br />
33
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000071">back (Algorithms::Containers::RubyDeque)</a><br />
34
+ <a href="classes/Algorithms/Search.html#M000001">binary_search (Algorithms::Search)</a><br />
35
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000112">bubble_sort (Algorithms::Algorithms::Sort)</a><br />
36
+ <a href="classes/Algorithms/Containers/Heap.html#M000063">change_key (Algorithms::Containers::Heap)</a><br />
37
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000084">clear (Algorithms::Containers::RubySplayTreeMap)</a><br />
38
+ <a href="classes/Algorithms/Containers/Heap.html#M000058">clear (Algorithms::Containers::Heap)</a><br />
39
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000067">clear (Algorithms::Containers::RubyDeque)</a><br />
40
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000044">clear (Algorithms::Containers::PriorityQueue)</a><br />
41
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000113">comb_sort (Algorithms::Algorithms::Sort)</a><br />
42
+ <a href="classes/Algorithms/Containers/Heap.html#M000064">delete (Algorithms::Containers::Heap)</a><br />
43
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000050">delete (Algorithms::Containers::PriorityQueue)</a><br />
44
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000091">delete (Algorithms::Containers::RubySplayTreeMap)</a><br />
45
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000014">delete (Algorithms::Containers::RubyRBTreeMap)</a><br />
46
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000017">delete_max (Algorithms::Containers::RubyRBTreeMap)</a><br />
47
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000016">delete_min (Algorithms::Containers::RubyRBTreeMap)</a><br />
48
+ <a href="classes/Algorithms/Containers/Queue.html#M000103">each (Algorithms::Containers::Queue)</a><br />
49
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000018">each (Algorithms::Containers::RubyRBTreeMap)</a><br />
50
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000077">each (Algorithms::Containers::RubyDeque)</a><br />
51
+ <a href="classes/Algorithms/Containers/Stack.html#M000111">each (Algorithms::Containers::Stack)</a><br />
52
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000092">each (Algorithms::Containers::RubySplayTreeMap)</a><br />
53
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000078">each_backward (Algorithms::Containers::RubyDeque)</a><br />
54
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000076">each_forward (Algorithms::Containers::RubyDeque)</a><br />
55
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000066">empty? (Algorithms::Containers::RubyDeque)</a><br />
56
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000045">empty? (Algorithms::Containers::PriorityQueue)</a><br />
57
+ <a href="classes/Algorithms/Containers/Stack.html#M000110">empty? (Algorithms::Containers::Stack)</a><br />
58
+ <a href="classes/Algorithms/Containers/Queue.html#M000102">empty? (Algorithms::Containers::Queue)</a><br />
59
+ <a href="classes/Algorithms/Containers/Heap.html#M000059">empty? (Algorithms::Containers::Heap)</a><br />
60
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000015">empty? (Algorithms::Containers::RubyRBTreeMap)</a><br />
61
+ <a href="classes/Algorithms/Containers/KDTree.html#M000026">find_nearest (Algorithms::Containers::KDTree)</a><br />
62
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000070">front (Algorithms::Containers::RubyDeque)</a><br />
63
+ <a href="classes/Algorithms/Containers/Trie.html#M000032">get (Algorithms::Containers::Trie)</a><br />
64
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000010">get (Algorithms::Containers::RubyRBTreeMap)</a><br />
65
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000087">get (Algorithms::Containers::RubySplayTreeMap)</a><br />
66
+ <a href="classes/Algorithms/Containers/Trie.html#M000039">get_recursive (Algorithms::Containers::Trie)</a><br />
67
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000009">has_key? (Algorithms::Containers::RubyRBTreeMap)</a><br />
68
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000086">has_key? (Algorithms::Containers::RubySplayTreeMap)</a><br />
69
+ <a href="classes/Algorithms/Containers/Trie.html#M000030">has_key? (Algorithms::Containers::Trie)</a><br />
70
+ <a href="classes/Algorithms/Containers/Heap.html#M000056">has_key? (Algorithms::Containers::Heap)</a><br />
71
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000046">has_priority? (Algorithms::Containers::PriorityQueue)</a><br />
72
+ <a href="classes/Algorithms/Containers/SuffixArray.html#M000020">has_substring? (Algorithms::Containers::SuffixArray)</a><br />
73
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000115">heapsort (Algorithms::Algorithms::Sort)</a><br />
74
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000085">height (Algorithms::Containers::RubySplayTreeMap)</a><br />
75
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000008">height (Algorithms::Containers::RubyRBTreeMap)</a><br />
76
+ <a href="classes/Algorithms/Containers/Trie.html#M000031">include? (Algorithms::Containers::Trie)</a><br />
77
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000116">insertion_sort (Algorithms::Algorithms::Sort)</a><br />
78
+ <a href="classes/Algorithms/Search.html#M000002">kmp_search (Algorithms::Search)</a><br />
79
+ <a href="classes/Algorithms/Search.html#M000003">kmp_search (Algorithms::Search)</a><br />
80
+ <a href="classes/Algorithms/Containers/Heap.html#M000052">length (Algorithms::Containers::Heap)</a><br />
81
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000042">length (Algorithms::Containers::PriorityQueue)</a><br />
82
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000069">length (Algorithms::Containers::RubyDeque)</a><br />
83
+ <a href="classes/Algorithms/Containers/Trie.html#M000034">longest_prefix (Algorithms::Containers::Trie)</a><br />
84
+ <a href="classes/Algorithms/Containers/MaxHeap.html#M000094">max (Algorithms::Containers::MaxHeap)</a><br />
85
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000090">max (Algorithms::Containers::RubySplayTreeMap)</a><br />
86
+ <a href="classes/Algorithms/Containers/MaxHeap.html#M000095">max! (Algorithms::Containers::MaxHeap)</a><br />
87
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000013">max_key (Algorithms::Containers::RubyRBTreeMap)</a><br />
88
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000121">merge (Algorithms::Algorithms::Sort)</a><br />
89
+ <a href="classes/Algorithms/Containers/Heap.html#M000060">merge! (Algorithms::Containers::Heap)</a><br />
90
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000120">mergesort (Algorithms::Algorithms::Sort)</a><br />
91
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000089">min (Algorithms::Containers::RubySplayTreeMap)</a><br />
92
+ <a href="classes/Algorithms/Containers/MinHeap.html#M000023">min (Algorithms::Containers::MinHeap)</a><br />
93
+ <a href="classes/Algorithms/Containers/MinHeap.html#M000024">min! (Algorithms::Containers::MinHeap)</a><br />
94
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000012">min_key (Algorithms::Containers::RubyRBTreeMap)</a><br />
95
+ <a href="classes/Algorithms/Containers/MaxHeap.html#M000093">new (Algorithms::Containers::MaxHeap)</a><br />
96
+ <a href="classes/Algorithms/Containers/MinHeap.html#M000022">new (Algorithms::Containers::MinHeap)</a><br />
97
+ <a href="classes/Algorithms/Containers/Queue.html#M000096">new (Algorithms::Containers::Queue)</a><br />
98
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000040">new (Algorithms::Containers::PriorityQueue)</a><br />
99
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000004">new (Algorithms::Containers::RubyRBTreeMap)</a><br />
100
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000065">new (Algorithms::Containers::RubyDeque)</a><br />
101
+ <a href="classes/Algorithms/Containers/Heap.html#M000053">new (Algorithms::Containers::Heap)</a><br />
102
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000080">new (Algorithms::Containers::RubySplayTreeMap)</a><br />
103
+ <a href="classes/Algorithms/Containers/SuffixArray.html#M000019">new (Algorithms::Containers::SuffixArray)</a><br />
104
+ <a href="classes/Algorithms/Containers/KDTree.html#M000025">new (Algorithms::Containers::KDTree)</a><br />
105
+ <a href="classes/Algorithms/Containers/Trie.html#M000027">new (Algorithms::Containers::Trie)</a><br />
106
+ <a href="classes/Algorithms/Containers/Stack.html#M000104">new (Algorithms::Containers::Stack)</a><br />
107
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000047">next (Algorithms::Containers::PriorityQueue)</a><br />
108
+ <a href="classes/Algorithms/Containers/Stack.html#M000105">next (Algorithms::Containers::Stack)</a><br />
109
+ <a href="classes/Algorithms/Containers/Queue.html#M000097">next (Algorithms::Containers::Queue)</a><br />
110
+ <a href="classes/Algorithms/Containers/Heap.html#M000057">next (Algorithms::Containers::Heap)</a><br />
111
+ <a href="classes/Algorithms/Containers/Heap.html#M000062">next! (Algorithms::Containers::Heap)</a><br />
112
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000049">next! (Algorithms::Containers::PriorityQueue)</a><br />
113
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000118">partition (Algorithms::Algorithms::Sort)</a><br />
114
+ <a href="classes/Algorithms/Containers/Stack.html#M000108">pop (Algorithms::Containers::Stack)</a><br />
115
+ <a href="classes/Algorithms/Containers/Heap.html#M000061">pop (Algorithms::Containers::Heap)</a><br />
116
+ <a href="classes/Algorithms/Containers/Queue.html#M000100">pop (Algorithms::Containers::Queue)</a><br />
117
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000048">pop (Algorithms::Containers::PriorityQueue)</a><br />
118
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000075">pop_back (Algorithms::Containers::RubyDeque)</a><br />
119
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000074">pop_front (Algorithms::Containers::RubyDeque)</a><br />
120
+ <a href="classes/Algorithms/Containers/Trie.html#M000037">prefix_recursive (Algorithms::Containers::Trie)</a><br />
121
+ <a href="classes/Algorithms/Containers/Queue.html#M000098">push (Algorithms::Containers::Queue)</a><br />
122
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000005">push (Algorithms::Containers::RubyRBTreeMap)</a><br />
123
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000081">push (Algorithms::Containers::RubySplayTreeMap)</a><br />
124
+ <a href="classes/Algorithms/Containers/Stack.html#M000106">push (Algorithms::Containers::Stack)</a><br />
125
+ <a href="classes/Algorithms/Containers/Trie.html#M000028">push (Algorithms::Containers::Trie)</a><br />
126
+ <a href="classes/Algorithms/Containers/Heap.html#M000054">push (Algorithms::Containers::Heap)</a><br />
127
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000043">push (Algorithms::Containers::PriorityQueue)</a><br />
128
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000073">push_back (Algorithms::Containers::RubyDeque)</a><br />
129
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000072">push_front (Algorithms::Containers::RubyDeque)</a><br />
130
+ <a href="classes/Algorithms/Containers/Trie.html#M000038">push_recursive (Algorithms::Containers::Trie)</a><br />
131
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000119">quicksort (Algorithms::Algorithms::Sort)</a><br />
132
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000079">reverse_each (Algorithms::Containers::RubyDeque)</a><br />
133
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000114">selection_sort (Algorithms::Algorithms::Sort)</a><br />
134
+ <a href="classes/Algorithms/Algorithms/Sort.html#M000117">shell_sort (Algorithms::Algorithms::Sort)</a><br />
135
+ <a href="classes/Algorithms/Containers/RubyDeque.html#M000068">size (Algorithms::Containers::RubyDeque)</a><br />
136
+ <a href="classes/Algorithms/Containers/RubyRBTreeMap.html#M000007">size (Algorithms::Containers::RubyRBTreeMap)</a><br />
137
+ <a href="classes/Algorithms/Containers/Stack.html#M000109">size (Algorithms::Containers::Stack)</a><br />
138
+ <a href="classes/Algorithms/Containers/Heap.html#M000051">size (Algorithms::Containers::Heap)</a><br />
139
+ <a href="classes/Algorithms/Containers/PriorityQueue.html#M000041">size (Algorithms::Containers::PriorityQueue)</a><br />
140
+ <a href="classes/Algorithms/Containers/RubySplayTreeMap.html#M000083">size (Algorithms::Containers::RubySplayTreeMap)</a><br />
141
+ <a href="classes/Algorithms/Containers/Queue.html#M000101">size (Algorithms::Containers::Queue)</a><br />
142
+ <a href="classes/Algorithms/Containers/Trie.html#M000035">wildcard (Algorithms::Containers::Trie)</a><br />
143
+ <a href="classes/Algorithms/Containers/Trie.html#M000036">wildcard_recursive (Algorithms::Containers::Trie)</a><br />
144
+ </div>
145
+ </div>
146
+ </body>
147
+ </html>
data/rdoc/index.html ADDED
@@ -0,0 +1,24 @@
1
+ <?xml version="1.0" encoding="iso-8859-1"?>
2
+ <!DOCTYPE html
3
+ PUBLIC "-//W3C//DTD XHTML 1.0 Frameset//EN"
4
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-frameset.dtd">
5
+
6
+ <!--
7
+
8
+ Algorithms
9
+
10
+ -->
11
+ <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
12
+ <head>
13
+ <title>Algorithms</title>
14
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
15
+ </head>
16
+ <frameset rows="20%, 80%">
17
+ <frameset cols="25%,35%,45%">
18
+ <frame src="fr_file_index.html" title="Files" name="Files" />
19
+ <frame src="fr_class_index.html" name="Classes" />
20
+ <frame src="fr_method_index.html" name="Methods" />
21
+ </frameset>
22
+ <frame src="files/README_markdown.html" name="docwin" />
23
+ </frameset>
24
+ </html>
data/rdoc/rdoc-style.css ADDED
@@ -0,0 +1,208 @@
1
+
2
+ body {
3
+ font-family: Verdana,Arial,Helvetica,sans-serif;
4
+ font-size: 90%;
5
+ margin: 0;
6
+ margin-left: 40px;
7
+ padding: 0;
8
+ background: white;
9
+ }
10
+
11
+ h1,h2,h3,h4 { margin: 0; color: #efefef; background: transparent; }
12
+ h1 { font-size: 150%; }
13
+ h2,h3,h4 { margin-top: 1em; }
14
+
15
+ a { background: #eef; color: #039; text-decoration: none; }
16
+ a:hover { background: #039; color: #eef; }
17
+
18
+ /* Override the base stylesheet's Anchor inside a table cell */
19
+ td > a {
20
+ background: transparent;
21
+ color: #039;
22
+ text-decoration: none;
23
+ }
24
+
25
+ /* and inside a section title */
26
+ .section-title > a {
27
+ background: transparent;
28
+ color: #eee;
29
+ text-decoration: none;
30
+ }
31
+
32
+ /* === Structural elements =================================== */
33
+
34
+ div#index {
35
+ margin: 0;
36
+ margin-left: -40px;
37
+ padding: 0;
38
+ font-size: 90%;
39
+ }
40
+
41
+
42
+ div#index a {
43
+ margin-left: 0.7em;
44
+ }
45
+
46
+ div#index .section-bar {
47
+ margin-left: 0px;
48
+ padding-left: 0.7em;
49
+ background: #ccc;
50
+ font-size: small;
51
+ }
52
+
53
+
54
+ div#classHeader, div#fileHeader {
55
+ width: auto;
56
+ color: white;
57
+ padding: 0.5em 1.5em 0.5em 1.5em;
58
+ margin: 0;
59
+ margin-left: -40px;
60
+ border-bottom: 3px solid #006;
61
+ }
62
+
63
+ div#classHeader a, div#fileHeader a {
64
+ background: inherit;
65
+ color: white;
66
+ }
67
+
68
+ div#classHeader td, div#fileHeader td {
69
+ background: inherit;
70
+ color: white;
71
+ }
72
+
73
+
74
+ div#fileHeader {
75
+ background: #057;
76
+ }
77
+
78
+ div#classHeader {
79
+ background: #048;
80
+ }
81
+
82
+
83
+ .class-name-in-header {
84
+ font-size: 180%;
85
+ font-weight: bold;
86
+ }
87
+
88
+
89
+ div#bodyContent {
90
+ padding: 0 1.5em 0 1.5em;
91
+ }
92
+
93
+ div#description {
94
+ padding: 0.5em 1.5em;
95
+ background: #efefef;
96
+ border: 1px dotted #999;
97
+ }
98
+
99
+ div#description h1,h2,h3,h4,h5,h6 {
100
+ color: #125;;
101
+ background: transparent;
102
+ }
103
+
104
+ div#validator-badges {
105
+ text-align: center;
106
+ }
107
+ div#validator-badges img { border: 0; }
108
+
109
+ div#copyright {
110
+ color: #333;
111
+ background: #efefef;
112
+ font: 0.75em sans-serif;
113
+ margin-top: 5em;
114
+ margin-bottom: 0;
115
+ padding: 0.5em 2em;
116
+ }
117
+
118
+
119
+ /* === Classes =================================== */
120
+
121
+ table.header-table {
122
+ color: white;
123
+ font-size: small;
124
+ }
125
+
126
+ .type-note {
127
+ font-size: small;
128
+ color: #DEDEDE;
129
+ }
130
+
131
+ .xxsection-bar {
132
+ background: #eee;
133
+ color: #333;
134
+ padding: 3px;
135
+ }
136
+
137
+ .section-bar {
138
+ color: #333;
139
+ border-bottom: 1px solid #999;
140
+ margin-left: -20px;
141
+ }
142
+
143
+
144
+ .section-title {
145
+ background: #79a;
146
+ color: #eee;
147
+ padding: 3px;
148
+ margin-top: 2em;
149
+ margin-left: -30px;
150
+ border: 1px solid #999;
151
+ }
152
+
153
+ .top-aligned-row { vertical-align: top }
154
+ .bottom-aligned-row { vertical-align: bottom }
155
+
156
+ /* --- Context section classes ----------------------- */
157
+
158
+ .context-row { }
159
+ .context-item-name { font-family: monospace; font-weight: bold; color: black; }
160
+ .context-item-value { font-size: small; color: #448; }
161
+ .context-item-desc { color: #333; padding-left: 2em; }
162
+
163
+ /* --- Method classes -------------------------- */
164
+ .method-detail {
165
+ background: #efefef;
166
+ padding: 0;
167
+ margin-top: 0.5em;
168
+ margin-bottom: 1em;
169
+ border: 1px dotted #ccc;
170
+ }
171
+ .method-heading {
172
+ color: black;
173
+ background: #ccc;
174
+ border-bottom: 1px solid #666;
175
+ padding: 0.2em 0.5em 0 0.5em;
176
+ }
177
+ .method-signature { color: black; background: inherit; }
178
+ .method-name { font-weight: bold; }
179
+ .method-args { font-style: italic; }
180
+ .method-description { padding: 0 0.5em 0 0.5em; }
181
+
182
+ /* --- Source code sections -------------------- */
183
+
184
+ a.source-toggle { font-size: 90%; }
185
+ div.method-source-code {
186
+ background: #262626;
187
+ color: #ffdead;
188
+ margin: 1em;
189
+ padding: 0.5em;
190
+ border: 1px dashed #999;
191
+ overflow: hidden;
192
+ }
193
+
194
+ div.method-source-code pre { color: #ffdead; overflow: hidden; }
195
+
196
+ /* --- Ruby keyword styles --------------------- */
197
+
198
+ .standalone-code { background: #221111; color: #ffdead; overflow: hidden; }
199
+
200
+ .ruby-constant { color: #7fffd4; background: transparent; }
201
+ .ruby-keyword { color: #00ffff; background: transparent; }
202
+ .ruby-ivar { color: #eedd82; background: transparent; }
203
+ .ruby-operator { color: #00ffee; background: transparent; }
204
+ .ruby-identifier { color: #ffdead; background: transparent; }
205
+ .ruby-node { color: #ffa07a; background: transparent; }
206
+ .ruby-comment { color: #b22222; font-weight: bold; background: transparent; }
207
+ .ruby-regexp { color: #ffa07a; background: transparent; }
208
+ .ruby-value { color: #7fffd4; background: transparent; }