solargraph 0.38.6 → 0.39.0

data/lib/solargraph/yard_map/core_docs.rb

@@ -30,8 +30,8 @@ module Solargraph
         #
         # @return [void]
         def require_minimum
+          FileUtils.mkdir_p File.join(cache_dir, 'gems')
           return unless best_match.nil?
-          FileUtils.mkdir_p cache_dir
           FileUtils.cp File.join(Solargraph::YARDOC_PATH, "#{DEFAULT}.tar.gz"), cache_dir
           install_archive File.join(cache_dir, "#{DEFAULT}.tar.gz")
         end

data/solargraph.gemspec

@@ -31,9 +31,10 @@ Gem::Specification.new do |s|
   s.add_runtime_dependency 'rubocop', '~> 0.52'
   s.add_runtime_dependency 'thor', '~> 1.0'
   s.add_runtime_dependency 'tilt', '~> 2.0'
-  s.add_runtime_dependency 'yard', '~> 0.9'
+  s.add_runtime_dependency 'yard', '~> 0.9', '>= 0.9.24'
 
   s.add_development_dependency 'pry', '~> 0.11.3'
+  s.add_development_dependency 'public_suffix', '~> 3.1'
   s.add_development_dependency 'rspec', '~> 3.5', '>= 3.5.0'
   s.add_development_dependency 'simplecov', '~> 0.14'
   s.add_development_dependency 'webmock', '~> 3.6'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: solargraph
 version: !ruby/object:Gem::Version
-  version: 0.38.6
+  version: 0.39.0
 platform: ruby
 authors:
 - Fred Snyder
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2020-03-22 00:00:00.000000000 Z
+date: 2020-04-26 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: backport
@@ -203,6 +203,9 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.9'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.9.24
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
@@ -210,6 +213,9 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.9'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.9.24
 - !ruby/object:Gem::Dependency
   name: pry
   requirement: !ruby/object:Gem::Requirement
@@ -225,25 +231,39 @@ dependencies:
       - !ruby/object:Gem::Version
         version: 0.11.3
 - !ruby/object:Gem::Dependency
-  name: rspec
+  name: public_suffix
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 3.5.0
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.5'
+        version: '3.1'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.5'
     - - ">="
       - !ruby/object:Gem::Version
         version: 3.5.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '3.5'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.5.0
 - !ruby/object:Gem::Dependency
   name: simplecov
   requirement: !ruby/object:Gem::Requirement
@@ -286,9 +306,9 @@ files:
 - ".yardopts"
 - Gemfile
 - LICENSE
-- OVERVIEW.md
 - README.md
 - Rakefile
+- SPONSORS.md
 - bin/solargraph
 - lib/solargraph.rb
 - lib/solargraph/api_map.rb
@@ -382,6 +402,62 @@ files:
 - lib/solargraph/location.rb
 - lib/solargraph/logging.rb
 - lib/solargraph/page.rb
+- lib/solargraph/parser.rb
+- lib/solargraph/parser/comment_ripper.rb
+- lib/solargraph/parser/legacy.rb
+- lib/solargraph/parser/legacy/class_methods.rb
+- lib/solargraph/parser/legacy/flawed_builder.rb
+- lib/solargraph/parser/legacy/node_chainer.rb
+- lib/solargraph/parser/legacy/node_methods.rb
+- lib/solargraph/parser/legacy/node_processors.rb
+- lib/solargraph/parser/legacy/node_processors/alias_node.rb
+- lib/solargraph/parser/legacy/node_processors/args_node.rb
+- lib/solargraph/parser/legacy/node_processors/begin_node.rb
+- lib/solargraph/parser/legacy/node_processors/block_node.rb
+- lib/solargraph/parser/legacy/node_processors/casgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/cvasgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/def_node.rb
+- lib/solargraph/parser/legacy/node_processors/defs_node.rb
+- lib/solargraph/parser/legacy/node_processors/gvasgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/ivasgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/lvasgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/namespace_node.rb
+- lib/solargraph/parser/legacy/node_processors/orasgn_node.rb
+- lib/solargraph/parser/legacy/node_processors/resbody_node.rb
+- lib/solargraph/parser/legacy/node_processors/sclass_node.rb
+- lib/solargraph/parser/legacy/node_processors/send_node.rb
+- lib/solargraph/parser/legacy/node_processors/sym_node.rb
+- lib/solargraph/parser/node_methods.rb
+- lib/solargraph/parser/node_processor.rb
+- lib/solargraph/parser/node_processor/base.rb
+- lib/solargraph/parser/region.rb
+- lib/solargraph/parser/rubyvm.rb
+- lib/solargraph/parser/rubyvm/class_methods.rb
+- lib/solargraph/parser/rubyvm/node_chainer.rb
+- lib/solargraph/parser/rubyvm/node_methods.rb
+- lib/solargraph/parser/rubyvm/node_processors.rb
+- lib/solargraph/parser/rubyvm/node_processors/alias_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/args_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/begin_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/block_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/casgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/cvasgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/def_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/defs_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/gvasgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/ivasgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/kw_arg_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/lit_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/lvasgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/namespace_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/opt_arg_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/orasgn_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/resbody_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/sclass_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/scope_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/send_node.rb
+- lib/solargraph/parser/rubyvm/node_processors/sym_node.rb
+- lib/solargraph/parser/snippet.rb
 - lib/solargraph/pin.rb
 - lib/solargraph/pin/attribute.rb
 - lib/solargraph/pin/base.rb
