activerecord-ejection_seat 0.3.1 → 0.3.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/.ruby-version +1 -1
- data/.tool-versions +1 -1
- data/CHANGELOG.md +6 -0
- data/Gemfile +0 -2
- data/Gemfile.lock +41 -52
- data/lib/activerecord-ejection_seat/version.rb +1 -1
- data/sorbet/rbi/gems/{activerecord@7.0.4.2.rbi → activerecord@7.0.4.3.rbi} +128 -128
- data/sorbet/rbi/gems/{activesupport@7.0.4.2.rbi → activesupport@7.0.4.3.rbi} +79 -103
- data/sorbet/rbi/gems/{concurrent-ruby@1.2.0.rbi → concurrent-ruby@1.2.2.rbi} +64 -89
- data/sorbet/rbi/gems/diff-lcs@1.5.0.rbi +19 -0
- data/sorbet/rbi/gems/i18n@1.13.0.rbi +2320 -0
- data/sorbet/rbi/gems/{irb@1.6.2.rbi → irb@1.6.4.rbi} +50 -35
- data/sorbet/rbi/gems/json@2.6.3.rbi +65 -73
- data/sorbet/rbi/gems/{minitest@5.17.0.rbi → minitest@5.18.0.rbi} +79 -48
- data/sorbet/rbi/gems/{parallel@1.22.1.rbi → parallel@1.23.0.rbi} +75 -79
- data/sorbet/rbi/gems/{parser@3.2.1.0.rbi → parser@3.2.2.1.rbi} +164 -164
- data/sorbet/rbi/gems/rainbow@3.1.1.rbi +11 -6
- data/sorbet/rbi/gems/rake@13.0.6.rbi +141 -0
- data/sorbet/rbi/gems/rbi@0.0.16.rbi +17 -17
- data/sorbet/rbi/gems/{regexp_parser@2.7.0.rbi → regexp_parser@2.8.0.rbi} +617 -449
- data/sorbet/rbi/gems/rexml@3.2.5.rbi +57 -0
- data/sorbet/rbi/gems/{rubocop-ast@1.26.0.rbi → rubocop-ast@1.28.1.rbi} +79 -60
- data/sorbet/rbi/gems/{rubocop-minitest@0.27.0.rbi → rubocop-minitest@0.31.0.rbi} +364 -222
- data/sorbet/rbi/gems/rubocop-rake@0.6.0.rbi +24 -50
- data/sorbet/rbi/gems/rubocop-sorbet@0.7.0.rbi +0 -15
- data/sorbet/rbi/gems/{rubocop@1.45.1.rbi → rubocop@1.51.0.rbi} +2170 -1402
- data/sorbet/rbi/gems/{ruby-progressbar@1.11.0.rbi → ruby-progressbar@1.13.0.rbi} +382 -277
- data/sorbet/rbi/gems/sorbet-struct-comparable@1.3.0.rbi +18 -0
- data/sorbet/rbi/gems/{spoom@1.1.15.rbi → spoom@1.2.1.rbi} +621 -501
- data/sorbet/rbi/gems/{tapioca@0.10.5.rbi → tapioca@0.11.6.rbi} +293 -207
- data/sorbet/rbi/gems/{thor@1.2.1.rbi → thor@1.2.2.rbi} +76 -61
- data/sorbet/rbi/gems/{yard-sorbet@0.8.0.rbi → yard-sorbet@0.8.1.rbi} +13 -26
- data/sorbet/rbi/gems/{yard@0.9.28.rbi → yard@0.9.34.rbi} +1531 -345
- metadata +27 -33
- data/activerecord-ejection_seat.gemspec +0 -40
- data/sorbet/rbi/gems/i18n@1.12.0.rbi +0 -8
- data/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi +0 -8
- data/sorbet/rbi/gems/prettier_print@1.2.0.rbi +0 -8
- data/sorbet/rbi/gems/ruby-lsp@0.4.0.rbi +0 -14
- data/sorbet/rbi/gems/syntax_tree@6.0.0.rbi +0 -8
- data/sorbet/rbi/gems/webrick@1.7.0.rbi +0 -2498
- /data/sorbet/rbi/gems/{activemodel@7.0.4.2.rbi → activemodel@7.0.4.3.rbi} +0 -0
- /data/sorbet/rbi/gems/{reline@0.3.2.rbi → reline@0.3.3.rbi} +0 -0
- /data/sorbet/rbi/gems/{sqlite3@1.6.0.rbi → sqlite3@1.6.2.rbi} +0 -0
@@ -558,55 +558,55 @@ Concurrent::AbstractExecutorService::FALLBACK_POLICIES = T.let(T.unsafe(nil), Ar
|
|
558
558
|
# them. This is why we need to use a finalizer to clean up the locals array
|
559
559
|
# when the EC goes out of scope.
|
560
560
|
#
|
561
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
561
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#35
|
562
562
|
class Concurrent::AbstractLocals
|
563
563
|
# @return [AbstractLocals] a new instance of AbstractLocals
|
564
564
|
#
|
565
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
565
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#36
|
566
566
|
def initialize; end
|
567
567
|
|
568
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
568
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#89
|
569
569
|
def fetch(index); end
|
570
570
|
|
571
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
571
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#71
|
572
572
|
def free_index(index); end
|
573
573
|
|
574
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
574
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#55
|
575
575
|
def next_index(local); end
|
576
576
|
|
577
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
577
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#102
|
578
578
|
def set(index, value); end
|
579
579
|
|
580
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
580
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#43
|
581
581
|
def synchronize; end
|
582
582
|
|
583
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
583
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#48
|
584
584
|
def weak_synchronize; end
|
585
585
|
|
586
586
|
private
|
587
587
|
|
588
588
|
# When the local goes out of scope, clean up that slot across all locals currently assigned.
|
589
589
|
#
|
590
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
590
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#112
|
591
591
|
def local_finalizer(index); end
|
592
592
|
|
593
593
|
# Returns the locals for the current scope, or nil if none exist.
|
594
594
|
#
|
595
595
|
# @raise [NotImplementedError]
|
596
596
|
#
|
597
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
597
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#128
|
598
598
|
def locals; end
|
599
599
|
|
600
600
|
# Returns the locals for the current scope, creating them if necessary.
|
601
601
|
#
|
602
602
|
# @raise [NotImplementedError]
|
603
603
|
#
|
604
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
604
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#133
|
605
605
|
def locals!; end
|
606
606
|
|
607
607
|
# When a thread/fiber goes out of scope, remove the array from @all_arrays.
|
608
608
|
#
|
609
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
609
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#119
|
610
610
|
def thread_fiber_finalizer(array_object_id); end
|
611
611
|
end
|
612
612
|
|
@@ -2765,7 +2765,7 @@ class Concurrent::Collection::MriMapBackend < ::Concurrent::Collection::NonConcu
|
|
2765
2765
|
# @return [MriMapBackend] a new instance of MriMapBackend
|
2766
2766
|
#
|
2767
2767
|
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb#12
|
2768
|
-
def initialize(options = T.unsafe(nil)); end
|
2768
|
+
def initialize(options = T.unsafe(nil), &default_proc); end
|
2769
2769
|
|
2770
2770
|
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb#17
|
2771
2771
|
def []=(key, value); end
|
@@ -2811,78 +2811,75 @@ class Concurrent::Collection::NonConcurrentMapBackend
|
|
2811
2811
|
# @return [NonConcurrentMapBackend] a new instance of NonConcurrentMapBackend
|
2812
2812
|
#
|
2813
2813
|
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#15
|
2814
|
-
def initialize(options = T.unsafe(nil)); end
|
2814
|
+
def initialize(options = T.unsafe(nil), &default_proc); end
|
2815
2815
|
|
2816
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2816
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#21
|
2817
2817
|
def [](key); end
|
2818
2818
|
|
2819
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2819
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#25
|
2820
2820
|
def []=(key, value); end
|
2821
2821
|
|
2822
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2822
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#94
|
2823
2823
|
def clear; end
|
2824
2824
|
|
2825
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2825
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#59
|
2826
2826
|
def compute(key); end
|
2827
2827
|
|
2828
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2828
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#29
|
2829
2829
|
def compute_if_absent(key); end
|
2830
2830
|
|
2831
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2831
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#53
|
2832
2832
|
def compute_if_present(key); end
|
2833
2833
|
|
2834
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2834
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#81
|
2835
2835
|
def delete(key); end
|
2836
2836
|
|
2837
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2837
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#85
|
2838
2838
|
def delete_pair(key, value); end
|
2839
2839
|
|
2840
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2840
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#99
|
2841
2841
|
def each_pair; end
|
2842
2842
|
|
2843
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2843
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#71
|
2844
2844
|
def get_and_set(key, value); end
|
2845
2845
|
|
2846
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2846
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#110
|
2847
2847
|
def get_or_default(key, default_value); end
|
2848
2848
|
|
2849
2849
|
# @return [Boolean]
|
2850
2850
|
#
|
2851
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2851
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#77
|
2852
2852
|
def key?(key); end
|
2853
2853
|
|
2854
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2854
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#63
|
2855
2855
|
def merge_pair(key, value); end
|
2856
2856
|
|
2857
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2857
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#46
|
2858
2858
|
def replace_if_exists(key, new_value); end
|
2859
2859
|
|
2860
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2860
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#37
|
2861
2861
|
def replace_pair(key, old_value, new_value); end
|
2862
2862
|
|
2863
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2863
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#106
|
2864
2864
|
def size; end
|
2865
2865
|
|
2866
2866
|
private
|
2867
2867
|
|
2868
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2869
|
-
def _get(key); end
|
2870
|
-
|
2871
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#23
|
2872
|
-
def _set(key, value); end
|
2873
|
-
|
2874
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#122
|
2868
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#130
|
2875
2869
|
def dupped_backend; end
|
2876
2870
|
|
2877
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2871
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#124
|
2878
2872
|
def initialize_copy(other); end
|
2879
2873
|
|
2880
2874
|
# @return [Boolean]
|
2881
2875
|
#
|
2882
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2876
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#134
|
2883
2877
|
def pair?(key, expected_value); end
|
2884
2878
|
|
2885
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#
|
2879
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#116
|
2880
|
+
def set_backend(default_proc); end
|
2881
|
+
|
2882
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#138
|
2886
2883
|
def store_computed_value(key, new_value); end
|
2887
2884
|
end
|
2888
2885
|
|
@@ -4066,12 +4063,12 @@ Concurrent::FiberLocalVar::LOCALS = T.let(T.unsafe(nil), Concurrent::FiberLocals
|
|
4066
4063
|
|
4067
4064
|
# An array-backed storage of indexed variables per fiber.
|
4068
4065
|
#
|
4069
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
4066
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#166
|
4070
4067
|
class Concurrent::FiberLocals < ::Concurrent::AbstractLocals
|
4071
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
4068
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#167
|
4072
4069
|
def locals; end
|
4073
4070
|
|
4074
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
4071
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#171
|
4075
4072
|
def locals!; end
|
4076
4073
|
end
|
4077
4074
|
|
@@ -4934,28 +4931,6 @@ Concurrent::MVar::TIMEOUT = T.let(T.unsafe(nil), Object)
|
|
4934
4931
|
#
|
4935
4932
|
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#39
|
4936
4933
|
class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
4937
|
-
# @return [Map] a new instance of Map
|
4938
|
-
#
|
4939
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#123
|
4940
|
-
def initialize(options = T.unsafe(nil), &block); end
|
4941
|
-
|
4942
|
-
# Get a value with key
|
4943
|
-
#
|
4944
|
-
# @param key [Object]
|
4945
|
-
# @return [Object] the value
|
4946
|
-
#
|
4947
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#137
|
4948
|
-
def [](key); end
|
4949
|
-
|
4950
|
-
# Set a value with key
|
4951
|
-
#
|
4952
|
-
# @param key [Object]
|
4953
|
-
# @param value [Object]
|
4954
|
-
# @return [Object] the new value
|
4955
|
-
#
|
4956
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#155
|
4957
|
-
def []=(key, value); end
|
4958
|
-
|
4959
4934
|
# Iterates over each key value pair.
|
4960
4935
|
# This method is atomic.
|
4961
4936
|
#
|
@@ -4966,7 +4941,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
4966
4941
|
# @yieldparam key [Object]
|
4967
4942
|
# @yieldparam value [Object]
|
4968
4943
|
#
|
4969
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
4944
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#274
|
4970
4945
|
def each; end
|
4971
4946
|
|
4972
4947
|
# Iterates over each key.
|
@@ -4978,7 +4953,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
4978
4953
|
# @yield for each key in the map
|
4979
4954
|
# @yieldparam key [Object]
|
4980
4955
|
#
|
4981
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
4956
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#255
|
4982
4957
|
def each_key; end
|
4983
4958
|
|
4984
4959
|
# Iterates over each key value pair.
|
@@ -4991,7 +4966,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
4991
4966
|
# @yieldparam key [Object]
|
4992
4967
|
# @yieldparam value [Object]
|
4993
4968
|
#
|
4994
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
4969
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#274
|
4995
4970
|
def each_pair; end
|
4996
4971
|
|
4997
4972
|
# Iterates over each value.
|
@@ -5003,14 +4978,14 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5003
4978
|
# @yield for each value in the map
|
5004
4979
|
# @yieldparam value [Object]
|
5005
4980
|
#
|
5006
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
4981
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#264
|
5007
4982
|
def each_value; end
|
5008
4983
|
|
5009
4984
|
# Is map empty?
|
5010
4985
|
#
|
5011
4986
|
# @return [true, false]
|
5012
4987
|
#
|
5013
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
4988
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#291
|
5014
4989
|
def empty?; end
|
5015
4990
|
|
5016
4991
|
# Get a value with key, or default_value when key is absent,
|
@@ -5032,7 +5007,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5032
5007
|
# @yieldparam key [Object]
|
5033
5008
|
# @yieldreturn [Object] default value
|
5034
5009
|
#
|
5035
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5010
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#183
|
5036
5011
|
def fetch(key, default_value = T.unsafe(nil)); end
|
5037
5012
|
|
5038
5013
|
# Fetch value with key, or store default value when key is absent,
|
@@ -5047,7 +5022,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5047
5022
|
# @yieldparam key [Object]
|
5048
5023
|
# @yieldreturn [Object] default value
|
5049
5024
|
#
|
5050
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5025
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#205
|
5051
5026
|
def fetch_or_store(key, default_value = T.unsafe(nil)); end
|
5052
5027
|
|
5053
5028
|
# Get a value with key
|
@@ -5055,10 +5030,10 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5055
5030
|
# @param key [Object]
|
5056
5031
|
# @return [Object] the value
|
5057
5032
|
#
|
5058
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5033
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb#21
|
5059
5034
|
def get(key); end
|
5060
5035
|
|
5061
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5036
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#321
|
5062
5037
|
def inspect; end
|
5063
5038
|
|
5064
5039
|
# Find key of a value.
|
@@ -5066,22 +5041,22 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5066
5041
|
# @param value [Object]
|
5067
5042
|
# @return [Object, nil] key or nil when not found
|
5068
5043
|
#
|
5069
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5044
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#284
|
5070
5045
|
def key(value); end
|
5071
5046
|
|
5072
5047
|
# All keys
|
5073
5048
|
#
|
5074
5049
|
# @return [::Array<Object>] keys
|
5075
5050
|
#
|
5076
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5051
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#236
|
5077
5052
|
def keys; end
|
5078
5053
|
|
5079
5054
|
# @raise [TypeError]
|
5080
5055
|
#
|
5081
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5056
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#305
|
5082
5057
|
def marshal_dump; end
|
5083
5058
|
|
5084
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5059
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#313
|
5085
5060
|
def marshal_load(hash); end
|
5086
5061
|
|
5087
5062
|
# Set a value with key
|
@@ -5090,7 +5065,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5090
5065
|
# @param value [Object]
|
5091
5066
|
# @return [Object] the new value
|
5092
5067
|
#
|
5093
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5068
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb#17
|
5094
5069
|
def put(key, value); end
|
5095
5070
|
|
5096
5071
|
# Insert value into map with key if key is absent in one atomic step.
|
@@ -5099,7 +5074,7 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5099
5074
|
# @param value [Object]
|
5100
5075
|
# @return [Object, nil] the previous value when key was present or nil when there was no key
|
5101
5076
|
#
|
5102
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5077
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#215
|
5103
5078
|
def put_if_absent(key, value); end
|
5104
5079
|
|
5105
5080
|
# Is the value stored in the map. Iterates over all values.
|
@@ -5107,30 +5082,30 @@ class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
|
|
5107
5082
|
# @param value [Object]
|
5108
5083
|
# @return [true, false]
|
5109
5084
|
#
|
5110
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5085
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#227
|
5111
5086
|
def value?(value); end
|
5112
5087
|
|
5113
5088
|
# All values
|
5114
5089
|
#
|
5115
5090
|
# @return [::Array<Object>] values
|
5116
5091
|
#
|
5117
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5092
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#244
|
5118
5093
|
def values; end
|
5119
5094
|
|
5120
5095
|
private
|
5121
5096
|
|
5122
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5097
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#331
|
5123
5098
|
def initialize_copy(other); end
|
5124
5099
|
|
5125
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5100
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#336
|
5126
5101
|
def populate_from(hash); end
|
5127
5102
|
|
5128
5103
|
# @raise [KeyError]
|
5129
5104
|
#
|
5130
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5105
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#327
|
5131
5106
|
def raise_fetch_no_key; end
|
5132
5107
|
|
5133
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#
|
5108
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/map.rb#341
|
5134
5109
|
def validate_options_hash!(options); end
|
5135
5110
|
end
|
5136
5111
|
|
@@ -10790,12 +10765,12 @@ Concurrent::ThreadLocalVar::LOCALS = T.let(T.unsafe(nil), Concurrent::ThreadLoca
|
|
10790
10765
|
|
10791
10766
|
# An array-backed storage of indexed variables per thread.
|
10792
10767
|
#
|
10793
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
10768
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#141
|
10794
10769
|
class Concurrent::ThreadLocals < ::Concurrent::AbstractLocals
|
10795
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
10770
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#142
|
10796
10771
|
def locals; end
|
10797
10772
|
|
10798
|
-
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#
|
10773
|
+
# source://concurrent-ruby//lib/concurrent-ruby/concurrent/atomic/locals.rb#146
|
10799
10774
|
def locals!; end
|
10800
10775
|
end
|
10801
10776
|
|
@@ -4,8 +4,10 @@
|
|
4
4
|
# This is an autogenerated file for types exported from the `diff-lcs` gem.
|
5
5
|
# Please instead update this file by running `bin/tapioca gem diff-lcs`.
|
6
6
|
|
7
|
+
# source://diff-lcs//lib/diff/lcs.rb#3
|
7
8
|
module Diff; end
|
8
9
|
|
10
|
+
# source://diff-lcs//lib/diff/lcs.rb#51
|
9
11
|
module Diff::LCS
|
10
12
|
# Returns the difference set between +self+ and +other+. See Diff::LCS#diff.
|
11
13
|
#
|
@@ -391,6 +393,8 @@ Diff::LCS::BalancedCallbacks = Diff::LCS::DefaultCallbacks
|
|
391
393
|
# A block is an operation removing, adding, or changing a group of items.
|
392
394
|
# Basically, this is just a list of changes, where each change adds or
|
393
395
|
# deletes a single item. Used by bin/ldiff.
|
396
|
+
#
|
397
|
+
# source://diff-lcs//lib/diff/lcs/block.rb#6
|
394
398
|
class Diff::LCS::Block
|
395
399
|
# @return [Block] a new instance of Block
|
396
400
|
#
|
@@ -422,6 +426,8 @@ end
|
|
422
426
|
# Represents a simplistic (non-contextual) change. Represents the removal or
|
423
427
|
# addition of an element from either the old or the new sequenced
|
424
428
|
# enumerable.
|
429
|
+
#
|
430
|
+
# source://diff-lcs//lib/diff/lcs/change.rb#6
|
425
431
|
class Diff::LCS::Change
|
426
432
|
include ::Comparable
|
427
433
|
|
@@ -515,6 +521,8 @@ Diff::LCS::Change::VALID_ACTIONS = T.let(T.unsafe(nil), Array)
|
|
515
521
|
# Represents a contextual change. Contains the position and values of the
|
516
522
|
# elements in the old and the new sequenced enumerables as well as the action
|
517
523
|
# taken.
|
524
|
+
#
|
525
|
+
# source://diff-lcs//lib/diff/lcs/change.rb#100
|
518
526
|
class Diff::LCS::ContextChange < ::Diff::LCS::Change
|
519
527
|
# @return [ContextChange] a new instance of ContextChange
|
520
528
|
#
|
@@ -640,6 +648,8 @@ end
|
|
640
648
|
#
|
641
649
|
# require 'pp'
|
642
650
|
# pp diffs.map { |e| e.map { |f| f.to_a } }
|
651
|
+
#
|
652
|
+
# source://diff-lcs//lib/diff/lcs/callbacks.rb#223
|
643
653
|
class Diff::LCS::ContextDiffCallbacks < ::Diff::LCS::DiffCallbacks
|
644
654
|
# source://diff-lcs//lib/diff/lcs/callbacks.rb#232
|
645
655
|
def change(event); end
|
@@ -659,6 +669,8 @@ end
|
|
659
669
|
# Note that this is intended to be called as is, e.g.,
|
660
670
|
#
|
661
671
|
# Diff::LCS.LCS(seq1, seq2, Diff::LCS::DefaultCallbacks)
|
672
|
+
#
|
673
|
+
# source://diff-lcs//lib/diff/lcs/callbacks.rb#14
|
662
674
|
class Diff::LCS::DefaultCallbacks
|
663
675
|
class << self
|
664
676
|
# Called when both the old and new values have changed.
|
@@ -736,6 +748,8 @@ end
|
|
736
748
|
#
|
737
749
|
# require 'pp'
|
738
750
|
# pp diffs.map { |e| e.map { |f| f.to_a } }
|
751
|
+
#
|
752
|
+
# source://diff-lcs//lib/diff/lcs/callbacks.rb#106
|
739
753
|
class Diff::LCS::DiffCallbacks
|
740
754
|
# :yields self:
|
741
755
|
#
|
@@ -773,6 +787,8 @@ end
|
|
773
787
|
# A Hunk is a group of Blocks which overlap because of the context surrounding
|
774
788
|
# each block. (So if we're not using context, every hunk will contain one
|
775
789
|
# block.) Used in the diff program (bin/ldiff).
|
790
|
+
#
|
791
|
+
# source://diff-lcs//lib/diff/lcs/hunk.rb#8
|
776
792
|
class Diff::LCS::Hunk
|
777
793
|
# Create a hunk using references to both the old and new data, as well as the
|
778
794
|
# piece of data.
|
@@ -897,6 +913,7 @@ Diff::LCS::Hunk::ED_DIFF_OP_ACTION = T.let(T.unsafe(nil), Hash)
|
|
897
913
|
# source://diff-lcs//lib/diff/lcs/hunk.rb#9
|
898
914
|
Diff::LCS::Hunk::OLD_DIFF_OP_ACTION = T.let(T.unsafe(nil), Hash)
|
899
915
|
|
916
|
+
# source://diff-lcs//lib/diff/lcs/internals.rb#29
|
900
917
|
module Diff::LCS::Internals
|
901
918
|
class << self
|
902
919
|
# This method will analyze the provided patchset to provide a single-pass
|
@@ -1024,6 +1041,8 @@ end
|
|
1024
1041
|
#
|
1025
1042
|
# require 'pp'
|
1026
1043
|
# pp diffs.map { |e| e.to_a }
|
1044
|
+
#
|
1045
|
+
# source://diff-lcs//lib/diff/lcs/callbacks.rb#301
|
1027
1046
|
class Diff::LCS::SDiffCallbacks
|
1028
1047
|
# :yields self:
|
1029
1048
|
#
|