Gecko [ dallasfobana2023.variationbd.com ]

Name	Size	Permission
capture	[ DIR ]	drwxr-xr-x
api.rb	6.07 KB	-rw-r--r--
around_block_scan.rb	6.9 KB	-rw-r--r--
block_expand.rb	4.87 KB	-rw-r--r--
capture_code_context.rb	6.67 KB	-rw-r--r--
clean_document.rb	8.73 KB	-rw-r--r--
cli.rb	3.12 KB	-rw-r--r--
code_block.rb	2.13 KB	-rw-r--r--
code_frontier.rb	5.61 KB	-rw-r--r--
code_line.rb	6.62 KB	-rw-r--r--
code_search.rb	3.81 KB	-rw-r--r--
core_ext.rb	3.02 KB	-rw-r--r--
display_code_with_line_numbers...	1.77 KB	-rw-r--r--
display_invalid_blocks.rb	1.75 KB	-rw-r--r--
explain_syntax.rb	2.69 KB	-rw-r--r--
left_right_lex_count.rb	4.06 KB	-rw-r--r--
lex_all.rb	1.66 KB	-rw-r--r--
lex_value.rb	1.5 KB	-rw-r--r--
parse_blocks_from_indent_line....	1.5 KB	-rw-r--r--
pathname_from_message.rb	1.42 KB	-rw-r--r--
priority_engulf_queue.rb	1.26 KB	-rw-r--r--
priority_queue.rb	2 KB	-rw-r--r--
ripper_errors.rb	960 B	-rw-r--r--
scan_history.rb	2.92 KB	-rw-r--r--
unvisited_lines.rb	705 B	-rw-r--r--
version.rb	76 B	-rw-r--r--

Code Editor : priority_queue.rb

# frozen_string_literal: true

module SyntaxSuggest
  # Holds elements in a priority heap on insert
  #
  # Instead of constantly calling `sort!`, put
  # the element where it belongs the first time
  # around
  #
  # Example:
  #
  #   queue = PriorityQueue.new
  #   queue << 33
  #   queue << 44
  #   queue << 1
  #
  #   puts queue.peek # => 44
  #
  class PriorityQueue
    attr_reader :elements

def initialize
      @elements = []
    end

def <<(element)
      @elements << element
      bubble_up(last_index, element)
    end

def pop
      exchange(0, last_index)
      max = @elements.pop
      bubble_down(0)
      max
    end

def length
      @elements.length
    end

def empty?
      @elements.empty?
    end

def peek
      @elements.first
    end

def to_a
      @elements
    end

# Used for testing, extremely not performant
    def sorted
      out = []
      elements = @elements.dup
      while (element = pop)
        out << element
      end
      @elements = elements
      out.reverse
    end

private def last_index
      @elements.size - 1
    end

private 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

private 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

def exchange(source, target)
      a = @elements[source]
      b = @elements[target]
      @elements[source] = b
      @elements[target] = a
    end
  end
end

${this.title}

Code Editor : priority_queue.rb