steep 0.14.0 → 0.15.0

data/vendor/ruby-signature/stdlib/set/set.rbs

@@ -1,77 +1,301 @@
+# Set implements a collection of unordered values with no duplicates. This is a
+# hybrid of Array's intuitive inter-operation facilities and Hash's fast lookup.
+#
+# Set is easy to use with Enumerable objects (implementing `each`). Most of the
+# initializer methods and binary operators accept generic Enumerable objects
+# besides sets and arrays.  An Enumerable object can be converted to Set using
+# the `to_set` method.
+#
+# Set uses Hash as storage, so you must note the following points:
+#
+# *   Equality of elements is determined according to Object#eql? and
+#     Object#hash.  Use Set#compare_by_identity to make a set compare its
+#     elements by their identity.
+# *   Set assumes that the identity of each element does not change while it is
+#     stored.  Modifying an element of a set will render the set to an
+#     unreliable state.
+# *   When a string is to be stored, a frozen copy of the string is stored
+#     instead unless the original string is already frozen.
+#
+#
+# ## Comparison
+#
+# The comparison operators <, >, <=, and >= are implemented as shorthand for the
+# {proper_,}{subset?,superset?} methods.  However, the <=> operator is
+# intentionally left out because not every pair of sets is comparable ({x, y}
+# vs. {x, z} for example).
+#
+# ## Example
+#
+#     require 'set'
+#     s1 = Set[1, 2]                        #=> #<Set: {1, 2}>
+#     s2 = [1, 2].to_set                    #=> #<Set: {1, 2}>
+#     s1 == s2                              #=> true
+#     s1.add("foo")                         #=> #<Set: {1, 2, "foo"}>
+#     s1.merge([2, 6])                      #=> #<Set: {1, 2, "foo", 6}>
+#     s1.subset?(s2)                        #=> false
+#     s2.subset?(s1)                        #=> true
+#
+# ## Contact
+#
+#     - Akinori MUSHA <knu@iDaemons.org> (current maintainer)
+#
 class Set[A]
-  def self.`[]`: [X] (*X) -> Set[X]
-
+  # Creates a new set containing the elements of the given enumerable object.
+  #
+  # If a block is given, the elements of enum are preprocessed by the given block.
+  #
+  #     Set.new([1, 2])                       #=> #<Set: {1, 2}>
+  #     Set.new([1, 2, 1])                    #=> #<Set: {1, 2}>
+  #     Set.new([1, 'c', :s])                 #=> #<Set: {1, "c", :s}>
+  #     Set.new(1..5)                         #=> #<Set: {1, 2, 3, 4, 5}>
+  #     Set.new([1, 2, 3]) { |x| x * x }      #=> #<Set: {1, 4, 9}>
+  #
   def initialize: (_Each[A, untyped]) -> untyped
                 | [X] (_Each[X, untyped]) { (X) -> A } -> untyped
                 | (?nil) -> untyped
 
-  def intersection: (_Each[A, untyped]) -> self
+  # Creates a new set containing the given objects.
+  #
+  #     Set[1, 2]                   # => #<Set: {1, 2}>
+  #     Set[1, 2, 1]                # => #<Set: {1, 2}>
+  #     Set[1, 'c', :s]             # => #<Set: {1, "c", :s}>
+  #
+  def self.[]: [X] (*X) -> Set[X]
+
+  # Returns a new set containing elements common to the set and the given
+  # enumerable object.
+  #
+  #     Set[1, 3, 5] & Set[3, 2, 1]             #=> #<Set: {3, 1}>
+  #     Set['a', 'b', 'z'] & ['a', 'b', 'c']    #=> #<Set: {"a", "b"}>
+  #
   def &: (_Each[A, untyped]) -> self
 
