class Rake::LinkedList

Polylithic linked list structure used to implement several data structures in Rake.

Constants

EMPTY

Attributes

head [R]

tail [R]

Public Class Methods

cons (head, tail)

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 73
def self.cons(head, tail)
  new(head, tail)
end

Cons a new head onto the tail list.

empty ()

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 78
def self.empty
  self::EMPTY
end

The standard empty list class for the given LinkedList class.

make (*args)

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 59
def self.make(*args)
  # return an EmptyLinkedList if there are no arguments
  return empty if !args || args.empty?

  # build a LinkedList by starting at the tail and iterating
  # through each argument
  # inject takes an EmptyLinkedList to start
  args.reverse.inject(empty) do |list, item|
    list = cons(item, list)
    list # return the newly created list for each item in the block
  end
end

Make a list out of the given arguments. This method is polymorphic

new (head, tail=EMPTY)

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 84
def initialize(head, tail=EMPTY)
  @head = head
  @tail = tail
end

Public Instance Methods

== (other)

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 25
def ==(other)
  current = self
  while !current.empty? && !other.empty?
    return false if current.head != other.head
    current = current.tail
    other = other.tail
  end
  current.empty? && other.empty?
end

Lists are structurally equivalent.

conj (item)

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 12
def conj(item)
  self.class.cons(item, self)
end

Polymorphically add a new element to the head of a list. The type of head node will be the same list type as the tail.

each () { |head| ... }

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 48
def each
  current = self
  while !current.empty?
    yield(current.head)
    current = current.tail
  end
  self
end

For each item in the list.

empty? ()

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 20
def empty?
  false
end

Is the list empty? .make guards against a list being empty making any instantiated LinkedList object not empty by default You should consider overriding this method if you implement your own .make method

inspect ()

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 42
def inspect
  items = map(&:inspect).join(", ")
  "LL(#{items})"
end

Same as to_s, but with inspected items.

to_s ()

Source

# File vendor/bundle/ruby/3.4.0/gems/rake-13.2.1/lib/rake/linked_list.rb, line 36
def to_s
  items = map(&:to_s).join(", ")
  "LL(#{items})"
end

Convert to string: LL(item, item…)