solargraph 0.51.1 → 0.52.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 353848ebb4c6cbcd1d29568a94ca2350bcfc3278292439f20ca193ac3feebbe4
-  data.tar.gz: d679687c21c2749452b8f32580c5bd0d3753c2b5422a1d0e2a5789044b3892c9
+  metadata.gz: fdf3486fdfc29fad9450f6c8dade8f6f9d2446b400c8032055adc93a0c9ed80f
+  data.tar.gz: 30cbae5663273333f57dd66eec6cc336a318bca17ea9ff2ba9da257d94f25ad3
 SHA512:
-  metadata.gz: 9ea698ddf8c609f6f912a02cd0b6b9952719c7d4f5398a68c1662004db285f1b6a0ee2ad2bedb60fecff61cd559ed9f685bb19a3594f59de591c4f8f659c2622
-  data.tar.gz: '020828068d62bded6d4ed1f205fdcc7cc961d108df8c6e2060d429c69a02e53652b1dd8587d6c697ae81109d50b7f8de2abf84240606a76c30bce24cbf0d43ab'
+  metadata.gz: '0739d9be8146ea6b09a9bf8151328d95bea64c3fe3ddd7af6334f140c0a2eedaacff84a0e6e5b70fb5e6909b8f25ff85fb5d18f7d73f06a0294ea617dde90263'
+  data.tar.gz: 29de344f99fc2f5f96b2ccc6df9fea4b6220074315ef4a04777e4afaa16253e166f238e51fbe18914ad6f9af6c1983587b7898d7abe003f4ad420f7e508b6edc

data/.yardopts

@@ -1,2 +1,2 @@
-lib/**/*.rb
--e lib/yard-solargraph.rb
+lib/**/*.rb
+--plugin yard-solargraph

data/CHANGELOG.md