-  def union: (_Each[A, untyped]) -> self
-  def `+`: (_Each[A, untyped]) -> self
-  def `|`: (_Each[A, untyped]) -> self
+  alias intersection &
+
+  # Returns a new set built by merging the set and the elements of the given
+  # enumerable object.
+  #
+  #     Set[1, 2, 3] | Set[2, 4, 5]         #=> #<Set: {1, 2, 3, 4, 5}>
+  #     Set[1, 5, 'z'] | (1..6)             #=> #<Set: {1, 5, "z", 2, 3, 4, 6}>
+  #
+  def |: (_Each[A, untyped]) -> self
+
+  alias union |
 
-  def difference: (_Each[A, untyped]) -> self
-  def `-`: (_Each[A, untyped]) -> self
+  alias + |
 
+  # Returns a new set built by duplicating the set, removing every element that
+  # appears in the given enumerable object.
+  #
+  #     Set[1, 3, 5] - Set[1, 5]                #=> #<Set: {3}>
+  #     Set['a', 'b', 'z'] - ['a', 'c']         #=> #<Set: {"b", "z"}>
+  #
+  def -: (_Each[A, untyped]) -> self
+
+  alias difference -
+
+  # Adds the given object to the set and returns self.  Use `merge` to add many
+  # elements at once.
+  #
+  #     Set[1, 2].add(3)                    #=> #<Set: {1, 2, 3}>
+  #     Set[1, 2].add([3, 4])               #=> #<Set: {1, 2, [3, 4]}>
+  #     Set[1, 2].add(2)                    #=> #<Set: {1, 2}>
+  #
   def add: (A) -> self
-  def `<<`: (A) -> self
+
+  alias << add
+
+  # Adds the given object to the set and returns self.  If the object is already
+  # in the set, returns nil.
+  #
+  #     Set[1, 2].add?(3)                    #=> #<Set: {1, 2, 3}>
+  #     Set[1, 2].add?([3, 4])               #=> #<Set: {1, 2, [3, 4]}>
+  #     Set[1, 2].add?(2)                    #=> nil
+  #
   def add?: (A) -> self?
 
-  def member?: (untyped) -> bool
+  # Returns true if the set contains the given object.
+  #
+  # Note that `include?` and `member?` do not test member equality using `==` as
+  # do other Enumerables.
+  #
+  # See also Enumerable#include?
+  #
   def include?: (untyped) -> bool
 
-  def `^`: (_Each[A, untyped]) -> self
+  alias member? include?
 
-  def classify: [X] { (A) -> X } -> Hash[X, self]
+  # Returns a new set containing elements exclusive between the set and the given
+  # enumerable object.  (set ^ enum) is equivalent to ((set | enum) - (set &
+  # enum)).
+  #
+  #     Set[1, 2] ^ Set[2, 3]                   #=> #<Set: {3, 1}>
+  #     Set[1, 'b', 'c'] ^ ['b', 'd']           #=> #<Set: {"d", 1, "c"}>
+  #
+  def ^: (_Each[A, untyped]) -> self
 
-  def clear: -> self
+  # Classifies the set by the return value of the given block and returns a hash
+  # of {value => set of elements} pairs.  The block is called once for each
+  # element of the set, passing the element as parameter.
+  #
+  #     require 'set'
+  #     files = Set.new(Dir.glob("*.rb"))
+  #     hash = files.classify { |f| File.mtime(f).year }
+  #     hash       #=> {2000=>#<Set: {"a.rb", "b.rb"}>,
+  #                #    2001=>#<Set: {"c.rb", "d.rb", "e.rb"}>,
+  #                #    2002=>#<Set: {"f.rb"}>}
+  #
+  # Returns an enumerator if no block is given.
+  #
+  def classify: [X] () { (A) -> X } -> Hash[X, self]
+
+  # Removes all elements and returns self.
+  #
+  #     set = Set[1, 'c', :s]             #=> #<Set: {1, "c", :s}>
+  #     set.clear                         #=> #<Set: {}>
+  #     set                               #=> #<Set: {}>
+  #
+  def clear: () -> self
+
+  # Replaces the elements with ones returned by collect(). Returns an enumerator
+  # if no block is given.
+  #
+  def collect!: () { (A) -> A } -> self
 
