solargraph 0.53.3 → 0.54.0

data/lib/solargraph/complex_type/unique_type.rb

@@ -17,43 +17,61 @@ module Solargraph
       #
       # @param name [String] The name of the type
       # @param substring [String] The substring of the type
-      def initialize name, substring = ''
+      # @param make_rooted [Boolean, nil]
+      # @return [UniqueType]
+      def self.parse name, substring = '', make_rooted: nil
+        if name.start_with?(':::')
+          raise "Illegal prefix: #{name}"
+        end
         if name.start_with?('::')
-          @name = name[2..-1]
-          @rooted = true
+          name = name[2..-1]
+          rooted = true
         else
-          @name = name
-          @rooted = false
+          rooted = false
         end
-        @substring = substring
-        @tag = @name + substring
-        # @type [Array<ComplexType>]
-        @key_types = []
+        rooted = make_rooted unless make_rooted.nil?
+
         # @type [Array<ComplexType>]
-        @subtypes = []
+        key_types = []
         # @type [Array<ComplexType>]
-        @all_params = []
-        return unless parameters?
-        # @todo we should be able to probe the type of 'subs' without
-        #   hoisting the definition outside of the if statement
-        subs = if @substring.start_with?('<(') && @substring.end_with?(')>')
-                 ComplexType.parse(substring[2..-3], partial: true)
-               else
-                 ComplexType.parse(substring[1..-2], partial: true)
-               end
-        if hash_parameters?
-          raise ComplexTypeError, "Bad hash type" unless !subs.is_a?(ComplexType) and subs.length == 2 and !subs[0].is_a?(UniqueType) and !subs[1].is_a?(UniqueType)
-          # @todo should be able to resolve map; both types have it
-          #   with same return type
-          # @sg-ignore
-          @key_types.concat subs[0].map { |u| ComplexType.new([u]) }
-          # @sg-ignore
-          @subtypes.concat subs[1].map { |u| ComplexType.new([u]) }
-        else
-          @subtypes.concat subs
+        subtypes = []
+        parameters_type = nil
+        unless substring.empty?
+          subs = ComplexType.parse(substring[1..-2], partial: true)
+          parameters_type = PARAMETERS_TYPE_BY_STARTING_TAG.fetch(substring[0])
+          if parameters_type == :hash
+            raise ComplexTypeError, "Bad hash type" unless !subs.is_a?(ComplexType) and subs.length == 2 and !subs[0].is_a?(UniqueType) and !subs[1].is_a?(UniqueType)
+            # @todo should be able to resolve map; both types have it
+            #   with same return type
+            # @sg-ignore
+            key_types.concat(subs[0].map { |u| ComplexType.new([u]) })
+            # @sg-ignore
+            subtypes.concat(subs[1].map { |u| ComplexType.new([u]) })
+          else
+            subtypes.concat subs
+          end
         end
-        @all_params.concat @key_types
-        @all_params.concat @subtypes
+        new(name, key_types, subtypes, rooted: rooted, parameters_type: parameters_type)
+      end
+
+      # @param name [String]
+      # @param key_types [Array<ComplexType>]
+      # @param subtypes [Array<ComplexType>]
+      # @param rooted [Boolean]
+      # @param parameters_type [Symbol, nil]
+      def initialize(name, key_types = [], subtypes = [], rooted:, parameters_type: nil)
+        if parameters_type.nil?
+          raise "You must supply parameters_type if you provide parameters" unless key_types.empty? && subtypes.empty?
+        end
+        raise "Please remove leading :: and set rooted instead - #{name}" if name.start_with?('::')
+        @name = name
+        @key_types = key_types
+        @subtypes = subtypes
+        @rooted = rooted
+        @all_params = []
+        @all_params.concat key_types
+        @all_params.concat subtypes
+        @parameters_type = parameters_type
       end
 
       def to_s
@@ -76,7 +94,17 @@ module Solargraph
 
       # @return [String]
       def to_rbs
-        if ['Tuple', 'Array'].include?(name) && fixed_parameters?
+        if duck_type?
+          'untyped'
+        elsif name == 'Boolean'
+          'bool'
+        elsif name.downcase == 'nil'
+          'nil'
+        elsif name == GENERIC_TAG_NAME
+          all_params.first.name
+        elsif ['Class', 'Module'].include?(name)
+          rbs_name
+        elsif ['Tuple', 'Array'].include?(name) && fixed_parameters?
           # tuples don't have a name; they're just [foo, bar, baz].
           if substring == '()'
             # but there are no zero element tuples, so we go with an array
