sorbet-runtime 0.6.12449 → 0.6.12652

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4ff0f5980373a88353853602b3a4189fa30606d521590a275a5e7a9c1975f0ad
-  data.tar.gz: a78f95a6c6d6e62cebb983a636b652a6d91a3914679305f32bd74b8866684759
+  metadata.gz: 3b5ae526c822c1b9eac7f55430c678b64b807489cf4326c51c3a31f48ca4a8c0
+  data.tar.gz: 901ac0445af6e20b17df21d2366ed09da7abaf54cbefe728ffd005fd553c1daf
 SHA512:
-  metadata.gz: b426d793bdb378528590f2d3d68e4ca0458ae81d9c5ea126ea8a7c6b5a8e295b094f85f9c0151ff58cdc577d04fee8cc7880b45390071dda46d8492e07f0204b
-  data.tar.gz: e651470c0acf174f8789cce1bea7fe857326c751f1055ea97c6e952799d0355d7dc3a219fa2594327c58bf895ae291ae3b0f82167ef6d5c194395b986f9e4e3a
+  metadata.gz: 79f837c6cf32a3737045ad77d12945f8b8c79a46431c211b5014b2e425980249f2b118362e78e89239706e1456ad3a045910611fb152f48ed714a5626f6a458b
+  data.tar.gz: b9cd8500296a6aad4250d6df216fa32e4007cf282a6273ac2247b8102b44f0f71bb7908e0c0a2e0aeccd0643b881fac95dd540c5ac6e3d61420ade1483972966

data/lib/types/configuration.rb

@@ -546,16 +546,6 @@ module T::Configuration
     @legacy_t_enum_migration_mode || false
   end
 
-  @prop_freeze_handler = ->(instance, prop_name) {}
-
-  def self.prop_freeze_handler=(handler)
-    @prop_freeze_handler = handler
-  end
-
-  def self.prop_freeze_handler
-    @prop_freeze_handler
-  end
-
   @sealed_violation_whitelist = nil
   # @param [Array] sealed_violation_whitelist An array of Regexp to validate
   #   whether inheriting /including a sealed module outside the defining module

data/lib/types/private/abstract/data.rb

@@ -12,7 +12,7 @@
 # modules that override the `hash` method with something completely broken.
 module T::Private::Abstract::Data
   def self.get(mod, key)
-    mod.instance_variable_get("@opus_abstract__#{key}") if key?(mod, key)
+    mod.instance_variable_get("@opus_abstract__#{key}")
   end
 
   def self.set(mod, key, value)

data/lib/types/private/methods/_methods.rb

@@ -104,24 +104,6 @@ module T::Private::Methods
     T::Types::Proc.new(decl.params, decl.returns)
   end
 
-  # Returns the signature for a method whose definition was preceded by `sig`.
-  #
-  # @param method [UnboundMethod]
-  # @return [T::Private::Methods::Signature]
-  def self.signature_for_method(method)
-    signature_for_key(method_to_key(method))
-  end
-
-  private_class_method def self.signature_for_key(key)
-    maybe_run_sig_block_for_key(key)
-
-    # If a subclass Sub inherits a method `foo` from Base, then
-    # Sub.instance_method(:foo) != Base.instance_method(:foo) even though they resolve to the
-    # same method. Similarly, Foo.method(:bar) != Foo.singleton_class.instance_method(:bar).
-    # So, we always do the look up by the method on the owner (Base in this example).
-    @signatures_by_method[key]
-  end
-
   # Fetch the directory name of the file that defines the `T::Private` constant and
   # add a trailing slash to allow us to match it as a directory prefix.
   SORBET_RUNTIME_LIB_PATH = File.dirname(T.const_source_location(:Private).first) + File::SEPARATOR
@@ -407,6 +389,19 @@ module T::Private::Methods
     end
   end
 
+  # Returns the signature for a method whose definition was preceded by `sig`.
+  #
+  # @param method [UnboundMethod]
+  # @return [T::Private::Methods::Signature]
+  def self.signature_for_method(method)
+    signature_for_key(method_to_key(method))
+  end
+
+  private_class_method def self.signature_for_key(key)
+    maybe_run_sig_block_for_key(key)
+    @signatures_by_method[key]
+  end
+
   def self.unwrap_method(mod, signature, original_method)
     maybe_wrapped_method = CallValidation.wrap_method_if_needed(mod, signature, original_method)
     @signatures_by_method[method_to_key(maybe_wrapped_method)] = signature