@@ -410,6 +486,7 @@ files:
 - lib/solargraph/pin/reference/extend.rb
 - lib/solargraph/pin/reference/include.rb
 - lib/solargraph/pin/reference/override.rb
+- lib/solargraph/pin/reference/prepend.rb
 - lib/solargraph/pin/reference/require.rb
 - lib/solargraph/pin/reference/superclass.rb
 - lib/solargraph/pin/singleton.rb
@@ -439,39 +516,18 @@ files:
 - lib/solargraph/source/change.rb
 - lib/solargraph/source/cursor.rb
 - lib/solargraph/source/encoding_fixes.rb
-- lib/solargraph/source/flawed_builder.rb
-- lib/solargraph/source/node_chainer.rb
-- lib/solargraph/source/node_methods.rb
 - lib/solargraph/source/source_chainer.rb
 - lib/solargraph/source/updater.rb
 - lib/solargraph/source_map.rb
 - lib/solargraph/source_map/clip.rb
 - lib/solargraph/source_map/completion.rb
 - lib/solargraph/source_map/mapper.rb
-- lib/solargraph/source_map/node_processor.rb
-- lib/solargraph/source_map/node_processor/alias_node.rb
-- lib/solargraph/source_map/node_processor/args_node.rb
-- lib/solargraph/source_map/node_processor/base.rb
-- lib/solargraph/source_map/node_processor/begin_node.rb
-- lib/solargraph/source_map/node_processor/block_node.rb
-- lib/solargraph/source_map/node_processor/casgn_node.rb
-- lib/solargraph/source_map/node_processor/cvasgn_node.rb
-- lib/solargraph/source_map/node_processor/def_node.rb
-- lib/solargraph/source_map/node_processor/defs_node.rb
-- lib/solargraph/source_map/node_processor/gvasgn_node.rb
-- lib/solargraph/source_map/node_processor/ivasgn_node.rb
-- lib/solargraph/source_map/node_processor/lvasgn_node.rb
-- lib/solargraph/source_map/node_processor/namespace_node.rb
-- lib/solargraph/source_map/node_processor/orasgn_node.rb
-- lib/solargraph/source_map/node_processor/resbody_node.rb
-- lib/solargraph/source_map/node_processor/sclass_node.rb
-- lib/solargraph/source_map/node_processor/send_node.rb
-- lib/solargraph/source_map/node_processor/sym_node.rb
-- lib/solargraph/source_map/region.rb
 - lib/solargraph/stdlib_fills.rb
 - lib/solargraph/type_checker.rb
+- lib/solargraph/type_checker/checks.rb
 - lib/solargraph/type_checker/param_def.rb
 - lib/solargraph/type_checker/problem.rb
+- lib/solargraph/type_checker/rules.rb
 - lib/solargraph/version.rb
 - lib/solargraph/views/_method.erb
 - lib/solargraph/views/_name_type_tag.erb
@@ -511,7 +567,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.3
+rubygems_version: 3.1.2
 signing_key: 
 specification_version: 4
 summary: A Ruby language server

data/OVERVIEW.md