@@ -90,16 +118,37 @@ module Solargraph
         end
       end
 
+      # @return [Boolean]
+      def parameters?
+        !all_params.empty?
+      end
+
+      # @param types [Array<UniqueType, ComplexType>]
+      # @return [String]
+      def rbs_union(types)
+        if types.length == 1
+          types.first.to_rbs
+        else
+          "(#{types.map(&:to_rbs).join(' | ')})"
+        end
+      end
+
       # @return [String]
       def parameters_as_rbs
-        parameters? ? "[#{all_params.map { |s| s.to_rbs }.join(', ')}]" : ''
+        return '' unless parameters?
+
+        return "[#{all_params.map(&:to_rbs).join(', ')}]" if key_types.empty?
+
+        # handle, e.g., Hash[K, V] case
+        key_types_str = rbs_union(key_types)
+        subtypes_str = rbs_union(subtypes)
+        "[#{key_types_str}, #{subtypes_str}]"
       end
 
       def generic?
         name == GENERIC_TAG_NAME || all_params.any?(&:generic?)
       end
 
-
       # @param generics_to_resolve [Enumerable<String>]
       # @param context_type [UniqueType, nil]
       # @param resolved_generic_values [Hash{String => ComplexType}] Added to as types are encountered or resolved
@@ -182,39 +231,34 @@ module Solargraph
       end
 
       # @param new_name [String, nil]
+      # @param make_rooted [Boolean, nil]
       # @param new_key_types [Array<UniqueType>, nil]
+      # @param rooted [Boolean, nil]
       # @param new_subtypes [Array<UniqueType>, nil]
       # @return [self]
-      def recreate(new_name: nil, new_key_types: nil, new_subtypes: nil)
+      def recreate(new_name: nil, make_rooted: nil, new_key_types: nil, new_subtypes: nil)
+        raise "Please remove leading :: and set rooted instead - #{new_name}" if new_name&.start_with?('::')
         new_name ||= name
         new_key_types ||= @key_types
         new_subtypes ||= @subtypes
-        if new_key_types.none?(&:defined?) && new_subtypes.none?(&:defined?)
-          # if all subtypes are undefined, erase down to the non-parametric type
-          UniqueType.new(new_name)
-        elsif new_key_types.empty? && new_subtypes.empty?
-          UniqueType.new(new_name)
-        elsif hash_parameters?
-          UniqueType.new(new_name, "{#{new_key_types.join(', ')} => #{new_subtypes.join(', ')}}")
-        elsif @substring.start_with?('<(')
-          # @todo This clause is probably wrong, and if so, fixing it
-          #    will be some level of breaking change.  Probably best
-          #    handled before real tuple support is rolled out and
-          #    folks start relying on it more.
-          #
-          #   (String) is a one element tuple in https://yardoc.org/types
-          #   <String> is an array of zero or more Strings in https://yardoc.org/types
-          #   Array<(String)> could be an Array of one-element tuples or a
-          #     one element tuple.  https://yardoc.org/types treats it
-          #     as the former.
-          #   Array<(String), Integer> is not ambiguous if we accept
-          #     (String) as a tuple type, but not currently understood
-          #     by Solargraph.
-          UniqueType.new(new_name, "<(#{new_subtypes.join(', ')})>")
-        elsif fixed_parameters?
-          UniqueType.new(new_name, "(#{new_subtypes.join(', ')})")
-        else
-          UniqueType.new(new_name, "<#{new_subtypes.join(', ')}>")
+        make_rooted = @rooted if make_rooted.nil?
+        UniqueType.new(new_name, new_key_types, new_subtypes, rooted: make_rooted, parameters_type: parameters_type)
+      end
+
+      # @return [String]
+      def rooted_tags
+        rooted_tag
+      end
+
+      # @return [String]
+      def tags
+        tag
+      end
+
+      # @return [self]
+      def force_rooted
+        transform do |t|
+          t.recreate(make_rooted: true)
         end
       end
 
@@ -225,9 +269,16 @@ module Solargraph
       # @yieldreturn [self]
       # @return [self]
       def transform(new_name = nil, &transform_type)
