class DataStructures::Queue
Implements a simple FIFO (first in, first out) queue data structure using an array container.
Public Class Methods
new()
click to toggle source
# File lib/datastructures/queue.rb, line 6 def initialize self.clear end
Public Instance Methods
back()
click to toggle source
# File lib/datastructures/queue.rb, line 33 def back @array.last end
clear()
click to toggle source
# File lib/datastructures/queue.rb, line 37 def clear @array = Array.new end
dequeue()
click to toggle source
# File lib/datastructures/queue.rb, line 24 def dequeue raise "Queue underflow: nothing to dequeue." if self.size == 0 @array.shift end
empty?()
click to toggle source
# File lib/datastructures/queue.rb, line 16 def empty? @array.empty? end
enqueue(item)
click to toggle source
# File lib/datastructures/queue.rb, line 20 def enqueue item @array.push item end
front()
click to toggle source
# File lib/datastructures/queue.rb, line 29 def front @array.first end
size()
click to toggle source
# File lib/datastructures/queue.rb, line 10 def size @array.size end
Also aliased as: length