-  def collect!: { (A) -> A } -> self
   alias map! collect!
 
+  # Deletes the given object from the set and returns self.  Use `subtract` to
+  # delete many items at once.
+  #
   def delete: (untyped) -> self
+
+  # Deletes the given object from the set and returns self.  If the object is not
+  # in the set, returns nil.
+  #
   def delete?: (untyped) -> self?
 
-  def delete_if: { (A) -> untyped } -> self
-  def reject!: { (A) -> untyped } -> self
+  # Deletes every element of the set for which block evaluates to true, and
+  # returns self. Returns an enumerator if no block is given.
+  #
+  def delete_if: () { (A) -> untyped } -> self
+
+  # Equivalent to Set#delete_if, but returns nil if no changes were made. Returns
+  # an enumerator if no block is given.
+  #
+  def reject!: () { (A) -> untyped } -> self
 
+  # Returns true if the set and the given set have no element in common.  This
+  # method is the opposite of `intersect?`.
+  #
+  #     Set[1, 2, 3].disjoint? Set[3, 4]   #=> false
+  #     Set[1, 2, 3].disjoint? Set[4, 5]   #=> true
+  #
   def disjoint?: (self) -> bool
 
-  def divide: { (A, A) -> untyped } -> Set[self]
-            | { (A) -> untyped } -> Set[self]
+  # Divides the set into a set of subsets according to the commonality defined by
+  # the given block.
+  #
+  # If the arity of the block is 2, elements o1 and o2 are in common if
+  # block.call(o1, o2) is true.  Otherwise, elements o1 and o2 are in common if
+  # block.call(o1) == block.call(o2).
+  #
+  #     require 'set'
+  #     numbers = Set[1, 3, 4, 6, 9, 10, 11]
+  #     set = numbers.divide { |i,j| (i - j).abs == 1 }
+  #     set        #=> #<Set: {#<Set: {1}>,
+  #                #           #<Set: {11, 9, 10}>,
+  #                #           #<Set: {3, 4}>,
+  #                #           #<Set: {6}>}>
+  #
+  # Returns an enumerator if no block is given.
+  #
+  def divide: () { (A, A) -> untyped } -> Set[self]
+            | () { (A) -> untyped } -> Set[self]
 
-  def each: { (A) -> void } -> self
+  # Calls the given block once for each element in the set, passing the element as
+  # parameter.  Returns an enumerator if no block is given.
+  #
+  def each: () { (A) -> void } -> self
 
-  def empty?: -> bool
+  # Returns true if the set contains no elements.
+  #
+  def empty?: () -> bool
 
-  def flatten: -> Set[untyped]
+  # Returns a new set that is a copy of the set, flattening each containing set
+  # recursively.
+  #
+  def flatten: () -> Set[untyped]
 
-  def intersect?: -> bool
+  # Returns true if the set and the given set have at least one element in common.
+  #
+  #     Set[1, 2, 3].intersect? Set[4, 5]   #=> false
+  #     Set[1, 2, 3].intersect? Set[3, 4]   #=> true
+  #
+  def intersect?: () -> bool
 
-  def keep_if: { (A) -> untyped } -> self
+  # Deletes every element of the set for which block evaluates to false, and
+  # returns self. Returns an enumerator if no block is given.
+  #
+  def keep_if: () { (A) -> untyped } -> self
+
+  # Returns the number of elements.
+  #
+  def size: () -> Integer
 
-  def size: -> Integer
   alias length size
 
+  # Merges the elements of the given enumerable object to the set and returns
+  # self.
+  #
   def merge: (_Each[A, untyped]) -> self
 
+  # Returns true if the set is a subset of the given set.
+  #
   def subset?: (self) -> bool
+
   def proper_subst?: (self) -> bool
 
+  # Returns true if the set is a superset of the given set.
+  #
   def superset?: (self) -> bool
