Gecko [ nxtxgen.com ]

Name	Size	Permission
contrib	[ DIR ]	drwxr-xr-x
ext	[ DIR ]	drwxr-xr-x
lib	[ DIR ]	drwxr-xr-x
loaders	[ DIR ]	drwxr-xr-x
alt_system.rb	3.17 KB	-rw-r--r--
application.rb	23.14 KB	-rw-r--r--
backtrace.rb	868 B	-rw-r--r--
clean.rb	1.93 KB	-rw-r--r--
cloneable.rb	418 B	-rw-r--r--
cpu_counter.rb	2.83 KB	-rw-r--r--
default_loader.rb	235 B	-rw-r--r--
dsl_definition.rb	5.64 KB	-rw-r--r--
early_time.rb	340 B	-rw-r--r--
file_creation_task.rb	670 B	-rw-r--r--
file_list.rb	12.13 KB	-rw-r--r--
file_task.rb	1.26 KB	-rw-r--r--
file_utils.rb	3.66 KB	-rw-r--r--
file_utils_ext.rb	4.05 KB	-rw-r--r--
gempackagetask.rb	144 B	-rw-r--r--
invocation_chain.rb	1.16 KB	-rw-r--r--
invocation_exception_mixin.rb	431 B	-rw-r--r--
late_time.rb	265 B	-rw-r--r--
linked_list.rb	2.27 KB	-rw-r--r--
multi_task.rb	315 B	-rw-r--r--
name_space.rb	673 B	-rw-r--r--
packagetask.rb	5.28 KB	-rw-r--r--
pathmap.rb	53 B	-rw-r--r--
phony.rb	351 B	-rw-r--r--
private_reader.rb	364 B	-rw-r--r--
promise.rb	2.28 KB	-rw-r--r--
pseudo_status.rb	375 B	-rw-r--r--
rake_module.rb	770 B	-rw-r--r--
rake_test_loader.rb	341 B	-rw-r--r--
rdoctask.rb	153 B	-rw-r--r--
ruby182_test_unit_fix.rb	897 B	-rw-r--r--
rule_recursion_overflow_error....	353 B	-rw-r--r--
runtest.rb	594 B	-rw-r--r--
scope.rb	882 B	-rw-r--r--
task.rb	11.02 KB	-rw-r--r--
task_argument_error.rb	119 B	-rw-r--r--
task_arguments.rb	2.15 KB	-rw-r--r--
task_manager.rb	8.84 KB	-rw-r--r--
tasklib.rb	618 B	-rw-r--r--
testtask.rb	5.55 KB	-rw-r--r--
thread_history_display.rb	1.11 KB	-rw-r--r--
thread_pool.rb	4.78 KB	-rw-r--r--
trace_output.rb	543 B	-rw-r--r--
version.rb	156 B	-rw-r--r--
win32.rb	1.55 KB	-rw-r--r--

Name

Size

Permission

Action

contrib

[ DIR ]

drwxr-xr-x

ext

[ DIR ]

drwxr-xr-x

lib

[ DIR ]

drwxr-xr-x

loaders

[ DIR ]

drwxr-xr-x

alt_system.rb

3.17 KB

-rw-r--r--

application.rb

23.14 KB

-rw-r--r--

backtrace.rb

868 B

-rw-r--r--

clean.rb

1.93 KB

-rw-r--r--

cloneable.rb

418 B

-rw-r--r--

cpu_counter.rb

2.83 KB

-rw-r--r--

default_loader.rb

235 B

-rw-r--r--

dsl_definition.rb

5.64 KB

-rw-r--r--

early_time.rb

340 B

-rw-r--r--

file_creation_task.rb

670 B

-rw-r--r--

file_list.rb

12.13 KB

-rw-r--r--

file_task.rb

1.26 KB

-rw-r--r--

file_utils.rb

3.66 KB

-rw-r--r--

file_utils_ext.rb

4.05 KB

-rw-r--r--

gempackagetask.rb

144 B

-rw-r--r--

invocation_chain.rb

1.16 KB

-rw-r--r--

invocation_exception_mixin.rb

431 B

-rw-r--r--

late_time.rb

265 B

-rw-r--r--

linked_list.rb

2.27 KB

-rw-r--r--

multi_task.rb

315 B

-rw-r--r--

name_space.rb

673 B

-rw-r--r--

packagetask.rb

5.28 KB

-rw-r--r--

pathmap.rb

53 B

-rw-r--r--

phony.rb

351 B

-rw-r--r--

private_reader.rb

364 B

-rw-r--r--

promise.rb

2.28 KB

-rw-r--r--

pseudo_status.rb

375 B

-rw-r--r--

rake_module.rb

770 B

-rw-r--r--

rake_test_loader.rb

341 B

-rw-r--r--

rdoctask.rb

153 B

-rw-r--r--

ruby182_test_unit_fix.rb

897 B

-rw-r--r--

rule_recursion_overflow_error....

353 B

-rw-r--r--

runtest.rb

594 B

-rw-r--r--

scope.rb

882 B

-rw-r--r--

task.rb

11.02 KB

-rw-r--r--

task_argument_error.rb

119 B

-rw-r--r--

task_arguments.rb

2.15 KB

-rw-r--r--

task_manager.rb

8.84 KB

-rw-r--r--

tasklib.rb

618 B

-rw-r--r--

testtask.rb

5.55 KB

-rw-r--r--

thread_history_display.rb

1.11 KB

-rw-r--r--

thread_pool.rb

4.78 KB

-rw-r--r--

trace_output.rb

543 B

-rw-r--r--

version.rb

156 B

-rw-r--r--

win32.rb

1.55 KB

-rw-r--r--

Code Editor : linked_list.rb

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 as 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 associated 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

${this.title}

Code Editor : linked_list.rb