rigortype 0.3.6 → 0.3.7

data/lib/rigor/analysis/check_rules/shadowed_rescue_collector.rb

@@ -88,8 +88,7 @@ module Rigor
         def extend_prefix(node, prefix)
           return prefix unless node.is_a?(Prism::ClassNode) || node.is_a?(Prism::ModuleNode)
 
-          name = Source::ConstantPath.qualified_name(node.constant_path)
-          name ? prefix + [name] : prefix
+          Source::ConstantPath.declaration_prefix(prefix, node.constant_path) || prefix
         end
 
         def collect_begin(node, prefix)
@@ -160,7 +159,7 @@ module Rigor
           name = Source::ConstantPath.qualified_name_or_nil(node)
           return nil if name.nil?
 
-          return name if absolute_path?(node)
+          return name if Source::ConstantPath.rooted?(node)
 
           candidates = []
           prefix.size.downto(1) { |i| candidates << (prefix.first(i) + [name]).join("::") }
@@ -168,15 +167,6 @@ module Rigor
           candidates.find { |candidate| known_name?(candidate, scope) }
         end
 
-        def absolute_path?(node)
-          return false unless node.is_a?(Prism::ConstantPathNode)
-
-          parent = node.parent
-          return true if parent.nil? # `::Foo`
-
-          parent.is_a?(Prism::ConstantPathNode) && absolute_path?(parent)
-        end
-
         # Presence check used to pick the lexical candidate — deliberately broader than certification, so a
         # name that resolves to a project module is FOUND here and then rejected by {#certified_class?}
         # (rather than mis-resolving outward to a same-named core class).
@@ -268,6 +258,10 @@ module Rigor
         # `Mail::Error`), longest prefix first; falls back to the as-written name (which RBS may know, e.g.
         # `StandardError`).
         def resolve_parent(child, parent, scope)
+          # Issue #722 residue 1 — a rooted parent is anchored at the top level; the namespace walk below
+          # is Ruby's lexical lookup, which `::` opts out of.
+          return parent.delete_prefix("::") if parent.start_with?("::")
+
           segments = child.to_s.split("::")[0...-1]
           until segments.empty?
             candidate = "#{segments.join('::')}::#{parent}"