refract 1.2.0 → 2.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/README.md +30 -1
- data/lib/refract/basic_visitor.rb +3 -1
- data/lib/refract/converter.rb +37 -31
- data/lib/refract/formatter.rb +665 -312
- data/lib/refract/mutation_visitor.rb +8 -3
- data/lib/refract/nodes/alias_global_variable_node.rb +1 -1
- data/lib/refract/nodes/alias_method_node.rb +1 -1
- data/lib/refract/nodes/alternation_pattern_node.rb +1 -1
- data/lib/refract/nodes/and_node.rb +1 -1
- data/lib/refract/nodes/arguments_node.rb +1 -1
- data/lib/refract/nodes/array_node.rb +1 -1
- data/lib/refract/nodes/array_pattern_node.rb +1 -1
- data/lib/refract/nodes/assoc_node.rb +1 -1
- data/lib/refract/nodes/assoc_splat_node.rb +1 -1
- data/lib/refract/nodes/back_reference_read_node.rb +1 -1
- data/lib/refract/nodes/begin_node.rb +1 -1
- data/lib/refract/nodes/block_argument_node.rb +1 -1
- data/lib/refract/nodes/block_local_variable_node.rb +1 -1
- data/lib/refract/nodes/block_node.rb +1 -1
- data/lib/refract/nodes/block_parameter_node.rb +1 -1
- data/lib/refract/nodes/block_parameters_node.rb +1 -1
- data/lib/refract/nodes/break_node.rb +1 -1
- data/lib/refract/nodes/call_and_write_node.rb +1 -1
- data/lib/refract/nodes/call_node.rb +1 -1
- data/lib/refract/nodes/call_operator_write_node.rb +1 -1
- data/lib/refract/nodes/call_or_write_node.rb +1 -1
- data/lib/refract/nodes/call_target_node.rb +3 -2
- data/lib/refract/nodes/capture_pattern_node.rb +1 -1
- data/lib/refract/nodes/case_match_node.rb +1 -1
- data/lib/refract/nodes/case_node.rb +1 -1
- data/lib/refract/nodes/class_node.rb +1 -1
- data/lib/refract/nodes/class_variable_and_write_node.rb +1 -1
- data/lib/refract/nodes/class_variable_operator_write_node.rb +1 -1
- data/lib/refract/nodes/class_variable_or_write_node.rb +1 -1
- data/lib/refract/nodes/class_variable_read_node.rb +1 -1
- data/lib/refract/nodes/class_variable_target_node.rb +1 -1
- data/lib/refract/nodes/class_variable_write_node.rb +1 -1
- data/lib/refract/nodes/constant_and_write_node.rb +1 -1
- data/lib/refract/nodes/constant_operator_write_node.rb +1 -1
- data/lib/refract/nodes/constant_or_write_node.rb +1 -1
- data/lib/refract/nodes/constant_path_and_write_node.rb +1 -1
- data/lib/refract/nodes/constant_path_node.rb +1 -1
- data/lib/refract/nodes/constant_path_operator_write_node.rb +1 -1
- data/lib/refract/nodes/constant_path_or_write_node.rb +1 -1
- data/lib/refract/nodes/constant_path_target_node.rb +1 -1
- data/lib/refract/nodes/constant_path_write_node.rb +1 -1
- data/lib/refract/nodes/constant_read_node.rb +1 -1
- data/lib/refract/nodes/constant_target_node.rb +1 -1
- data/lib/refract/nodes/constant_write_node.rb +1 -1
- data/lib/refract/nodes/def_node.rb +1 -1
- data/lib/refract/nodes/defined_node.rb +1 -1
- data/lib/refract/nodes/else_node.rb +1 -1
- data/lib/refract/nodes/embedded_statements_node.rb +1 -1
- data/lib/refract/nodes/embedded_variable_node.rb +1 -1
- data/lib/refract/nodes/ensure_node.rb +1 -1
- data/lib/refract/nodes/find_pattern_node.rb +1 -1
- data/lib/refract/nodes/flip_flop_node.rb +1 -1
- data/lib/refract/nodes/float_node.rb +1 -1
- data/lib/refract/nodes/for_node.rb +1 -1
- data/lib/refract/nodes/forwarding_super_node.rb +1 -1
- data/lib/refract/nodes/global_variable_and_write_node.rb +1 -1
- data/lib/refract/nodes/global_variable_operator_write_node.rb +1 -1
- data/lib/refract/nodes/global_variable_or_write_node.rb +1 -1
- data/lib/refract/nodes/global_variable_read_node.rb +1 -1
- data/lib/refract/nodes/global_variable_target_node.rb +1 -1
- data/lib/refract/nodes/global_variable_write_node.rb +1 -1
- data/lib/refract/nodes/hash_node.rb +1 -1
- data/lib/refract/nodes/hash_pattern_node.rb +1 -1
- data/lib/refract/nodes/if_node.rb +1 -1
- data/lib/refract/nodes/imaginary_node.rb +1 -1
- data/lib/refract/nodes/implicit_node.rb +1 -1
- data/lib/refract/nodes/in_node.rb +1 -1
- data/lib/refract/nodes/index_and_write_node.rb +1 -1
- data/lib/refract/nodes/index_operator_write_node.rb +1 -1
- data/lib/refract/nodes/index_or_write_node.rb +1 -1
- data/lib/refract/nodes/index_target_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_and_write_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_operator_write_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_or_write_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_read_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_target_node.rb +1 -1
- data/lib/refract/nodes/instance_variable_write_node.rb +1 -1
- data/lib/refract/nodes/integer_node.rb +1 -1
- data/lib/refract/nodes/interpolated_match_last_line_node.rb +1 -1
- data/lib/refract/nodes/interpolated_regular_expression_node.rb +1 -1
- data/lib/refract/nodes/interpolated_string_node.rb +1 -1
- data/lib/refract/nodes/interpolated_symbol_node.rb +1 -1
- data/lib/refract/nodes/interpolated_x_string_node.rb +1 -1
- data/lib/refract/nodes/keyword_hash_node.rb +1 -1
- data/lib/refract/nodes/keyword_rest_parameter_node.rb +1 -1
- data/lib/refract/nodes/lambda_node.rb +1 -1
- data/lib/refract/nodes/local_variable_and_write_node.rb +1 -1
- data/lib/refract/nodes/local_variable_operator_write_node.rb +1 -1
- data/lib/refract/nodes/local_variable_or_write_node.rb +1 -1
- data/lib/refract/nodes/local_variable_read_node.rb +3 -2
- data/lib/refract/nodes/local_variable_target_node.rb +3 -2
- data/lib/refract/nodes/local_variable_write_node.rb +3 -2
- data/lib/refract/nodes/match_last_line_node.rb +1 -1
- data/lib/refract/nodes/match_predicate_node.rb +1 -1
- data/lib/refract/nodes/match_required_node.rb +1 -1
- data/lib/refract/nodes/match_write_node.rb +1 -1
- data/lib/refract/nodes/module_node.rb +1 -1
- data/lib/refract/nodes/multi_target_node.rb +1 -1
- data/lib/refract/nodes/multi_write_node.rb +1 -1
- data/lib/refract/nodes/next_node.rb +1 -1
- data/lib/refract/nodes/numbered_reference_read_node.rb +1 -1
- data/lib/refract/nodes/optional_keyword_parameter_node.rb +1 -1
- data/lib/refract/nodes/optional_parameter_node.rb +1 -1
- data/lib/refract/nodes/or_node.rb +1 -1
- data/lib/refract/nodes/parameters_node.rb +1 -1
- data/lib/refract/nodes/parentheses_node.rb +1 -1
- data/lib/refract/nodes/pinned_expression_node.rb +1 -1
- data/lib/refract/nodes/pinned_variable_node.rb +1 -1
- data/lib/refract/nodes/post_execution_node.rb +1 -1
- data/lib/refract/nodes/pre_execution_node.rb +1 -1
- data/lib/refract/nodes/program_node.rb +1 -1
- data/lib/refract/nodes/range_node.rb +1 -1
- data/lib/refract/nodes/rational_node.rb +1 -1
- data/lib/refract/nodes/regular_expression_node.rb +1 -1
- data/lib/refract/nodes/required_keyword_parameter_node.rb +1 -1
- data/lib/refract/nodes/required_parameter_node.rb +1 -1
- data/lib/refract/nodes/rescue_modifier_node.rb +1 -1
- data/lib/refract/nodes/rescue_node.rb +1 -1
- data/lib/refract/nodes/rest_parameter_node.rb +1 -1
- data/lib/refract/nodes/return_node.rb +1 -1
- data/lib/refract/nodes/shareable_constant_node.rb +1 -1
- data/lib/refract/nodes/singleton_class_node.rb +1 -1
- data/lib/refract/nodes/splat_node.rb +1 -1
- data/lib/refract/nodes/statements_node.rb +1 -1
- data/lib/refract/nodes/string_node.rb +1 -1
- data/lib/refract/nodes/super_node.rb +1 -1
- data/lib/refract/nodes/symbol_node.rb +1 -1
- data/lib/refract/nodes/undef_node.rb +1 -1
- data/lib/refract/nodes/unless_node.rb +1 -1
- data/lib/refract/nodes/until_node.rb +1 -1
- data/lib/refract/nodes/when_node.rb +1 -1
- data/lib/refract/nodes/while_node.rb +1 -1
- data/lib/refract/nodes/x_string_node.rb +1 -1
- data/lib/refract/nodes/yield_node.rb +1 -1
- data/lib/refract/version.rb +1 -1
- data/lib/refract/visitor.rb +2 -2
- data/lib/refract.rb +49 -30
- data/lib/rubocop/cop/refract/ordered_visit_methods.rb +12 -84
- metadata +4 -4
checksums.yaml
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
---
|
|
2
2
|
SHA256:
|
|
3
|
-
metadata.gz:
|
|
4
|
-
data.tar.gz:
|
|
3
|
+
metadata.gz: a6fb7942758a87f0e3d964d10d07ef139d6b2dd8d84b67b9b190419652306a3b
|
|
4
|
+
data.tar.gz: c921930c14173a750e302247664933a29065ab100071b11a18d3dfa7ca59fa4f
|
|
5
5
|
SHA512:
|
|
6
|
-
metadata.gz:
|
|
7
|
-
data.tar.gz:
|
|
6
|
+
metadata.gz: 8f5596e40075ef25e2d2c9aac80e564588c07d737de795abcd9a20f879fba0a2c170fc9369903ff6f8a62c1c91f63a9fae01ae4c0b8fc9d701cf1b4e2b887015
|
|
7
|
+
data.tar.gz: 1620c97d6f27b75f1bff8f8a1bea692994b1b17b77bc09e6507a5d8c36a19e17d0d02dd9df03a2f4004162d8e9a6408a48daa3befca3b62802016a1cfd5bfc8a
|
data/README.md
CHANGED
|
@@ -6,6 +6,26 @@ Refract lets you re-write Ruby at the AST level.
|
|
|
6
6
|
2. The `MutationVisitor` walks the Refract tree, allowing you to mutate existing nodes and insert new nodes.
|
|
7
7
|
3. Finally, the `Formatter` walks the Refract tree producing valid Ruby code.
|
|
8
8
|
|
|
9
|
+
```ruby
|
|
10
|
+
tree = Refract::Converter.new.visit(Prism.parse(source).value)
|
|
11
|
+
tree = MyMutationVisitor.new.visit(tree)
|
|
12
|
+
result = Refract::Formatter.new.format_node(tree)
|
|
13
|
+
result.source # Ruby
|
|
14
|
+
result.source_map # the original line of each output line
|
|
15
|
+
```
|
|
16
|
+
|
|
17
|
+
## Nodes
|
|
18
|
+
|
|
19
|
+
Nodes are immutable. `node.copy(**changes)` builds a new node through the class's constructor, so it is validated and frozen like any other. A copy keeps the original's `prism_node`, so its `start_line`, and the source map entries for it, point at where it came from. Nodes built by hand have no `prism_node`.
|
|
20
|
+
|
|
21
|
+
The same node can appear in more than one place in a tree.
|
|
22
|
+
|
|
23
|
+
A `MutationVisitor`'s visit methods must return something that responds to `accept`, normally a node.
|
|
24
|
+
|
|
25
|
+
## Formatting
|
|
26
|
+
|
|
27
|
+
The formatter's output is not meant to look good, but it is meant to be valid Ruby that means exactly what the tree says, for any well-formed tree, including ones built or rearranged by hand. Operands are parenthesised wherever precedence or context could change their meaning, and ranges, regular expressions and flip-flops are written so they stay values or conditions as the tree says.
|
|
28
|
+
|
|
9
29
|
## What the round trip preserves
|
|
10
30
|
|
|
11
31
|
Converting and formatting preserves the meaning of the code, not its layout. Comments, heredocs, `%w[]` and other literal syntaxes, and optional parentheses are normalised.
|
|
@@ -19,4 +39,13 @@ Not preserved:
|
|
|
19
39
|
- `__END__` and the data after it, so `DATA` is not defined.
|
|
20
40
|
- The encoding of string literals containing raw non-ASCII bytes in an `# encoding: ASCII-8BIT` file, because Prism reports such files as UTF-8.
|
|
21
41
|
|
|
22
|
-
|
|
42
|
+
## Testing
|
|
43
|
+
|
|
44
|
+
```sh
|
|
45
|
+
bundle exec qd # the suite, including property tests
|
|
46
|
+
CORPUS=1 bundle exec qd test/corpus.test.rb # round trip the standard library and installed gems
|
|
47
|
+
CORPUS=rubygems bundle exec qd test/corpus.test.rb # only files whose path matches
|
|
48
|
+
bundle exec qd fuzz test/fuzz.test.rb --timeout 10 # fuzz source round trips and generated trees
|
|
49
|
+
bundle exec qd --coverage # coverage report in .quickdraw/coverage/
|
|
50
|
+
bundle exec qd mutate lib # mutation testing, after a coverage run
|
|
51
|
+
```
|
|
@@ -7,7 +7,7 @@ module Refract
|
|
|
7
7
|
end
|
|
8
8
|
|
|
9
9
|
def self.visit(node_class, &)
|
|
10
|
-
define_method(
|
|
10
|
+
define_method(node_class.visit_method, &)
|
|
11
11
|
end
|
|
12
12
|
|
|
13
13
|
def around_visit(node)
|
|
@@ -24,6 +24,8 @@ module Refract
|
|
|
24
24
|
end
|
|
25
25
|
|
|
26
26
|
def visit_each(nodes)
|
|
27
|
+
return unless nodes
|
|
28
|
+
|
|
27
29
|
nodes = nodes.compact
|
|
28
30
|
|
|
29
31
|
i, len = 0, nodes.length
|
data/lib/refract/converter.rb
CHANGED
|
@@ -50,14 +50,14 @@ module Refract
|
|
|
50
50
|
visit Prism::ArgumentsNode do |node|
|
|
51
51
|
ArgumentsNode.new(
|
|
52
52
|
prism_node: node,
|
|
53
|
-
arguments: node.arguments
|
|
53
|
+
arguments: node.arguments.map { |n| visit(n) },
|
|
54
54
|
)
|
|
55
55
|
end
|
|
56
56
|
|
|
57
57
|
visit Prism::ArrayNode do |node|
|
|
58
58
|
ArrayNode.new(
|
|
59
59
|
prism_node: node,
|
|
60
|
-
elements: node.elements
|
|
60
|
+
elements: node.elements.map { |n| visit(n) },
|
|
61
61
|
)
|
|
62
62
|
end
|
|
63
63
|
|
|
@@ -65,9 +65,9 @@ module Refract
|
|
|
65
65
|
ArrayPatternNode.new(
|
|
66
66
|
prism_node: node,
|
|
67
67
|
constant: visit(node.constant),
|
|
68
|
-
requireds: node.requireds
|
|
68
|
+
requireds: node.requireds.map { |n| visit(n) },
|
|
69
69
|
rest: visit(node.rest),
|
|
70
|
-
posts: node.posts
|
|
70
|
+
posts: node.posts.map { |n| visit(n) },
|
|
71
71
|
)
|
|
72
72
|
end
|
|
73
73
|
|
|
@@ -136,7 +136,7 @@ module Refract
|
|
|
136
136
|
BlockParametersNode.new(
|
|
137
137
|
prism_node: node,
|
|
138
138
|
parameters: visit(node.parameters),
|
|
139
|
-
locals: node.locals
|
|
139
|
+
locals: node.locals.map { |n| visit(n) },
|
|
140
140
|
)
|
|
141
141
|
end
|
|
142
142
|
|
|
@@ -196,6 +196,7 @@ module Refract
|
|
|
196
196
|
prism_node: node,
|
|
197
197
|
receiver: visit(node.receiver),
|
|
198
198
|
name: node.name,
|
|
199
|
+
safe_navigation: node.safe_navigation?,
|
|
199
200
|
)
|
|
200
201
|
end
|
|
201
202
|
|
|
@@ -211,7 +212,7 @@ module Refract
|
|
|
211
212
|
CaseMatchNode.new(
|
|
212
213
|
prism_node: node,
|
|
213
214
|
predicate: visit(node.predicate),
|
|
214
|
-
conditions: node.conditions
|
|
215
|
+
conditions: node.conditions.map { |n| visit(n) },
|
|
215
216
|
else_clause: visit(node.else_clause),
|
|
216
217
|
)
|
|
217
218
|
end
|
|
@@ -220,7 +221,7 @@ module Refract
|
|
|
220
221
|
CaseNode.new(
|
|
221
222
|
prism_node: node,
|
|
222
223
|
predicate: visit(node.predicate),
|
|
223
|
-
conditions: node.conditions
|
|
224
|
+
conditions: node.conditions.map { |n| visit(n) },
|
|
224
225
|
else_clause: visit(node.else_clause),
|
|
225
226
|
)
|
|
226
227
|
end
|
|
@@ -546,7 +547,7 @@ module Refract
|
|
|
546
547
|
visit Prism::HashNode do |node|
|
|
547
548
|
HashNode.new(
|
|
548
549
|
prism_node: node,
|
|
549
|
-
elements: node.elements
|
|
550
|
+
elements: node.elements.map { |n| visit(n) },
|
|
550
551
|
)
|
|
551
552
|
end
|
|
552
553
|
|
|
@@ -554,7 +555,7 @@ module Refract
|
|
|
554
555
|
HashPatternNode.new(
|
|
555
556
|
prism_node: node,
|
|
556
557
|
constant: visit(node.constant),
|
|
557
|
-
elements: node.elements
|
|
558
|
+
elements: node.elements.map { |n| visit(n) },
|
|
558
559
|
rest: visit(node.rest),
|
|
559
560
|
)
|
|
560
561
|
end
|
|
@@ -694,7 +695,7 @@ module Refract
|
|
|
694
695
|
visit Prism::InterpolatedMatchLastLineNode do |node|
|
|
695
696
|
InterpolatedMatchLastLineNode.new(
|
|
696
697
|
prism_node: node,
|
|
697
|
-
parts: node.parts
|
|
698
|
+
parts: node.parts.map { |n| visit(n) },
|
|
698
699
|
ignore_case: node.ignore_case?,
|
|
699
700
|
multi_line: node.multi_line?,
|
|
700
701
|
extended: node.extended?,
|
|
@@ -718,7 +719,7 @@ module Refract
|
|
|
718
719
|
visit Prism::InterpolatedStringNode do |node|
|
|
719
720
|
InterpolatedStringNode.new(
|
|
720
721
|
prism_node: node,
|
|
721
|
-
parts: node.parts
|
|
722
|
+
parts: node.parts.map { |n| visit(n) },
|
|
722
723
|
)
|
|
723
724
|
end
|
|
724
725
|
|
|
@@ -751,7 +752,7 @@ module Refract
|
|
|
751
752
|
visit Prism::KeywordHashNode do |node|
|
|
752
753
|
KeywordHashNode.new(
|
|
753
754
|
prism_node: node,
|
|
754
|
-
elements: node.elements
|
|
755
|
+
elements: node.elements.map { |n| visit(n) },
|
|
755
756
|
)
|
|
756
757
|
end
|
|
757
758
|
|
|
@@ -802,6 +803,7 @@ module Refract
|
|
|
802
803
|
LocalVariableReadNode.new(
|
|
803
804
|
prism_node: node,
|
|
804
805
|
name: node.name,
|
|
806
|
+
depth: node.depth,
|
|
805
807
|
)
|
|
806
808
|
end
|
|
807
809
|
|
|
@@ -809,6 +811,7 @@ module Refract
|
|
|
809
811
|
LocalVariableTargetNode.new(
|
|
810
812
|
prism_node: node,
|
|
811
813
|
name: node.name,
|
|
814
|
+
depth: node.depth,
|
|
812
815
|
)
|
|
813
816
|
end
|
|
814
817
|
|
|
@@ -817,6 +820,7 @@ module Refract
|
|
|
817
820
|
prism_node: node,
|
|
818
821
|
name: node.name,
|
|
819
822
|
value: visit(node.value),
|
|
823
|
+
depth: node.depth,
|
|
820
824
|
)
|
|
821
825
|
end
|
|
822
826
|
|
|
@@ -885,9 +889,9 @@ module Refract
|
|
|
885
889
|
visit Prism::MultiWriteNode do |node|
|
|
886
890
|
MultiWriteNode.new(
|
|
887
891
|
prism_node: node,
|
|
888
|
-
lefts: node.lefts
|
|
892
|
+
lefts: node.lefts.map { |n| visit(n) },
|
|
889
893
|
rest: visit(node.rest),
|
|
890
|
-
rights: node.rights
|
|
894
|
+
rights: node.rights.map { |n| visit(n) },
|
|
891
895
|
value: visit(node.value),
|
|
892
896
|
)
|
|
893
897
|
end
|
|
@@ -952,11 +956,11 @@ module Refract
|
|
|
952
956
|
visit Prism::ParametersNode do |node|
|
|
953
957
|
ParametersNode.new(
|
|
954
958
|
prism_node: node,
|
|
955
|
-
requireds: node.requireds
|
|
956
|
-
optionals: node.optionals
|
|
959
|
+
requireds: node.requireds.map { |n| visit(n) },
|
|
960
|
+
optionals: node.optionals.map { |n| visit(n) },
|
|
957
961
|
rest: visit(node.rest),
|
|
958
|
-
posts: node.posts
|
|
959
|
-
keywords: node.keywords
|
|
962
|
+
posts: node.posts.map { |n| visit(n) },
|
|
963
|
+
keywords: node.keywords.map { |n| visit(n) },
|
|
960
964
|
keyword_rest: visit(node.keyword_rest),
|
|
961
965
|
block: visit(node.block),
|
|
962
966
|
)
|
|
@@ -1066,7 +1070,7 @@ module Refract
|
|
|
1066
1070
|
visit Prism::RescueNode do |node|
|
|
1067
1071
|
RescueNode.new(
|
|
1068
1072
|
prism_node: node,
|
|
1069
|
-
exceptions: node.exceptions
|
|
1073
|
+
exceptions: node.exceptions.map { |n| visit(n) },
|
|
1070
1074
|
reference: visit(node.reference),
|
|
1071
1075
|
statements: visit(node.statements),
|
|
1072
1076
|
subsequent: visit(node.subsequent),
|
|
@@ -1143,7 +1147,7 @@ module Refract
|
|
|
1143
1147
|
visit Prism::StatementsNode do |node|
|
|
1144
1148
|
StatementsNode.new(
|
|
1145
1149
|
prism_node: node,
|
|
1146
|
-
body: node.body
|
|
1150
|
+
body: node.body.map { |n| visit(n) },
|
|
1147
1151
|
)
|
|
1148
1152
|
end
|
|
1149
1153
|
|
|
@@ -1166,7 +1170,7 @@ module Refract
|
|
|
1166
1170
|
SymbolNode.new(
|
|
1167
1171
|
prism_node: node,
|
|
1168
1172
|
unescaped: unescaped(node),
|
|
1169
|
-
quoted: node.opening_loc && node.closing_loc
|
|
1173
|
+
quoted: !node.opening_loc.nil? && !node.closing_loc.nil?,
|
|
1170
1174
|
)
|
|
1171
1175
|
end
|
|
1172
1176
|
|
|
@@ -1205,7 +1209,7 @@ module Refract
|
|
|
1205
1209
|
visit Prism::WhenNode do |node|
|
|
1206
1210
|
WhenNode.new(
|
|
1207
1211
|
prism_node: node,
|
|
1208
|
-
conditions: node.conditions
|
|
1212
|
+
conditions: node.conditions.map { |n| visit(n) },
|
|
1209
1213
|
statements: visit(node.statements),
|
|
1210
1214
|
)
|
|
1211
1215
|
end
|
|
@@ -1242,26 +1246,28 @@ module Refract
|
|
|
1242
1246
|
|
|
1243
1247
|
while (current = queue.shift)
|
|
1244
1248
|
case current
|
|
1245
|
-
|
|
1249
|
+
in Prism::StringNode | Prism::SourceFileNode
|
|
1246
1250
|
return true if current.frozen?
|
|
1247
1251
|
return false if current.mutable?
|
|
1248
|
-
|
|
1252
|
+
in Prism::InterpolatedStringNode
|
|
1249
1253
|
return true if current.frozen?
|
|
1254
|
+
else
|
|
1255
|
+
nil
|
|
1250
1256
|
end
|
|
1251
1257
|
|
|
1252
1258
|
case current
|
|
1253
|
-
|
|
1254
|
-
Prism::InterpolatedRegularExpressionNode
|
|
1259
|
+
in Prism::InterpolatedStringNode | Prism::InterpolatedSymbolNode | Prism::InterpolatedXStringNode |
|
|
1260
|
+
Prism::InterpolatedRegularExpressionNode | Prism::InterpolatedMatchLastLineNode
|
|
1255
1261
|
|
|
1256
1262
|
queue.concat(current.parts.grep_v(Prism::StringNode))
|
|
1257
|
-
|
|
1263
|
+
in Prism::AssocNode
|
|
1258
1264
|
queue << current.key unless Prism::StringNode === current.key
|
|
1259
|
-
queue << current.value
|
|
1260
|
-
|
|
1265
|
+
queue << current.value
|
|
1266
|
+
in Prism::WhenNode
|
|
1261
1267
|
queue.concat(current.conditions.grep_v(Prism::StringNode))
|
|
1262
1268
|
queue << current.statements if current.statements
|
|
1263
|
-
|
|
1264
|
-
queue << current.statements unless current.statements&.body in [Prism::StringNode] | nil
|
|
1269
|
+
in Prism::EmbeddedStatementsNode
|
|
1270
|
+
queue << current.statements unless (current.statements&.body in [Prism::StringNode] | nil)
|
|
1265
1271
|
else
|
|
1266
1272
|
queue.concat(current.compact_child_nodes)
|
|
1267
1273
|
end
|