rubocop-ast 1.45.0 → 1.46.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 583dc53998abcebb206e7c0567e4a4fd48e650adb3b75103a0c312e318460495
-  data.tar.gz: 8ebae0951d2152b63a04d497d39be8502902327d1f8d45b4cab5480c84e08148
+  metadata.gz: 2b94b9545a7aceaf8b52e8e6b8713df63fe1113c4040fd5f92563438c0307d21
+  data.tar.gz: 6db23c373003f60f0faf0f48ff1a4cb7d086f36820e7f5e732a147eea0d22f98
 SHA512:
-  metadata.gz: c977e70e95ab8d4929ac09e354c1d8236f2110565245f68f185d853461cf49552b85afc6557e9b5e4d7b3b84d0fea2b640b5602b318f1d0b0e24be38b23563cd
-  data.tar.gz: fecacf448202e8dcf1a010708de8ac1eb27e78211f4f130fa77d60737ed32ba2d3446f575841488f49a775489ada8e8122db781a8a20a97a46425b7538acc3ff
+  metadata.gz: 3a0fb03bcb60b82177efefcf2146d1512c50f9791f094769d64ae7c87899e9984ce41eebdb1fc8f6d8c40b287e42621f6d4bd9fdde23fe9884ebc0dd2202b5ae
+  data.tar.gz: 8fd5e39ac28109336a207edfedf5fc6b782ede8da4594cfdd1faf41e8e9df4d59a17716e1ea55121c575514d17fce9e0b3071ab98ecc54b007f66af8f002f560

data/lib/rubocop/ast/builder.rb

@@ -38,6 +38,7 @@ module RuboCop
         casgn:               CasgnNode,
         case:                CaseNode,
         class:               ClassNode,
+        complex:             ComplexNode,
         const:               ConstNode,
         def:                 DefNode,
         defined?:            DefinedNode,

data/lib/rubocop/ast/node/complex_node.rb

@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+module RuboCop
+  module AST
+    # A node extension for `complex` nodes. This will be used in place of a plain
+    # node when the builder constructs the AST, making its methods available to
+    # all `complex` nodes within RuboCop.
+    class ComplexNode < Node
+      include BasicLiteralNode
+      include NumericNode
+    end
+  end
+end

data/lib/rubocop/ast/node/mixin/basic_literal_node.rb

@@ -3,7 +3,7 @@
 module RuboCop
   module AST
     # Common functionality for primitive literal nodes: `sym`, `str`,
-    # `int`, `float`, `rational`...
+    # `int`, `float`, `rational`, `complex`...
     module BasicLiteralNode
       # Returns the value of the literal.
       #

data/lib/rubocop/ast/node/mixin/numeric_node.rb

@@ -2,7 +2,7 @@
 
 module RuboCop
   module AST
-    # Common functionality for primitive numeric nodes: `int`, `float`, `rational`...
+    # Common functionality for primitive numeric nodes: `int`, `float`, `rational`, `complex`...
     module NumericNode
       SIGN_REGEX = /\A[+-]/.freeze
       private_constant :SIGN_REGEX
@@ -15,7 +15,7 @@ module RuboCop
       #
       # @return [Boolean] whether this literal has a sign.
       def sign?
-        source.match(SIGN_REGEX)
+        source.match?(SIGN_REGEX)
       end
     end
   end

data/lib/rubocop/ast/node.rb

@@ -272,7 +272,7 @@ module RuboCop
       def right_siblings
         return [].freeze unless parent
 
-        parent.children[sibling_index + 1..].freeze
+        parent.children[(sibling_index + 1)..].freeze
       end
 
       # Common destructuring method. This can be used to normalize

data/lib/rubocop/ast/node_pattern/compiler/debug.rb

@@ -15,10 +15,12 @@ module RuboCop
               @visit = {}
             end
 
+            # rubocop:disable Naming/PredicateMethod
             def enter(node_id)
               @visit[node_id] = false
               true
             end
+            # rubocop:enable Naming/PredicateMethod
 
             def success(node_id)
               @visit[node_id] = true

data/lib/rubocop/ast/node_pattern/compiler/sequence_subcompiler.rb

@@ -261,7 +261,7 @@ module RuboCop
             arities = children
                       .reverse
                       .map(&:arity_range)
-                      .map { |r| last = last.begin + r.begin..last.max + r.max }
+                      .map { |r| last = (last.begin + r.begin)..(last.max + r.max) }
                       .reverse!
             arities.push last_arity
           end

data/lib/rubocop/ast/node_pattern/node.rb

@@ -179,7 +179,7 @@ module RuboCop
         class AnyOrder < Node
           include ForbidInSeqHead
 
-          ARITIES = Hash.new { |h, k| h[k] = k - 1..Float::INFINITY }
+          ARITIES = Hash.new { |h, k| h[k] = (k - 1)..Float::INFINITY }
           private_constant :ARITIES
 
           def term_nodes

data/lib/rubocop/ast/processed_source.rb

@@ -341,7 +341,7 @@ module RuboCop
 
         parser_class = parser_class(ruby_version, parser_engine)
 
-        parser_instance = if prism_result
+        parser_instance = if parser_engine == :parser_prism && prism_result
                             # NOTE: Since it is intended for use with Ruby LSP, it targets only Prism.
                             # If there is no reuse of a pre-parsed result, such as in Ruby LSP,
                             # regular parsing with Prism occurs, and `else` branch will be executed.

data/lib/rubocop/ast/version.rb

@@ -3,7 +3,7 @@
 module RuboCop
   module AST
     module Version
-      STRING = '1.45.0'
+      STRING = '1.46.0'
     end
   end
 end

data/lib/rubocop/ast.rb

@@ -48,6 +48,7 @@ require_relative 'ast/node/case_match_node'
 require_relative 'ast/node/case_node'
 require_relative 'ast/node/casgn_node'
 require_relative 'ast/node/class_node'
+require_relative 'ast/node/complex_node'
 require_relative 'ast/node/const_node'
 require_relative 'ast/node/def_node'
 require_relative 'ast/node/defined_node'

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rubocop-ast
 version: !ruby/object:Gem::Version
-  version: 1.45.0
+  version: 1.46.0
 platform: ruby
 authors:
 - Bozhidar Batsov
@@ -10,7 +10,7 @@ authors:
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2025-06-03 00:00:00.000000000 Z
+date: 2025-07-16 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: parser
@@ -69,6 +69,7 @@ files:
 - lib/rubocop/ast/node/case_node.rb
 - lib/rubocop/ast/node/casgn_node.rb
 - lib/rubocop/ast/node/class_node.rb
+- lib/rubocop/ast/node/complex_node.rb
 - lib/rubocop/ast/node/const_node.rb
 - lib/rubocop/ast/node/csend_node.rb
 - lib/rubocop/ast/node/def_node.rb