steep-activesupport-4 1.9.3

data/lib/steep/subtyping/constraints.rb

@@ -0,0 +1,341 @@
+module Steep
+  module Subtyping
+    class Constraints
+      class UnsatisfiedInvariantError < StandardError
+        attr_reader :constraints
+        attr_reader :reason
+
+        def initialize(reason:, constraints:)
+          @reason = reason
+          @constraints = constraints
+          super "Invalid constraint: reason=#{reason.message}, constraints=#{constraints.to_s}"
+        end
+
+        class VariablesUnknownsNotDisjoint
+          attr_reader :vars
+
+          def initialize(vars:)
+            @vars = vars
+          end
+
+          def message
+            "Variables and unknowns should be disjoint (#{vars})"
+          end
+        end
+
+        class VariablesFreeVariablesNotDisjoint
+          attr_reader :var
+          attr_reader :lower_bound
+          attr_reader :upper_bound
+
+          def initialize(var:, lower_bound:, upper_bound:)
+            @var = var
+            @lower_bound = lower_bound
+            @upper_bound = upper_bound
+          end
+
+          def message
+            "Variables and FV(constraints) should be disjoint (#{var}, #{lower_bound}, #{upper_bound})"
+          end
+        end
+
+        class UnknownsFreeVariableNotDisjoint
+          attr_reader :var
+          attr_reader :upper_bound
+          attr_reader :lower_bound
+
+          def initialize(var:, lower_bound:, upper_bound:)
+            @var = var
+            @lower_bound = lower_bound
+            @upper_bound = upper_bound
+          end
+
+          def message
+            "Unknowns and FV(constraints) should be disjoint (#{var}, #{lower_bound}, #{upper_bound})"
+          end
+        end
+      end
+
+      class UnsatisfiableConstraint < StandardError
+        attr_reader :var
+        attr_reader :sub_type
+        attr_reader :super_type
+        attr_reader :result
+
+        def initialize(var:, sub_type:, super_type:, result:)
+          @var = var
+          @sub_type = sub_type
+          @super_type = super_type
+          @result = result
+
+          super "Unsatisfiable constraint on #{var}: #{sub_type} <: #{super_type}"
+        end
+      end
+
+      attr_reader :dictionary
+      attr_reader :vars
+
+      def initialize(unknowns:)
+        @dictionary = {}
+        @vars = Set.new
+
+        unknowns.each do |var|
+          dictionary[var] = [Set.new, Set.new, Set.new]
+        end
+      end
+
+      def self.empty
+        new(unknowns: [])
+      end
+
+      def add_var(*vars)
+        vars.each do |var|
+          self.vars << var
+        end
+
+        unless Set.new(vars).disjoint?(unknowns)
+          raise UnsatisfiedInvariantError.new(
+            reason: UnsatisfiedInvariantError::VariablesUnknownsNotDisjoint.new(vars: vars),
+            constraints: self
+          )
+        end
+      end
+
+      def add(var, sub_type: nil, super_type: nil, skip: false)
+        subs, supers, skips = dictionary.fetch(var)
+
+        if sub_type.is_a?(AST::Types::Logic::Base)
+          sub_type = AST::Builtin.bool_type
+        end
+
+        if super_type.is_a?(AST::Types::Logic::Base)
+          super_type = AST::Builtin.bool_type
+        end
+
+        if super_type && !super_type.is_a?(AST::Types::Top)
+          type = eliminate_variable(super_type, to: AST::Types::Top.instance)
+          supers << type
+          skips << type if skip
+        end
+
+        if sub_type && !sub_type.is_a?(AST::Types::Bot)
+          type = eliminate_variable(sub_type, to: AST::Types::Bot.instance)
+          subs << type
+          skips << type if skip
+        end
+
+        super_fvs = supers.each_with_object(Set.new) do |type, fvs|
+          fvs.merge(type.free_variables)
+        end
+        sub_fvs = subs.each_with_object(Set.new) do |type, fvs|
+          fvs.merge(type.free_variables)
+        end
+
+        unless super_fvs.disjoint?(unknowns) || sub_fvs.disjoint?(unknowns)
+          raise UnsatisfiedInvariantError.new(
+            reason: UnsatisfiedInvariantError::UnknownsFreeVariableNotDisjoint.new(
+              var: var,
+              lower_bound: sub_type,
+              upper_bound: super_type
+            ),
+            constraints: self
+          )
+        end
+      end
+
+      def eliminate_variable(type, to:)
+        case type
+        when AST::Types::Name::Instance, AST::Types::Name::Alias, AST::Types::Name::Interface
+          type.args.map do |ty|
+            eliminate_variable(ty, to: AST::Types::Any.instance)
+          end.yield_self do |args|
+            type.class.new(name: type.name, args: args)
+          end
+        when AST::Types::Union
+          type.types.map do |ty|
+            eliminate_variable(ty, to: AST::Types::Any.instance)
+          end.yield_self do |types|
+            AST::Types::Union.build(types: types)
+          end
+        when AST::Types::Intersection
+          type.types.map do |ty|
+            eliminate_variable(ty, to: AST::Types::Any.instance)
+          end.yield_self do |types|
+            AST::Types::Intersection.build(types: types)
+          end
+        when AST::Types::Var
+          if vars.member?(type.name)
+            to
+          else
+            type
+          end
+        when AST::Types::Tuple
+          AST::Types::Tuple.new(
+            types: type.types.map {|ty| eliminate_variable(ty, to: AST::Builtin.any_type) }
+          )
+        when AST::Types::Record
+          type.map_type { eliminate_variable(_1, to: AST::Builtin.any_type) }
+        when AST::Types::Proc
+          type.map_type {|ty| eliminate_variable(ty, to: AST::Builtin.any_type) }
+        else
+          type
+        end
+      end
+
+      def unknown?(var)
+        dictionary.key?(var)
+      end
+
+      def unknowns
+        Set.new(dictionary.keys)
+      end
+
+      def unknown!(var)
+        unless unknown?(var)
+          dictionary[var] = [Set.new, Set.new, Set.new]
+        end
+      end
+
+      def empty?
+        dictionary.keys.empty?
+      end
+
+      def upper_bound(var, skip: false)
+        if skip
+          upper_bound = upper_bound_types(var)
+        else
+          _, upper_bound, _ = dictionary.fetch(var)
+        end
+
+        case upper_bound.size
+        when 0
+          AST::Types::Top.instance
+        when 1
+          upper_bound.first || raise
+        else
+          AST::Types::Intersection.build(types: upper_bound.to_a)
+        end
+      end
+
+      def lower_bound(var, skip: false)
+        lower_bound = lower_bound_types(var)
+
+        case lower_bound.size
+        when 0
+          AST::Types::Bot.instance
+        when 1
+          lower_bound.first || raise
+        else
+          AST::Types::Union.build(types: lower_bound.to_a)
+        end
+      end
+
+      Context = _ = Struct.new(:variance, :self_type, :instance_type, :class_type, keyword_init: true)
+
+      def solution(checker, variance: nil, variables:, self_type: nil, instance_type: nil, class_type: nil, context: nil)
+        if context
+          raise if variance
+          raise if self_type
+          raise if instance_type
+          raise if class_type
+
+          variance = context.variance
+          self_type = context.self_type
+          instance_type = context.instance_type
+          class_type = context.class_type
+        end
+
+        vars = [] #: Array[Symbol]
+        types = [] #: Array[AST::Types::t]
+
+        dictionary.each_key do |var|
+          if variables.include?(var)
+            if has_constraint?(var)
+              relation = Relation.new(
+                sub_type: lower_bound(var, skip: false),
+                super_type: upper_bound(var, skip: false)
+              )
+
+              checker.check(relation, self_type: self_type, instance_type: instance_type, class_type: class_type, constraints: self.class.empty).yield_self do |result|
+                if result.success?
+                  vars << var
+
+                  upper_bound = upper_bound(var, skip: true)
+                  lower_bound = lower_bound(var, skip: true)
+
+                  type =
+                    case
+                    when variance.contravariant?(var)
+                      upper_bound
+                    when variance.covariant?(var)
+                      lower_bound
+                    else
+                      if lower_bound.level.join > upper_bound.level.join
+                        upper_bound
+                      else
+                        lower_bound
+                      end
+                    end
+
+                  types << type
+                else
+                  raise UnsatisfiableConstraint.new(
+                    var: var,
+                    sub_type: result.relation.sub_type,
+                    super_type: result.relation.super_type,
+                    result: result
+                  )
+                end
+              end
+            else
+              vars << var
+              types << AST::Types::Any.instance
+            end
+          end
+        end
+
+        Interface::Substitution.build(vars, types)
+      end
+
+      def has_constraint?(var)
+        !upper_bound_types(var).empty? || !lower_bound_types(var).empty?
+      end
+
+      def each
+        if block_given?
+          dictionary.each_key do |var|
+            yield [var, lower_bound(var), upper_bound(var)]
+          end
+        else
+          enum_for :each
+        end
+      end
+
+      def to_s
+        strings = each.map do |var, lower_bound, upper_bound|
+          "#{lower_bound} <: #{var} <: #{upper_bound}"
+        end
+
+        "#{unknowns.to_a.join(",")}/#{vars.to_a.join(",")} |- { #{strings.join(", ")} }"
+      end
+
+      def lower_bound_types(var_name)
+        lower, _, _ = dictionary.fetch(var_name)
+        lower
+      end
+
+      def upper_bound_types(var_name)
+        _, upper, skips = dictionary.fetch(var_name)
+
+        case
+        when upper.empty?
+          skips
+        when skips.empty?
+          upper
+        else
+          upper - skips
+        end
+      end
+    end
+  end
+end

