OXIESEC PANEL
- Current Dir:
/
/
usr
/
lib
/
ruby
/
vendor_ruby
/
rake
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
03/05/2020 06:33:15 AM
rwxr-xr-x
📄
application.rb
24.5 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
backtrace.rb
896 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
clean.rb
2.03 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
cloneable.rb
448 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
cpu_counter.rb
2.32 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
default_loader.rb
265 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
dsl_definition.rb
5.48 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
early_time.rb
370 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📁
ext
-
03/05/2020 06:33:15 AM
rwxr-xr-x
📄
file_creation_task.rb
700 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
file_list.rb
12.45 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
file_task.rb
1.5 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
file_utils.rb
3.8 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
file_utils_ext.rb
4.08 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
invocation_chain.rb
1.19 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
invocation_exception_mixin.rb
461 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
late_time.rb
295 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
linked_list.rb
2.77 KB
03/03/2020 01:44:04 PM
rw-r--r--
📁
loaders
-
03/05/2020 06:33:15 AM
rwxr-xr-x
📄
multi_task.rb
345 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
name_space.rb
702 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
packagetask.rb
5.57 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
phony.rb
381 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
private_reader.rb
394 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
promise.rb
2.28 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
pseudo_status.rb
405 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
rake_module.rb
1.49 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
rake_test_loader.rb
505 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
rule_recursion_overflow_error.rb
382 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
scope.rb
899 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
task.rb
11.96 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
task_argument_error.rb
149 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
task_arguments.rb
2.41 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
task_manager.rb
9.58 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
tasklib.rb
165 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
testtask.rb
5.85 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
thread_history_display.rb
1.13 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
thread_pool.rb
4.67 KB
03/03/2020 01:44:04 PM
rw-r--r--
📄
trace_output.rb
575 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
version.rb
208 bytes
03/03/2020 01:44:04 PM
rw-r--r--
📄
win32.rb
1.52 KB
03/03/2020 01:44:04 PM
rw-r--r--
Editing: linked_list.rb
Close
# 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