@@ -433,6 +428,25 @@ module T::Private::Methods
     run_sig_block_for_key(method_to_key(method))
   end
 
+  # use this directly if you don't want/need to box up the method into an object to pass to method_to_key.
+  private_class_method def self.method_owner_and_name_to_key(owner, name)
+    "#{owner.object_id}##{name}"
+  end
+
+  private_class_method def self.method_to_key(method)
+    # If a subclass Sub inherits a method `foo` from Base, then
+    # Sub.instance_method(:foo) != Base.instance_method(:foo) even though they resolve to the
+    # same method. Similarly, Foo.method(:bar) != Foo.singleton_class.instance_method(:bar).
+    # So, we always do the look up by the method on the owner (Base in this example).
+    method_owner_and_name_to_key(method.owner, method.name)
+  end
+
+  private_class_method def self.key_to_method(key)
+    id, name = key.split("#")
+    obj = ObjectSpace._id2ref(id.to_i)
+    obj.instance_method(name)
+  end
+
   private_class_method def self.run_sig_block_for_key(key, force_type_init: false)
     blk = @sig_wrappers[key]
     if !blk
@@ -604,21 +618,6 @@ module T::Private::Methods
       mod.method(name)
     end
   end
-
-  # use this directly if you don't want/need to box up the method into an object to pass to method_to_key.
-  private_class_method def self.method_owner_and_name_to_key(owner, name)
-    "#{owner.object_id}##{name}"
-  end
-
-  private_class_method def self.method_to_key(method)
-    method_owner_and_name_to_key(method.owner, method.name)
-  end
-
-  private_class_method def self.key_to_method(key)
-    id, name = key.split("#")
-    obj = ObjectSpace._id2ref(id.to_i)
-    obj.instance_method(name)
-  end
 end
 
 # This has to be here, and can't be nested inside `T::Private::Methods`,

data/lib/types/private/methods/signature_validation.rb

@@ -277,6 +277,9 @@ module T::Private::Methods::SignatureValidation
     end
   end
 
+  ALLOW_INCOMPATIBLE_VISIBILITY = [:visibility, true].freeze
+  private_constant :ALLOW_INCOMPATIBLE_VISIBILITY
+
   def self.validate_override_visibility(signature, super_signature)
     return if super_signature.mode == Modes.untyped
     # This departs from the behavior of other `validate_override_whatever` functions in that it
@@ -284,8 +287,8 @@ module T::Private::Methods::SignatureValidation
     # done because the primary method for silencing these errors (`allow_incompatible: :visibility`)
     # requires an `override` node to attach to. Once we have static override checking for implicitly
     # overridden methods, we can remove this.
-    return unless [Modes.override, Modes.overridable_override].include?(signature.mode)
-    return if [:visibility, true].include?(signature.override_allow_incompatible)
+    return unless Modes::OVERRIDE_MODES.include?(signature.mode)
+    return if ALLOW_INCOMPATIBLE_VISIBILITY.include?(signature.override_allow_incompatible)
     method = signature.method
     super_method = super_signature.method
     mode_noun = super_signature.mode == Modes.abstract ? 'implementation' : 'override'
@@ -305,8 +308,11 @@ module T::Private::Methods::SignatureValidation
   end
 
   # Higher = more restrictive.
+  METHOD_VISIBILITIES = %i[public protected private].freeze
+  private_constant :METHOD_VISIBILITIES
+
   private_class_method def self.visibility_strength(vis)
-    %i[public protected private].find_index(vis)
+    METHOD_VISIBILITIES.find_index(vis)
   end
 
   private_class_method def self.base_override_loc_str(signature, super_signature)

data/lib/types/private/sealed.rb

@@ -70,7 +70,7 @@ module T::Private::Sealed
 
   def self.validate_inheritance(caller_loc, parent, child, verb)
     this_file = caller_loc&.path
-    decl_file = parent.instance_variable_get(:@sorbet_sealed_module_decl_file) if sealed_module?(parent)
+    decl_file = parent.instance_variable_get(:@sorbet_sealed_module_decl_file)
 
     if !this_file
       raise "Could not use backtrace to determine file for #{verb} child #{child}"

data/lib/types/props/_props.rb

@@ -132,17 +132,14 @@ module T::Props
     end
 
     # Shorthand helper to define a `prop` with `immutable => true`