@@ -1,9 +1,34 @@
+## 0.52.0 - February 28, 2025
+- Chains resolve identical names with different contexts (#679)
+- Handle symbol tags in method tag values (#744)
+- Infer more specific Array types when possible (#745)
+- Handle interpolated symbol literals (#747)
+- Handle combined conditions, else clauses in case statements (#746)
+- fix: support find require xxx.rb in local workspace. (#722)
+- Don't require redundant attribute @return and @param tags (#748)
+- Use @yieldreturn tags for type inference (#749)
+- Fix type annotations identified at 'typed' level (#750)
+- Support RBS class aliases (#751)
+- Better support for generics via Class @param tags (#743)
+- Generic module support through RBS (#757)
+- Fix inference of begin expression types (#754)
+- Add argument to satisfy typechecker on which signature to use (#755)
+- Fix RBS ingestion implicit initializer issues, missing param types (#756)
+- Validate zsuper arity
+- Use yard-solargraph plugin (#759)
+- Add missing RBS types
+
+## 0.51.2 - February 1, 2025
+- Fix exception from parser when anonymous block forwarding is used (#740)
+- Parameterized Object types
+- Remove extraneous comment from method examples
+
 ## 0.51.1 - January 23, 2025
 - Format example code
-- Block infers yieldself from chain
+- Block infers yieldreceiver from chain
 
 ## 0.51.0 - January 19, 2025
-- Resolve self in yieldself tags
+- Resolve self in yieldreceiver tags
 - Include absolute paths in config (#674)
 - Enable diagnostics by default
 - Fix cache resolution (#704)
@@ -12,6 +37,7 @@
 - Enable diagnostics by default
 - Remove RSpec convention (#716)
 - Include convention pins in document_symbols (#724)
+- Implement Go To Type Definition (#717)
 - Remove e2mmap dependency (#699)
 - Update rbs to 3.0
 - Relax reverse_markdown dependency (#729)
@@ -591,7 +617,7 @@
 ## 0.31.2 - January 27, 2019
 - Use YARD documentation rules to associate directives with namespaces
 - Handle non-unique pin locations in completionItem/resolve
-- Clip#complete handles @yieldself and @yieldpublic contexts
+- Clip#complete handles @yieldreceiver and @yieldpublic contexts
 - Host::Dispatch filters library updates (castwide/vscode-solargraph#99)
 - Qualify included namespaces (#148)
 
@@ -947,7 +973,7 @@
 
 ## 0.17.0 - February 1, 2018
 - Support Solargraph configurations in workspace folders.
-- Use @yieldself tag to change block contexts.
+- Use @yieldreceiver tag to change block contexts.
 - Handle whitespace in signatures.
 - Convert 'self' when inferring signature types.
 - Handle bare periods without signatures.
@@ -990,7 +1016,7 @@
 - Map pins to code objects.
 - Infer return types from domain (DSL) methods.
 - Fixed visibility and results for superclasses.
-- Experimental @yieldself tag.
+- Experimental @yieldreceiver tag.
 - Improved syntax error handling in Source.fix.
 - Gem ships with Ruby 2.2.2 yardocs.
 - Experimental plugin architecture and Runtime plugin.

data/lib/solargraph/api_map/cache.rb

@@ -4,6 +4,7 @@ module Solargraph
   class ApiMap
     class Cache
       def initialize
+        # @type [Hash{Array => Array<Pin::Method>}]
         @methods = {}
         @constants = {}
         @qualified_namespaces = {}
@@ -15,6 +16,7 @@ module Solargraph
         @methods[[fqns, scope, visibility.sort, deep]]
       end
 
+      # @return [Array<Pin::Method>]
       def set_methods fqns, scope, visibility, deep, value
         @methods[[fqns, scope, visibility.sort, deep]] = value
       end

data/lib/solargraph/api_map/store.rb

@@ -147,8 +147,6 @@ module Solargraph
         @pin_select_cache[klass] ||= @pin_class_hash.each_with_object(Set.new) { |(key, o), n| n.merge(o) if key <= klass }
       end
 
-      private
-
       # @param fqns [String]
       # @return [Array<Solargraph::Pin::Namespace>]
       def fqns_pins fqns
@@ -164,6 +162,8 @@ module Solargraph
         fqns_pins_map[[base, name]]
       end
 
+      private
+
       def fqns_pins_map
         @fqns_pins_map ||= Hash.new do |h, (base, name)|
           value = namespace_children(base).select { |pin| pin.name == name && pin.is_a?(Pin::Namespace) }

data/lib/solargraph/api_map.rb

@@ -4,7 +4,7 @@ require 'rubygems'
 require 'set'
 require 'pathname'
 require 'yard'
-require 'yard-solargraph'
+require 'solargraph/yard_tags'
 
 module Solargraph
   # An aggregate provider for information about workspaces, sources, gems, and
@@ -137,7 +137,7 @@ module Solargraph
       api_map
     end
 
-    # @return [Array<Solargraph::Pin::Base>]
+    # @return [Enumerable<Solargraph::Pin::Base>]
     def pins
       store.pins
     end
@@ -199,6 +199,13 @@ module Solargraph
       result
     end
 
+    # @param namespace [String]
+    # @param context [String]
+    # @return [Array<Pin::Namespace>]
+    def get_namespace_pins namespace, context
+      store.fqns_pins(qualify(namespace, context))
+    end
+
     # Get a fully qualified namespace name. This method will start the search
     # in the specified context until it finds a match for the name.
     #
@@ -245,12 +252,12 @@ module Solargraph
       prefer_non_nil_variables(store.get_class_variables(namespace))
     end
 
-    # @return [Array<Solargraph::Pin::Base>]
+    # @return [Enumerable<Solargraph::Pin::Base>]
     def get_symbols
       store.get_symbols
     end
 
-    # @return [Array<Solargraph::Pin::GlobalVariable>]
+    # @return [Enumerable<Solargraph::Pin::GlobalVariable>]
     def get_global_variable_pins
       store.pins_by_class(Pin::GlobalVariable)
     end

data/lib/solargraph/complex_type/type_methods.rb

@@ -101,7 +101,7 @@ module Solargraph
       # @param context [String] The namespace from which to resolve names
       # @return [ComplexType] The generated ComplexType
       def qualify api_map, context = ''
-        return self if name == 'param'
+        return self if name == GENERIC_TAG_NAME
         return ComplexType.new([self]) if duck_type? || void? || undefined?
         recon = (rooted? ? '' : context)
         fqns = api_map.qualify(name, recon)

data/lib/solargraph/complex_type/unique_type.rb

@@ -51,35 +51,42 @@ module Solargraph
         tag
       end
 
+      def items
+        [self]
+      end
+
       def to_rbs
         "#{namespace}#{parameters? ? "[#{subtypes.map { |s| s.to_rbs }.join(', ')}]" : ''}"
       end
-  
-      def parameterized?
-        name == 'param' || all_params.any?(&:parameterized?)
+
+      def generic?
+        name == GENERIC_TAG_NAME || all_params.any?(&:generic?)
       end
 
-      def resolve_parameters definitions, context
-        new_name = if name == 'param'
-          idx = definitions.parameters.index(subtypes.first.name)
+      # @param definitions [Pin::Namespace]
+      # @param context_type [ComplexType]
+      # @return [UniqueType]
+      def resolve_generics definitions, context_type
+        new_name = if name == GENERIC_TAG_NAME
+          idx = definitions.generics.index(subtypes.first&.name)
           return ComplexType::UNDEFINED if idx.nil?
-          param_type = context.return_type.all_params[idx]
+          param_type = context_type.all_params[idx]
           return ComplexType::UNDEFINED unless param_type
           param_type.to_s
         else
           name
         end
-        new_key_types = if name != 'param'
-          @key_types.map { |t| t.resolve_parameters(definitions, context) }.select(&:defined?)
+        new_key_types = if name != GENERIC_TAG_NAME
+          @key_types.map { |t| t.resolve_generics(definitions, context_type) }.select(&:defined?)
         else
           []
         end
-        new_subtypes = if name != 'param'
-          @subtypes.map { |t| t.resolve_parameters(definitions, context) }.select(&:defined?)
+        new_subtypes = if name != GENERIC_TAG_NAME
+          @subtypes.map { |t| t.resolve_generics(definitions, context_type) }.select(&:defined?)
         else
           []
         end
-        if name != 'param' && !(new_key_types.empty? && new_subtypes.empty?)
+        if name != GENERIC_TAG_NAME && !(new_key_types.empty? && new_subtypes.empty?)
           if hash_parameters?
             UniqueType.new(new_name, "{#{new_key_types.join(', ')} => #{new_subtypes.join(', ')}}")
           elsif parameters?

data/lib/solargraph/complex_type.rb

@@ -4,26 +4,28 @@ module Solargraph
   # A container for type data based on YARD type tags.
   #
   class ComplexType
+    GENERIC_TAG_NAME = 'generic'.freeze
     # @!parse
     #   include TypeMethods
 
     autoload :TypeMethods, 'solargraph/complex_type/type_methods'
     autoload :UniqueType,  'solargraph/complex_type/unique_type'
 
-    # @param types [Array<UniqueType>]
+    # @param types [Array<[UniqueType, ComplexType]>]
     def initialize types = [UniqueType::UNDEFINED]
-      @items = types.uniq(&:to_s)
+      @items = types.flat_map(&:items).uniq(&:to_s)
     end
 
     # @param api_map [ApiMap]
     # @param context [String]
     # @return [ComplexType]
     def qualify api_map, context = ''
-      types = @items.map do |t|
+      red = reduce_object
+      types = red.items.map do |t|
         next t if ['Boolean', 'nil', 'void', 'undefined'].include?(t.name)
         t.qualify api_map, context
       end
-      ComplexType.new(types)
+      ComplexType.new(types).reduce_object
     end
 
     def first
@@ -41,7 +43,7 @@ module Solargraph
     end
 
     # @yieldparam [UniqueType]
-    # @return [Array]
+    # @return [Enumerator<UniqueType>]
     def each &block
       @items.each &block
     end
@@ -105,12 +107,15 @@ module Solargraph
       @items.any?(&:selfy?)
     end
 
-    def parameterized?
-      any?(&:parameterized?)
+    def generic?
+      any?(&:generic?)
     end
 
-    def resolve_parameters definitions, context
-      result = @items.map { |i| i.resolve_parameters(definitions, context) }
+    # @param definitions [Pin::Namespace]
+    # @param context_type [ComplexType]
+    # @return [ComplexType]
+    def resolve_generics definitions, context_type
+      result = @items.map { |i| i.resolve_generics(definitions, context_type) }
       ComplexType.parse(*result.map(&:tag))
     end
 
@@ -120,7 +125,7 @@ module Solargraph
       return self unless selfy?
       red = reduce_class(dst)
       result = @items.map { |i| i.self_to red }
-      ComplexType.parse(*result.map(&:to_s))
+      ComplexType.parse(*result.map(&:tag))
     end
 
     def nullable?
@@ -131,6 +136,15 @@ module Solargraph
       @items.first.all_params || []
     end
 
+    attr_reader :items
+
+    protected
+
+    def reduce_object
+      return self if name != 'Object' || subtypes.empty?
+      ComplexType.try_parse(reduce_class(subtypes.join(', ')))
+    end
+
     private
 
     # @todo This is a quick and dirty hack that forces `self` keywords

data/lib/solargraph/documentor.rb

@@ -56,7 +56,7 @@ module Solargraph
     end
 
     # @param directory [String]
-    # @return [Hash]
+    # @return [Hash{String => BasicObject}]
     def self.specs_from_bundle directory
       Solargraph.with_clean_env do
         cmd = [

data/lib/solargraph/library.rb

@@ -283,10 +283,15 @@ module Solargraph
       return if map.nil?
       pin = map.requires.select { |p| p.location.range.contain?(location.range.start) }.first
       return nil if pin.nil?
+      return_if_match = proc do |full|
+        if source_map_hash.key?(full)
+          return Location.new(full, Solargraph::Range.from_to(0, 0, 0, 0))
+        end
+      end
       workspace.require_paths.each do |path|
-        full = Pathname.new(path).join("#{pin.name}.rb").to_s
-        next unless source_map_hash.key?(full)
-        return Location.new(full, Solargraph::Range.from_to(0, 0, 0, 0))
+        full = File.join path, pin.name
+        return_if_match.(full)
+        return_if_match.(full << ".rb")
       end
       nil
     rescue FileNotFoundError
@@ -497,10 +502,12 @@ module Solargraph
     def find_external_requires source_map
       new_set = source_map.requires.map(&:name).to_set
       # return if new_set == source_map_external_require_hash[source_map.filename]
+      _filenames = nil
+      filenames = ->{ _filenames ||= workspace.filenames.to_set }
       source_map_external_require_hash[source_map.filename] = new_set.reject do |path|
         workspace.require_paths.any? do |base|
-          full = Pathname.new(base).join("#{path}.rb").to_s
-          workspace.filenames.include?(full)
+          full = File.join(base, path)
+          filenames[].include?(full) or filenames[].include?(full << ".rb")
         end
       end
       @external_requires = nil

data/lib/solargraph/parser/comment_ripper.rb

@@ -42,6 +42,7 @@ module Solargraph
         result
       end
 
+      # @return [Hash{Integer => String}]
       def parse
         @comments = {}
         super

data/lib/solargraph/parser/legacy/class_methods.rb

@@ -5,7 +5,7 @@ module Solargraph
     module Legacy
       module ClassMethods
         # @param code [String]
-        # @param filename [String]
+        # @param filename [String, nil]
         # @return [Array(Parser::AST::Node, Array<Parser::Source::Comment>)]
         def parse_with_comments code, filename = nil
           buffer = ::Parser::Source::Buffer.new(filename, 0)
@@ -128,7 +128,7 @@ module Solargraph
             end
           end
           result
-        end  
+        end
       end
     end
   end

data/lib/solargraph/parser/legacy/node_chainer.rb

@@ -10,7 +10,7 @@ module Solargraph
         Chain = Source::Chain
 
         # @param node [Parser::AST::Node]
-        # @param filename [String]
+        # @param filename [String, nil]
         def initialize node, filename = nil, in_block = false
           @node = node
           @filename = filename
@@ -25,7 +25,7 @@ module Solargraph
 
         class << self
           # @param node [Parser::AST::Node]
-          # @param filename [String]
+          # @param filename [String, nil]
           # @return [Source::Chain]
           def chain node, filename = nil, in_block = false
             NodeChainer.new(node, filename, in_block).chain
@@ -47,7 +47,6 @@ module Solargraph
         # @return [Array<Chain::Link>]
         def generate_links n
           return [] unless n.is_a?(::Parser::AST::Node)
-          return generate_links(n.children[0]) if n.type == :begin
           return generate_links(n.children[0]) if n.type == :splat
           result = []
           if n.type == :block
@@ -95,6 +94,9 @@ module Solargraph
           elsif n.type == :super
             args = n.children.map { |c| NodeChainer.chain(c) }
             result.push Chain::Call.new('super', args, @in_block > 0 || block_passed?(n))
+          elsif n.type == :yield
+            args = n.children.map { |c| NodeChainer.chain(c) }
+            result.push Chain::Call.new('yield', args, @in_block > 0 || block_passed?(n))
           elsif n.type == :const
             const = unpack_name(n)
             result.push Chain::Constant.new(const)
@@ -116,18 +118,24 @@ module Solargraph
           elsif n.type == :or
             result.push Chain::Or.new([NodeChainer.chain(n.children[0], @filename), NodeChainer.chain(n.children[1], @filename)])
           elsif [:begin, :kwbegin].include?(n.type)
-            result.concat generate_links(n.children[0])
+            result.concat generate_links(n.children.last)
           elsif n.type == :block_pass
-            result.push Chain::BlockVariable.new("&#{n.children[0].children[0].to_s}")
+            block_variable_name_node = n.children[0]
+            if block_variable_name_node.nil?
+              # anonymous block forwarding (e.g., "&")
+              # added in Ruby 3.1 - https://bugs.ruby-lang.org/issues/11256
+              result.push Chain::BlockVariable.new(nil)
+            else
+              result.push Chain::BlockVariable.new("&#{block_variable_name_node.children[0].to_s}")
+            end
           elsif n.type == :hash
             result.push Chain::Hash.new('::Hash', hash_is_splatted?(n))
+          elsif n.type == :array
+            chained_children = n.children.map { |c| NodeChainer.chain(c) }
+            result.push Source::Chain::Array.new(chained_children)
           else
             lit = infer_literal_node_type(n)
-            # if lit == '::Hash'
-            #   result.push Chain::Hash.new(lit, hash_is_splatted?(n))
-            # else
-              result.push (lit ? Chain::Literal.new(lit) : Chain::Link.new)
-            # end
+            result.push (lit ? Chain::Literal.new(lit) : Chain::Link.new)
           end
           result
         end

data/lib/solargraph/parser/legacy/node_methods.rb

@@ -48,7 +48,7 @@ module Solargraph
             return '::Integer'
           elsif node.type == :float
             return '::Float'
-          elsif node.type == :sym
+          elsif node.type == :sym || node.type == :dsym
             return '::Symbol'
           elsif node.type == :regexp
             return '::Regexp'
@@ -244,9 +244,11 @@ module Solargraph
                 node.children[1..-1].each do |cc|
                   if cc.nil?
                     result.push NIL_NODE
-                  else
-                    result.concat reduce_to_value_nodes(cc.children[1..-2]) unless cc.children.length < 1
+                  elsif cc.type == :when
                     result.concat reduce_to_value_nodes([cc.children.last])
+                  else
+                    # else clause in case
+                    result.concat reduce_to_value_nodes([cc])
                   end
                 end
               else

data/lib/solargraph/parser/legacy/node_processors/args_node.rb

@@ -6,25 +6,40 @@ module Solargraph
       module NodeProcessors
         class ArgsNode < Parser::NodeProcessor::Base
           def process
-            node.children.each do |u|
-              loc = get_node_location(u)
-              locals.push Solargraph::Pin::Parameter.new(
-                location: loc,
-                closure: region.closure,
-                comments: comments_for(node),
-                name: u.children[0].to_s,
-                assignment: u.children[1],
-                asgn_code: u.children[1] ? region.code_for(u.children[1]) : nil,
-                presence: region.closure.location.range,
-                decl: get_decl(u)
-              )
-              region.closure.parameters.push locals.last
+            if node.type == :forward_args
+              forward
+            else
+              node.children.each do |u|
+                loc = get_node_location(u)
+                locals.push Solargraph::Pin::Parameter.new(
+                  location: loc,
+                  closure: region.closure,
+                  comments: comments_for(node),
+                  name: u.children[0].to_s,
+                  assignment: u.children[1],
+                  asgn_code: u.children[1] ? region.code_for(u.children[1]) : nil,
+                  presence: region.closure.location.range,
+                  decl: get_decl(u)
+                )
+                region.closure.parameters.push locals.last
+              end
             end
             process_children
           end
 
           private
 
+          def forward
+            loc = get_node_location(node)
+            locals.push Solargraph::Pin::Parameter.new(
+              location: loc,
+              closure: region.closure,
+              presence: region.closure.location.range,
+              decl: get_decl(node)
+            )
+            region.closure.parameters.push locals.last
+          end
+
           def get_decl node
             node.type
           end

data/lib/solargraph/parser/legacy/node_processors.rb

@@ -28,27 +28,28 @@ module Solargraph
     end
 
     module NodeProcessor
-      register :source,  Legacy::NodeProcessors::BeginNode
-      register :begin,   Legacy::NodeProcessors::BeginNode
-      register :kwbegin, Legacy::NodeProcessors::BeginNode
-      register :rescue,  Legacy::NodeProcessors::BeginNode
-      register :resbody, Legacy::NodeProcessors::ResbodyNode
-      register :def,     Legacy::NodeProcessors::DefNode
-      register :defs,    Legacy::NodeProcessors::DefsNode
-      register :send,    Legacy::NodeProcessors::SendNode
-      register :class,   Legacy::NodeProcessors::NamespaceNode
-      register :module,  Legacy::NodeProcessors::NamespaceNode
-      register :sclass,  Legacy::NodeProcessors::SclassNode
-      register :ivasgn,  Legacy::NodeProcessors::IvasgnNode
-      register :cvasgn,  Legacy::NodeProcessors::CvasgnNode
-      register :lvasgn,  Legacy::NodeProcessors::LvasgnNode
-      register :gvasgn,  Legacy::NodeProcessors::GvasgnNode
-      register :casgn,   Legacy::NodeProcessors::CasgnNode
-      register :alias,   Legacy::NodeProcessors::AliasNode
-      register :args,    Legacy::NodeProcessors::ArgsNode
-      register :block,   Legacy::NodeProcessors::BlockNode
-      register :or_asgn, Legacy::NodeProcessors::OrasgnNode
-      register :sym,     Legacy::NodeProcessors::SymNode
+      register :source,       Legacy::NodeProcessors::BeginNode
+      register :begin,        Legacy::NodeProcessors::BeginNode
+      register :kwbegin,      Legacy::NodeProcessors::BeginNode
+      register :rescue,       Legacy::NodeProcessors::BeginNode
+      register :resbody,      Legacy::NodeProcessors::ResbodyNode
+      register :def,          Legacy::NodeProcessors::DefNode
+      register :defs,         Legacy::NodeProcessors::DefsNode
+      register :send,         Legacy::NodeProcessors::SendNode
+      register :class,        Legacy::NodeProcessors::NamespaceNode
+      register :module,       Legacy::NodeProcessors::NamespaceNode
+      register :sclass,       Legacy::NodeProcessors::SclassNode
+      register :ivasgn,       Legacy::NodeProcessors::IvasgnNode
+      register :cvasgn,       Legacy::NodeProcessors::CvasgnNode
+      register :lvasgn,       Legacy::NodeProcessors::LvasgnNode
+      register :gvasgn,       Legacy::NodeProcessors::GvasgnNode
+      register :casgn,        Legacy::NodeProcessors::CasgnNode
+      register :alias,        Legacy::NodeProcessors::AliasNode
+      register :args,         Legacy::NodeProcessors::ArgsNode
+      register :forward_args, Legacy::NodeProcessors::ArgsNode
+      register :block,        Legacy::NodeProcessors::BlockNode
+      register :or_asgn,      Legacy::NodeProcessors::OrasgnNode
+      register :sym,          Legacy::NodeProcessors::SymNode
     end
   end
 end

data/lib/solargraph/parser/node_methods.rb

@@ -27,6 +27,7 @@ module Solargraph
         raise NotImplementedError
       end
 
+      # @return [Source::Chain]
       def chain node, filename = nil, in_block = false
         raise NotImplementedError
       end

data/lib/solargraph/parser/region.rb

@@ -23,7 +23,7 @@ module Solargraph
 
       # @param source [Source]
       # @param namespace [String]
-      # @param scope [Symbol]
+      # @param scope [Symbol, nil]
       # @param visibility [Symbol]
       def initialize source: Solargraph::Source.load_string(''), closure: nil,
                      scope: nil, visibility: :public, lvars: []

data/lib/solargraph/parser/rubyvm/class_methods.rb

@@ -6,9 +6,8 @@ module Solargraph
     module Rubyvm
       module ClassMethods
         # @param code [String]
-        # @param filename [String]
+        # @param filename [String, nil]
         # @return [Array(Parser::AST::Node, Array<Parser::Source::Comment>)]
-        # @sg-ignore
         def parse_with_comments code, filename = nil
           node = RubyVM::AbstractSyntaxTree.parse(code).children[2]
           node &&= RubyVM::AbstractSyntaxTree::NodeWrapper.from(node, code.lines)
@@ -22,7 +21,6 @@ module Solargraph
         # @param filename [String, nil]
         # @param line [Integer]
         # @return [Parser::AST::Node]
-        # @sg-ignore
         def parse code, filename = nil, line = 0
           node = RubyVM::AbstractSyntaxTree.parse(code).children[2]
           node and RubyVM::AbstractSyntaxTree::NodeWrapper.from(node, code.lines)

data/lib/solargraph/parser/rubyvm/node_chainer.rb

@@ -11,7 +11,7 @@ module Solargraph
         Chain = Source::Chain
 
         # @param node [Parser::AST::Node]
-        # @param filename [String]
+        # @param filename [String, nil]
         def initialize node, filename = nil, in_block = false
           @node = node
           @filename = filename
@@ -26,7 +26,7 @@ module Solargraph
 
         class << self
           # @param node [Parser::AST::Node]
-          # @param filename [String]
+          # @param filename [String, nil]
           # @return [Source::Chain]
           def chain node, filename = nil, in_block = false
             NodeChainer.new(node, filename, in_block).chain
@@ -104,6 +104,9 @@ module Solargraph
             result.push Chain::BlockVariable.new("&#{n.children[1].children[0].to_s}")
           elsif n.type == :HASH
             result.push Chain::Hash.new('::Hash', hash_is_splatted?(n))
+          elsif n.type == :ARRAY
+            chained_children = n.children[0..-2].map { |c| NodeChainer.chain(c) }
+            result.push Source::Chain::Array.new(chained_children)
           else
             lit = infer_literal_node_type(n)
             if lit