-        new_key_types = @key_types.flat_map { |ct| ct.map { |ut| ut.transform(&transform_type) } }.compact
-        new_subtypes = @subtypes.flat_map { |ct| ct.map { |ut| ut.transform(&transform_type) } }.compact
-        new_type = recreate(new_name: new_name || rooted_name, new_key_types: new_key_types, new_subtypes: new_subtypes)
+        raise "Please remove leading :: and set rooted with recreate() instead - #{new_name}" if new_name&.start_with?('::')
+        if name == ComplexType::GENERIC_TAG_NAME
+          # doesn't make sense to manipulate the name of the generic
+          new_key_types = @key_types
+          new_subtypes = @subtypes
+        else
+          new_key_types = @key_types.flat_map { |ct| ct.items.map { |ut| ut.transform(&transform_type) } }
+          new_subtypes = @subtypes.flat_map { |ct| ct.items.map { |ut| ut.transform(&transform_type) } }
+        end
+        new_type = recreate(new_name: new_name || name, new_key_types: new_key_types, new_subtypes: new_subtypes)
         yield new_type
       end
 
@@ -245,8 +296,8 @@ module Solargraph
         @name == 'self' || @key_types.any?(&:selfy?) || @subtypes.any?(&:selfy?)
       end
 
-      UNDEFINED = UniqueType.new('undefined')
-      BOOLEAN = UniqueType.new('Boolean')
+      UNDEFINED = UniqueType.new('undefined', rooted: false)
+      BOOLEAN = UniqueType.new('Boolean', rooted: true)
     end
   end
 end

data/lib/solargraph/complex_type.rb

@@ -11,7 +11,7 @@ module Solargraph
     autoload :TypeMethods, 'solargraph/complex_type/type_methods'
     autoload :UniqueType,  'solargraph/complex_type/unique_type'
 
-    # @param types [Array<[UniqueType, ComplexType]>]
+    # @param types [Array<UniqueType, ComplexType>]
     def initialize types = [UniqueType::UNDEFINED]
       # @todo @items here should not need an annotation
       # @type [Array<UniqueType>]
@@ -86,6 +86,10 @@ module Solargraph
       @items
     end
 
+    def tags
+      @items.map(&:tag).join(', ')
+    end
+
     # @param index [Integer]
     # @return [UniqueType]
     def [](index)
@@ -126,6 +130,10 @@ module Solargraph
       map(&:tag).join(', ')
     end
 
+    def rooted_tags
+      map(&:rooted_tag).join(', ')
+    end
+
     def all? &block
       @items.all? &block
     end
@@ -147,15 +155,23 @@ module Solargraph
     # @yieldreturn [UniqueType]
     # @return [ComplexType]
     def transform(new_name = nil, &transform_type)
+      raise "Please remove leading :: and set rooted with recreate() instead - #{new_name}" if new_name&.start_with?('::')
       ComplexType.new(map { |ut| ut.transform(new_name, &transform_type) })
     end
 
+    # @return [self]
+    def force_rooted
+      transform do |t|
+        t.recreate(make_rooted: true)
+      end
+    end
+
     # @param definitions [Pin::Namespace, Pin::Method]
     # @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))
+      ComplexType.try_parse(*result.map(&:tag))
     end
 
     # @param dst [String]
@@ -164,7 +180,7 @@ module Solargraph
       return self unless selfy?
       red = reduce_class(dst)
       result = @items.map { |i| i.self_to red }
-      ComplexType.parse(*result.map(&:tag))
+      ComplexType.try_parse(*result.map(&:tag))
     end
 
     def nullable?
@@ -190,21 +206,6 @@ module Solargraph
       @items.all?(&:bot?)
     end
 
-    private
-
-    # @todo This is a quick and dirty hack that forces `self` keywords
-    #   to reference an instance of their class and never the class itself.
-    #   This behavior may change depending on which result is expected
-    #   from YARD conventions. See https://github.com/lsegal/yard/issues/1257
-    # @param dst [String]
-    # @return [String]
-    def reduce_class dst
-      while dst =~ /^(Class|Module)\<(.*?)\>$/
-        dst = dst.sub(/^(Class|Module)\</, '').sub(/\>$/, '')
-      end
-      dst
-    end
-
     class << self
       # Parse type strings into a ComplexType.
       #
@@ -250,7 +251,7 @@ module Solargraph
               elsif base.end_with?('=')
                 raise ComplexTypeError, "Invalid hash thing" unless key_types.nil?
                 # types.push ComplexType.new([UniqueType.new(base[0..-2].strip)])
-                types.push UniqueType.new(base[0..-2].strip)
+                types.push UniqueType.parse(base[0..-2].strip, subtype_string)
                 # @todo this should either expand key_type's type
                 #   automatically or complain about not being
                 #   compatible with key_type's type in type checking