+
+  # Returns true if the set is a proper superset of the given set.
+  #
   def proper_superset?: (self) -> bool
 
+  # Replaces the contents of the set with the contents of the given enumerable
+  # object and returns self.
+  #
+  #     set = Set[1, 'c', :s]             #=> #<Set: {1, "c", :s}>
+  #     set.replace([1, 2])               #=> #<Set: {1, 2}>
+  #     set                               #=> #<Set: {1, 2}>
+  #
   def replace: (_Each[A, untyped]) -> self
 
-  def reset: -> self
+  # Resets the internal state after modification to existing elements and returns
+  # self.
+  #
+  # Elements will be reindexed and deduplicated.
+  #
+  def reset: () -> self
 
-  def select!: { (A) -> untyped } -> self?
+  # Equivalent to Set#keep_if, but returns nil if no changes were made. Returns an
+  # enumerator if no block is given.
+  #
+  def select!: () { (A) -> untyped } -> self?
 
+  # Deletes every element that appears in the given enumerable object and returns
+  # self.
+  #
   def subtract: (_Each[A, untyped]) -> self
 
-  def to_a: -> Array[A]
+  # Converts the set to an array.  The order of elements is uncertain.
+  #
+  #     Set[1, 2].to_a                    #=> [1, 2]
+  #     Set[1, 'c', :s].to_a              #=> [1, "c", :s]
+  #
+  def to_a: () -> Array[A]
 
   include Enumerable[A, self]
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: steep
 version: !ruby/object:Gem::Version
-  version: 0.14.0
+  version: 0.15.0
 platform: ruby
 authors:
 - Soutaro Matsumoto
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-02-24 00:00:00.000000000 Z
+date: 2020-05-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -203,7 +203,6 @@ email:
 - matsumoto@soutaro.com
 executables:
 - rbs
-- ruby-signature
 - steep
 extensions: []
 extra_rdoc_files: []
@@ -221,7 +220,6 @@ files:
 - bin/setup
 - bin/smoke_runner.rb
 - exe/rbs
-- exe/ruby-signature
 - exe/steep
 - lib/steep.rb
 - lib/steep/annotation_parser.rb
@@ -294,6 +292,9 @@ files:
 - lib/steep/type_inference/block_params.rb
 - lib/steep/type_inference/constant_env.rb
 - lib/steep/type_inference/context.rb
+- lib/steep/type_inference/context_array.rb
+- lib/steep/type_inference/local_variable_type_env.rb
+- lib/steep/type_inference/logic.rb
 - lib/steep/type_inference/send_args.rb
 - lib/steep/type_inference/type_env.rb
 - lib/steep/typing.rb
@@ -447,48 +448,49 @@ files:
 - vendor/ruby-signature/docs/stdlib.md
 - vendor/ruby-signature/docs/syntax.md
 - vendor/ruby-signature/exe/rbs