data/lib/steep/subtyping/relation.rb

@@ -0,0 +1,101 @@
+module Steep
+  module Subtyping
+    class Relation
+      attr_reader :sub_type
+      attr_reader :super_type
+
+      def initialize(sub_type:, super_type:)
+        @sub_type = sub_type
+        @super_type = super_type
+      end
+
+      def hash
+        self.class.hash ^ sub_type.hash ^ super_type.hash
+      end
+
+      def ==(other)
+        other.is_a?(self.class) && other.sub_type == sub_type && other.super_type == super_type
+      end
+
+      alias eql? ==
+
+      def to_s
+        "#{sub_type} <: #{super_type}"
+      end
+
+      def to_ary
+        [sub_type, super_type]
+      end
+
+      def type?
+        !interface? && !method? && !function? && !params? && !block?
+      end
+
+      def interface?
+        sub_type.is_a?(Interface::Shape) && super_type.is_a?(Interface::Shape)
+      end
+
+      def method?
+        (sub_type.is_a?(Interface::Shape::Entry) || sub_type.is_a?(Interface::MethodType)) &&
+          (super_type.is_a?(Interface::Shape::Entry) || super_type.is_a?(Interface::MethodType))
+      end
+
+      def function?
+        sub_type.is_a?(Interface::Function) && super_type.is_a?(Interface::Function)
+      end
+
+      def params?
+        sub_type.is_a?(Interface::Function::Params) && super_type.is_a?(Interface::Function::Params)
+      end
+
+      def block?
+        (sub_type.is_a?(Interface::Block) || !sub_type) &&
+          (!super_type || super_type.is_a?(Interface::Block))
+      end
+
+      def assert_type(type)
+        unless __send__(:"#{type}?")
+          raise "#{type}? is expected but: sub_type=#{sub_type.class}, super_type=#{super_type.class}"
+        end
+      end
+
+      def type!
+        assert_type(:type)
+      end
+
+      def interface!
+        assert_type(:interface)
+      end
+
+      def method!
+        assert_type(:method)
+      end
+
+      def function!
+        assert_type(:function)
+      end
+
+      def params!
+        assert_type(:params)
+      end
+
+      def block!
+        assert_type(:block)
+      end
+
+      def map
+        self.class.new(
+          sub_type: yield(sub_type),
+          super_type: yield(super_type)
+        )
+      end
+
+      def flip
+        self.class.new(
+          sub_type: super_type,
+          super_type: sub_type
+        )
+      end
+    end
+  end
+end