123456789_123456789_123456789_123456789_123456789_

Class: Rake::LinkedList

Relationships & Source Files
Namespace Children
Classes:
EmptyLinkedList
Extension / Inclusion / Inheritance Descendants
Subclasses:
InvocationChain, Rake::Scope, InvocationChain::EmptyInvocationChain, EmptyLinkedList
Super Chains via Extension / Inclusion / Inheritance
Instance Chain:
self, Enumerable
Inherits: Object
Defined in: lib/rake/linked_list.rb

Overview

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

Constant Summary

Class Method Summary

Instance Attribute Summary

Instance Method Summary

  • #==(other)

    Lists are structurally equivalent.

  • #conj(item)

    Polymorphically add a new element to the head of a list.

  • #each

    For each item in the list.

  • #inspect

    Same as #to_s, but with inspected items.

  • #to_s

    Convert to string: LL(item, item…).

Constructor Details

.new(head, tail = EMPTY) ⇒ LinkedList

[ GitHub ] 

  


# File 'lib/rake/linked_list.rb', line 10



def initialize(head, tail=EMPTY)
  @head = head
  @tail = tail
end


  







Class Method Details



  

    .cons(head, tail)  
  



  

    

Cons a new head onto the tail list.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 70



def self.cons(head, tail)
  new(head, tail)
end


  








  

    .empty  
  



  

    

The standard empty list class for the given LinkedList class.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 75



def self.empty
  self::EMPTY
end


  








  

    .make(*args)  
  



  

    

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


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 61



def self.make(*args)
  result = empty
  args.reverse_each do |item|
    result = cons(item, result)
  end
  result
end


  







Instance Attribute Details



  

    #empty?  ⇒ Boolean  (readonly)
  



  

    

Is the list empty?


  





  


  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 22



def empty?
  false
end


  








  

    #head   (readonly)
  

  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 8



attr_reader :head, :tail


  








  

    #tail   (readonly)
  

  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 8



attr_reader :head, :tail


  







Instance Method Details



  

    #==(other)  
  



  

    

Lists are structurally equivalent.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 27



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


  








  

    #conj(item)  
  



  

    

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.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 17



def conj(item)
  self.class.cons(item, self)
end


  








  

    #each  
  



  

    

For each item in the list.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 50



def each
  current = self
  while ! current.empty?
    yield(current.head)
    current = current.tail
  end
  self
end


  








  

    #inspect  
  



  

    

Same as #to_s, but with inspected items.


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 44



def inspect
  items = map { |item| item.inspect }.join(", ")
  "LL(#{items})"
end


  








  

    #to_s  
  



  

    

Convert to string: LL(item, item…)


  



  [ GitHub ]


  

  


# File 'lib/rake/linked_list.rb', line 38



def to_s
  items = map { |item| item.to_s }.join(", ")
  "LL(#{items})"
end