Class: Btree::Node
- Inherits:
-
Object
- Object
- Btree::Node
- Defined in:
- lib/btree/node.rb
Instance Attribute Summary collapse
-
#leaf ⇒ Object
Returns the value of attribute leaf.
Instance Method Summary collapse
- #add_child(node) ⇒ Object
- #children ⇒ Object
- #dump(level = 0) ⇒ Object
- #full? ⇒ Boolean
-
#initialize(degree) ⇒ Node
constructor
A new instance of Node.
- #insert(key, value) ⇒ Object
- #keys ⇒ Object
- #leaf? ⇒ Boolean
- #size ⇒ Object
- #split(child_idx) ⇒ Object
- #value_of(key) ⇒ Object
- #values ⇒ Object
Constructor Details
#initialize(degree) ⇒ Node
Returns a new instance of Node.
3 4 5 6 7 8 |
# File 'lib/btree/node.rb', line 3 def initialize(degree) @degree = degree @keys = [] @children = [] @leaf = true end |
Instance Attribute Details
#leaf ⇒ Object
Returns the value of attribute leaf.
2 3 4 |
# File 'lib/btree/node.rb', line 2 def leaf @leaf end |
Instance Method Details
#add_child(node) ⇒ Object
23 24 25 |
# File 'lib/btree/node.rb', line 23 def add_child(node) @children << node end |
#children ⇒ Object
27 28 29 |
# File 'lib/btree/node.rb', line 27 def children @children.dup.freeze end |
#dump(level = 0) ⇒ Object
10 11 12 13 14 15 16 17 18 19 20 21 |
# File 'lib/btree/node.rb', line 10 def dump(level = 0) @keys.each_with_index do |key, idx| if @children[idx] @children[idx].dump(level + 1) end puts "#{level}: #{key.first}: full? #{full?} leaf? #{leaf?}" end (@children[@keys.size..-1] || []).each do |c| c.dump(level+1) end nil end |
#full? ⇒ Boolean
39 40 41 |
# File 'lib/btree/node.rb', line 39 def full? size >= 2 * @degree - 1 end |
#insert(key, value) ⇒ Object
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 |
# File 'lib/btree/node.rb', line 66 def insert(key, value) i = size - 1 #puts "INSERTING #{key} INTO NODE: #{self.inspect}" if leaf? raise "Duplicate key" if @keys.any?{|(k,v)| k == key } #OPTIMIZE: This is inefficient while i >= 0 && @keys[i] && key < @keys[i].first @keys[i+1] = @keys[i] i -= 1 end @keys[i+1] = [key, value] else while i >= 0 && @keys[i] && key < @keys[i].first i -= 1 end #puts " -- INSERT KEY INDEX #{i}" if @children[i+1] && @children[i+1].full? split(i+1) if key > @keys[i+1].first i += 1 end end @children[i+1].insert(key, value) end end |
#keys ⇒ Object
31 32 33 |
# File 'lib/btree/node.rb', line 31 def keys @keys.map(&:first).freeze end |
#leaf? ⇒ Boolean
43 44 45 |
# File 'lib/btree/node.rb', line 43 def leaf? @leaf end |
#size ⇒ Object
47 48 49 |
# File 'lib/btree/node.rb', line 47 def size @keys.size end |
#split(child_idx) ⇒ Object
91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 |
# File 'lib/btree/node.rb', line 91 def split(child_idx) raise "Invalid child index #{child_idx} in split, num_children = #{@children.size}" if child_idx < 0 || child_idx >= @children.size #puts "SPLIT1: #{self.inspect}" splitee = @children[child_idx] y = Btree::Node.new(@degree) z = Btree::Node.new(@degree) z.leaf = splitee.leaf (@degree-1).times do |j| z._keys[j] = splitee._keys[j+@degree] y._keys[j] = splitee._keys[j] end if !splitee.leaf? @degree.times do |j| z._children[j] = splitee._children[j+@degree] y._children[j] = splitee._children[j] end end mid_val = splitee._keys[@degree-1] #puts "SPLIT2: #{self.inspect}" (@keys.size).downto(child_idx) do |j| @children[j+1] = @children[j] end @children[child_idx+1] = z @children[child_idx] = y #puts "SPLIT3: #{self.inspect}" (@keys.size - 1).downto(child_idx) do |j| @keys[j+1] = @keys[j] end #puts "SPLIT4: #{self.inspect}" @keys[child_idx] = mid_val #puts "SPLIT5: #{self.inspect}" end |
#value_of(key) ⇒ Object
51 52 53 54 55 56 57 58 59 60 61 62 63 64 |
# File 'lib/btree/node.rb', line 51 def value_of(key) i = 1 while i <= size && key > @keys[i-1].first i += 1 end if i <= size && key == @keys[i-1].first return @keys[i-1].last elsif leaf? return nil else return @children[i-1].value_of(key) end end |
#values ⇒ Object
35 36 37 |
# File 'lib/btree/node.rb', line 35 def values @keys.map(&:last).freeze end |