类 SyntaxSuggest::PriorityQueue
在插入时将元素保存在优先级堆中
与其不断调用 ‘sort!’,不如第一次就将元素放置在其所属的位置
示例
queue = PriorityQueue.new queue << 33 queue << 44 queue << 1 puts queue.peek # => 44
属性
公共类方法
公共实例方法
源代码
# File lib/syntax_suggest/priority_queue.rb, line 26 def <<(element) @elements << element bubble_up(last_index, element) end
源代码
# File lib/syntax_suggest/priority_queue.rb, line 98 def exchange(source, target) a = @elements[source] b = @elements[target] @elements[source] = b @elements[target] = a end
源代码
# File lib/syntax_suggest/priority_queue.rb, line 31 def pop exchange(0, last_index) max = @elements.pop bubble_down(0) max end
源代码
# File lib/syntax_suggest/priority_queue.rb, line 55 def sorted out = [] elements = @elements.dup while (element = pop) out << element end @elements = elements out.reverse end
用于测试,性能极差
私有实例方法
源代码
# File lib/syntax_suggest/priority_queue.rb, line 81 def bubble_down(index) child_index = (index * 2) + 1 return if child_index > last_index not_the_last_element = child_index < last_index left_element = @elements[child_index] right_element = @elements[child_index + 1] child_index += 1 if not_the_last_element && (right_element <=> left_element) == 1 return if (@elements[index] <=> @elements[child_index]) >= 0 exchange(index, child_index) bubble_down(child_index) end
源代码
# File lib/syntax_suggest/priority_queue.rb, line 69 def bubble_up(index, element) return if index <= 0 parent_index = (index - 1) / 2 parent = @elements[parent_index] return if (parent <=> element) >= 0 exchange(index, parent_index) bubble_up(parent_index, element) end
源代码
# File lib/syntax_suggest/priority_queue.rb, line 65 def last_index @elements.size - 1 end