@@ -1,37 +0,0 @@
-# An Overview of Solargraph
-
-The Solargraph library consists of two major groups of components: the data providers and the language servers. The data providers manage the maps of information about a program. The language servers are the concrete implementations of transports and messages that enable the language server protocol.
-
-## Data Providers
-
-**ApiMap** (`Solargraph::ApiMap`): The component that provides information about a program based on its Workspace, external gems, and the Ruby core.
-
-**Workspace** (`Solargraph::Workspace`): A collection of Sources that comprise a project. Workspaces have configurations that define which files to include in maps and other project-related options. Users can configure the Workspace through a .solargraph.yml file in a project's root directory.
-
-**Source** (`Solargraph::Source`): Data about a single Ruby file. Sources parse Ruby code into an AST and handle incremental updates.
-
-**SourceMap** (`Solargraph::SourceMap`): A Source with generated pins for use in ApiMaps.
-
-**Pins** (`Solargraph::Pin`): Information about classes, modules, methods, variables, etc. Pins for different types of components extend `Pin::Base`. Most ApiMap queries return results as an array of Pins.
-
-**Cursor** (`Solargraph::Source::Cursor`): Information about a specific location in a Source.
-
-**Clip** (`Solargraph::SourceMap::Clip`): A Cursor bundled with an ApiMap to provide definitions, completions, and other information.
-
-**YardMap** (`Solargraph::YardMap`): A collection of YARD documents. ApiMaps use YardMaps to gather data from external gems and the Ruby core.
-
-**Library** (`Solargraph::Library`): The component that synchronizes a Workspace with an ApiMap. Libraries help ensure that the ApiMap gets updated when a file in the Workspace changes.
-
-## Language Servers
-
-**Host** (`Solargraph::LanguageServer::Host`): The component responsible for processing messages between the server and the client. Hosts maintain a project's Library and provide thread-safe methods for asynchronous operations.
-
-**Messages** (`Solargraph::LanguageServer::Message`): Implementations of LSP methods and notifications. Each message implementation extends `Message::Base`.
-
-**Transports** (`Solargraph::LanguageServer::Transport`): Server implementations for various protocols. The two transports that are currently supported are socket and stdio. The `Transport::DataReader` class provides a common interface for processing incoming JSON-RPC messages.
-
-## More Information
-
-The [EXAMPLES.md](EXAMPLES.md) document provides simple examples of how to use, extend, and modify the Solargraph library.
-
-Refer to [LANGUAGE_SERVER.md](LANGUAGE_SERVER.md) for information about connecting language clients to Solargraph language servers.

data/lib/solargraph/source/flawed_builder.rb

@@ -1,15 +0,0 @@
-# frozen_string_literal: true
-
-module Solargraph
-  class Source
-    # A custom builder for source parsers that ignores character encoding
-    # issues in literal strings.
-    #
-    class FlawedBuilder < Parser::Builders::Default
-      def string_value(token)
-        value(token)
-      end
-    end
-    private_constant :FlawedBuilder
-  end
-end

data/lib/solargraph/source/node_chainer.rb

@@ -1,111 +0,0 @@
-# frozen_string_literal: true
-
-module Solargraph
-  class Source
-    # A factory for generating chains from nodes.
-    #
-    class NodeChainer
-      include Source::NodeMethods
-
-      # @param node [Parser::AST::Node]
-      # @param filename [String]
-      def initialize node, filename = nil, in_block = false
-        @node = node
-        @filename = filename
-        @in_block = in_block
-      end
-
-      # @return [Source::Chain]
-      def chain
-        links = generate_links(@node)
-        Chain.new(links)
-      end
-
-      class << self
-        # @param node [Parser::AST::Node]
-        # @param filename [String]
-        # @return [Chain]
-        def chain node, filename = nil, in_block = false
-          NodeChainer.new(node, filename, in_block).chain
-        end
-
-        # @param code [String]
-        # @return [Chain]
-        def load_string(code)
-          node = Source.parse(code.sub(/\.$/, ''))
-          chain = NodeChainer.new(node).chain
-          chain.links.push(Chain::Link.new) if code.end_with?('.')
-          chain
-        end
-      end
-
-      private
-
-      # @param n [Parser::AST::Node]
-      # @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
-        result = []
-        if n.type == :block
-          @in_block = true
-          result.concat generate_links(n.children[0])
-          @in_block = false
-        elsif n.type == :send
-          if n.children[0].is_a?(Parser::AST::Node)
-            result.concat generate_links(n.children[0])
-            args = []
-            n.children[2..-1].each do |c|
-              args.push NodeChainer.chain(c)
-            end
-            result.push Chain::Call.new(n.children[1].to_s, args, @in_block || block_passed?(n))
-          elsif n.children[0].nil?
-            args = []
-            n.children[2..-1].each do |c|
-              args.push NodeChainer.chain(c)
-            end
-            result.push Chain::Call.new(n.children[1].to_s, args, @in_block || block_passed?(n))
-          else
-            raise "No idea what to do with #{n}"
-          end
-        elsif n.type == :self
-          result.push Chain::Head.new('self')
-        elsif n.type == :zsuper
-          result.push Chain::Head.new('super')
-        elsif n.type == :const
-          const = unpack_name(n)
-          result.push Chain::Constant.new(const)
-        elsif [:lvar, :lvasgn].include?(n.type)
-          result.push Chain::Call.new(n.children[0].to_s)
-        elsif [:ivar, :ivasgn].include?(n.type)
-          result.push Chain::InstanceVariable.new(n.children[0].to_s)
-        elsif [:cvar, :cvasgn].include?(n.type)
-          result.push Chain::ClassVariable.new(n.children[0].to_s)
-        elsif [:gvar, :gvasgn].include?(n.type)
-          result.push Chain::GlobalVariable.new(n.children[0].to_s)
-        elsif n.type == :or_asgn
-          result.concat generate_links n.children[1]
-        elsif [:class, :module, :def, :defs].include?(n.type)
-          # @todo Undefined or what?
-          result.push Chain::UNDEFINED_CALL
-        elsif n.type == :and
-          result.concat generate_links(n.children.last)
-        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])
-        elsif n.type == :block_pass
-          result.push Chain::BlockVariable.new("&#{n.children[0].children[0].to_s}")
-        else
-          lit = infer_literal_node_type(n)
-          result.push (lit ? Chain::Literal.new(lit) : Chain::Link.new)
-        end
-        result
-      end
-
-      def block_passed? node
-        node.children.last.is_a?(Parser::AST::Node) && node.children.last.type == :block_pass
-      end
-    end
-  end
-end

