Class: Prawn::NameTree::Node
- Inherits:
-
Object
- Object
- Prawn::NameTree::Node
- Defined in:
- lib/prawn/name_tree.rb
Overview
:nodoc:
Instance Attribute Summary collapse
-
#children ⇒ Object
readonly
Returns the value of attribute children.
-
#document ⇒ Object
readonly
Returns the value of attribute document.
-
#limit ⇒ Object
readonly
Returns the value of attribute limit.
-
#parent ⇒ Object
Returns the value of attribute parent.
-
#ref ⇒ Object
Returns the value of attribute ref.
Instance Method Summary collapse
- #<<(value) ⇒ Object
- #>=(value) ⇒ Object
- #add(name, value) ⇒ Object
- #empty? ⇒ Boolean
- #greatest ⇒ Object
-
#initialize(document, limit, parent = nil) ⇒ Node
constructor
A new instance of Node.
- #leaf? ⇒ Boolean
- #least ⇒ Object
- #size ⇒ Object
- #split! ⇒ Object
- #to_hash ⇒ Object
Constructor Details
#initialize(document, limit, parent = nil) ⇒ Node
Returns a new instance of Node.
21 22 23 24 25 26 27 |
# File 'lib/prawn/name_tree.rb', line 21 def initialize(document, limit, parent=nil) @document = document @children = [] @limit = limit @parent = parent @ref = nil end |
Instance Attribute Details
#children ⇒ Object (readonly)
Returns the value of attribute children.
15 16 17 |
# File 'lib/prawn/name_tree.rb', line 15 def children @children end |
#document ⇒ Object (readonly)
Returns the value of attribute document.
17 18 19 |
# File 'lib/prawn/name_tree.rb', line 17 def document @document end |
#limit ⇒ Object (readonly)
Returns the value of attribute limit.
16 17 18 |
# File 'lib/prawn/name_tree.rb', line 16 def limit @limit end |
#parent ⇒ Object
Returns the value of attribute parent.
18 19 20 |
# File 'lib/prawn/name_tree.rb', line 18 def parent @parent end |
#ref ⇒ Object
Returns the value of attribute ref.
19 20 21 |
# File 'lib/prawn/name_tree.rb', line 19 def ref @ref end |
Instance Method Details
#<<(value) ⇒ Object
74 75 76 77 78 79 80 81 82 83 84 85 86 87 |
# File 'lib/prawn/name_tree.rb', line 74 def <<(value) if children.empty? children << value elsif leaf? children.insert(insertion_point(value), value) split! if children.length > limit else fit = children.detect { |child| child >= value } fit = children.last unless fit fit << value end value end |
#>=(value) ⇒ Object
89 90 91 |
# File 'lib/prawn/name_tree.rb', line 89 def >=(value) children.empty? || children.last >= value end |
#add(name, value) ⇒ Object
41 42 43 |
# File 'lib/prawn/name_tree.rb', line 41 def add(name, value) self << Value.new(name, value) end |
#empty? ⇒ Boolean
29 30 31 |
# File 'lib/prawn/name_tree.rb', line 29 def empty? children.empty? end |
#greatest ⇒ Object
66 67 68 69 70 71 72 |
# File 'lib/prawn/name_tree.rb', line 66 def greatest if leaf? children.last.name else children.last.greatest end end |
#leaf? ⇒ Boolean
37 38 39 |
# File 'lib/prawn/name_tree.rb', line 37 def leaf? children.empty? || children.first.is_a?(Value) end |
#least ⇒ Object
58 59 60 61 62 63 64 |
# File 'lib/prawn/name_tree.rb', line 58 def least if leaf? children.first.name else children.first.least end end |
#size ⇒ Object
33 34 35 |
# File 'lib/prawn/name_tree.rb', line 33 def size leaf? ? children.size : children.inject(0) { |sum, child| sum + child.size } end |
#split! ⇒ Object
93 94 95 96 97 98 99 100 101 |
# File 'lib/prawn/name_tree.rb', line 93 def split! if parent parent.split(self) else left, right = new_node(self), new_node(self) split_children(self, left, right) children.replace([left, right]) end end |
#to_hash ⇒ Object
45 46 47 48 49 50 51 52 53 54 55 56 |
# File 'lib/prawn/name_tree.rb', line 45 def to_hash hash = {} hash[:Limits] = [least, greatest] if parent if leaf? hash[:Names] = children if leaf? else hash[:Kids] = children.map { |child| child.ref } end return hash end |