@@ -281,7 +282,7 @@ module Solargraph
               next
             elsif char == ',' && point_stack == 0 && curly_stack == 0 && paren_stack == 0
               # types.push ComplexType.new([UniqueType.new(base.strip, subtype_string.strip)])
-              types.push UniqueType.new(base.strip, subtype_string.strip)
+              types.push UniqueType.parse(base.strip, subtype_string.strip)
               base.clear
               subtype_string.clear
               next
@@ -294,7 +295,7 @@ module Solargraph
           end
           raise ComplexTypeError, "Unclosed subtype in #{type_string}" if point_stack != 0 || curly_stack != 0 || paren_stack != 0
           # types.push ComplexType.new([UniqueType.new(base, subtype_string)])
-          types.push UniqueType.new(base.strip, subtype_string.strip)
+          types.push UniqueType.parse(base.strip, subtype_string.strip)
         end
         unless key_types.nil?
           raise ComplexTypeError, "Invalid use of key/value parameters" unless partial
@@ -311,18 +312,33 @@ module Solargraph
       def try_parse *strings
         parse *strings
       rescue ComplexTypeError => e
-        Solargraph.logger.info "Error parsing complex type: #{e.message}"
+        Solargraph.logger.info "Error parsing complex type `#{strings.join(', ')}`: #{e.message}"
         ComplexType::UNDEFINED
       end
     end
 
     VOID = ComplexType.parse('void')
     UNDEFINED = ComplexType.parse('undefined')
-    SYMBOL = ComplexType.parse('Symbol')
-    ROOT = ComplexType.parse('Class<>')
+    SYMBOL = ComplexType.parse('::Symbol')
+    ROOT = ComplexType.parse('::Class<>')
     NIL = ComplexType.parse('nil')
     SELF = ComplexType.parse('self')
-    BOOLEAN = ComplexType.parse('Boolean')
+    BOOLEAN = ComplexType.parse('::Boolean')
     BOT = ComplexType.parse('bot')
+
+    private
+
+    # @todo This is a quick and dirty hack that forces `self` keywords
+    #   to reference an instance of their class and never the class itself.
+    #   This behavior may change depending on which result is expected
+    #   from YARD conventions. See https://github.com/lsegal/yard/issues/1257
+    # @param dst [String]
+    # @return [String]
+    def reduce_class dst
+      while dst =~ /^(Class|Module)\<(.*?)\>$/
+        dst = dst.sub(/^(Class|Module)\</, '').sub(/\>$/, '')
+      end
+      dst
+    end
   end
 end

data/lib/solargraph/doc_map.rb

@@ -18,9 +18,11 @@ module Solargraph
 
     # @param requires [Array<String>]
     # @param preferences [Array<Gem::Specification>]
-    def initialize(requires, preferences)
+    # @param rbs_path [String, Pathname, nil]
+    def initialize(requires, preferences, rbs_path = nil)
       @requires = requires.compact
       @preferences = preferences.compact
+      @rbs_path = rbs_path
       generate
     end
 
@@ -39,6 +41,7 @@ module Solargraph
       @gems_in_memory ||= {}
     end
 
+    # @return [Set<Gem::Specification>]
     def dependencies
       @dependencies ||= (gemspecs.flat_map { |spec| fetch_dependencies(spec) } - gemspecs).to_set
     end
@@ -57,6 +60,7 @@ module Solargraph
         end
       end
       dependencies.each { |dep| try_cache dep }
+      @uncached_gemspecs.uniq!
     end
 
     # @return [Hash{String => Gem::Specification, nil}]
@@ -75,7 +79,8 @@ module Solargraph
       return if try_gem_in_memory(gemspec)
       cache_file = File.join('gems', "#{gemspec.name}-#{gemspec.version}.ser")
       if Cache.exist?(cache_file)
-        gempins = Cache.load(cache_file)
+        cached = Cache.load(cache_file)
+        gempins = update_from_collection(gemspec, cached)
         self.class.gems_in_memory[gemspec] = gempins
         @pins.concat gempins
       else
@@ -93,7 +98,7 @@ module Solargraph
         @pins.concat map.pins
       else
         # @todo Temporarily ignoring unresolved `require 'set'`
-        Solargraph.logger.warn "Require path #{path} could not be resolved" unless path == 'set'
+        Solargraph.logger.debug "Require path #{path} could not be resolved" unless path == 'set'
       end
     end
 
@@ -107,6 +112,17 @@ module Solargraph
       true
     end
 