data/lib/solargraph/source/node_methods.rb

@@ -1,240 +0,0 @@
-# frozen_string_literal: true
-
-module Solargraph
-  class Source
-    module NodeMethods
-      module_function
-
-      # @param node [Parser::AST::Node]
-      # @return [String]
-      def unpack_name(node)
-        pack_name(node).join("::")
-      end
-
-      # @param node [Parser::AST::Node]
-      # @return [Array<String>]
-      def pack_name(node)
-        parts = []
-        if node.is_a?(AST::Node)
-          node.children.each { |n|
-            if n.is_a?(AST::Node)
-              if n.type == :cbase
-                parts = [''] + pack_name(n)
-              else
-                parts += pack_name(n)
-              end
-            else
-              parts.push n unless n.nil?
-            end
-          }
-        end
-        parts
-      end
-
-      # @param node [Parser::AST::Node]
-      # @return [String]
-      def const_from node
-        if node.is_a?(AST::Node) and node.type == :const
-          result = ''
-          unless node.children[0].nil?
-            result = const_from(node.children[0])
-          end
-          if result == ''
-            result = node.children[1].to_s
-          else
-            result = result + '::' + node.children[1].to_s
-          end
-          result
-        else
-          nil
-        end
-      end
-
-      # @param node [Parser::AST::Node]
-      # @return [String]
-      def infer_literal_node_type node
-        return nil unless node.is_a?(AST::Node)
-        if node.type == :str || node.type == :dstr
-          return '::String'
-        elsif node.type == :array
-          return '::Array'
-        elsif node.type == :hash
-          return '::Hash'
-        elsif node.type == :int
-          return '::Integer'
-        elsif node.type == :float
-          return '::Float'
-        elsif node.type == :sym
-          return '::Symbol'
-        elsif node.type == :regexp
-          return '::Regexp'
-        elsif node.type == :irange
-          return '::Range'
-        elsif node.type == :true || node.type == :false
-          return '::Boolean'
-        # @todo Support `nil` keyword in types
-        # elsif node.type == :nil
-        #   return 'NilClass'
-        end
-        nil
-      end
-
-      # Get a call signature from a node.
-      # The result should be a string in the form of a method path, e.g.,
-      # String.new or variable.method.
-      #
-      # @param node [Parser::AST::Node]
-      # @return [String]
-      def resolve_node_signature node
-        result = drill_signature node, ''
-        return nil if result.empty?
-        result
-      end
-
-      # @param node [Parser::AST::Node]
-      # @return [Position]
-      def get_node_start_position(node)
-        Position.new(node.loc.line, node.loc.column)
-      end
-
-      # @param node [Parser::AST::Node]
-      # @return [Position]
-      def get_node_end_position(node)
-        Position.new(node.loc.last_line, node.loc.last_column)
-      end
-
-      def drill_signature node, signature
-        return signature unless node.is_a?(AST::Node)
-        if node.type == :const or node.type == :cbase
-          unless node.children[0].nil?
-            signature += drill_signature(node.children[0], signature)
-          end
-          signature += '::' unless signature.empty?
-          signature += node.children[1].to_s
-        elsif node.type == :lvar or node.type == :ivar or node.type == :cvar
-          signature += '.' unless signature.empty?
-          signature += node.children[0].to_s
-        elsif node.type == :send
-          unless node.children[0].nil?
-            signature += drill_signature(node.children[0], signature)
-          end
-          signature += '.' unless signature.empty?
-          signature += node.children[1].to_s
-        end
-        signature
-      end
-
-      NIL_NODE = Parser::AST::Node.new(:nil)
-
-      # Find all the nodes within the provided node that potentially return a
-      # value.
-      #
-      # The node parameter typically represents a method's logic, e.g., the
-      # second child (after the :args node) of a :def node. A simple one-line
-      # method would typically return itself, while a node with conditions
-      # would return the resulting node from each conditional branch. Nodes
-      # that follow a :return node are assumed to be unreachable. Nil values
-      # are converted to nil node types.
-      #
-      # @param node [Parser::AST::Node]
-      # @return [Array<Parser::AST::Node>]
-      def returns_from node
-        DeepInference.get_return_nodes(node).map { |n| n || NIL_NODE }
-      end
-
-      module DeepInference
-        class << self
-          CONDITIONAL = [:if, :unless]
-          REDUCEABLE = [:begin, :kwbegin]
-          SKIPPABLE = [:def, :defs, :class, :sclass, :module]
-
-          # @param node [Parser::AST::Node]
-          # @return [Array<Parser::AST::Node>]
-          def get_return_nodes node
-            return [] unless node.is_a?(Parser::AST::Node)
-            result = []
-            if REDUCEABLE.include?(node.type)
-              result.concat get_return_nodes_from_children(node)
-            elsif CONDITIONAL.include?(node.type)
-              result.concat reduce_to_value_nodes(node.children[1..-1])
-            elsif node.type == :and || node.type == :or
-              result.concat reduce_to_value_nodes(node.children)
-            elsif node.type == :return
-              result.concat reduce_to_value_nodes([node.children[0]])
-            elsif node.type == :block
-              result.push node
-              # result.concat reduce_to_value_nodes([node.children[0]])
-              result.concat get_return_nodes_only(node.children[2])
-            else
-              result.push node
-            end
-            result
-          end
-
-          private
-
-          def get_return_nodes_from_children parent
-            result = []
-            nodes = parent.children.select{|n| n.is_a?(AST::Node)}
-            nodes.each_with_index do |node, idx|
-              if node.type == :block
-                result.concat get_return_nodes_only(node.children[2])
-              elsif SKIPPABLE.include?(node.type)
-                next
-              elsif node.type == :return
-                result.concat reduce_to_value_nodes([node.children[0]])
-                # Return the result here because the rest of the code is
-                # unreachable
-                return result
-              else
-                result.concat get_return_nodes_only(node)
-              end
-              result.concat reduce_to_value_nodes([nodes.last]) if idx == nodes.length - 1
-            end
-            result
-          end
-
-          def get_return_nodes_only parent
-            return [] unless parent.is_a?(Parser::AST::Node)
-            result = []
-            nodes = parent.children.select{|n| n.is_a?(Parser::AST::Node)}
-            nodes.each do |node|
-              next if SKIPPABLE.include?(node.type)
-              if node.type == :return
-                result.concat reduce_to_value_nodes([node.children[0]])
-                # Return the result here because the rest of the code is
-                # unreachable
-                return result
-              else
-                result.concat get_return_nodes_only(node)
-              end
-            end
-            result
-          end
-
-          def reduce_to_value_nodes nodes
-            result = []
-            nodes.each do |node|
-              if !node.is_a?(Parser::AST::Node)
-                result.push nil
-              elsif REDUCEABLE.include?(node.type)
-                result.concat get_return_nodes_from_children(node)
-              elsif CONDITIONAL.include?(node.type)
-                result.concat reduce_to_value_nodes(node.children[1..-1])
-              elsif node.type == :return
-                result.concat get_return_nodes(node.children[0])
-              elsif node.type == :and || node.type == :or
-                result.concat reduce_to_value_nodes(node.children)
-              elsif node.type == :block
-                result.concat get_return_nodes_only(node.children[2])
-              else
-                result.push node
-              end
-            end
-            result
-          end
-        end
-      end
-    end
-  end
-end