mootool 0.2.7 → 0.2.8
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/.rubocop.yml +7 -0
- data/Gemfile +1 -0
- data/Gemfile.lock +71 -67
- data/lib/mootool/command.rb +1 -0
- data/lib/mootool/controller_base.rb +1 -0
- data/lib/mootool/controllers/dwarf.rb +2 -1
- data/lib/mootool/controllers/dyld_linker.rb +1 -0
- data/lib/mootool/controllers/dyld_shared_cache.rb +1 -0
- data/lib/mootool/controllers/fat_binary.rb +1 -0
- data/lib/mootool/controllers/kernel_collection.rb +4 -3
- data/lib/mootool/controllers/sections.rb +1 -0
- data/lib/mootool/core_extensions.rb +3 -3
- data/lib/mootool/models/decompressor.rb +5 -2
- data/lib/mootool/models/device_tree.rb +5 -3
- data/lib/mootool/models/img4.rb +2 -1
- data/lib/mootool/models/ipsw.rb +5 -1
- data/lib/mootool/version.rb +2 -1
- data/lib/mootool.rb +1 -0
- data/sorbet/config +1 -1
- data/sorbet/rbi/annotations/.gitattributes +1 -0
- data/sorbet/rbi/annotations/rainbow.rbi +2 -2
- data/sorbet/rbi/gems/.gitattributes +1 -0
- data/sorbet/rbi/gems/ast@2.4.2.rbi +48 -82
- data/sorbet/rbi/gems/childprocess@4.1.0.rbi +107 -153
- data/sorbet/rbi/gems/diff-lcs@1.5.0.rbi +192 -332
- data/sorbet/rbi/gems/docile@1.4.0.rbi +376 -0
- data/sorbet/rbi/gems/erubi@1.12.0.rbi +146 -0
- data/sorbet/rbi/gems/iniparse@1.5.0.rbi +166 -276
- data/sorbet/rbi/gems/{json@2.6.2.rbi → json@2.6.3.rbi} +119 -228
- data/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi +14237 -0
- data/sorbet/rbi/gems/lzfse@0.0.2.rbi +55 -0
- data/sorbet/rbi/gems/lzss@0.1.rbi +8 -0
- data/sorbet/rbi/gems/netrc@0.11.0.rbi +52 -80
- data/sorbet/rbi/gems/{overcommit@0.59.1.rbi → overcommit@0.60.0.rbi} +534 -887
- data/sorbet/rbi/gems/parallel@1.23.0.rbi +273 -0
- data/sorbet/rbi/gems/parser@3.2.2.4.rbi +5451 -0
- data/sorbet/rbi/gems/{plist@3.6.0.rbi → plist@3.7.0.rbi} +125 -3
- data/sorbet/rbi/gems/prettier_print@1.2.1.rbi +951 -0
- data/sorbet/rbi/gems/prism@0.17.1.rbi +27700 -0
- data/sorbet/rbi/gems/racc@1.7.3.rbi +161 -0
- data/sorbet/rbi/gems/rainbow@3.1.1.rbi +141 -191
- data/sorbet/rbi/gems/rake@13.1.0.rbi +2887 -0
- data/sorbet/rbi/gems/{rbi@0.0.15.rbi → rbi@0.1.4.rbi} +979 -1676
- data/sorbet/rbi/gems/regexp_parser@2.8.2.rbi +3749 -0
- data/sorbet/rbi/gems/{rexml@3.2.5.rbi → rexml@3.2.6.rbi} +811 -1268
- data/sorbet/rbi/gems/{rspec-core@3.11.0.rbi → rspec-core@3.12.2.rbi} +2662 -4722
- data/sorbet/rbi/gems/{rspec-expectations@3.11.0.rbi → rspec-expectations@3.12.3.rbi} +1557 -2608
- data/sorbet/rbi/gems/rspec-mocks@3.12.6.rbi +5306 -0
- data/sorbet/rbi/gems/rspec-support@3.12.1.rbi +1609 -0
- data/sorbet/rbi/gems/rspec@3.12.0.rbi +82 -0
- data/sorbet/rbi/gems/rubocop-ast@1.30.0.rbi +7090 -0
- data/sorbet/rbi/gems/rubocop-capybara@2.19.0.rbi +1125 -0
- data/sorbet/rbi/gems/rubocop-factory_bot@2.24.0.rbi +878 -0
- data/sorbet/rbi/gems/rubocop-rake@0.6.0.rbi +88 -173
- data/sorbet/rbi/gems/rubocop-rspec@2.25.0.rbi +7997 -0
- data/sorbet/rbi/gems/rubocop@1.57.2.rbi +56813 -0
- data/sorbet/rbi/gems/ruby-lzma@0.4.3.rbi +19 -0
- data/sorbet/rbi/gems/ruby-macho@3.0.0.rbi +899 -1237
- data/sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi +1317 -0
- data/sorbet/rbi/gems/rubyzip@2.3.2.rbi +808 -1275
- data/sorbet/rbi/gems/simplecov-html@0.12.3.rbi +216 -0
- data/sorbet/rbi/gems/simplecov@0.22.0.rbi +2148 -0
- data/sorbet/rbi/gems/simplecov_json_formatter@0.1.4.rbi +8 -0
- data/sorbet/rbi/gems/spoom@1.2.4.rbi +3777 -0
- data/sorbet/rbi/gems/syntax_tree@6.2.0.rbi +23136 -0
- data/sorbet/rbi/gems/tapioca@0.11.12.rbi +3507 -0
- data/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi +65 -0
- data/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi +428 -0
- data/sorbet/rbi/gems/{yard@0.9.28.rbi → yard@0.9.34.rbi} +4531 -7160
- data/sorbet/rbi/sorbet-typed/lib/rainbow/all/rainbow.rbi +24 -72
- data/sorbet/rbi/sorbet-typed/lib/rake/all/rake.rbi +385 -1697
- data/sorbet/rbi/sorbet-typed/lib/rspec-core/all/rspec-core.rbi +7 -30
- data/sorbet/rbi/sorbet-typed/lib/rubocop/>=1.8/rubocop.rbi +1 -3
- data/sorbet/rbi/sorbet-typed/lib/thor/all/thor.rbi +905 -0
- data/sorbet/rbi/sorbet-typed/lib/yard/all/yard.rbi +35 -0
- data/sorbet/tapioca/require.rb +13 -1
- metadata +47 -35
- data/sorbet/rbi/gems/coderay@1.1.3.rbi +0 -8
- data/sorbet/rbi/gems/method_source@1.0.0.rbi +0 -8
- data/sorbet/rbi/gems/parallel@1.22.1.rbi +0 -353
- data/sorbet/rbi/gems/parser@3.1.2.1.rbi +0 -6198
- data/sorbet/rbi/gems/pry@0.14.1.rbi +0 -8
- data/sorbet/rbi/gems/rake@13.0.6.rbi +0 -3587
- data/sorbet/rbi/gems/regexp_parser@2.5.0.rbi +0 -3927
- data/sorbet/rbi/gems/rspec-mocks@3.11.1.rbi +0 -6506
- data/sorbet/rbi/gems/rspec-support@3.11.0.rbi +0 -2040
- data/sorbet/rbi/gems/rspec@3.11.0.rbi +0 -120
- data/sorbet/rbi/gems/rubocop-ast@1.21.0.rbi +0 -7990
- data/sorbet/rbi/gems/rubocop-rspec@2.12.1.rbi +0 -7604
- data/sorbet/rbi/gems/rubocop@1.35.0.rbi +0 -62260
- data/sorbet/rbi/gems/ruby-progressbar@1.11.0.rbi +0 -1445
- data/sorbet/rbi/gems/spoom@1.1.12.rbi +0 -2829
- data/sorbet/rbi/gems/tapioca@0.9.3.rbi +0 -2151
- data/sorbet/rbi/gems/thor@1.2.1.rbi +0 -4532
- data/sorbet/rbi/gems/unicode-display_width@2.2.0.rbi +0 -60
- data/sorbet/rbi/gems/unparser@0.6.5.rbi +0 -8
- data/sorbet/rbi/gems/webrick@1.7.0.rbi +0 -3075
- data/sorbet/rbi/gems/yard-sorbet@0.6.1.rbi +0 -458
- data/sorbet/rbi/todo.rbi +0 -7
@@ -16,10 +16,8 @@
|
|
16
16
|
# See also {AST::Node}, {AST::Processor::Mixin} and {AST::Sexp} for
|
17
17
|
# additional recommendations and design patterns.
|
18
18
|
#
|
19
|
-
# source://ast
|
20
|
-
module AST
|
21
|
-
;
|
22
|
-
end
|
19
|
+
# source://ast//lib/ast.rb#13
|
20
|
+
module AST; end
|
23
21
|
|
24
22
|
# Node is an immutable class, instances of which represent abstract
|
25
23
|
# syntax tree nodes. It combines semantic information (i.e. anything
|
@@ -57,7 +55,7 @@ end
|
|
57
55
|
# temporary node type requires making globally visible changes to
|
58
56
|
# the codebase.
|
59
57
|
#
|
60
|
-
# source://ast
|
58
|
+
# source://ast//lib/ast/node.rb#40
|
61
59
|
class AST::Node
|
62
60
|
# Constructs a new instance of Node.
|
63
61
|
#
|
@@ -71,47 +69,37 @@ class AST::Node
|
|
71
69
|
#
|
72
70
|
# @return [Node] a new instance of Node
|
73
71
|
#
|
74
|
-
# source://ast
|
75
|
-
def initialize(type, children = T.unsafe(nil), properties = T.unsafe(nil))
|
76
|
-
;
|
77
|
-
end
|
72
|
+
# source://ast//lib/ast/node.rb#72
|
73
|
+
def initialize(type, children = T.unsafe(nil), properties = T.unsafe(nil)); end
|
78
74
|
|
79
75
|
# Concatenates `array` with `children` and returns the resulting node.
|
80
76
|
#
|
81
77
|
# @return [AST::Node]
|
82
78
|
#
|
83
|
-
# source://ast
|
84
|
-
def +(array)
|
85
|
-
;
|
86
|
-
end
|
79
|
+
# source://ast//lib/ast/node.rb#168
|
80
|
+
def +(array); end
|
87
81
|
|
88
82
|
# Appends `element` to `children` and returns the resulting node.
|
89
83
|
#
|
90
84
|
# @return [AST::Node]
|
91
85
|
#
|
92
|
-
# source://ast
|
93
|
-
def <<(element)
|
94
|
-
;
|
95
|
-
end
|
86
|
+
# source://ast//lib/ast/node.rb#177
|
87
|
+
def <<(element); end
|
96
88
|
|
97
89
|
# Compares `self` to `other`, possibly converting with `to_ast`. Only
|
98
90
|
# `type` and `children` are compared; metadata is deliberately ignored.
|
99
91
|
#
|
100
92
|
# @return [Boolean]
|
101
93
|
#
|
102
|
-
# source://ast
|
103
|
-
def ==(other)
|
104
|
-
;
|
105
|
-
end
|
94
|
+
# source://ast//lib/ast/node.rb#153
|
95
|
+
def ==(other); end
|
106
96
|
|
107
97
|
# Appends `element` to `children` and returns the resulting node.
|
108
98
|
#
|
109
99
|
# @return [AST::Node]
|
110
100
|
#
|
111
|
-
# source://ast
|
112
|
-
def append(element)
|
113
|
-
;
|
114
|
-
end
|
101
|
+
# source://ast//lib/ast/node.rb#177
|
102
|
+
def append(element); end
|
115
103
|
|
116
104
|
# Returns the children of this node.
|
117
105
|
# The returned value is frozen.
|
@@ -125,7 +113,7 @@ class AST::Node
|
|
125
113
|
#
|
126
114
|
# @return [Array]
|
127
115
|
#
|
128
|
-
# source://ast
|
116
|
+
# source://ast//lib/ast/node.rb#56
|
129
117
|
def children; end
|
130
118
|
|
131
119
|
# Nodes are already frozen, so there is no harm in returning the
|
@@ -134,24 +122,22 @@ class AST::Node
|
|
134
122
|
#
|
135
123
|
# @return self
|
136
124
|
#
|
137
|
-
# source://ast
|
125
|
+
# source://ast//lib/ast/node.rb#115
|
138
126
|
def clone; end
|
139
127
|
|
140
128
|
# Concatenates `array` with `children` and returns the resulting node.
|
141
129
|
#
|
142
130
|
# @return [AST::Node]
|
143
131
|
#
|
144
|
-
# source://ast
|
145
|
-
def concat(array)
|
146
|
-
;
|
147
|
-
end
|
132
|
+
# source://ast//lib/ast/node.rb#168
|
133
|
+
def concat(array); end
|
148
134
|
|
149
135
|
# Enables matching for Node, where type is the first element
|
150
136
|
# and the children are remaining items.
|
151
137
|
#
|
152
138
|
# @return [Array]
|
153
139
|
#
|
154
|
-
# source://ast
|
140
|
+
# source://ast//lib/ast/node.rb#253
|
155
141
|
def deconstruct; end
|
156
142
|
|
157
143
|
# Nodes are already frozen, so there is no harm in returning the
|
@@ -160,7 +146,7 @@ class AST::Node
|
|
160
146
|
#
|
161
147
|
# @return self
|
162
148
|
#
|
163
|
-
# source://ast
|
149
|
+
# source://ast//lib/ast/node.rb#115
|
164
150
|
def dup; end
|
165
151
|
|
166
152
|
# Test if other object is equal to
|
@@ -168,16 +154,14 @@ class AST::Node
|
|
168
154
|
# @param other [Object]
|
169
155
|
# @return [Boolean]
|
170
156
|
#
|
171
|
-
# source://ast
|
172
|
-
def eql?(other)
|
173
|
-
;
|
174
|
-
end
|
157
|
+
# source://ast//lib/ast/node.rb#85
|
158
|
+
def eql?(other); end
|
175
159
|
|
176
160
|
# Returns the precomputed hash value for this node
|
177
161
|
#
|
178
162
|
# @return [Fixnum]
|
179
163
|
#
|
180
|
-
# source://ast
|
164
|
+
# source://ast//lib/ast/node.rb#61
|
181
165
|
def hash; end
|
182
166
|
|
183
167
|
# Converts `self` to a s-expression ruby string.
|
@@ -186,10 +170,8 @@ class AST::Node
|
|
186
170
|
# @param indent [Integer] Base indentation level.
|
187
171
|
# @return [String]
|
188
172
|
#
|
189
|
-
# source://ast
|
190
|
-
def inspect(indent = T.unsafe(nil))
|
191
|
-
;
|
192
|
-
end
|
173
|
+
# source://ast//lib/ast/node.rb#211
|
174
|
+
def inspect(indent = T.unsafe(nil)); end
|
193
175
|
|
194
176
|
# Returns the children of this node.
|
195
177
|
# The returned value is frozen.
|
@@ -203,12 +185,12 @@ class AST::Node
|
|
203
185
|
#
|
204
186
|
# @return [Array]
|
205
187
|
#
|
206
|
-
# source://ast
|
188
|
+
# source://ast//lib/ast/node.rb#56
|
207
189
|
def to_a; end
|
208
190
|
|
209
191
|
# @return [AST::Node] self
|
210
192
|
#
|
211
|
-
# source://ast
|
193
|
+
# source://ast//lib/ast/node.rb#229
|
212
194
|
def to_ast; end
|
213
195
|
|
214
196
|
# Converts `self` to a pretty-printed s-expression.
|
@@ -216,34 +198,30 @@ class AST::Node
|
|
216
198
|
# @param indent [Integer] Base indentation level.
|
217
199
|
# @return [String]
|
218
200
|
#
|
219
|
-
# source://ast
|
220
|
-
def to_s(indent = T.unsafe(nil))
|
221
|
-
;
|
222
|
-
end
|
201
|
+
# source://ast//lib/ast/node.rb#187
|
202
|
+
def to_s(indent = T.unsafe(nil)); end
|
223
203
|
|
224
204
|
# Converts `self` to a pretty-printed s-expression.
|
225
205
|
#
|
226
206
|
# @param indent [Integer] Base indentation level.
|
227
207
|
# @return [String]
|
228
208
|
#
|
229
|
-
# source://ast
|
230
|
-
def to_sexp(indent = T.unsafe(nil))
|
231
|
-
;
|
232
|
-
end
|
209
|
+
# source://ast//lib/ast/node.rb#187
|
210
|
+
def to_sexp(indent = T.unsafe(nil)); end
|
233
211
|
|
234
212
|
# Converts `self` to an Array where the first element is the type as a Symbol,
|
235
213
|
# and subsequent elements are the same representation of its children.
|
236
214
|
#
|
237
215
|
# @return [Array<Symbol, [...Array]>]
|
238
216
|
#
|
239
|
-
# source://ast
|
217
|
+
# source://ast//lib/ast/node.rb#237
|
240
218
|
def to_sexp_array; end
|
241
219
|
|
242
220
|
# Returns the type of this node.
|
243
221
|
#
|
244
222
|
# @return [Symbol]
|
245
223
|
#
|
246
|
-
# source://ast
|
224
|
+
# source://ast//lib/ast/node.rb#43
|
247
225
|
def type; end
|
248
226
|
|
249
227
|
# Returns a new instance of Node where non-nil arguments replace the
|
@@ -260,10 +238,8 @@ class AST::Node
|
|
260
238
|
# @param properties [Hash, nil]
|
261
239
|
# @return [AST::Node]
|
262
240
|
#
|
263
|
-
# source://ast
|
264
|
-
def updated(type = T.unsafe(nil), children = T.unsafe(nil), properties = T.unsafe(nil))
|
265
|
-
;
|
266
|
-
end
|
241
|
+
# source://ast//lib/ast/node.rb#133
|
242
|
+
def updated(type = T.unsafe(nil), children = T.unsafe(nil), properties = T.unsafe(nil)); end
|
267
243
|
|
268
244
|
protected
|
269
245
|
|
@@ -275,10 +251,8 @@ class AST::Node
|
|
275
251
|
#
|
276
252
|
# @return [nil]
|
277
253
|
#
|
278
|
-
# source://ast
|
279
|
-
def assign_properties(properties)
|
280
|
-
;
|
281
|
-
end
|
254
|
+
# source://ast//lib/ast/node.rb#98
|
255
|
+
def assign_properties(properties); end
|
282
256
|
|
283
257
|
# Returns `@type` with all underscores replaced by dashes. This allows
|
284
258
|
# to write symbol literals without quotes in Ruby sources and yet have
|
@@ -286,7 +260,7 @@ class AST::Node
|
|
286
260
|
#
|
287
261
|
# @return [String]
|
288
262
|
#
|
289
|
-
# source://ast
|
263
|
+
# source://ast//lib/ast/node.rb#264
|
290
264
|
def fancy_type; end
|
291
265
|
|
292
266
|
private
|
@@ -301,7 +275,7 @@ end
|
|
301
275
|
#
|
302
276
|
# @deprecated Use {AST::Processor::Mixin} instead.
|
303
277
|
#
|
304
|
-
# source://ast
|
278
|
+
# source://ast//lib/ast/processor.rb#8
|
305
279
|
class AST::Processor
|
306
280
|
include ::AST::Processor::Mixin
|
307
281
|
end
|
@@ -544,17 +518,15 @@ end
|
|
544
518
|
# use some partial evaluation before! The possibilites are
|
545
519
|
# endless. Have fun.
|
546
520
|
#
|
547
|
-
# source://ast
|
521
|
+
# source://ast//lib/ast/processor/mixin.rb#240
|
548
522
|
module AST::Processor::Mixin
|
549
523
|
# Default handler. Does nothing.
|
550
524
|
#
|
551
525
|
# @param node [AST::Node]
|
552
526
|
# @return [AST::Node, nil]
|
553
527
|
#
|
554
|
-
# source://ast
|
555
|
-
def handler_missing(node)
|
556
|
-
;
|
557
|
-
end
|
528
|
+
# source://ast//lib/ast/processor/mixin.rb#284
|
529
|
+
def handler_missing(node); end
|
558
530
|
|
559
531
|
# Dispatches `node`. If a node has type `:foo`, then a handler
|
560
532
|
# named `on_foo` is invoked with one argument, the `node`; if
|
@@ -567,10 +539,8 @@ module AST::Processor::Mixin
|
|
567
539
|
# @param node [AST::Node, nil]
|
568
540
|
# @return [AST::Node, nil]
|
569
541
|
#
|
570
|
-
# source://ast
|
571
|
-
def process(node)
|
572
|
-
;
|
573
|
-
end
|
542
|
+
# source://ast//lib/ast/processor/mixin.rb#251
|
543
|
+
def process(node); end
|
574
544
|
|
575
545
|
# {#process}es each node from `nodes` and returns an array of
|
576
546
|
# results.
|
@@ -578,10 +548,8 @@ module AST::Processor::Mixin
|
|
578
548
|
# @param nodes [Array<AST::Node>]
|
579
549
|
# @return [Array<AST::Node>]
|
580
550
|
#
|
581
|
-
# source://ast
|
582
|
-
def process_all(nodes)
|
583
|
-
;
|
584
|
-
end
|
551
|
+
# source://ast//lib/ast/processor/mixin.rb#274
|
552
|
+
def process_all(nodes); end
|
585
553
|
end
|
586
554
|
|
587
555
|
# This simple module is very useful in the cases where one needs
|
@@ -603,7 +571,7 @@ end
|
|
603
571
|
#
|
604
572
|
# This way the amount of boilerplate code is greatly reduced.
|
605
573
|
#
|
606
|
-
# source://ast
|
574
|
+
# source://ast//lib/ast/sexp.rb#20
|
607
575
|
module AST::Sexp
|
608
576
|
# Creates a {Node} with type `type` and children `children`.
|
609
577
|
# Note that the resulting node is of the type AST::Node and not a
|
@@ -611,8 +579,6 @@ module AST::Sexp
|
|
611
579
|
# This would not pose a problem with comparisons, as {Node#==}
|
612
580
|
# ignores metadata.
|
613
581
|
#
|
614
|
-
# source://ast
|
615
|
-
def s(type, *children)
|
616
|
-
;
|
617
|
-
end
|
582
|
+
# source://ast//lib/ast/sexp.rb#26
|
583
|
+
def s(type, *children); end
|
618
584
|
end
|