-- vendor/ruby-signature/exe/ruby-signature
+- vendor/ruby-signature/lib/rbs.rb
+- vendor/ruby-signature/lib/rbs/ast/annotation.rb
+- vendor/ruby-signature/lib/rbs/ast/comment.rb
+- vendor/ruby-signature/lib/rbs/ast/declarations.rb
+- vendor/ruby-signature/lib/rbs/ast/members.rb
+- vendor/ruby-signature/lib/rbs/buffer.rb
+- vendor/ruby-signature/lib/rbs/builtin_names.rb
+- vendor/ruby-signature/lib/rbs/cli.rb
+- vendor/ruby-signature/lib/rbs/constant.rb
+- vendor/ruby-signature/lib/rbs/constant_table.rb
+- vendor/ruby-signature/lib/rbs/definition.rb
+- vendor/ruby-signature/lib/rbs/definition_builder.rb
+- vendor/ruby-signature/lib/rbs/environment.rb
+- vendor/ruby-signature/lib/rbs/environment_loader.rb
+- vendor/ruby-signature/lib/rbs/environment_walker.rb
+- vendor/ruby-signature/lib/rbs/errors.rb
+- vendor/ruby-signature/lib/rbs/location.rb
+- vendor/ruby-signature/lib/rbs/method_type.rb
+- vendor/ruby-signature/lib/rbs/namespace.rb
+- vendor/ruby-signature/lib/rbs/parser.rb
+- vendor/ruby-signature/lib/rbs/parser.y
+- vendor/ruby-signature/lib/rbs/prototype/rb.rb
+- vendor/ruby-signature/lib/rbs/prototype/rbi.rb
+- vendor/ruby-signature/lib/rbs/prototype/runtime.rb
+- vendor/ruby-signature/lib/rbs/substitution.rb
+- vendor/ruby-signature/lib/rbs/test.rb
+- vendor/ruby-signature/lib/rbs/test/errors.rb
+- vendor/ruby-signature/lib/rbs/test/hook.rb
+- vendor/ruby-signature/lib/rbs/test/setup.rb
+- vendor/ruby-signature/lib/rbs/test/spy.rb
+- vendor/ruby-signature/lib/rbs/test/test_helper.rb
+- vendor/ruby-signature/lib/rbs/test/type_check.rb
+- vendor/ruby-signature/lib/rbs/type_name.rb
+- vendor/ruby-signature/lib/rbs/types.rb
+- vendor/ruby-signature/lib/rbs/variance_calculator.rb
+- vendor/ruby-signature/lib/rbs/vendorer.rb
+- vendor/ruby-signature/lib/rbs/version.rb
+- vendor/ruby-signature/lib/rbs/writer.rb
 - vendor/ruby-signature/lib/ruby/signature.rb
-- vendor/ruby-signature/lib/ruby/signature/ast/annotation.rb
-- vendor/ruby-signature/lib/ruby/signature/ast/comment.rb
-- vendor/ruby-signature/lib/ruby/signature/ast/declarations.rb
-- vendor/ruby-signature/lib/ruby/signature/ast/members.rb
-- vendor/ruby-signature/lib/ruby/signature/buffer.rb
-- vendor/ruby-signature/lib/ruby/signature/builtin_names.rb
-- vendor/ruby-signature/lib/ruby/signature/cli.rb
-- vendor/ruby-signature/lib/ruby/signature/constant.rb
-- vendor/ruby-signature/lib/ruby/signature/constant_table.rb
-- vendor/ruby-signature/lib/ruby/signature/definition.rb
-- vendor/ruby-signature/lib/ruby/signature/definition_builder.rb
-- vendor/ruby-signature/lib/ruby/signature/environment.rb
-- vendor/ruby-signature/lib/ruby/signature/environment_loader.rb
-- vendor/ruby-signature/lib/ruby/signature/environment_walker.rb
-- vendor/ruby-signature/lib/ruby/signature/errors.rb
-- vendor/ruby-signature/lib/ruby/signature/location.rb
-- vendor/ruby-signature/lib/ruby/signature/method_type.rb
-- vendor/ruby-signature/lib/ruby/signature/namespace.rb
-- vendor/ruby-signature/lib/ruby/signature/parser.rb
-- vendor/ruby-signature/lib/ruby/signature/parser.y
-- vendor/ruby-signature/lib/ruby/signature/prototype/rb.rb
-- vendor/ruby-signature/lib/ruby/signature/prototype/rbi.rb
-- vendor/ruby-signature/lib/ruby/signature/prototype/runtime.rb
-- vendor/ruby-signature/lib/ruby/signature/substitution.rb
-- vendor/ruby-signature/lib/ruby/signature/test.rb
-- vendor/ruby-signature/lib/ruby/signature/test/errors.rb
-- vendor/ruby-signature/lib/ruby/signature/test/hook.rb
-- vendor/ruby-signature/lib/ruby/signature/test/setup.rb
-- vendor/ruby-signature/lib/ruby/signature/test/spy.rb
-- vendor/ruby-signature/lib/ruby/signature/test/test_helper.rb
-- vendor/ruby-signature/lib/ruby/signature/test/type_check.rb
-- vendor/ruby-signature/lib/ruby/signature/type_name.rb
-- vendor/ruby-signature/lib/ruby/signature/types.rb
-- vendor/ruby-signature/lib/ruby/signature/variance_calculator.rb
-- vendor/ruby-signature/lib/ruby/signature/vendorer.rb
-- vendor/ruby-signature/lib/ruby/signature/version.rb
-- vendor/ruby-signature/lib/ruby/signature/writer.rb
-- vendor/ruby-signature/ruby-signature.gemspec
+- vendor/ruby-signature/rbs.gemspec
 - vendor/ruby-signature/stdlib/abbrev/abbrev.rbs
 - vendor/ruby-signature/stdlib/base64/base64.rbs
