X7ROOT File Manager
Current Path:
/opt/alt/ruby30/share/gems/gems/rake-13.0.3/lib/rake
opt
/
alt
/
ruby30
/
share
/
gems
/
gems
/
rake-13.0.3
/
lib
/
rake
/
ðŸ“
..
📄
application.rb
(24.53 KB)
📄
backtrace.rb
(896 B)
📄
clean.rb
(2.03 KB)
📄
cloneable.rb
(448 B)
📄
cpu_counter.rb
(2.33 KB)
📄
default_loader.rb
(265 B)
📄
dsl_definition.rb
(5.48 KB)
📄
early_time.rb
(370 B)
ðŸ“
ext
📄
file_creation_task.rb
(699 B)
📄
file_list.rb
(12.45 KB)
📄
file_task.rb
(1.5 KB)
📄
file_utils.rb
(3.82 KB)
📄
file_utils_ext.rb
(3.84 KB)
📄
invocation_chain.rb
(1.19 KB)
📄
invocation_exception_mixin.rb
(461 B)
📄
late_time.rb
(295 B)
📄
linked_list.rb
(2.77 KB)
ðŸ“
loaders
📄
multi_task.rb
(345 B)
📄
name_space.rb
(702 B)
📄
packagetask.rb
(6.02 KB)
📄
phony.rb
(381 B)
📄
private_reader.rb
(394 B)
📄
promise.rb
(2.28 KB)
📄
pseudo_status.rb
(405 B)
📄
rake_module.rb
(1.49 KB)
📄
rake_test_loader.rb
(505 B)
📄
rule_recursion_overflow_error.rb
(382 B)
📄
scope.rb
(898 B)
📄
task.rb
(12.74 KB)
📄
task_argument_error.rb
(149 B)
📄
task_arguments.rb
(2.41 KB)
📄
task_manager.rb
(10.01 KB)
📄
tasklib.rb
(165 B)
📄
testtask.rb
(5.19 KB)
📄
thread_history_display.rb
(1.13 KB)
📄
thread_pool.rb
(4.67 KB)
📄
trace_output.rb
(575 B)
📄
version.rb
(208 B)
📄
win32.rb
(1.52 KB)
Editing: linked_list.rb
# frozen_string_literal: true 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