X7ROOT File Manager
Current Path:
/opt/alt/ruby24/lib64/ruby/gems/2.4.0/gems/rake-12.0.0/lib/rake
opt
/
alt
/
ruby24
/
lib64
/
ruby
/
gems
/
2.4.0
/
gems
/
rake-12.0.0
/
lib
/
rake
/
ðŸ“
..
📄
application.rb
(23.07 KB)
📄
backtrace.rb
(866 B)
📄
clean.rb
(2 KB)
📄
cloneable.rb
(418 B)
📄
cpu_counter.rb
(2.29 KB)
📄
default_loader.rb
(235 B)
📄
dsl_definition.rb
(5.45 KB)
📄
early_time.rb
(340 B)
ðŸ“
ext
📄
file_creation_task.rb
(670 B)
📄
file_list.rb
(12.41 KB)
📄
file_task.rb
(1.26 KB)
📄
file_utils.rb
(3.73 KB)
📄
file_utils_ext.rb
(4.05 KB)
📄
invocation_chain.rb
(1.16 KB)
📄
invocation_exception_mixin.rb
(431 B)
📄
late_time.rb
(265 B)
📄
linked_list.rb
(2.74 KB)
ðŸ“
loaders
📄
multi_task.rb
(1.49 KB)
📄
name_space.rb
(672 B)
📄
packagetask.rb
(5.54 KB)
📄
phony.rb
(351 B)
📄
private_reader.rb
(364 B)
📄
promise.rb
(2.25 KB)
📄
pseudo_status.rb
(375 B)
📄
rake_module.rb
(770 B)
📄
rake_test_loader.rb
(340 B)
📄
rule_recursion_overflow_error.rb
(352 B)
📄
scope.rb
(869 B)
📄
task.rb
(11.38 KB)
📄
task_argument_error.rb
(119 B)
📄
task_arguments.rb
(2.38 KB)
📄
task_manager.rb
(8.73 KB)
📄
tasklib.rb
(135 B)
📄
testtask.rb
(5.95 KB)
📄
thread_history_display.rb
(1.1 KB)
📄
thread_pool.rb
(4.64 KB)
📄
trace_output.rb
(545 B)
📄
version.rb
(178 B)
📄
win32.rb
(1.49 KB)
Editing: 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 # 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? # .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 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(&:to_s).join(", ") "LL(#{items})" end # Same as +to_s+, but with inspected items. def inspect items = map(&: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) # 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 # 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 protected def initialize(head, tail=EMPTY) @head = head @tail = tail 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
Upload File
Create Folder