+    def update_from_collection gemspec, gempins
+      return gempins unless @rbs_path && File.directory?(@rbs_path)
+      return gempins if RbsMap.new(gemspec.name, gemspec.version).resolved?
+
+      rbs_map = RbsMap.new(gemspec.name, gemspec.version, directories: [@rbs_path])
+      return gempins unless rbs_map.resolved?
+
+      Solargraph.logger.info "Updating #{gemspec.name} #{gemspec.version} from collection"
+      GemPins.combine(gempins, rbs_map)
+    end
+
     # @param path [String]
     # @return [Gem::Specification, nil]
     def resolve_path_to_gemspec path

data/lib/solargraph/gem_pins.rb

@@ -16,13 +16,21 @@ module Solargraph
     def self.build(gemspec)
       yard_pins = build_yard_pins(gemspec)
       rbs_map = RbsMap.from_gemspec(gemspec)
+      combine yard_pins, rbs_map
+    end
+
+    # @param yard_pins [Array<Pin::Base>]
+    # @param rbs_map [RbsMap]
+    # @return [Array<Pin::Base>]
+    def self.combine(yard_pins, rbs_map)
       in_yard = Set.new
       combined = yard_pins.map do |yard|
         in_yard.add yard.path
         next yard unless yard.is_a?(Pin::Method)
+
         rbs = rbs_map.path_pin(yard.path, Pin::Method)
         next yard unless rbs
-        # @todo Could not include: attribute and anon_splat
+
         # @sg-ignore
         yard.class.new(
           location: yard.location,

data/lib/solargraph/language_server/host/dispatch.rb

@@ -34,7 +34,7 @@ module Solargraph
         def update_libraries uri
           src = sources.find(uri)
           using = libraries.select { |lib| lib.contain?(src.filename) }
-          using.push generic_library_for(uri) if using.empty?
+          using.push library_for(uri) if using.empty?
           using.each { |lib| lib.merge src }
           diagnoser.schedule uri
         end
@@ -114,6 +114,13 @@ module Solargraph
         # @return [Library]
         def generic_library
           @generic_library ||= Solargraph::Library.new(Solargraph::Workspace.new('', nil, options), nil)
+                                                  .tap { |lib| lib.add_observer self }
+        end
+
+        # @param library [Solargraph::Library]
+        # @return [void]
+        def update progress
+          progress&.send(self)
         end
       end
     end

data/lib/solargraph/language_server/host/sources.rb

@@ -11,54 +11,10 @@ module Solargraph
         include Observable
         include UriHelpers
 
-        def initialize
-          @mutex = Mutex.new
-          @stopped = true
-          @has_uri = ConditionVariable.new
-        end
-
-        def stopped?
-          @stopped
-        end
-
-        # @return [void]
-        def start
-          return unless @stopped
-          @stopped = false
-          Thread.new do
-            tick until stopped?
-          end
-        end
-
-        # @return [void]
-        def tick
-          uri = mutex.synchronize { next_uri }
-
-          return if queue.include?(uri)
-          mutex.synchronize do
-            nxt = open_source_hash[uri].finish_synchronize
-            open_source_hash[uri] = nxt
-            changed
-            notify_observers uri
-          end
-        end
-
         # @param uri [String]
         # @return [void]
         def add_uri(uri)
           queue.push(uri)
-          @has_uri.signal
-        end
-
-        # @return [String]
-        def next_uri
-          @has_uri.wait(mutex) if queue.empty?
-          queue.shift
-        end
-
-        # @return [void]
-        def stop
-          @stopped = true
         end
 
         # Open a source.
@@ -89,20 +45,7 @@ module Solargraph
         # @return [void]
         def update uri, updater
           src = find(uri)
-          mutex.synchronize { open_source_hash[uri] = src.synchronize(updater) }
-          changed
-          notify_observers uri
-        end
-
-        # @param uri [String]
-        # @param updater [Source::Updater]
-        # @return [void]
-        def async_update uri, updater
-          src = find(uri)
-          mutex.synchronize do
-            open_source_hash[uri] = src.start_synchronize(updater)
-            add_uri(uri)
-          end
+          open_source_hash[uri] = src.synchronize(updater)
           changed
           notify_observers uri
         end
@@ -144,9 +87,6 @@ module Solargraph
           @open_source_hash ||= {}
         end
 
-        # @return [Mutex]
-        attr_reader :mutex
-
         # An array of source URIs that are waiting to finish synchronizing.
         #
         # @return [::Array<String>]