sorbet-runtime 0.6.13640 → 0.6.13645

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c1c6889cfff1084220a387a83be0db47a4e8d64fd52c908f92cec233959167b2
-  data.tar.gz: fb88d8b6d8d544c49d1a6c505f4d914e3397eb8589da9e7b45990c1d99867f4e
+  metadata.gz: e60178283f5d03064093df6783548c58e6ea6f57b9b179dde7813d49deac5ecc
+  data.tar.gz: c23e8c62f59909036be48774a0986fb8487e6a5b06d5328ca79ac7e2946d8307
 SHA512:
-  metadata.gz: 34175a95d0498d547a3ee97f46d282ea00c0179ff26767fd9a2382f4f074d6decb919cf887164030530fcedf83530b1b17bdce51e11ae34c45f36b3d62dc90ee
-  data.tar.gz: e43447bc650100a300abfaf2f846ba8347b209d61174023c87a5335f37d5d6c107d3d59b7d71da44b976818e4cabf6d4744689ba047311fa11b084d3c434a650
+  metadata.gz: f2df8e767af1c945a6b0b75b9cfef26b8c38a271fd1674f5b404f646a01df3df547ed399e6b10603a4cecc49764281aca10f7e31a7d69608a7ef9bf6292a63de
+  data.tar.gz: a000671a569f11bafddbf498a71b105b65dc314ef5a76b2605b213541f540580af1fd2c0037eec99982fe7455b346201d803c349913c4c78b2be43f88889bb6d

data/lib/types/_types.rb

@@ -331,7 +331,7 @@ module T
       if keys.is_a?(T::Types::Untyped) && values.is_a?(T::Types::Untyped)
         T::Types::TypedHash::Untyped::Private::INSTANCE
       else
-        T::Types::TypedHash.new(keys: keys, values: values)
+        T::Types::TypedHash::Private::Pool.type_for_keys_and_values(keys, values)
       end
     end
   end

data/lib/types/types/typed_hash.rb

@@ -45,6 +45,33 @@ module T::Types
       Hash.new(...)
     end
 
+    # Only public for `Private::Pool`, which holds each per-keys bucket weakly, so every pooled type keeps its own bucket alive.
+    def _retain_pool_bucket(bucket)
+      @pool_bucket = bucket
+    end
+
+    module Private
+      module Pool
+        @cache = ObjectSpace::WeakMap.new
+
+        def self.type_for_keys_and_values(keys, values)
+          by_values = @cache[keys]
+          if by_values.nil?
+            by_values = ObjectSpace::WeakMap.new
+            @cache[keys] = by_values
+          end
+
+          cached = by_values[values]
+          return cached if cached
+
+          type = TypedHash.new(keys: keys, values: values)
+          type._retain_pool_bucket(by_values)
+          by_values[values] = type
+          type
+        end
+      end
+    end
+
     class Untyped < TypedHash
       def initialize
         # Use the INSTANCE constant directly (rather than `T.untyped`) so this

data/lib/types/types/union.rb

@@ -148,6 +148,16 @@ module T::Types
         EMPTY_ARRAY = [].freeze
         private_constant :EMPTY_ARRAY
 
+        @nilable_cache = ObjectSpace::WeakMap.new
+
+        # Memoizes `T.nilable(type)` for compound types, the way `Simple#to_nilable` does for simple ones.
+        def self.nilable_of(type)
+          cached = @nilable_cache[type]
+          return cached if cached
+
+          @nilable_cache[type] = Union.new([type, T::Utils::Nilable::NIL_TYPE])
+        end
+
         # Try to use `to_nilable` on a type to get memoization, or failing that
         # try to at least use SimplePairUnion to get faster init and typechecking.
         #
@@ -164,7 +174,14 @@ module T::Types
           if !types.empty?
             # Slow path
             return Union.new([type_a, type_b] + types)
-          elsif !type_a.is_a?(T::Types::Simple) || !type_b.is_a?(T::Types::Simple)
+          elsif !type_a.is_a?(T::Types::Simple)
+            if type_b.equal?(T::Utils::Nilable::NIL_TYPE)
+              return nilable_of(type_a)
+            else
+              # Slow path
+              return Union.new([type_a, type_b])
+            end
+          elsif !type_b.is_a?(T::Types::Simple)
             # Slow path
             return Union.new([type_a, type_b])
           end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: sorbet-runtime
 version: !ruby/object:Gem::Version
-  version: 0.6.13640
+  version: 0.6.13645
 platform: ruby
 authors:
 - Stripe