-    sig { params(name: Symbol, cls_or_args: T.untyped, args: T.untyped).void }
-    def const(name, cls_or_args, **args)
-      if (cls_or_args.is_a?(Hash) && cls_or_args.key?(:immutable)) || args.key?(:immutable)
+    sig { params(name: Symbol, cls: T.untyped, rules: T.untyped).void }
+    def const(name, cls, **rules)
+      if rules.key?(:immutable)
         Kernel.raise ArgumentError.new("Cannot pass 'immutable' argument when using 'const' keyword to define a prop")
       end
 
-      if cls_or_args.is_a?(Hash)
-        self.prop(name, **cls_or_args.merge(immutable: true))
-      else
-        self.prop(name, cls_or_args, **args.merge(immutable: true))
-      end
+      rules[:immutable] = true
+      self.prop(name, cls, **rules)
     end
 
     def included(child)

data/lib/types/props/decorator.rb

@@ -174,7 +174,9 @@ class T::Props::Decorator
     .checked(:never)
   end
   def prop_get(instance, prop, rules=prop_rules(prop))
-    val = instance.instance_variable_get(rules[:accessor_key]) if instance.instance_variable_defined?(rules[:accessor_key])
+    # `instance_variable_get` will return nil if the variable doesn't exist
+    # which is what we want to have happen for the logic below.
+    val = instance.instance_variable_get(rules[:accessor_key])
     if !val.nil?
       val
     elsif (d = rules[:ifunset])
@@ -194,7 +196,9 @@ class T::Props::Decorator
     .checked(:never)
   end
   def prop_get_if_set(instance, prop, rules=prop_rules(prop))
-    instance.instance_variable_get(rules[:accessor_key]) if instance.instance_variable_defined?(rules[:accessor_key])
+    # `instance_variable_get` will return nil if the variable doesn't exist
+    # which is what we want to have happen for the return value here.
+    instance.instance_variable_get(rules[:accessor_key])
   end
   alias_method :get, :prop_get_if_set # Alias for backwards compatibility
 
@@ -238,7 +242,9 @@ class T::Props::Decorator
     end
 
     if rules.keys.any? { |k| !valid_rule_key?(k) }
-      raise ArgumentError.new("At least one invalid prop arg supplied in #{self}: #{rules.keys.inspect}")
+      invalid_keys = rules.keys.reject { |k| valid_rule_key?(k) }
+      suffix = invalid_keys.size == 1 ? "" : "s"
+      raise ArgumentError.new("Invalid prop arg#{suffix} supplied in #{self}: #{invalid_keys.inspect}")
     end
 
     if !rules[:clobber_existing_method!] && !rules[:without_accessors] && BANNED_METHOD_NAMES.include?(name.to_sym)
@@ -259,6 +265,8 @@ class T::Props::Decorator
   end
 
   SAFE_NAME = T.let(/\A[A-Za-z_][A-Za-z0-9_-]*\z/.freeze, Regexp, checked: false)
+  # Should be exactly the same as `SAFE_NAME`, but with a leading `@`.
+  SAFE_ACCESSOR_KEY_NAME = T.let(/\A@[A-Za-z_][A-Za-z0-9_-]*\z/.freeze, Regexp, checked: false)
 
   # Used to validate both prop names and serialized forms
   sig { params(name: T.any(Symbol, String)).void.checked(:never) }
@@ -319,9 +327,9 @@ class T::Props::Decorator
   sig(:final) { params(name: Symbol).returns(T::Boolean).checked(:never) }
   private def method_defined_on_ancestor?(name)
     (@class.method_defined?(name) || @class.private_method_defined?(name)) &&
-      # Unfortunately, older versions of ruby don't allow the second parameter on
-      # `private_method_defined?`.
-      (!@class.method_defined?(name, false) && !@class.private_method_defined?(name, false))
+    # Unfortunately, older versions of ruby don't allow the second parameter on
+    # `private_method_defined?`.
+    (!@class.method_defined?(name, false) && !@class.private_method_defined?(name, false))
   end
 
   sig(:final) { params(name: Symbol, rules: Rules).void.checked(:never) }
@@ -402,8 +410,6 @@ class T::Props::Decorator
 
     # extra arbitrary metadata attached by the code defining this property
 
-    validate_not_missing_sensitivity(name, rules)
-
     # for backcompat (the `:array` key is deprecated but because the name is
     # so generic it's really hard to be sure it's not being relied on anymore)
     if type.is_a?(T::Types::TypedArray)
@@ -479,35 +485,6 @@ class T::Props::Decorator
     end
   end
 