+- vendor/ruby-signature/stdlib/benchmark/benchmark.rbs
 - vendor/ruby-signature/stdlib/builtin/array.rbs
 - vendor/ruby-signature/stdlib/builtin/basic_object.rbs
 - vendor/ruby-signature/stdlib/builtin/binding.rbs
@@ -545,8 +547,11 @@ files:
 - vendor/ruby-signature/stdlib/builtin/true_class.rbs
 - vendor/ruby-signature/stdlib/builtin/unbound_method.rbs
 - vendor/ruby-signature/stdlib/builtin/warning.rbs
+- vendor/ruby-signature/stdlib/coverage/coverage.rbs
+- vendor/ruby-signature/stdlib/csv/csv.rbs
 - vendor/ruby-signature/stdlib/erb/erb.rbs
 - vendor/ruby-signature/stdlib/find/find.rbs
+- vendor/ruby-signature/stdlib/ipaddr/ipaddr.rbs
 - vendor/ruby-signature/stdlib/pathname/pathname.rbs
 - vendor/ruby-signature/stdlib/prime/integer-extension.rbs
 - vendor/ruby-signature/stdlib/prime/prime.rbs
@@ -572,7 +577,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.6
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: Gradual Typing for Ruby

data/exe/ruby-signature

@@ -1,3 +0,0 @@
-#!/usr/bin/env ruby
-
-load File.join(__dir__, "../vendor/ruby-signature/exe/ruby-signature")

data/vendor/ruby-signature/exe/ruby-signature

@@ -1,7 +0,0 @@
-#!/usr/bin/env ruby
-
-$LOAD_PATH << File.join(__dir__, "../lib")
-require "ruby/signature"
-require "ruby/signature/cli"
-
-Ruby::Signature::CLI.new(stdout: STDOUT, stderr: STDERR).run(ARGV.dup)

data/vendor/ruby-signature/lib/ruby/signature/ast/annotation.rb

@@ -1,29 +0,0 @@
-module Ruby
-  module Signature
-    module AST
-      class Annotation
-        attr_reader :string
-        attr_reader :location
-
-        def initialize(string:, location:)
-          @string = string
-          @location = location
-        end
-
-        def ==(other)
-          other.is_a?(Annotation) && other.string == string
-        end
-
-        alias eql? ==
-
-        def hash
-          self.class.hash ^ string.hash
-        end
-
-        def to_json(*a)
-          { string: string, location: location }.to_json(*a)
-        end
-      end
-    end
-  end
-end

data/vendor/ruby-signature/lib/ruby/signature/ast/comment.rb

@@ -1,29 +0,0 @@
-module Ruby
-  module Signature
-    module AST
-      class Comment
-        attr_reader :string
-        attr_reader :location
-
-        def initialize(string:, location:)
-          @string = string
-          @location = location
-        end
-
-        def ==(other)
-          other.is_a?(Comment) && other.string == string
-        end
-
-        alias eql? ==
-
-        def hash
-          self.class.hash ^ string.hash
-        end
-
-        def to_json(*a)
-          { string: string, location: location }.to_json(*a)
-        end
-      end
-    end
-  end
-end