132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
# File 'lib/ruby_lsp/document.rb', line 132
def locate(node, char_position, node_types: [])
queue = T.let(node.child_nodes.compact, T::Array[T.nilable(SyntaxTree::Node)])
closest = node
parent = T.let(nil, T.nilable(SyntaxTree::Node))
until queue.empty?
candidate = queue.shift
next if candidate.nil?
queue.concat(candidate.child_nodes)
loc = candidate.location
next unless (loc.start_char...loc.end_char).cover?(char_position)
break if char_position < loc.start_char
next if node_types.any? && node_types.none? { |type| candidate.class == type }
closest_loc = closest.location
if loc.end_char - loc.start_char <= closest_loc.end_char - closest_loc.start_char
parent = closest
closest = candidate
end
end
[closest, parent]
end
|