-  # checked(:never) - Rules hash is expensive to check
-  sig { params(prop_name: Symbol, rules: Rules).void.checked(:never) }
-  private def validate_not_missing_sensitivity(prop_name, rules)
-    if rules[:sensitivity].nil?
-      if rules[:redaction]
-        T::Configuration.hard_assert_handler(
-          "#{@class}##{prop_name} has a 'redaction:' annotation but no " \
-          "'sensitivity:' annotation. This is probably wrong, because if a " \
-          "prop needs redaction then it is probably sensitive. Add a " \
-          "sensitivity annotation like 'sensitivity: Opus::Sensitivity::PII." \
-          "whatever', or explicitly override this check with 'sensitivity: []'."
-        )
-      end
-      # TODO(PRIVACYENG-982) Ideally we'd also check for 'password' and possibly
-      # other terms, but this interacts badly with ProtoDefinedDocument because
-      # the proto syntax currently can't declare "sensitivity: []"
-      if /\bsecret\b/.match?(prop_name)
-        T::Configuration.hard_assert_handler(
-          "#{@class}##{prop_name} has the word 'secret' in its name, but no " \
-          "'sensitivity:' annotation. This is probably wrong, because if a " \
-          "prop is named 'secret' then it is probably sensitive. Add a " \
-          "sensitivity annotation like 'sensitivity: Opus::Sensitivity::NonPII." \
-          "security_token', or explicitly override this check with " \
-          "'sensitivity: []'."
-        )
-      end
-    end
-  end
-
   # Create `#{prop_name}_redacted` method
   sig do
     params(

data/lib/types/props/has_lazily_specialized_methods.rb

@@ -37,7 +37,7 @@ module T::Props
 
     sig { returns(T::Boolean) }
     def self.lazy_evaluation_enabled?
-      !defined?(@lazy_evaluation_disabled) || !@lazy_evaluation_disabled
+      !@lazy_evaluation_disabled
     end
 
     module DecoratorMethods

data/lib/types/props/pretty_printable.rb

@@ -12,8 +12,8 @@ module T::Props::PrettyPrintable
     pp.group(1, "<#{klass.inspect_class_with_decoration(self)}", ">") do
       klass.all_props.sort.each do |prop|
         pp.breakable
-        val = klass.get(self, prop)
         rules = klass.prop_rules(prop)
+        val = klass.get(self, prop, rules)
         pp.text("#{prop}=")
         if (custom_inspect = rules[:inspect])
           inspected = if T::Utils.arity(custom_inspect) == 1
@@ -22,8 +22,8 @@ module T::Props::PrettyPrintable
             custom_inspect.call(val, {multiline: multiline})
           end
           pp.text(inspected.nil? ? "nil" : inspected)
-        elsif rules[:sensitivity] && !rules[:sensitivity].empty? && !val.nil?
-          pp.text("<REDACTED #{rules[:sensitivity].join(', ')}>")
+        elsif (sensitivity = rules[:sensitivity]) && !sensitivity.empty? && !val.nil?
+          pp.text("<REDACTED #{sensitivity.join(', ')}>")
         else
           val.pretty_print(pp)
         end
@@ -56,14 +56,14 @@ module T::Props::PrettyPrintable
 
     # Overridable method to specify how the first part of a `pretty_print`d object's class should look like
     # NOTE: This is just to support Stripe's `PrettyPrintableModel` case, and not recommended to be overridden
-    sig { params(instance: T::Props::PrettyPrintable).returns(String) }
+    sig { params(instance: T::Props::PrettyPrintable).returns(String).checked(:never) }
     def inspect_class_with_decoration(instance)
       T.unsafe(instance).class.to_s
     end
 
     # Overridable method to add anything that is not a prop
     # NOTE: This is to support cases like Serializable's `@_extra_props`, and Stripe's `PrettyPrintableModel#@_deleted`
-    sig { params(instance: T::Props::PrettyPrintable, pp: T.any(PrettyPrint, PP::SingleLine)).void }
+    sig { params(instance: T::Props::PrettyPrintable, pp: T.any(PrettyPrint, PP::SingleLine)).void.checked(:never) }
     def pretty_print_extra(instance, pp); end
   end
 end

data/lib/types/props/private/deserializer_generator.rb

@@ -16,6 +16,8 @@ module T::Props
     module DeserializerGenerator
       extend T::Sig
 
+      CAN_USE_SYMBOL_NAME = T.let(RUBY_VERSION >= "3.3.0", T::Boolean)
+
       # Generate a method that takes a T::Hash[String, T.untyped] representing
       # serialized props, sets instance variables for each prop found in the
       # input, and returns the count of we props set (which we can use to check
@@ -29,19 +31,21 @@ module T::Props
         .checked(:never)
       end
       def self.generate(props, defaults)
-        stored_props = props.reject { |_, rules| rules[:dont_store] }
-        parts = stored_props.map do |prop, rules|
+        parts = props.filter_map do |prop, rules|
+          next if rules[:dont_store]
+
           # All of these strings should already be validated (directly or
           # indirectly) in `validate_prop_name`, so we don't bother with a nice
           # error message, but we double check here to prevent a refactoring
           # from introducing a security vulnerability.
-          raise unless T::Props::Decorator::SAFE_NAME.match?(prop.to_s)
+          raise unless T::Props::Decorator::SAFE_NAME.match?(CAN_USE_SYMBOL_NAME ? prop.name : prop.to_s)
 
           hash_key = rules.fetch(:serialized_form)
           raise unless T::Props::Decorator::SAFE_NAME.match?(hash_key)
 
-          ivar_name = rules.fetch(:accessor_key).to_s
-          raise unless ivar_name.start_with?('@') && T::Props::Decorator::SAFE_NAME.match?(ivar_name[1..-1])
+          key = rules.fetch(:accessor_key)
+          ivar_name = CAN_USE_SYMBOL_NAME ? key.name : key.to_s
+          raise unless ivar_name.start_with?('@') && T::Props::Decorator::SAFE_ACCESSOR_KEY_NAME.match?(ivar_name)
 
           transformation = SerdeTransform.generate(
             T::Utils::Nilable.get_underlying_type_object(rules.fetch(:type_object)),
@@ -90,7 +94,7 @@ module T::Props
 
         <<~RUBY
           def __t_props_generated_deserialize(hash)
-            found = #{stored_props.size}
+            found = #{parts.size}
             #{parts.join("\n\n")}
             found
           end

data/lib/types/props/private/serializer_generator.rb

@@ -16,6 +16,8 @@ module T::Props
     module SerializerGenerator
       extend T::Sig
 
+      CAN_USE_SYMBOL_NAME = T.let(RUBY_VERSION >= "3.3.0", T::Boolean)
+
       sig do
         params(
           props: T::Hash[Symbol, T::Hash[Symbol, T.untyped]],
@@ -24,19 +26,21 @@ module T::Props
         .checked(:never)
       end
       def self.generate(props)
-        stored_props = props.reject { |_, rules| rules[:dont_store] }
-        parts = stored_props.map do |prop, rules|
+        parts = props.filter_map do |prop, rules|
+          next if rules[:dont_store]
+
           # All of these strings should already be validated (directly or
           # indirectly) in `validate_prop_name`, so we don't bother with a nice
           # error message, but we double check here to prevent a refactoring
           # from introducing a security vulnerability.
-          raise unless T::Props::Decorator::SAFE_NAME.match?(prop.to_s)
+          raise unless T::Props::Decorator::SAFE_NAME.match?(CAN_USE_SYMBOL_NAME ? prop.name : prop.to_s)
 
           hash_key = rules.fetch(:serialized_form)
           raise unless T::Props::Decorator::SAFE_NAME.match?(hash_key)
 
-          ivar_name = rules.fetch(:accessor_key).to_s
-          raise unless ivar_name.start_with?('@') && T::Props::Decorator::SAFE_NAME.match?(ivar_name[1..-1])
+          key = rules.fetch(:accessor_key)
+          ivar_name = CAN_USE_SYMBOL_NAME ? key.name : key.to_s
+          raise unless ivar_name.start_with?('@') && T::Props::Decorator::SAFE_ACCESSOR_KEY_NAME.match?(ivar_name)
 
           transformed_val = SerdeTransform.generate(
             T::Utils::Nilable.get_underlying_type_object(rules.fetch(:type_object)),

data/lib/types/props/serializable.rb

@@ -121,8 +121,8 @@ module T::Props::Serializable
   private def with_existing_hash(changed_props, existing_hash:)
     serialized = existing_hash
     new_val = self.class.from_hash(serialized.merge(recursive_stringify_keys(changed_props)))
-    old_extra = self.instance_variable_get(:@_extra_props) if self.instance_variable_defined?(:@_extra_props)
-    new_extra = new_val.instance_variable_get(:@_extra_props) if new_val.instance_variable_defined?(:@_extra_props)
+    old_extra = self.instance_variable_get(:@_extra_props)
+    new_extra = new_val.instance_variable_get(:@_extra_props)
     if old_extra != new_extra
       difference =
         if old_extra
@@ -137,8 +137,7 @@ module T::Props::Serializable
 
   # Asserts if this property is missing during strict serialize
   private def required_prop_missing_from_serialize(prop)
-    if defined?(@_required_props_missing_from_deserialize) &&
-       @_required_props_missing_from_deserialize&.include?(prop)
+    if @_required_props_missing_from_deserialize&.include?(prop)
       # If the prop was already missing during deserialization, that means the application
       # code already had to deal with a nil value, which means we wouldn't be accomplishing
       # much by raising here (other than causing an unnecessary breakage).
@@ -353,11 +352,7 @@ module T::Props::Serializable::DecoratorMethods
   private_constant :EMPTY_EXTRA_PROPS
 
   def extra_props(instance)
-    if instance.instance_variable_defined?(:@_extra_props)
-      instance.instance_variable_get(:@_extra_props) || EMPTY_EXTRA_PROPS
-    else
-      EMPTY_EXTRA_PROPS
-    end
+    instance.instance_variable_get(:@_extra_props) || EMPTY_EXTRA_PROPS
   end
 
   # adds to the default result of T::Props::PrettyPrintable

data/lib/types/types/t_enum.rb

@@ -34,6 +34,8 @@ module T::Types
       case other
       when TEnum
         @val == other.val
+      when Simple
+        other.raw_type.===(@val)
       else
         false
       end

data/lib/types/types/typed_array.rb

@@ -22,8 +22,8 @@ module T::Types
       obj.is_a?(Array)
     end
 
-    def new(*args)
-      Array.new(*T.unsafe(args))
+    def new(...)
+      Array.new(...)
     end
 
     module Private

data/lib/types/types/typed_enumerator.rb

@@ -22,8 +22,8 @@ module T::Types
       obj.is_a?(Enumerator)
     end
 
-    def new(*args, &blk)
-      T.unsafe(Enumerator).new(*args, &blk)
+    def new(...)
+      Enumerator.new(...)
     end
 
     class Untyped < TypedEnumerator

data/lib/types/types/typed_enumerator_chain.rb

@@ -22,8 +22,8 @@ module T::Types
       obj.is_a?(Enumerator::Chain)
     end
 
-    def new(*args, &blk)
-      T.unsafe(Enumerator::Chain).new(*args, &blk)
+    def new(...)
+      Enumerator::Chain.new(...)
     end
 
     class Untyped < TypedEnumeratorChain

data/lib/types/types/typed_enumerator_lazy.rb

@@ -22,8 +22,8 @@ module T::Types
       obj.is_a?(Enumerator::Lazy)
     end
 
-    def new(*args, &blk)
-      T.unsafe(Enumerator::Lazy).new(*args, &blk)
+    def new(...)
+      Enumerator::Lazy.new(...)
     end
 
     class Untyped < TypedEnumeratorLazy

data/lib/types/types/typed_hash.rb

@@ -41,8 +41,8 @@ module T::Types
       obj.is_a?(Hash)
     end
 
-    def new(*args, &blk)
-      Hash.new(*T.unsafe(args), &blk)
+    def new(...)
+      Hash.new(...)
     end
 
     class Untyped < TypedHash

data/lib/types/types/typed_range.rb

@@ -22,8 +22,8 @@ module T::Types
       obj.is_a?(Range)
     end
 
-    def new(*args)
-      T.unsafe(Range).new(*args)
+    def new(...)
+      Range.new(...)
     end
   end
 end

data/lib/types/types/typed_set.rb

@@ -28,11 +28,11 @@ module T::Types
       obj.is_a?(Set)
     end
 
-    def new(*args)
+    def new(...)
       # Fine for this to blow up, because hopefully if they're trying to make a
       # Set, they don't mind putting (or already have put) a `require 'set'` in
       # their program directly.
-      Set.new(*T.unsafe(args))
+      Set.new(...)
     end
 
     class Untyped < TypedSet

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: sorbet-runtime
 version: !ruby/object:Gem::Version
-  version: 0.6.12449
+  version: 0.6.12652
 platform: ruby
 authors:
 - Stripe
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2025-08-27 00:00:00.000000000 Z
+date: 2025-10-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: minitest