reweave 0.1.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 +7 -0
- data/LICENSE +21 -0
- data/README.md +202 -0
- data/bin/reweave +200 -0
- data/lib/reweave/config.rb +119 -0
- data/lib/reweave/discovery/file_discoverer.rb +23 -0
- data/lib/reweave/editing/edit.rb +52 -0
- data/lib/reweave/editing/edit_set.rb +96 -0
- data/lib/reweave/editing/editor.rb +53 -0
- data/lib/reweave/editing.rb +23 -0
- data/lib/reweave/execution/engine.rb +317 -0
- data/lib/reweave/execution/execution_context.rb +87 -0
- data/lib/reweave/execution/project.rb +45 -0
- data/lib/reweave/execution.rb +10 -0
- data/lib/reweave/parser.rb +71 -0
- data/lib/reweave/recipe/composite_recipe.rb +26 -0
- data/lib/reweave/recipe/recipe.rb +118 -0
- data/lib/reweave/recipe/recipe_descriptor.rb +35 -0
- data/lib/reweave/recipe/recipe_option.rb +46 -0
- data/lib/reweave/recipe/recipe_registry.rb +44 -0
- data/lib/reweave/recipe/scanning_recipe.rb +29 -0
- data/lib/reweave/recipe/validation_error.rb +5 -0
- data/lib/reweave/recipe.rb +11 -0
- data/lib/reweave/recipes/rails/active_job_continuations.rb +62 -0
- data/lib/reweave/recipes/rails/controller_markdown_rendering.rb +48 -0
- data/lib/reweave/recipes/rails/remove_deprecated_gems.rb +71 -0
- data/lib/reweave/recipes/rails/replace_deprecated_find.rb +63 -0
- data/lib/reweave/recipes/rails/solid_cache_migration.rb +60 -0
- data/lib/reweave/recipes/rails/solid_queue_migration.rb +52 -0
- data/lib/reweave/recipes/rails/update_active_record.rb +70 -0
- data/lib/reweave/recipes/rails/update_configuration.rb +59 -0
- data/lib/reweave/recipes/rails/update_rails_routes.rb +51 -0
- data/lib/reweave/recipes/rails/upgrade_rails.rb +39 -0
- data/lib/reweave/recipes/ruby/find_method_calls.rb +72 -0
- data/lib/reweave/recipes/ruby/modernize_syntax.rb +81 -0
- data/lib/reweave/recipes/ruby/remove_unused_methods.rb +93 -0
- data/lib/reweave/recipes/ruby/rename_method.rb +55 -0
- data/lib/reweave/results/changeset.rb +96 -0
- data/lib/reweave/results/execution_result.rb +104 -0
- data/lib/reweave/results.rb +9 -0
- data/lib/reweave/source.rb +92 -0
- data/lib/reweave/version.rb +5 -0
- data/lib/reweave/visitor/cursor.rb +105 -0
- data/lib/reweave/visitor/ruby_visitor.rb +397 -0
- data/lib/reweave/visitor/visitor.rb +127 -0
- data/lib/reweave/visitor.rb +10 -0
- data/lib/reweave.rb +27 -0
- metadata +164 -0
|
@@ -0,0 +1,104 @@
|
|
|
1
|
+
# frozen_string_literal: true
|
|
2
|
+
|
|
3
|
+
require_relative "changeset"
|
|
4
|
+
|
|
5
|
+
module Reweave
|
|
6
|
+
module Results
|
|
7
|
+
class ExecutionResult
|
|
8
|
+
attr_reader :change_set, :diagnostics, :stats, :context, :success, :error
|
|
9
|
+
|
|
10
|
+
def initialize(change_set:, diagnostics:, stats:, context:, success: true, error: nil)
|
|
11
|
+
@change_set = change_set
|
|
12
|
+
@diagnostics = diagnostics
|
|
13
|
+
@stats = stats
|
|
14
|
+
@context = context
|
|
15
|
+
@success = success
|
|
16
|
+
@error = error
|
|
17
|
+
end
|
|
18
|
+
|
|
19
|
+
def changed?
|
|
20
|
+
!@change_set.empty?
|
|
21
|
+
end
|
|
22
|
+
|
|
23
|
+
def success?
|
|
24
|
+
@success
|
|
25
|
+
end
|
|
26
|
+
|
|
27
|
+
def changed_files
|
|
28
|
+
@change_set.changed_files
|
|
29
|
+
end
|
|
30
|
+
|
|
31
|
+
def files_changed
|
|
32
|
+
@change_set.size
|
|
33
|
+
end
|
|
34
|
+
|
|
35
|
+
def files_modified
|
|
36
|
+
@change_set.modified_files.size
|
|
37
|
+
end
|
|
38
|
+
|
|
39
|
+
def files_created
|
|
40
|
+
@change_set.created_files.size
|
|
41
|
+
end
|
|
42
|
+
|
|
43
|
+
def files_deleted
|
|
44
|
+
@change_set.deleted_files.size
|
|
45
|
+
end
|
|
46
|
+
|
|
47
|
+
def recipes
|
|
48
|
+
@change_set.recipes
|
|
49
|
+
end
|
|
50
|
+
|
|
51
|
+
def diffs
|
|
52
|
+
@change_set.map(&:diff).join("\n")
|
|
53
|
+
end
|
|
54
|
+
|
|
55
|
+
def to_h
|
|
56
|
+
{
|
|
57
|
+
success: @success,
|
|
58
|
+
error: @error,
|
|
59
|
+
changed: changed?,
|
|
60
|
+
stats: @stats,
|
|
61
|
+
diagnostics: @diagnostics,
|
|
62
|
+
changes: @change_set.map do |c|
|
|
63
|
+
{
|
|
64
|
+
path: c.path,
|
|
65
|
+
change_type: c.change_type,
|
|
66
|
+
recipes: c.recipes,
|
|
67
|
+
diff: c.diff
|
|
68
|
+
}
|
|
69
|
+
end
|
|
70
|
+
}
|
|
71
|
+
end
|
|
72
|
+
|
|
73
|
+
def summary
|
|
74
|
+
lines = []
|
|
75
|
+
lines << "Reweave Execution Summary"
|
|
76
|
+
lines << "=" * 30
|
|
77
|
+
lines << "Success: #{@success}"
|
|
78
|
+
lines << "Files scanned: #{@stats[:files_scanned]}"
|
|
79
|
+
lines << "Files matched: #{@stats[:files_matched]}"
|
|
80
|
+
lines << "Files changed: #{@stats[:files_changed]}"
|
|
81
|
+
lines << "Files created: #{@stats[:files_created]}"
|
|
82
|
+
lines << "Files deleted: #{@stats[:files_deleted]}"
|
|
83
|
+
lines << "Cycles: #{@stats[:cycles]}"
|
|
84
|
+
lines << "Recipes executed: #{@stats[:recipes_executed]}"
|
|
85
|
+
lines << "Total edits: #{@stats[:total_edits]}"
|
|
86
|
+
|
|
87
|
+
if @error
|
|
88
|
+
lines << ""
|
|
89
|
+
lines << "Error: #{@error}"
|
|
90
|
+
end
|
|
91
|
+
|
|
92
|
+
unless @change_set.empty?
|
|
93
|
+
lines << ""
|
|
94
|
+
lines << "Changes:"
|
|
95
|
+
@change_set.each do |c|
|
|
96
|
+
lines << " #{c.path} (#{c.change_type})"
|
|
97
|
+
end
|
|
98
|
+
end
|
|
99
|
+
|
|
100
|
+
lines.join("\n")
|
|
101
|
+
end
|
|
102
|
+
end
|
|
103
|
+
end
|
|
104
|
+
end
|
|
@@ -0,0 +1,92 @@
|
|
|
1
|
+
# frozen_string_literal: true
|
|
2
|
+
|
|
3
|
+
require_relative "parser"
|
|
4
|
+
|
|
5
|
+
module Reweave
|
|
6
|
+
class SourceFile
|
|
7
|
+
attr_reader :path, :source, :parse_result, :root, :diagnostics, :encoding, :identity
|
|
8
|
+
|
|
9
|
+
def initialize(path:, source: nil)
|
|
10
|
+
@path = path
|
|
11
|
+
@source = source || File.read(path, encoding: "bom|utf-8")
|
|
12
|
+
@encoding = @source.encoding
|
|
13
|
+
@parse_result = Parser.parse(@source, path: @path)
|
|
14
|
+
@root = @parse_result.root
|
|
15
|
+
@diagnostics = @parse_result.diagnostics
|
|
16
|
+
@identity = object_id
|
|
17
|
+
end
|
|
18
|
+
|
|
19
|
+
def valid?
|
|
20
|
+
@parse_result.success?
|
|
21
|
+
end
|
|
22
|
+
|
|
23
|
+
def errors
|
|
24
|
+
@parse_result.errors
|
|
25
|
+
end
|
|
26
|
+
|
|
27
|
+
def warnings
|
|
28
|
+
@parse_result.warnings
|
|
29
|
+
end
|
|
30
|
+
|
|
31
|
+
def reparse!
|
|
32
|
+
@parse_result = Parser.parse(@source, path: @path)
|
|
33
|
+
@root = @parse_result.root
|
|
34
|
+
@diagnostics = @parse_result.diagnostics
|
|
35
|
+
self
|
|
36
|
+
end
|
|
37
|
+
|
|
38
|
+
def apply_edits(edits)
|
|
39
|
+
@source = Editing::Editor.apply(@source, edits)
|
|
40
|
+
reparse!
|
|
41
|
+
end
|
|
42
|
+
|
|
43
|
+
def ==(other)
|
|
44
|
+
other.is_a?(SourceFile) && other.path == @path && other.identity == @identity
|
|
45
|
+
end
|
|
46
|
+
alias_method :eql?, :==
|
|
47
|
+
end
|
|
48
|
+
|
|
49
|
+
class SourceSet
|
|
50
|
+
include Enumerable
|
|
51
|
+
|
|
52
|
+
def initialize(files = [])
|
|
53
|
+
@files = files
|
|
54
|
+
@by_path = files.each_with_object({}) { |f, h| h[f.path] = f }
|
|
55
|
+
end
|
|
56
|
+
|
|
57
|
+
def self.from_paths(paths)
|
|
58
|
+
new(paths.map { |p| SourceFile.new(path: p) })
|
|
59
|
+
end
|
|
60
|
+
|
|
61
|
+
def each(&block)
|
|
62
|
+
@files.each(&block)
|
|
63
|
+
end
|
|
64
|
+
|
|
65
|
+
def [](path)
|
|
66
|
+
@by_path[path]
|
|
67
|
+
end
|
|
68
|
+
|
|
69
|
+
def paths
|
|
70
|
+
@files.map(&:path)
|
|
71
|
+
end
|
|
72
|
+
|
|
73
|
+
def valid_files
|
|
74
|
+
select(&:valid?)
|
|
75
|
+
end
|
|
76
|
+
|
|
77
|
+
def invalid_files
|
|
78
|
+
reject(&:valid?)
|
|
79
|
+
end
|
|
80
|
+
|
|
81
|
+
def add(file)
|
|
82
|
+
@files << file
|
|
83
|
+
@by_path[file.path] = file
|
|
84
|
+
end
|
|
85
|
+
|
|
86
|
+
def remove(path)
|
|
87
|
+
file = @by_path.delete(path)
|
|
88
|
+
@files.delete(file) if file
|
|
89
|
+
file
|
|
90
|
+
end
|
|
91
|
+
end
|
|
92
|
+
end
|
|
@@ -0,0 +1,105 @@
|
|
|
1
|
+
# frozen_string_literal: true
|
|
2
|
+
|
|
3
|
+
module Reweave
|
|
4
|
+
module Visitor
|
|
5
|
+
class Cursor
|
|
6
|
+
attr_reader :node, :parent_node, :index, :path
|
|
7
|
+
|
|
8
|
+
def initialize(node, parent: nil, index: nil, path: [])
|
|
9
|
+
@node = node
|
|
10
|
+
@parent_node = parent
|
|
11
|
+
@index = index
|
|
12
|
+
@path = path
|
|
13
|
+
end
|
|
14
|
+
|
|
15
|
+
def parent(n = nil)
|
|
16
|
+
return @parent_node if n.nil?
|
|
17
|
+
current = @parent_node
|
|
18
|
+
n.times { current = current&.parent_node }
|
|
19
|
+
current
|
|
20
|
+
end
|
|
21
|
+
|
|
22
|
+
def parents
|
|
23
|
+
return enum_for(:parents) unless block_given?
|
|
24
|
+
current = @parent_node
|
|
25
|
+
while current
|
|
26
|
+
yield current
|
|
27
|
+
current = current.parent_node
|
|
28
|
+
end
|
|
29
|
+
end
|
|
30
|
+
|
|
31
|
+
def ancestors
|
|
32
|
+
parents.to_a
|
|
33
|
+
end
|
|
34
|
+
|
|
35
|
+
def first_enclosing(*types)
|
|
36
|
+
parents.find { |p| types.any? { |t| p.node.is_a?(t) } }
|
|
37
|
+
end
|
|
38
|
+
|
|
39
|
+
def find_ancestor(&block)
|
|
40
|
+
parents.find(&block)
|
|
41
|
+
end
|
|
42
|
+
|
|
43
|
+
def siblings
|
|
44
|
+
return [] unless @parent_node
|
|
45
|
+
@parent_node.children.reject { |c| c.equal?(@node) }
|
|
46
|
+
end
|
|
47
|
+
|
|
48
|
+
def previous_sibling
|
|
49
|
+
return nil unless @parent_node && @index && @index > 0
|
|
50
|
+
@parent_node.children[@index - 1]
|
|
51
|
+
end
|
|
52
|
+
|
|
53
|
+
def next_sibling
|
|
54
|
+
return nil unless @parent_node && @index && @index < @parent_node.children.size - 1
|
|
55
|
+
@parent_node.children[@index + 1]
|
|
56
|
+
end
|
|
57
|
+
|
|
58
|
+
def root
|
|
59
|
+
current = self
|
|
60
|
+
current = current.parent_node while current.parent_node
|
|
61
|
+
current
|
|
62
|
+
end
|
|
63
|
+
|
|
64
|
+
def replace(new_node)
|
|
65
|
+
return unless @parent_node && @index
|
|
66
|
+
@parent_node.children[@index] = new_node
|
|
67
|
+
end
|
|
68
|
+
|
|
69
|
+
def delete
|
|
70
|
+
return unless @parent_node && @index
|
|
71
|
+
@parent_node.children.delete_at(@index)
|
|
72
|
+
end
|
|
73
|
+
|
|
74
|
+
def inspect
|
|
75
|
+
"#<Cursor node=#{@node.class} parent=#{@parent_node&.node&.class} index=#{@index}>"
|
|
76
|
+
end
|
|
77
|
+
end
|
|
78
|
+
|
|
79
|
+
class CursorStack
|
|
80
|
+
def initialize
|
|
81
|
+
@stack = []
|
|
82
|
+
end
|
|
83
|
+
|
|
84
|
+
def push(cursor)
|
|
85
|
+
@stack << cursor
|
|
86
|
+
end
|
|
87
|
+
|
|
88
|
+
def pop
|
|
89
|
+
@stack.pop
|
|
90
|
+
end
|
|
91
|
+
|
|
92
|
+
def current
|
|
93
|
+
@stack.last
|
|
94
|
+
end
|
|
95
|
+
|
|
96
|
+
def depth
|
|
97
|
+
@stack.size
|
|
98
|
+
end
|
|
99
|
+
|
|
100
|
+
def ancestors
|
|
101
|
+
@stack.map(&:node)
|
|
102
|
+
end
|
|
103
|
+
end
|
|
104
|
+
end
|
|
105
|
+
end
|
|
@@ -0,0 +1,397 @@
|
|
|
1
|
+
# frozen_string_literal: true
|
|
2
|
+
|
|
3
|
+
require_relative "visitor"
|
|
4
|
+
|
|
5
|
+
module Reweave
|
|
6
|
+
module Visitor
|
|
7
|
+
class RubyVisitor < Base
|
|
8
|
+
# Class/Module definitions
|
|
9
|
+
def visit_class_node(node)
|
|
10
|
+
super
|
|
11
|
+
end
|
|
12
|
+
|
|
13
|
+
def visit_module_node(node)
|
|
14
|
+
super
|
|
15
|
+
end
|
|
16
|
+
|
|
17
|
+
def visit_singleton_class_node(node)
|
|
18
|
+
super
|
|
19
|
+
end
|
|
20
|
+
|
|
21
|
+
# Method definitions
|
|
22
|
+
def visit_def_node(node)
|
|
23
|
+
super
|
|
24
|
+
end
|
|
25
|
+
|
|
26
|
+
def visit_defs_node(node)
|
|
27
|
+
super
|
|
28
|
+
end
|
|
29
|
+
|
|
30
|
+
# Method calls
|
|
31
|
+
def visit_call_node(node)
|
|
32
|
+
super
|
|
33
|
+
end
|
|
34
|
+
|
|
35
|
+
def visit_call_operator_write_node(node)
|
|
36
|
+
super
|
|
37
|
+
end
|
|
38
|
+
|
|
39
|
+
def visit_operator_write_node(node)
|
|
40
|
+
super
|
|
41
|
+
end
|
|
42
|
+
|
|
43
|
+
def visit_or_write_node(node)
|
|
44
|
+
super
|
|
45
|
+
end
|
|
46
|
+
|
|
47
|
+
def visit_and_write_node(node)
|
|
48
|
+
super
|
|
49
|
+
end
|
|
50
|
+
|
|
51
|
+
# Blocks
|
|
52
|
+
def visit_block_node(node)
|
|
53
|
+
super
|
|
54
|
+
end
|
|
55
|
+
|
|
56
|
+
def visit_do_block_node(node)
|
|
57
|
+
super
|
|
58
|
+
end
|
|
59
|
+
|
|
60
|
+
def visit_brace_block_node(node)
|
|
61
|
+
super
|
|
62
|
+
end
|
|
63
|
+
|
|
64
|
+
def visit_block_parameters_node(node)
|
|
65
|
+
super
|
|
66
|
+
end
|
|
67
|
+
|
|
68
|
+
# Control flow
|
|
69
|
+
def visit_if_node(node)
|
|
70
|
+
super
|
|
71
|
+
end
|
|
72
|
+
|
|
73
|
+
def visit_unless_node(node)
|
|
74
|
+
super
|
|
75
|
+
end
|
|
76
|
+
|
|
77
|
+
def visit_case_node(node)
|
|
78
|
+
super
|
|
79
|
+
end
|
|
80
|
+
|
|
81
|
+
def visit_when_node(node)
|
|
82
|
+
super
|
|
83
|
+
end
|
|
84
|
+
|
|
85
|
+
def visit_while_node(node)
|
|
86
|
+
super
|
|
87
|
+
end
|
|
88
|
+
|
|
89
|
+
def visit_until_node(node)
|
|
90
|
+
super
|
|
91
|
+
end
|
|
92
|
+
|
|
93
|
+
def visit_for_node(node)
|
|
94
|
+
super
|
|
95
|
+
end
|
|
96
|
+
|
|
97
|
+
def visit_break_node(node)
|
|
98
|
+
super
|
|
99
|
+
end
|
|
100
|
+
|
|
101
|
+
def visit_next_node(node)
|
|
102
|
+
super
|
|
103
|
+
end
|
|
104
|
+
|
|
105
|
+
def visit_redo_node(node)
|
|
106
|
+
super
|
|
107
|
+
end
|
|
108
|
+
|
|
109
|
+
def visit_retry_node(node)
|
|
110
|
+
super
|
|
111
|
+
end
|
|
112
|
+
|
|
113
|
+
def visit_return_node(node)
|
|
114
|
+
super
|
|
115
|
+
end
|
|
116
|
+
|
|
117
|
+
# Variables and constants
|
|
118
|
+
def visit_constant_read_node(node)
|
|
119
|
+
super
|
|
120
|
+
end
|
|
121
|
+
|
|
122
|
+
def visit_constant_path_node(node)
|
|
123
|
+
super
|
|
124
|
+
end
|
|
125
|
+
|
|
126
|
+
def visit_constant_write_node(node)
|
|
127
|
+
super
|
|
128
|
+
end
|
|
129
|
+
|
|
130
|
+
def visit_constant_path_write_node(node)
|
|
131
|
+
super
|
|
132
|
+
end
|
|
133
|
+
|
|
134
|
+
def visit_constant_target_node(node)
|
|
135
|
+
super
|
|
136
|
+
end
|
|
137
|
+
|
|
138
|
+
def visit_local_variable_read_node(node)
|
|
139
|
+
super
|
|
140
|
+
end
|
|
141
|
+
|
|
142
|
+
def visit_local_variable_write_node(node)
|
|
143
|
+
super
|
|
144
|
+
end
|
|
145
|
+
|
|
146
|
+
def visit_local_variable_target_node(node)
|
|
147
|
+
super
|
|
148
|
+
end
|
|
149
|
+
|
|
150
|
+
def visit_instance_variable_read_node(node)
|
|
151
|
+
super
|
|
152
|
+
end
|
|
153
|
+
|
|
154
|
+
def visit_instance_variable_write_node(node)
|
|
155
|
+
super
|
|
156
|
+
end
|
|
157
|
+
|
|
158
|
+
def visit_instance_variable_target_node(node)
|
|
159
|
+
super
|
|
160
|
+
end
|
|
161
|
+
|
|
162
|
+
def visit_class_variable_read_node(node)
|
|
163
|
+
super
|
|
164
|
+
end
|
|
165
|
+
|
|
166
|
+
def visit_class_variable_write_node(node)
|
|
167
|
+
super
|
|
168
|
+
end
|
|
169
|
+
|
|
170
|
+
def visit_class_variable_target_node(node)
|
|
171
|
+
super
|
|
172
|
+
end
|
|
173
|
+
|
|
174
|
+
def visit_global_variable_read_node(node)
|
|
175
|
+
super
|
|
176
|
+
end
|
|
177
|
+
|
|
178
|
+
def visit_global_variable_write_node(node)
|
|
179
|
+
super
|
|
180
|
+
end
|
|
181
|
+
|
|
182
|
+
def visit_global_variable_target_node(node)
|
|
183
|
+
super
|
|
184
|
+
end
|
|
185
|
+
|
|
186
|
+
# Literals
|
|
187
|
+
def visit_string_node(node)
|
|
188
|
+
super
|
|
189
|
+
end
|
|
190
|
+
|
|
191
|
+
def visit_interpolated_string_node(node)
|
|
192
|
+
super
|
|
193
|
+
end
|
|
194
|
+
|
|
195
|
+
def visit_symbol_node(node)
|
|
196
|
+
super
|
|
197
|
+
end
|
|
198
|
+
|
|
199
|
+
def visit_integer_node(node)
|
|
200
|
+
super
|
|
201
|
+
end
|
|
202
|
+
|
|
203
|
+
def visit_float_node(node)
|
|
204
|
+
super
|
|
205
|
+
end
|
|
206
|
+
|
|
207
|
+
def visit_rational_node(node)
|
|
208
|
+
super
|
|
209
|
+
end
|
|
210
|
+
|
|
211
|
+
def visit_imaginary_node(node)
|
|
212
|
+
super
|
|
213
|
+
end
|
|
214
|
+
|
|
215
|
+
def visit_array_node(node)
|
|
216
|
+
super
|
|
217
|
+
end
|
|
218
|
+
|
|
219
|
+
def visit_hash_node(node)
|
|
220
|
+
super
|
|
221
|
+
end
|
|
222
|
+
|
|
223
|
+
def visit_keyword_hash_node(node)
|
|
224
|
+
super
|
|
225
|
+
end
|
|
226
|
+
|
|
227
|
+
def visit_assoc_node(node)
|
|
228
|
+
super
|
|
229
|
+
end
|
|
230
|
+
|
|
231
|
+
def visit_range_node(node)
|
|
232
|
+
super
|
|
233
|
+
end
|
|
234
|
+
|
|
235
|
+
def visit_regexp_node(node)
|
|
236
|
+
super
|
|
237
|
+
end
|
|
238
|
+
|
|
239
|
+
def visit_interpolated_regexp_node(node)
|
|
240
|
+
super
|
|
241
|
+
end
|
|
242
|
+
|
|
243
|
+
# True/False/Nil/Self
|
|
244
|
+
def visit_true_node(node)
|
|
245
|
+
super
|
|
246
|
+
end
|
|
247
|
+
|
|
248
|
+
def visit_false_node(node)
|
|
249
|
+
super
|
|
250
|
+
end
|
|
251
|
+
|
|
252
|
+
def visit_nil_node(node)
|
|
253
|
+
super
|
|
254
|
+
end
|
|
255
|
+
|
|
256
|
+
def visit_self_node(node)
|
|
257
|
+
super
|
|
258
|
+
end
|
|
259
|
+
|
|
260
|
+
# Aliases and undef
|
|
261
|
+
def visit_alias_node(node)
|
|
262
|
+
super
|
|
263
|
+
end
|
|
264
|
+
|
|
265
|
+
def visit_undef_node(node)
|
|
266
|
+
super
|
|
267
|
+
end
|
|
268
|
+
|
|
269
|
+
# Super and yield
|
|
270
|
+
def visit_super_node(node)
|
|
271
|
+
super
|
|
272
|
+
end
|
|
273
|
+
|
|
274
|
+
def visit_zsuper_node(node)
|
|
275
|
+
super
|
|
276
|
+
end
|
|
277
|
+
|
|
278
|
+
def visit_yield_node(node)
|
|
279
|
+
super
|
|
280
|
+
end
|
|
281
|
+
|
|
282
|
+
# Arguments
|
|
283
|
+
def visit_arguments_node(node)
|
|
284
|
+
super
|
|
285
|
+
end
|
|
286
|
+
|
|
287
|
+
def visit_keyword_rest_node(node)
|
|
288
|
+
super
|
|
289
|
+
end
|
|
290
|
+
|
|
291
|
+
def visit_block_local_variable_node(node)
|
|
292
|
+
super
|
|
293
|
+
end
|
|
294
|
+
|
|
295
|
+
def visit_numbered_parameters_node(node)
|
|
296
|
+
super
|
|
297
|
+
end
|
|
298
|
+
|
|
299
|
+
# Rescue/Ensure
|
|
300
|
+
def visit_rescue_node(node)
|
|
301
|
+
super
|
|
302
|
+
end
|
|
303
|
+
|
|
304
|
+
def visit_ensure_node(node)
|
|
305
|
+
super
|
|
306
|
+
end
|
|
307
|
+
|
|
308
|
+
def visit_resbody_node(node)
|
|
309
|
+
super
|
|
310
|
+
end
|
|
311
|
+
|
|
312
|
+
# Lambda/Proc
|
|
313
|
+
def visit_lambda_node(node)
|
|
314
|
+
super
|
|
315
|
+
end
|
|
316
|
+
|
|
317
|
+
# Match
|
|
318
|
+
def visit_match_predicate_node(node)
|
|
319
|
+
super
|
|
320
|
+
end
|
|
321
|
+
|
|
322
|
+
def visit_match_write_node(node)
|
|
323
|
+
super
|
|
324
|
+
end
|
|
325
|
+
|
|
326
|
+
# Forwarding
|
|
327
|
+
def visit_forwarding_super_node(node)
|
|
328
|
+
super
|
|
329
|
+
end
|
|
330
|
+
|
|
331
|
+
def visit_forwarding_args_node(node)
|
|
332
|
+
super
|
|
333
|
+
end
|
|
334
|
+
|
|
335
|
+
# Helpers for matching
|
|
336
|
+
def match_call?(node, receiver: nil, method: nil, **kwargs)
|
|
337
|
+
return false unless node.is_a?(Prism::CallNode)
|
|
338
|
+
return false if receiver && node.receiver&.slice != receiver
|
|
339
|
+
return false if method && node.name != method
|
|
340
|
+
kwargs.all? { |k, v| node.respond_to?(k) && node.public_send(k) == v }
|
|
341
|
+
end
|
|
342
|
+
|
|
343
|
+
def match_constant?(node, name: nil, **kwargs)
|
|
344
|
+
return false unless node.is_a?(Prism::ConstantReadNode) || node.is_a?(Prism::ConstantPathNode)
|
|
345
|
+
return false if name && node.slice != name.to_s
|
|
346
|
+
kwargs.all? { |k, v| node.respond_to?(k) && node.public_send(k) == v }
|
|
347
|
+
end
|
|
348
|
+
|
|
349
|
+
def match_method_def?(node, name: nil, **kwargs)
|
|
350
|
+
return false unless node.is_a?(Prism::DefNode)
|
|
351
|
+
return false if name && node.name != name
|
|
352
|
+
kwargs.all? { |k, v| node.respond_to?(k) && node.public_send(k) == v }
|
|
353
|
+
end
|
|
354
|
+
|
|
355
|
+
def extract_receiver_name(node)
|
|
356
|
+
return nil unless node.receiver
|
|
357
|
+
case node.receiver
|
|
358
|
+
when Prism::ConstantReadNode, Prism::ConstantPathNode
|
|
359
|
+
node.receiver.slice
|
|
360
|
+
when Prism::SelfNode
|
|
361
|
+
"self"
|
|
362
|
+
when Prism::CallNode
|
|
363
|
+
extract_receiver_name(node.receiver)
|
|
364
|
+
else
|
|
365
|
+
node.receiver.slice
|
|
366
|
+
end
|
|
367
|
+
end
|
|
368
|
+
|
|
369
|
+
def extract_method_name(node)
|
|
370
|
+
node.name
|
|
371
|
+
end
|
|
372
|
+
|
|
373
|
+
def extract_arguments(node)
|
|
374
|
+
return [] unless node.arguments
|
|
375
|
+
node.arguments.arguments || []
|
|
376
|
+
end
|
|
377
|
+
|
|
378
|
+
def extract_keyword_arguments(node)
|
|
379
|
+
return {} unless node.arguments
|
|
380
|
+
kwargs = []
|
|
381
|
+
node.arguments.arguments.each do |arg|
|
|
382
|
+
if arg.is_a?(Prism::AssocNode)
|
|
383
|
+
kwargs << arg
|
|
384
|
+
elsif arg.is_a?(Prism::KeywordHashNode)
|
|
385
|
+
kwargs.concat(arg.elements)
|
|
386
|
+
end
|
|
387
|
+
end
|
|
388
|
+
kwargs.to_h { |a| [a.key.slice.sub(/:$/, "").to_sym, a.value] }
|
|
389
|
+
end
|
|
390
|
+
|
|
391
|
+
def source_for(node)
|
|
392
|
+
loc = node.location
|
|
393
|
+
@source_file.source[loc.start_offset...loc.end_offset]
|
|
394
|
+
end
|
|
395
|
+
end
|
|
396
|
+
end
|
|
397
|
+
end
|