Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
contrib	[ DIR ]	drwxr-xr-x	2024-03-03 22:53
ext	[ DIR ]	drwxr-xr-x	2024-03-03 22:53
lib	[ DIR ]	drwxr-xr-x	2024-03-03 22:53
loaders	[ DIR ]	drwxr-xr-x	2024-03-03 22:53
alt_system.rb	3.13 KB	-rw-r--r--	2013-10-11 21:35
application.rb	20.78 KB	-rw-r--r--	2013-10-11 21:35
backtrace.rb	715 B	-rw-r--r--	2013-10-11 21:35
clean.rb	1.37 KB	-rw-r--r--	2013-10-11 21:35
cloneable.rb	482 B	-rw-r--r--	2012-11-15 21:59
default_loader.rb	164 B	-rw-r--r--	2011-06-23 22:11
dsl_definition.rb	4.15 KB	-rw-r--r--	2013-10-11 21:35
early_time.rb	273 B	-rw-r--r--	2011-06-23 22:11
file_creation_task.rb	670 B	-rw-r--r--	2011-06-23 22:11
file_list.rb	11.82 KB	-rw-r--r--	2013-10-11 21:35
file_task.rb	1.28 KB	-rw-r--r--	2013-10-11 21:35
file_utils.rb	3.03 KB	-rw-r--r--	2013-10-11 21:35
file_utils_ext.rb	4.05 KB	-rw-r--r--	2013-10-11 21:35
gempackagetask.rb	116 B	-rw-r--r--	2013-10-11 21:35
invocation_chain.rb	1.23 KB	-rw-r--r--	2013-10-11 21:35
invocation_exception_mixin.rb	431 B	-rw-r--r--	2011-06-23 22:11
linked_list.rb	2.27 KB	-rw-r--r--	2013-10-11 21:35
multi_task.rb	315 B	-rw-r--r--	2012-11-15 21:59
name_space.rb	618 B	-rw-r--r--	2013-10-11 21:35
packagetask.rb	5.11 KB	-rw-r--r--	2013-10-11 21:35
pathmap.rb	26 B	-rw-r--r--	2011-06-23 22:11
phony.rb	351 B	-rw-r--r--	2012-11-15 22:32
private_reader.rb	364 B	-rw-r--r--	2012-11-15 22:01
promise.rb	2.28 KB	-rw-r--r--	2013-10-11 21:35
pseudo_status.rb	427 B	-rw-r--r--	2013-10-11 21:35
rake_module.rb	727 B	-rw-r--r--	2012-11-15 22:32
rake_test_loader.rb	341 B	-rw-r--r--	2011-06-28 02:45
rdoctask.rb	126 B	-rw-r--r--	2013-10-11 21:35
ruby182_test_unit_fix.rb	870 B	-rw-r--r--	2013-10-11 21:35
rule_recursion_overflow_error.rb	353 B	-rw-r--r--	2011-06-23 22:11
runtest.rb	471 B	-rw-r--r--	2013-10-11 21:35
scope.rb	868 B	-rw-r--r--	2013-10-11 21:35
task.rb	10.96 KB	-rw-r--r--	2013-10-11 21:35
task_argument_error.rb	119 B	-rw-r--r--	2011-06-23 22:11
task_arguments.rb	1.88 KB	-rw-r--r--	2013-10-11 21:35
task_manager.rb	8.4 KB	-rw-r--r--	2013-10-11 21:35
tasklib.rb	580 B	-rw-r--r--	2013-10-11 21:35
testtask.rb	5.22 KB	-rw-r--r--	2013-10-11 21:35
thread_history_display.rb	1.11 KB	-rw-r--r--	2013-10-11 21:35
thread_pool.rb	4.74 KB	-rw-r--r--	2013-10-11 21:35
trace_output.rb	529 B	-rw-r--r--	2013-10-11 21:35
version.rb	178 B	-rw-r--r--	2013-10-11 21:35
win32.rb	1.54 KB	-rw-r--r--	2013-10-11 21:35

Rename

module Rake

# Polylithic linked list structure used to implement several data
  # structures in Rake.
  class LinkedList
    include Enumerable

attr_reader :head, :tail

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

# Polymorphically add a new element to the head of a list. The
    # type of head node will be the same list type has the tail.
    def conj(item)
      self.class.cons(item, self)
    end

# Is the list empty?
    def empty?
      false
    end

# Lists are structurally equivalent.
    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

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

# Same as +to_s+, but with inspected items.
    def inspect
      items = map { |item| item.inspect }.join(", ")
      "LL(#{items})"
    end

# For each item in the list.
    def each
      current = self
      while ! current.empty?
        yield(current.head)
        current = current.tail
      end
      self
    end

# Make a list out of the given arguments. This method is
    # polymorphic
    def self.make(*args)
      result = empty
      args.reverse_each do |item|
        result = cons(item, result)
      end
      result
    end

# Cons a new head onto the tail list.
    def self.cons(head, tail)
      new(head, tail)
    end

# The standard empty list class for the given LinkedList class.
    def self.empty
      self::EMPTY
    end

# Represent an empty list, using the Null Object Pattern.
    #
    # When inheriting from the LinkedList class, you should implement
    # a type specific Empty class as well. Make sure you set the class
    # instance variable @parent to the assocated list class (this
    # allows conj, cons and make to work polymorphically).
    class EmptyLinkedList < LinkedList
      @parent = LinkedList

def initialize
      end

def empty?
        true
      end

def self.cons(head, tail)
        @parent.cons(head, tail)
      end
    end

EMPTY = EmptyLinkedList.new
  end

end