ric 0.12.0 → 0.12.2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (1206) hide show
  1. checksums.yaml +7 -0
  2. checksums.yaml.gz.sig +1 -0
  3. data.tar.gz.sig +2 -0
  4. data/Gemfile +0 -1
  5. data/HISTORY.yml +2 -0
  6. data/LICENSE +1 -1
  7. data/Makefile +12 -2
  8. data/Manifest +1189 -4
  9. data/Rakefile +16 -9
  10. data/VERSION +1 -1
  11. data/ric.gemspec +31 -27
  12. data/vendor/bundle/ruby/2.5.0/bin/allison +27 -0
  13. data/vendor/bundle/ruby/2.5.0/bin/rake +27 -0
  14. data/vendor/bundle/ruby/2.5.0/bin/rdoc +27 -0
  15. data/vendor/bundle/ruby/2.5.0/bin/ri +27 -0
  16. data/vendor/bundle/ruby/2.5.0/bin/rubyforge +27 -0
  17. data/vendor/bundle/ruby/2.5.0/cache/activemodel-5.2.3.gem +0 -0
  18. data/vendor/bundle/ruby/2.5.0/cache/activemodel-serializers-xml-1.0.2.gem +0 -0
  19. data/vendor/bundle/ruby/2.5.0/cache/activeresource-5.1.0.gem +0 -0
  20. data/vendor/bundle/ruby/2.5.0/cache/activesupport-5.2.3.gem +0 -0
  21. data/vendor/bundle/ruby/2.5.0/cache/allison-2.0.3.gem +0 -0
  22. data/vendor/bundle/ruby/2.5.0/cache/builder-3.2.3.gem +0 -0
  23. data/vendor/bundle/ruby/2.5.0/cache/concurrent-ruby-1.1.5.gem +0 -0
  24. data/vendor/bundle/ruby/2.5.0/cache/echoe-4.6.6.gem +0 -0
  25. data/vendor/bundle/ruby/2.5.0/cache/i18n-1.6.0.gem +0 -0
  26. data/vendor/bundle/ruby/2.5.0/cache/json_pure-2.2.0.gem +0 -0
  27. data/vendor/bundle/ruby/2.5.0/cache/minitest-5.11.3.gem +0 -0
  28. data/vendor/bundle/ruby/2.5.0/cache/rake-12.3.2.gem +0 -0
  29. data/vendor/bundle/ruby/2.5.0/cache/rdoc-6.1.1.gem +0 -0
  30. data/vendor/bundle/ruby/2.5.0/cache/rubyforge-2.0.4.gem +0 -0
  31. data/vendor/bundle/ruby/2.5.0/cache/thread_safe-0.3.6.gem +0 -0
  32. data/vendor/bundle/ruby/2.5.0/cache/tzinfo-1.2.5.gem +0 -0
  33. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/CHANGELOG.md +114 -0
  34. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/MIT-LICENSE +21 -0
  35. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/README.rdoc +264 -0
  36. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model.rb +77 -0
  37. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute.rb +248 -0
  38. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute/user_provided_default.rb +52 -0
  39. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_assignment.rb +57 -0
  40. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_methods.rb +478 -0
  41. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_mutation_tracker.rb +124 -0
  42. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_set.rb +114 -0
  43. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_set/builder.rb +126 -0
  44. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attribute_set/yaml_encoder.rb +41 -0
  45. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/attributes.rb +111 -0
  46. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/callbacks.rb +153 -0
  47. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/conversion.rb +111 -0
  48. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/dirty.rb +343 -0
  49. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/errors.rb +517 -0
  50. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/forbidden_attributes_protection.rb +31 -0
  51. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/gem_version.rb +17 -0
  52. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/lint.rb +118 -0
  53. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/locale/en.yml +36 -0
  54. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/model.rb +99 -0
  55. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/naming.rb +318 -0
  56. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/railtie.rb +14 -0
  57. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/secure_password.rb +129 -0
  58. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/serialization.rb +192 -0
  59. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/serializers/json.rb +146 -0
  60. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/translation.rb +70 -0
  61. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type.rb +53 -0
  62. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/big_integer.rb +15 -0
  63. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/binary.rb +52 -0
  64. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/boolean.rb +38 -0
  65. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/date.rb +57 -0
  66. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/date_time.rb +51 -0
  67. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/decimal.rb +70 -0
  68. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/float.rb +36 -0
  69. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers.rb +7 -0
  70. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers/accepts_multiparameter_time.rb +41 -0
  71. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers/mutable.rb +20 -0
  72. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers/numeric.rb +37 -0
  73. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers/time_value.rb +68 -0
  74. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/helpers/timezone.rb +19 -0
  75. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/immutable_string.rb +32 -0
  76. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/integer.rb +70 -0
  77. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/registry.rb +70 -0
  78. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/string.rb +26 -0
  79. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/time.rb +51 -0
  80. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/type/value.rb +126 -0
  81. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations.rb +439 -0
  82. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/absence.rb +33 -0
  83. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/acceptance.rb +106 -0
  84. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/callbacks.rb +122 -0
  85. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/clusivity.rb +54 -0
  86. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/confirmation.rb +80 -0
  87. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/exclusion.rb +49 -0
  88. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/format.rb +114 -0
  89. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/helper_methods.rb +15 -0
  90. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/inclusion.rb +47 -0
  91. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/length.rb +129 -0
  92. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/numericality.rb +189 -0
  93. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/presence.rb +39 -0
  94. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/validates.rb +174 -0
  95. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validations/with.rb +147 -0
  96. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/validator.rb +183 -0
  97. data/vendor/bundle/ruby/2.5.0/gems/activemodel-5.2.3/lib/active_model/version.rb +10 -0
  98. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/CONTRIBUTING.md +99 -0
  99. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/Gemfile +4 -0
  100. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/MIT-LICENSE +21 -0
  101. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/README.md +89 -0
  102. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/Rakefile +10 -0
  103. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/activemodel-serializers-xml.gemspec +25 -0
  104. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/lib/active_model/serializers.rb +23 -0
  105. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/lib/active_model/serializers/version.rb +5 -0
  106. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/lib/active_model/serializers/xml.rb +238 -0
  107. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/lib/active_record/serializers/xml_serializer.rb +194 -0
  108. data/vendor/bundle/ruby/2.5.0/gems/activemodel-serializers-xml-1.0.2/lib/activemodel-serializers-xml.rb +1 -0
  109. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/MIT-LICENSE +20 -0
  110. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/README.rdoc +285 -0
  111. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource.rb +46 -0
  112. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/active_job_serializer.rb +26 -0
  113. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/associations.rb +175 -0
  114. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/associations/builder/association.rb +33 -0
  115. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/associations/builder/belongs_to.rb +16 -0
  116. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/associations/builder/has_many.rb +14 -0
  117. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/associations/builder/has_one.rb +14 -0
  118. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/base.rb +1695 -0
  119. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/callbacks.rb +22 -0
  120. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/collection.rb +94 -0
  121. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/connection.rb +294 -0
  122. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/custom_methods.rb +129 -0
  123. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/exceptions.rb +84 -0
  124. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/formats.rb +24 -0
  125. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/formats/json_format.rb +28 -0
  126. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/formats/xml_format.rb +27 -0
  127. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/http_mock.rb +373 -0
  128. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/log_subscriber.rb +26 -0
  129. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/observing.rb +0 -0
  130. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/railtie.rb +25 -0
  131. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/reflection.rb +78 -0
  132. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/schema.rb +59 -0
  133. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/singleton.rb +113 -0
  134. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/threadsafe_attributes.rb +66 -0
  135. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/validations.rb +176 -0
  136. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/active_resource/version.rb +12 -0
  137. data/vendor/bundle/ruby/2.5.0/gems/activeresource-5.1.0/lib/activeresource.rb +3 -0
  138. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/CHANGELOG.md +602 -0
  139. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/MIT-LICENSE +20 -0
  140. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/README.rdoc +39 -0
  141. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support.rb +95 -0
  142. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/all.rb +5 -0
  143. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/array_inquirer.rb +48 -0
  144. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/backtrace_cleaner.rb +105 -0
  145. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/benchmarkable.rb +51 -0
  146. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/builder.rb +8 -0
  147. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache.rb +808 -0
  148. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/file_store.rb +196 -0
  149. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/mem_cache_store.rb +207 -0
  150. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/memory_store.rb +169 -0
  151. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/null_store.rb +43 -0
  152. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/redis_cache_store.rb +461 -0
  153. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/strategy/local_cache.rb +194 -0
  154. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/cache/strategy/local_cache_middleware.rb +45 -0
  155. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/callbacks.rb +845 -0
  156. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/concern.rb +148 -0
  157. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/concurrency/load_interlock_aware_monitor.rb +17 -0
  158. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/concurrency/share_lock.rb +227 -0
  159. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/configurable.rb +150 -0
  160. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext.rb +5 -0
  161. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array.rb +9 -0
  162. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/access.rb +92 -0
  163. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/conversions.rb +213 -0
  164. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/extract_options.rb +31 -0
  165. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/grouping.rb +109 -0
  166. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/inquiry.rb +19 -0
  167. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/prepend_and_append.rb +9 -0
  168. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/array/wrap.rb +48 -0
  169. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/benchmark.rb +16 -0
  170. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/big_decimal.rb +3 -0
  171. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/big_decimal/conversions.rb +14 -0
  172. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/class.rb +4 -0
  173. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/class/attribute.rb +146 -0
  174. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/class/attribute_accessors.rb +6 -0
  175. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/class/subclasses.rb +54 -0
  176. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date.rb +7 -0
  177. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date/acts_like.rb +10 -0
  178. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date/blank.rb +14 -0
  179. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date/calculations.rb +145 -0
  180. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date/conversions.rb +96 -0
  181. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date/zones.rb +8 -0
  182. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_and_time/calculations.rb +374 -0
  183. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_and_time/compatibility.rb +16 -0
  184. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_and_time/zones.rb +41 -0
  185. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time.rb +7 -0
  186. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time/acts_like.rb +16 -0
  187. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time/blank.rb +14 -0
  188. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time/calculations.rb +211 -0
  189. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time/compatibility.rb +18 -0
  190. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/date_time/conversions.rb +107 -0
  191. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/digest/uuid.rb +53 -0
  192. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/enumerable.rb +164 -0
  193. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/file.rb +3 -0
  194. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/file/atomic.rb +70 -0
  195. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash.rb +11 -0
  196. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/compact.rb +29 -0
  197. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/conversions.rb +263 -0
  198. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/deep_merge.rb +34 -0
  199. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/except.rb +24 -0
  200. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/indifferent_access.rb +24 -0
  201. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/keys.rb +172 -0
  202. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/reverse_merge.rb +25 -0
  203. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/slice.rb +48 -0
  204. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/hash/transform_values.rb +32 -0
  205. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/integer.rb +5 -0
  206. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/integer/inflections.rb +31 -0
  207. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/integer/multiple.rb +12 -0
  208. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/integer/time.rb +22 -0
  209. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/kernel.rb +6 -0
  210. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/kernel/agnostics.rb +13 -0
  211. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/kernel/concern.rb +14 -0
  212. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/kernel/reporting.rb +45 -0
  213. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/kernel/singleton_class.rb +8 -0
  214. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/load_error.rb +9 -0
  215. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/marshal.rb +24 -0
  216. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module.rb +14 -0
  217. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/aliasing.rb +31 -0
  218. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/anonymous.rb +30 -0
  219. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/attr_internal.rb +38 -0
  220. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/attribute_accessors.rb +215 -0
  221. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/attribute_accessors_per_thread.rb +150 -0
  222. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/concerning.rb +134 -0
  223. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/delegation.rb +287 -0
  224. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/deprecation.rb +25 -0
  225. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/introspection.rb +62 -0
  226. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/reachable.rb +11 -0
  227. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/redefine_method.rb +49 -0
  228. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/module/remove_method.rb +17 -0
  229. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/name_error.rb +38 -0
  230. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/numeric.rb +6 -0
  231. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/numeric/bytes.rb +66 -0
  232. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/numeric/conversions.rb +140 -0
  233. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/numeric/inquiry.rb +28 -0
  234. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/numeric/time.rb +66 -0
  235. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object.rb +16 -0
  236. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/acts_like.rb +21 -0
  237. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/blank.rb +156 -0
  238. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/conversions.rb +6 -0
  239. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/deep_dup.rb +55 -0
  240. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/duplicable.rb +156 -0
  241. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/inclusion.rb +29 -0
  242. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/instance_variables.rb +30 -0
  243. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/json.rb +227 -0
  244. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/to_param.rb +3 -0
  245. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/to_query.rb +89 -0
  246. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/try.rb +148 -0
  247. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/object/with_options.rb +82 -0
  248. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range.rb +7 -0
  249. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/compare_range.rb +61 -0
  250. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/conversions.rb +39 -0
  251. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/each.rb +25 -0
  252. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/include_range.rb +3 -0
  253. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/include_time_with_zone.rb +23 -0
  254. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/range/overlaps.rb +10 -0
  255. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/regexp.rb +11 -0
  256. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/securerandom.rb +25 -0
  257. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string.rb +15 -0
  258. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/access.rb +106 -0
  259. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/behavior.rb +8 -0
  260. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/conversions.rb +59 -0
  261. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/exclude.rb +13 -0
  262. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/filters.rb +104 -0
  263. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/indent.rb +45 -0
  264. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/inflections.rb +254 -0
  265. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/inquiry.rb +15 -0
  266. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/multibyte.rb +57 -0
  267. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/output_safety.rb +258 -0
  268. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/starts_ends_with.rb +6 -0
  269. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/strip.rb +25 -0
  270. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/string/zones.rb +16 -0
  271. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time.rb +7 -0
  272. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time/acts_like.rb +10 -0
  273. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time/calculations.rb +315 -0
  274. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time/compatibility.rb +16 -0
  275. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time/conversions.rb +72 -0
  276. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/time/zones.rb +113 -0
  277. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/core_ext/uri.rb +24 -0
  278. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/current_attributes.rb +195 -0
  279. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/dependencies.rb +753 -0
  280. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/dependencies/autoload.rb +79 -0
  281. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/dependencies/interlock.rb +57 -0
  282. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation.rb +46 -0
  283. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/behaviors.rb +109 -0
  284. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/constant_accessor.rb +52 -0
  285. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/instance_delegator.rb +39 -0
  286. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/method_wrappers.rb +90 -0
  287. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/proxy_wrappers.rb +154 -0
  288. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/deprecation/reporting.rb +114 -0
  289. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/descendants_tracker.rb +62 -0
  290. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/digest.rb +20 -0
  291. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/duration.rb +432 -0
  292. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/duration/iso8601_parser.rb +125 -0
  293. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/duration/iso8601_serializer.rb +55 -0
  294. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/encrypted_configuration.rb +49 -0
  295. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/encrypted_file.rb +99 -0
  296. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/evented_file_update_checker.rb +205 -0
  297. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/execution_wrapper.rb +128 -0
  298. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/executor.rb +8 -0
  299. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/file_update_checker.rb +163 -0
  300. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/gem_version.rb +17 -0
  301. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/gzip.rb +38 -0
  302. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/hash_with_indifferent_access.rb +395 -0
  303. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/i18n.rb +15 -0
  304. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/i18n_railtie.rb +118 -0
  305. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/inflections.rb +72 -0
  306. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/inflector.rb +9 -0
  307. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/inflector/inflections.rb +260 -0
  308. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/inflector/methods.rb +410 -0
  309. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/inflector/transliterate.rb +118 -0
  310. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/json.rb +4 -0
  311. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/json/decoding.rb +76 -0
  312. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/json/encoding.rb +130 -0
  313. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/key_generator.rb +73 -0
  314. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/lazy_load_hooks.rb +78 -0
  315. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/locale/en.yml +135 -0
  316. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/log_subscriber.rb +112 -0
  317. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/log_subscriber/test_helper.rb +106 -0
  318. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/logger.rb +108 -0
  319. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/logger_silence.rb +29 -0
  320. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/logger_thread_safe_level.rb +33 -0
  321. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/message_encryptor.rb +229 -0
  322. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/message_verifier.rb +205 -0
  323. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/messages/metadata.rb +71 -0
  324. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/messages/rotation_configuration.rb +22 -0
  325. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/messages/rotator.rb +56 -0
  326. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/multibyte.rb +23 -0
  327. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/multibyte/chars.rb +235 -0
  328. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/multibyte/unicode.rb +394 -0
  329. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/notifications.rb +216 -0
  330. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/notifications/fanout.rb +159 -0
  331. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/notifications/instrumenter.rb +93 -0
  332. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper.rb +371 -0
  333. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_converter.rb +184 -0
  334. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_currency_converter.rb +46 -0
  335. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_delimited_converter.rb +29 -0
  336. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_human_converter.rb +68 -0
  337. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_human_size_converter.rb +59 -0
  338. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_percentage_converter.rb +14 -0
  339. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_phone_converter.rb +58 -0
  340. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/number_to_rounded_converter.rb +54 -0
  341. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/number_helper/rounding_helper.rb +66 -0
  342. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/option_merger.rb +27 -0
  343. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/ordered_hash.rb +50 -0
  344. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/ordered_options.rb +85 -0
  345. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/per_thread_registry.rb +60 -0
  346. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/proxy_object.rb +15 -0
  347. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/rails.rb +35 -0
  348. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/railtie.rb +80 -0
  349. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/reloader.rb +131 -0
  350. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/rescuable.rb +174 -0
  351. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/security_utils.rb +31 -0
  352. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/string_inquirer.rb +34 -0
  353. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/subscriber.rb +130 -0
  354. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/tagged_logging.rb +79 -0
  355. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/test_case.rb +72 -0
  356. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/assertions.rb +214 -0
  357. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/autorun.rb +7 -0
  358. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/constant_lookup.rb +51 -0
  359. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/declarative.rb +28 -0
  360. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/deprecation.rb +39 -0
  361. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/file_fixtures.rb +36 -0
  362. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/isolation.rb +110 -0
  363. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/method_call_assertions.rb +43 -0
  364. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/setup_and_teardown.rb +55 -0
  365. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/stream.rb +44 -0
  366. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/tagged_logging.rb +27 -0
  367. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/testing/time_helpers.rb +200 -0
  368. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/time.rb +20 -0
  369. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/time_with_zone.rb +551 -0
  370. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/values/time_zone.rb +565 -0
  371. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/values/unicode_tables.dat +0 -0
  372. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/version.rb +10 -0
  373. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini.rb +209 -0
  374. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/jdom.rb +183 -0
  375. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/libxml.rb +80 -0
  376. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/libxmlsax.rb +83 -0
  377. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/nokogiri.rb +83 -0
  378. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/nokogirisax.rb +86 -0
  379. data/vendor/bundle/ruby/2.5.0/gems/activesupport-5.2.3/lib/active_support/xml_mini/rexml.rb +130 -0
  380. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/CHANGELOG +18 -0
  381. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/LICENSE +184 -0
  382. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/Manifest +24 -0
  383. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/README +67 -0
  384. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/allison.gemspec +48 -0
  385. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/bin/allison +9 -0
  386. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/BODY +570 -0
  387. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/CLASS_INDEX +4 -0
  388. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/CLASS_PAGE +1 -0
  389. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/FILE_INDEX +4 -0
  390. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/FILE_PAGE +1 -0
  391. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/FONTS +1 -0
  392. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/FR_INDEX_BODY +1 -0
  393. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/INDEX +1 -0
  394. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/JAVASCRIPT +316 -0
  395. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/METHOD_INDEX +4 -0
  396. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/METHOD_LIST +1 -0
  397. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/SRC_PAGE +1 -0
  398. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/cache/STYLE +320 -0
  399. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/contrib/Rakefile +147 -0
  400. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/contrib/rdoc_patch.rb +252 -0
  401. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/contrib/rdoc_patch_test.rb +95 -0
  402. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/lib/allison.css +314 -0
  403. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/lib/allison.js +316 -0
  404. data/vendor/bundle/ruby/2.5.0/gems/allison-2.0.3/lib/allison.rb +276 -0
  405. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/CHANGES +107 -0
  406. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/MIT-LICENSE +20 -0
  407. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/README.md +258 -0
  408. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/Rakefile +195 -0
  409. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/doc/jamis.rb +591 -0
  410. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/doc/releases/builder-1.2.4.rdoc +31 -0
  411. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/doc/releases/builder-2.0.0.rdoc +46 -0
  412. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/doc/releases/builder-2.1.1.rdoc +58 -0
  413. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/blankslate.rb +137 -0
  414. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder.rb +13 -0
  415. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/blankslate.rb +23 -0
  416. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/version.rb +8 -0
  417. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/xchar.rb +197 -0
  418. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/xmlbase.rb +199 -0
  419. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/xmlevents.rb +63 -0
  420. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/lib/builder/xmlmarkup.rb +339 -0
  421. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/rakelib/publish.rake +20 -0
  422. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/rakelib/tags.rake +62 -0
  423. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/rakelib/testing.rake +7 -0
  424. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/helper.rb +12 -0
  425. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/performance.rb +41 -0
  426. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/preload.rb +39 -0
  427. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_blankslate.rb +213 -0
  428. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_eventbuilder.rb +150 -0
  429. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_markupbuilder.rb +611 -0
  430. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_method_caching.rb +62 -0
  431. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_namecollision.rb +39 -0
  432. data/vendor/bundle/ruby/2.5.0/gems/builder-3.2.3/test/test_xchar.rb +78 -0
  433. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/CHANGELOG.md +478 -0
  434. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/Gemfile +41 -0
  435. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/LICENSE.md +23 -0
  436. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/README.md +381 -0
  437. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/Rakefile +327 -0
  438. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/ConcurrentRubyService.java +17 -0
  439. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/AtomicReferenceLibrary.java +175 -0
  440. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/JRubyMapBackendLibrary.java +248 -0
  441. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/JavaAtomicBooleanLibrary.java +93 -0
  442. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/JavaAtomicFixnumLibrary.java +113 -0
  443. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/JavaSemaphoreLibrary.java +159 -0
  444. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/SynchronizationLibrary.java +307 -0
  445. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/ConcurrentHashMap.java +31 -0
  446. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/ConcurrentHashMapV8.java +3863 -0
  447. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/LongAdder.java +203 -0
  448. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/Striped64.java +342 -0
  449. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/nounsafe/ConcurrentHashMapV8.java +3800 -0
  450. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/nounsafe/LongAdder.java +204 -0
  451. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166e/nounsafe/Striped64.java +291 -0
  452. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/ext/concurrent-ruby/com/concurrent_ruby/ext/jsr166y/ThreadLocalRandom.java +199 -0
  453. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent-ruby.rb +1 -0
  454. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent.rb +134 -0
  455. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/agent.rb +587 -0
  456. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/array.rb +66 -0
  457. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/async.rb +459 -0
  458. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atom.rb +222 -0
  459. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/abstract_thread_local_var.rb +66 -0
  460. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/atomic_boolean.rb +126 -0
  461. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/atomic_fixnum.rb +143 -0
  462. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/atomic_markable_reference.rb +164 -0
  463. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/atomic_reference.rb +204 -0
  464. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/count_down_latch.rb +100 -0
  465. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/cyclic_barrier.rb +128 -0
  466. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/event.rb +109 -0
  467. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/java_count_down_latch.rb +42 -0
  468. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/java_thread_local_var.rb +37 -0
  469. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/mutex_atomic_boolean.rb +62 -0
  470. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/mutex_atomic_fixnum.rb +75 -0
  471. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/mutex_count_down_latch.rb +44 -0
  472. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/mutex_semaphore.rb +115 -0
  473. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/read_write_lock.rb +254 -0
  474. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/reentrant_read_write_lock.rb +379 -0
  475. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/ruby_thread_local_var.rb +161 -0
  476. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/semaphore.rb +145 -0
  477. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic/thread_local_var.rb +104 -0
  478. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic_reference/mutex_atomic.rb +56 -0
  479. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomic_reference/numeric_cas_wrapper.rb +28 -0
  480. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/atomics.rb +10 -0
  481. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/copy_on_notify_observer_set.rb +107 -0
  482. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/copy_on_write_observer_set.rb +111 -0
  483. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/java_non_concurrent_priority_queue.rb +84 -0
  484. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/lock_free_stack.rb +158 -0
  485. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/map/atomic_reference_map_backend.rb +927 -0
  486. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/map/mri_map_backend.rb +66 -0
  487. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/map/non_concurrent_map_backend.rb +140 -0
  488. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/map/synchronized_map_backend.rb +82 -0
  489. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/non_concurrent_priority_queue.rb +143 -0
  490. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/collection/ruby_non_concurrent_priority_queue.rb +150 -0
  491. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concern/deprecation.rb +34 -0
  492. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concern/dereferenceable.rb +73 -0
  493. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concern/logging.rb +32 -0
  494. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concern/obligation.rb +220 -0
  495. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concern/observable.rb +110 -0
  496. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/concurrent_ruby.jar +0 -0
  497. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/configuration.rb +184 -0
  498. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/constants.rb +8 -0
  499. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/dataflow.rb +81 -0
  500. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/delay.rb +199 -0
  501. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/errors.rb +69 -0
  502. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/exchanger.rb +352 -0
  503. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/abstract_executor_service.rb +134 -0
  504. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/cached_thread_pool.rb +62 -0
  505. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/executor_service.rb +185 -0
  506. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/fixed_thread_pool.rb +206 -0
  507. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/immediate_executor.rb +66 -0
  508. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/indirect_immediate_executor.rb +44 -0
  509. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/java_executor_service.rb +91 -0
  510. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/java_single_thread_executor.rb +29 -0
  511. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/java_thread_pool_executor.rb +123 -0
  512. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/ruby_executor_service.rb +78 -0
  513. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/ruby_single_thread_executor.rb +22 -0
  514. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/ruby_thread_pool_executor.rb +362 -0
  515. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/safe_task_executor.rb +35 -0
  516. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/serial_executor_service.rb +34 -0
  517. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/serialized_execution.rb +107 -0
  518. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/serialized_execution_delegator.rb +28 -0
  519. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/simple_executor_service.rb +100 -0
  520. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/single_thread_executor.rb +56 -0
  521. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/thread_pool_executor.rb +87 -0
  522. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executor/timer_set.rb +173 -0
  523. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/executors.rb +20 -0
  524. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/future.rb +141 -0
  525. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/hash.rb +59 -0
  526. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/immutable_struct.rb +93 -0
  527. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/ivar.rb +207 -0
  528. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/map.rb +337 -0
  529. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/maybe.rb +229 -0
  530. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/mutable_struct.rb +229 -0
  531. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/mvar.rb +242 -0
  532. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/options.rb +42 -0
  533. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/promise.rb +579 -0
  534. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/promises.rb +2167 -0
  535. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/re_include.rb +58 -0
  536. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/scheduled_task.rb +318 -0
  537. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/set.rb +66 -0
  538. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/settable_struct.rb +129 -0
  539. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization.rb +30 -0
  540. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/abstract_lockable_object.rb +98 -0
  541. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/abstract_object.rb +24 -0
  542. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/abstract_struct.rb +160 -0
  543. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/condition.rb +60 -0
  544. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/jruby_lockable_object.rb +13 -0
  545. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/jruby_object.rb +45 -0
  546. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/lock.rb +36 -0
  547. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/lockable_object.rb +74 -0
  548. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/mri_object.rb +44 -0
  549. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/mutex_lockable_object.rb +76 -0
  550. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/object.rb +183 -0
  551. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/rbx_lockable_object.rb +65 -0
  552. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/rbx_object.rb +49 -0
  553. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/truffleruby_object.rb +47 -0
  554. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/synchronization/volatile.rb +36 -0
  555. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/synchronized_delegator.rb +50 -0
  556. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util.rb +16 -0
  557. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/adder.rb +74 -0
  558. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/cheap_lockable.rb +118 -0
  559. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/data_structures.rb +63 -0
  560. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/power_of_two_tuple.rb +38 -0
  561. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/striped64.rb +246 -0
  562. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/volatile.rb +75 -0
  563. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/thread_safe/util/xor_shift_random.rb +50 -0
  564. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/timer_task.rb +334 -0
  565. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/tuple.rb +86 -0
  566. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/tvar.rb +258 -0
  567. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/at_exit.rb +97 -0
  568. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/engine.rb +56 -0
  569. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/monotonic_time.rb +58 -0
  570. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/native_extension_loader.rb +79 -0
  571. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/native_integer.rb +53 -0
  572. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/utility/processor_counter.rb +158 -0
  573. data/vendor/bundle/ruby/2.5.0/gems/concurrent-ruby-1.1.5/lib/concurrent/version.rb +3 -0
  574. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/CHANGELOG +113 -0
  575. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/LICENSE +184 -0
  576. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/MIT-LICENSE +21 -0
  577. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/Manifest +19 -0
  578. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/README.rdoc +97 -0
  579. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/Rakefile +15 -0
  580. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/echoe.gemspec +45 -0
  581. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/echoe.pem +21 -0
  582. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/lib/echoe.rb +793 -0
  583. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/lib/echoe/extensions.rb +61 -0
  584. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/lib/echoe/platform.rb +37 -0
  585. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/lib/echoe/rubygems.rb +41 -0
  586. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/MIT-LICENSE +21 -0
  587. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/compositepublisher.rb +24 -0
  588. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/ftptools.rb +153 -0
  589. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/publisher.rb +75 -0
  590. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/rubyforgepublisher.rb +18 -0
  591. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/sshpublisher.rb +43 -0
  592. data/vendor/bundle/ruby/2.5.0/gems/echoe-4.6.6/vendor/rake/lib/rake/contrib/sys.rb +209 -0
  593. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/MIT-LICENSE +20 -0
  594. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/README.md +125 -0
  595. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n.rb +398 -0
  596. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend.rb +21 -0
  597. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/base.rb +284 -0
  598. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/cache.rb +113 -0
  599. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/cache_file.rb +36 -0
  600. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/cascade.rb +56 -0
  601. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/chain.rb +127 -0
  602. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/fallbacks.rb +84 -0
  603. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/flatten.rb +115 -0
  604. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/gettext.rb +85 -0
  605. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/interpolation_compiler.rb +123 -0
  606. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/key_value.rb +206 -0
  607. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/memoize.rb +54 -0
  608. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/metadata.rb +71 -0
  609. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/pluralization.rb +55 -0
  610. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/simple.rb +111 -0
  611. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/backend/transliterator.rb +108 -0
  612. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/config.rb +165 -0
  613. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/core_ext/hash.rb +47 -0
  614. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/exceptions.rb +111 -0
  615. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/gettext.rb +28 -0
  616. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/gettext/helpers.rb +75 -0
  617. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/gettext/po_parser.rb +329 -0
  618. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/interpolate/ruby.rb +39 -0
  619. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale.rb +8 -0
  620. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale/fallbacks.rb +96 -0
  621. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale/tag.rb +28 -0
  622. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale/tag/parents.rb +22 -0
  623. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale/tag/rfc4646.rb +74 -0
  624. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/locale/tag/simple.rb +39 -0
  625. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/middleware.rb +17 -0
  626. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests.rb +14 -0
  627. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/basics.rb +60 -0
  628. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/defaults.rb +52 -0
  629. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/interpolation.rb +159 -0
  630. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/link.rb +56 -0
  631. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/localization.rb +19 -0
  632. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/localization/date.rb +117 -0
  633. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/localization/date_time.rb +103 -0
  634. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/localization/procs.rb +116 -0
  635. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/localization/time.rb +103 -0
  636. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/lookup.rb +81 -0
  637. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/pluralization.rb +35 -0
  638. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/tests/procs.rb +55 -0
  639. data/vendor/bundle/ruby/2.5.0/gems/i18n-1.6.0/lib/i18n/version.rb +5 -0
  640. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/CHANGES.md +391 -0
  641. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/Gemfile +14 -0
  642. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/README-json-jruby.md +33 -0
  643. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/README.md +409 -0
  644. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/Rakefile +408 -0
  645. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/VERSION +1 -0
  646. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/fbuffer/fbuffer.h +187 -0
  647. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/generator/depend +1 -0
  648. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/generator/extconf.rb +4 -0
  649. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/generator/generator.c +1444 -0
  650. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/generator/generator.h +171 -0
  651. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/parser/depend +1 -0
  652. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/parser/extconf.rb +6 -0
  653. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/parser/parser.c +2131 -0
  654. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/parser/parser.h +91 -0
  655. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/ext/parser/parser.rl +891 -0
  656. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/ext/json/extconf.rb +2 -0
  657. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/install.rb +23 -0
  658. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/ByteListTranscoder.java +166 -0
  659. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/Generator.java +443 -0
  660. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/GeneratorMethods.java +231 -0
  661. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/GeneratorService.java +42 -0
  662. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/GeneratorState.java +490 -0
  663. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/OptionsReader.java +113 -0
  664. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/Parser.java +2362 -0
  665. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/Parser.rl +893 -0
  666. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/ParserService.java +34 -0
  667. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/RuntimeInfo.java +116 -0
  668. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/StringDecoder.java +166 -0
  669. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/StringEncoder.java +111 -0
  670. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/java/src/json/ext/Utils.java +88 -0
  671. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/json-java.gemspec +38 -0
  672. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/json.gemspec +0 -0
  673. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/json_pure.gemspec +38 -0
  674. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json.rb +63 -0
  675. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/bigdecimal.rb +29 -0
  676. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/complex.rb +29 -0
  677. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/core.rb +12 -0
  678. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/date.rb +34 -0
  679. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/date_time.rb +50 -0
  680. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/exception.rb +31 -0
  681. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/ostruct.rb +31 -0
  682. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/range.rb +29 -0
  683. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/rational.rb +28 -0
  684. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/regexp.rb +30 -0
  685. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/set.rb +29 -0
  686. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/struct.rb +30 -0
  687. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/symbol.rb +25 -0
  688. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/add/time.rb +38 -0
  689. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/common.rb +456 -0
  690. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/ext.rb +15 -0
  691. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/generic_object.rb +71 -0
  692. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/pure.rb +15 -0
  693. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/pure/generator.rb +458 -0
  694. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/pure/parser.rb +311 -0
  695. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/lib/json/version.rb +9 -0
  696. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/references/rfc7159.txt +899 -0
  697. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail10.json +1 -0
  698. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail11.json +1 -0
  699. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail12.json +1 -0
  700. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail13.json +1 -0
  701. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail14.json +1 -0
  702. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail18.json +1 -0
  703. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail19.json +1 -0
  704. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail2.json +1 -0
  705. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail20.json +1 -0
  706. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail21.json +1 -0
  707. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail22.json +1 -0
  708. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail23.json +1 -0
  709. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail24.json +1 -0
  710. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail25.json +1 -0
  711. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail27.json +2 -0
  712. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail28.json +2 -0
  713. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail3.json +1 -0
  714. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail4.json +1 -0
  715. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail5.json +1 -0
  716. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail6.json +1 -0
  717. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail7.json +1 -0
  718. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail8.json +1 -0
  719. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/fail9.json +1 -0
  720. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/obsolete_fail1.json +1 -0
  721. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass1.json +56 -0
  722. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass15.json +1 -0
  723. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass16.json +1 -0
  724. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass17.json +1 -0
  725. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass2.json +1 -0
  726. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass26.json +1 -0
  727. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/fixtures/pass3.json +6 -0
  728. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_addition_test.rb +203 -0
  729. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_common_interface_test.rb +126 -0
  730. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_encoding_test.rb +107 -0
  731. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_ext_parser_test.rb +15 -0
  732. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_fixtures_test.rb +32 -0
  733. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_generator_test.rb +377 -0
  734. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_generic_object_test.rb +82 -0
  735. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_parser_test.rb +472 -0
  736. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/json_string_matching_test.rb +38 -0
  737. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tests/test_helper.rb +17 -0
  738. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tools/diff.sh +18 -0
  739. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tools/fuzz.rb +131 -0
  740. data/vendor/bundle/ruby/2.5.0/gems/json_pure-2.2.0/tools/server.rb +62 -0
  741. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/History.rdoc +1310 -0
  742. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/Manifest.txt +26 -0
  743. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/README.rdoc +746 -0
  744. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/Rakefile +86 -0
  745. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/design_rationale.rb +52 -0
  746. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/hoe/minitest.rb +32 -0
  747. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest.rb +987 -0
  748. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/assertions.rb +693 -0
  749. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/autorun.rb +13 -0
  750. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/benchmark.rb +455 -0
  751. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/expectations.rb +284 -0
  752. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/hell.rb +11 -0
  753. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/mock.rb +240 -0
  754. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/parallel.rb +70 -0
  755. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/pride.rb +4 -0
  756. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/pride_plugin.rb +142 -0
  757. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/spec.rb +331 -0
  758. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/test.rb +220 -0
  759. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/lib/minitest/unit.rb +45 -0
  760. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/metametameta.rb +102 -0
  761. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/test_minitest_benchmark.rb +137 -0
  762. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/test_minitest_mock.rb +874 -0
  763. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/test_minitest_reporter.rb +299 -0
  764. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/test_minitest_spec.rb +987 -0
  765. data/vendor/bundle/ruby/2.5.0/gems/minitest-5.11.3/test/minitest/test_minitest_test.rb +2142 -0
  766. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/CONTRIBUTING.rdoc +43 -0
  767. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/Gemfile +3 -0
  768. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/History.rdoc +2333 -0
  769. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/MIT-LICENSE +21 -0
  770. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/README.rdoc +156 -0
  771. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/Rakefile +41 -0
  772. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/bundle +105 -0
  773. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/console +7 -0
  774. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/rake +29 -0
  775. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/rdoc +29 -0
  776. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/rubocop +29 -0
  777. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/bin/setup +6 -0
  778. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/command_line_usage.rdoc +158 -0
  779. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/example/Rakefile1 +38 -0
  780. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/example/Rakefile2 +35 -0
  781. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/example/a.c +6 -0
  782. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/example/b.c +6 -0
  783. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/example/main.c +11 -0
  784. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/glossary.rdoc +42 -0
  785. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/jamis.rb +592 -0
  786. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/proto_rake.rdoc +127 -0
  787. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/rake.1 +156 -0
  788. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/rakefile.rdoc +622 -0
  789. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/doc/rational.rdoc +151 -0
  790. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/exe/rake +27 -0
  791. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake.rb +71 -0
  792. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/application.rb +824 -0
  793. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/backtrace.rb +24 -0
  794. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/clean.rb +78 -0
  795. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/cloneable.rb +17 -0
  796. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/cpu_counter.rb +107 -0
  797. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/default_loader.rb +15 -0
  798. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/dsl_definition.rb +195 -0
  799. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/early_time.rb +22 -0
  800. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/ext/core.rb +26 -0
  801. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/ext/string.rb +176 -0
  802. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/file_creation_task.rb +25 -0
  803. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/file_list.rb +435 -0
  804. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/file_task.rb +54 -0
  805. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/file_utils.rb +137 -0
  806. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/file_utils_ext.rb +145 -0
  807. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/invocation_chain.rb +57 -0
  808. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/invocation_exception_mixin.rb +17 -0
  809. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/late_time.rb +18 -0
  810. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/linked_list.rb +112 -0
  811. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/loaders/makefile.rb +54 -0
  812. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/multi_task.rb +14 -0
  813. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/name_space.rb +38 -0
  814. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/packagetask.rb +207 -0
  815. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/phony.rb +16 -0
  816. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/private_reader.rb +21 -0
  817. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/promise.rb +100 -0
  818. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/pseudo_status.rb +30 -0
  819. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/rake_module.rb +67 -0
  820. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/rake_test_loader.rb +27 -0
  821. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/rule_recursion_overflow_error.rb +20 -0
  822. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/scope.rb +43 -0
  823. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/task.rb +413 -0
  824. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/task_argument_error.rb +8 -0
  825. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/task_arguments.rb +109 -0
  826. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/task_manager.rb +323 -0
  827. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/tasklib.rb +12 -0
  828. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/testtask.rb +224 -0
  829. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/thread_history_display.rb +49 -0
  830. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/thread_pool.rb +163 -0
  831. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/trace_output.rb +23 -0
  832. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/version.rb +10 -0
  833. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/lib/rake/win32.rb +51 -0
  834. data/vendor/bundle/ruby/2.5.0/gems/rake-12.3.2/rake.gemspec +42 -0
  835. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/CONTRIBUTING.rdoc +220 -0
  836. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/CVE-2013-0256.rdoc +49 -0
  837. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/ExampleMarkdown.md +37 -0
  838. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/ExampleRDoc.rdoc +208 -0
  839. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/Gemfile +3 -0
  840. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/History.rdoc +1666 -0
  841. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/LEGAL.rdoc +50 -0
  842. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/LICENSE.rdoc +57 -0
  843. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/README.rdoc +130 -0
  844. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/RI.rdoc +57 -0
  845. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/Rakefile +91 -0
  846. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/TODO.rdoc +59 -0
  847. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/appveyor.yml +36 -0
  848. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/bin/console +7 -0
  849. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/bin/setup +6 -0
  850. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/exe/rdoc +44 -0
  851. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/exe/ri +12 -0
  852. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc.rb +180 -0
  853. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/alias.rb +112 -0
  854. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/anon_class.rb +11 -0
  855. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/any_method.rb +316 -0
  856. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/attr.rb +176 -0
  857. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/class_module.rb +802 -0
  858. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/code_object.rb +421 -0
  859. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/code_objects.rb +6 -0
  860. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/comment.rb +239 -0
  861. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/constant.rb +187 -0
  862. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/context.rb +1258 -0
  863. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/context/section.rb +245 -0
  864. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/cross_reference.rb +202 -0
  865. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/encoding.rb +136 -0
  866. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/erb_partial.rb +19 -0
  867. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/erbio.rb +42 -0
  868. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/extend.rb +10 -0
  869. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator.rb +51 -0
  870. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/darkfish.rb +790 -0
  871. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/json_index.rb +300 -0
  872. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/markup.rb +160 -0
  873. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/pot.rb +98 -0
  874. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/pot/message_extractor.rb +68 -0
  875. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/pot/po.rb +84 -0
  876. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/pot/po_entry.rb +141 -0
  877. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/ri.rb +31 -0
  878. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_footer.rhtml +5 -0
  879. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_head.rhtml +20 -0
  880. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_VCS_info.rhtml +19 -0
  881. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_classes.rhtml +9 -0
  882. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_extends.rhtml +15 -0
  883. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_in_files.rhtml +9 -0
  884. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_includes.rhtml +15 -0
  885. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_installed.rhtml +15 -0
  886. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_methods.rhtml +12 -0
  887. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_navigation.rhtml +11 -0
  888. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_pages.rhtml +12 -0
  889. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_parent.rhtml +11 -0
  890. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_search.rhtml +14 -0
  891. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_sections.rhtml +11 -0
  892. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/_sidebar_table_of_contents.rhtml +18 -0
  893. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/class.rhtml +172 -0
  894. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/css/fonts.css +167 -0
  895. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/css/rdoc.css +590 -0
  896. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/Lato-Light.ttf +0 -0
  897. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/Lato-LightItalic.ttf +0 -0
  898. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/Lato-Regular.ttf +0 -0
  899. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/Lato-RegularItalic.ttf +0 -0
  900. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Bold.ttf +0 -0
  901. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Regular.ttf +0 -0
  902. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/add.png +0 -0
  903. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/arrow_up.png +0 -0
  904. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/brick.png +0 -0
  905. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/brick_link.png +0 -0
  906. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/bug.png +0 -0
  907. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/bullet_black.png +0 -0
  908. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/bullet_toggle_minus.png +0 -0
  909. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/bullet_toggle_plus.png +0 -0
  910. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/date.png +0 -0
  911. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/delete.png +0 -0
  912. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/find.png +0 -0
  913. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/loadingAnimation.gif +0 -0
  914. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/macFFBgHack.png +0 -0
  915. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/package.png +0 -0
  916. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/page_green.png +0 -0
  917. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/page_white_text.png +0 -0
  918. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/page_white_width.png +0 -0
  919. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/plugin.png +0 -0
  920. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/ruby.png +0 -0
  921. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/tag_blue.png +0 -0
  922. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/tag_green.png +0 -0
  923. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/transparent.png +0 -0
  924. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/wrench.png +0 -0
  925. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/wrench_orange.png +0 -0
  926. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/images/zoom.png +0 -0
  927. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/index.rhtml +23 -0
  928. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/js/darkfish.js +161 -0
  929. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/js/jquery.js +4 -0
  930. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/js/search.js +109 -0
  931. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/page.rhtml +18 -0
  932. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/servlet_not_found.rhtml +18 -0
  933. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/servlet_root.rhtml +63 -0
  934. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/darkfish/table_of_contents.rhtml +58 -0
  935. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/json_index/js/navigation.js +141 -0
  936. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/generator/template/json_index/js/searcher.js +229 -0
  937. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ghost_method.rb +7 -0
  938. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/i18n.rb +10 -0
  939. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/i18n/locale.rb +102 -0
  940. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/i18n/text.rb +126 -0
  941. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/include.rb +10 -0
  942. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/known_classes.rb +73 -0
  943. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markdown.kpeg +1219 -0
  944. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markdown/entities.rb +2132 -0
  945. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markdown/literals.kpeg +23 -0
  946. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup.rb +868 -0
  947. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/attr_changer.rb +23 -0
  948. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/attr_span.rb +30 -0
  949. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/attribute_manager.rb +344 -0
  950. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/attributes.rb +71 -0
  951. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/blank_line.rb +28 -0
  952. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/block_quote.rb +15 -0
  953. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/document.rb +165 -0
  954. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/formatter.rb +266 -0
  955. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/formatter_test_case.rb +764 -0
  956. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/hard_break.rb +32 -0
  957. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/heading.rb +79 -0
  958. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/include.rb +43 -0
  959. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/indented_paragraph.rb +48 -0
  960. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/list.rb +102 -0
  961. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/list_item.rb +100 -0
  962. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/paragraph.rb +29 -0
  963. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/parser.rb +559 -0
  964. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/pre_process.rb +296 -0
  965. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/raw.rb +70 -0
  966. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/regexp_handling.rb +41 -0
  967. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/rule.rb +21 -0
  968. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/text_formatter_test_case.rb +115 -0
  969. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_ansi.rb +94 -0
  970. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_bs.rb +77 -0
  971. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_html.rb +404 -0
  972. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_html_crossref.rb +164 -0
  973. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_html_snippet.rb +285 -0
  974. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_joined_paragraph.rb +46 -0
  975. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_label.rb +75 -0
  976. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_markdown.rb +192 -0
  977. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_rdoc.rb +334 -0
  978. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_table_of_contents.rb +88 -0
  979. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_test.rb +70 -0
  980. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/to_tt_only.rb +121 -0
  981. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/markup/verbatim.rb +84 -0
  982. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/meta_method.rb +7 -0
  983. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/method_attr.rb +419 -0
  984. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/mixin.rb +121 -0
  985. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/normal_class.rb +93 -0
  986. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/normal_module.rb +74 -0
  987. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/options.rb +1235 -0
  988. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser.rb +277 -0
  989. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/c.rb +1269 -0
  990. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/changelog.rb +204 -0
  991. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/markdown.rb +24 -0
  992. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/rd.rb +23 -0
  993. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/ripper_state_lex.rb +589 -0
  994. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/ruby.rb +2317 -0
  995. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/ruby_tools.rb +167 -0
  996. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/simple.rb +61 -0
  997. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/parser/text.rb +12 -0
  998. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rd.rb +100 -0
  999. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rd/block_parser.ry +639 -0
  1000. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rd/inline.rb +72 -0
  1001. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rd/inline_parser.ry +593 -0
  1002. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rdoc.rb +566 -0
  1003. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/require.rb +52 -0
  1004. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri.rb +21 -0
  1005. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri/driver.rb +1568 -0
  1006. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri/formatter.rb +6 -0
  1007. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri/paths.rb +185 -0
  1008. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri/store.rb +7 -0
  1009. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/ri/task.rb +71 -0
  1010. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/rubygems_hook.rb +246 -0
  1011. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/servlet.rb +443 -0
  1012. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/single_class.rb +26 -0
  1013. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/stats.rb +462 -0
  1014. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/stats/normal.rb +58 -0
  1015. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/stats/quiet.rb +60 -0
  1016. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/stats/verbose.rb +46 -0
  1017. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/store.rb +987 -0
  1018. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/task.rb +329 -0
  1019. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/text.rb +298 -0
  1020. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/token_stream.rb +114 -0
  1021. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/tom_doc.rb +264 -0
  1022. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/top_level.rb +289 -0
  1023. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/lib/rdoc/version.rb +8 -0
  1024. data/vendor/bundle/ruby/2.5.0/gems/rdoc-6.1.1/rdoc.gemspec +62 -0
  1025. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/History.txt +128 -0
  1026. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/Manifest.txt +9 -0
  1027. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/README.txt +55 -0
  1028. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/Rakefile +40 -0
  1029. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/bin/rubyforge +222 -0
  1030. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/lib/rubyforge.rb +389 -0
  1031. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/lib/rubyforge/client.rb +124 -0
  1032. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/test/test_rubyforge.rb +329 -0
  1033. data/vendor/bundle/ruby/2.5.0/gems/rubyforge-2.0.4/test/test_rubyforge_client.rb +57 -0
  1034. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/Gemfile +20 -0
  1035. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/LICENSE +144 -0
  1036. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/README.md +60 -0
  1037. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/Rakefile +62 -0
  1038. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/examples/bench_cache.rb +35 -0
  1039. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/JRubyCacheBackendLibrary.java +245 -0
  1040. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMap.java +31 -0
  1041. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMapV8.java +3863 -0
  1042. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/LongAdder.java +203 -0
  1043. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/Striped64.java +342 -0
  1044. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/ConcurrentHashMapV8.java +3800 -0
  1045. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/LongAdder.java +204 -0
  1046. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/Striped64.java +291 -0
  1047. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166y/ThreadLocalRandom.java +199 -0
  1048. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/ext/thread_safe/JrubyCacheBackendService.java +15 -0
  1049. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe.rb +65 -0
  1050. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/atomic_reference_cache_backend.rb +908 -0
  1051. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/cache.rb +161 -0
  1052. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/mri_cache_backend.rb +60 -0
  1053. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/non_concurrent_cache_backend.rb +135 -0
  1054. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/synchronized_cache_backend.rb +77 -0
  1055. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/synchronized_delegator.rb +43 -0
  1056. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util.rb +16 -0
  1057. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/adder.rb +62 -0
  1058. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/atomic_reference.rb +44 -0
  1059. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/cheap_lockable.rb +106 -0
  1060. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/power_of_two_tuple.rb +26 -0
  1061. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/striped64.rb +222 -0
  1062. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/volatile.rb +64 -0
  1063. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/volatile_tuple.rb +46 -0
  1064. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/util/xor_shift_random.rb +41 -0
  1065. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/lib/thread_safe/version.rb +21 -0
  1066. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/spec_helper.rb +31 -0
  1067. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/src/thread_safe/SecurityManager.java +21 -0
  1068. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/support/threads.rb +1 -0
  1069. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/support/threadsafe_test.rb +75 -0
  1070. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/array_spec.rb +18 -0
  1071. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/cache_loops_spec.rb +507 -0
  1072. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/cache_spec.rb +943 -0
  1073. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/hash_spec.rb +17 -0
  1074. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/no_unsafe_spec.rb +27 -0
  1075. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/spec/thread_safe/synchronized_delegator_spec.rb +85 -0
  1076. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/tasks/update_doc.rake +45 -0
  1077. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/thread_safe.gemspec +26 -0
  1078. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/yard-template/default/fulldoc/html/css/common.css +125 -0
  1079. data/vendor/bundle/ruby/2.5.0/gems/thread_safe-0.3.6/yard-template/default/layout/html/footer.erb +16 -0
  1080. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/CHANGES.md +786 -0
  1081. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/LICENSE +19 -0
  1082. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/README.md +151 -0
  1083. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/Rakefile +107 -0
  1084. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo.rb +40 -0
  1085. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/country.rb +196 -0
  1086. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/country_index_definition.rb +31 -0
  1087. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/country_info.rb +42 -0
  1088. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/country_timezone.rb +135 -0
  1089. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/data_source.rb +190 -0
  1090. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/data_timezone.rb +58 -0
  1091. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/data_timezone_info.rb +55 -0
  1092. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/info_timezone.rb +30 -0
  1093. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/linked_timezone.rb +63 -0
  1094. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/linked_timezone_info.rb +26 -0
  1095. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/offset_rationals.rb +77 -0
  1096. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/ruby_core_support.rb +146 -0
  1097. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/ruby_country_info.rb +74 -0
  1098. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/ruby_data_source.rb +136 -0
  1099. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/time_or_datetime.rb +340 -0
  1100. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone.rb +669 -0
  1101. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_definition.rb +36 -0
  1102. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_index_definition.rb +54 -0
  1103. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_info.rb +30 -0
  1104. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_offset.rb +101 -0
  1105. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_period.rb +245 -0
  1106. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_proxy.rb +105 -0
  1107. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_transition.rb +130 -0
  1108. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/timezone_transition_definition.rb +104 -0
  1109. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/transition_data_timezone_info.rb +274 -0
  1110. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/zoneinfo_country_info.rb +37 -0
  1111. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/zoneinfo_data_source.rb +488 -0
  1112. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/lib/tzinfo/zoneinfo_timezone_info.rb +296 -0
  1113. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_country.rb +234 -0
  1114. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_country_index_definition.rb +69 -0
  1115. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_country_info.rb +16 -0
  1116. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_country_timezone.rb +173 -0
  1117. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_data_source.rb +218 -0
  1118. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_data_timezone.rb +99 -0
  1119. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_data_timezone_info.rb +18 -0
  1120. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_info_timezone.rb +34 -0
  1121. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_linked_timezone.rb +155 -0
  1122. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_linked_timezone_info.rb +23 -0
  1123. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_offset_rationals.rb +23 -0
  1124. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_ruby_core_support.rb +168 -0
  1125. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_ruby_country_info.rb +110 -0
  1126. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_ruby_data_source.rb +143 -0
  1127. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_time_or_datetime.rb +654 -0
  1128. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone.rb +1350 -0
  1129. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_definition.rb +113 -0
  1130. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_index_definition.rb +73 -0
  1131. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_info.rb +11 -0
  1132. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_london.rb +143 -0
  1133. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_melbourne.rb +142 -0
  1134. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_new_york.rb +142 -0
  1135. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_offset.rb +126 -0
  1136. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_period.rb +555 -0
  1137. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_proxy.rb +136 -0
  1138. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_transition.rb +366 -0
  1139. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_transition_definition.rb +295 -0
  1140. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_timezone_utc.rb +27 -0
  1141. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_transition_data_timezone_info.rb +423 -0
  1142. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_zoneinfo_country_info.rb +78 -0
  1143. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_zoneinfo_data_source.rb +1195 -0
  1144. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tc_zoneinfo_timezone_info.rb +1232 -0
  1145. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/test_utils.rb +163 -0
  1146. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/ts_all.rb +7 -0
  1147. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/ts_all_ruby.rb +5 -0
  1148. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/ts_all_zoneinfo.rb +7 -0
  1149. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data.rb +8 -0
  1150. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/America/Argentina/Buenos_Aires.rb +89 -0
  1151. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/America/New_York.rb +315 -0
  1152. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Australia/Melbourne.rb +218 -0
  1153. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/EST.rb +19 -0
  1154. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Etc/GMT__m__1.rb +21 -0
  1155. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Etc/GMT__p__1.rb +21 -0
  1156. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Etc/UTC.rb +21 -0
  1157. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Europe/Amsterdam.rb +261 -0
  1158. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Europe/Andorra.rb +186 -0
  1159. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Europe/London.rb +321 -0
  1160. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Europe/Paris.rb +265 -0
  1161. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/Europe/Prague.rb +220 -0
  1162. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/definitions/UTC.rb +16 -0
  1163. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/indexes/countries.rb +927 -0
  1164. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/indexes/timezones.rb +596 -0
  1165. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/tzinfo-data/tzinfo/data/version.rb +14 -0
  1166. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/America/Argentina/Buenos_Aires +0 -0
  1167. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/America/New_York +0 -0
  1168. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Australia/Melbourne +0 -0
  1169. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/EST +0 -0
  1170. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Etc/UTC +0 -0
  1171. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Europe/Amsterdam +0 -0
  1172. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Europe/Andorra +0 -0
  1173. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Europe/London +0 -0
  1174. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Europe/Paris +0 -0
  1175. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Europe/Prague +0 -0
  1176. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/Factory +0 -0
  1177. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/iso3166.tab +275 -0
  1178. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/leapseconds +61 -0
  1179. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/posix/Europe/London +0 -0
  1180. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/posixrules +0 -0
  1181. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/right/Europe/London +0 -0
  1182. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/zone.tab +439 -0
  1183. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/test/zoneinfo/zone1970.tab +369 -0
  1184. data/vendor/bundle/ruby/2.5.0/gems/tzinfo-1.2.5/tzinfo.gemspec +21 -0
  1185. data/vendor/bundle/ruby/2.5.0/specifications/activemodel-5.2.3.gemspec +34 -0
  1186. data/vendor/bundle/ruby/2.5.0/specifications/activemodel-serializers-xml-1.0.2.gemspec +46 -0
  1187. data/vendor/bundle/ruby/2.5.0/specifications/activeresource-5.1.0.gemspec +48 -0
  1188. data/vendor/bundle/ruby/2.5.0/specifications/activesupport-5.2.3.gemspec +44 -0
  1189. data/vendor/bundle/ruby/2.5.0/specifications/allison-2.0.3.gemspec +23 -0
  1190. data/vendor/bundle/ruby/2.5.0/specifications/builder-3.2.3.gemspec +21 -0
  1191. data/vendor/bundle/ruby/2.5.0/specifications/concurrent-ruby-1.1.5.gemspec +24 -0
  1192. data/vendor/bundle/ruby/2.5.0/specifications/echoe-4.6.6.gemspec +46 -0
  1193. data/vendor/bundle/ruby/2.5.0/specifications/i18n-1.6.0.gemspec +35 -0
  1194. data/vendor/bundle/ruby/2.5.0/specifications/json_pure-2.2.0.gemspec +39 -0
  1195. data/vendor/bundle/ruby/2.5.0/specifications/minitest-5.11.3.gemspec +39 -0
  1196. data/vendor/bundle/ruby/2.5.0/specifications/rake-12.3.2.gemspec +49 -0
  1197. data/vendor/bundle/ruby/2.5.0/specifications/rdoc-6.1.1.gemspec +50 -0
  1198. data/vendor/bundle/ruby/2.5.0/specifications/rubyforge-2.0.4.gemspec +36 -0
  1199. data/vendor/bundle/ruby/2.5.0/specifications/thread_safe-0.3.6.gemspec +38 -0
  1200. data/vendor/bundle/ruby/2.5.0/specifications/tzinfo-1.2.5.gemspec +37 -0
  1201. metadata +1283 -91
  1202. metadata.gz.sig +2 -0
  1203. data/sbin/rake-deploy1.sh +0 -9
  1204. data/sbin/rake-deploy2.sh +0 -11
  1205. data/sbin/reboot.rb +0 -3
  1206. data/sbin/ric_reboot.rb +0 -3
@@ -0,0 +1,31 @@
1
+ package com.concurrent_ruby.ext.jsr166e;
2
+
3
+ import java.util.Map;
4
+ import java.util.Set;
5
+
6
+ public interface ConcurrentHashMap<K, V> {
7
+ /** Interface describing a function of one argument */
8
+ public interface Fun<A,T> { T apply(A a); }
9
+ /** Interface describing a function of two arguments */
10
+ public interface BiFun<A,B,T> { T apply(A a, B b); }
11
+
12
+ public V get(K key);
13
+ public V put(K key, V value);
14
+ public V putIfAbsent(K key, V value);
15
+ public V computeIfAbsent(K key, Fun<? super K, ? extends V> mf);
16
+ public V computeIfPresent(K key, BiFun<? super K, ? super V, ? extends V> mf);
17
+ public V compute(K key, BiFun<? super K, ? super V, ? extends V> mf);
18
+ public V merge(K key, V value, BiFun<? super V, ? super V, ? extends V> mf);
19
+ public boolean replace(K key, V oldVal, V newVal);
20
+ public V replace(K key, V value);
21
+ public boolean containsKey(K key);
22
+ public boolean remove(Object key, Object value);
23
+ public V remove(K key);
24
+ public void clear();
25
+ public Set<Map.Entry<K,V>> entrySet();
26
+ public int size();
27
+ public V getValueOrDefault(Object key, V defaultValue);
28
+
29
+ public boolean containsValue(V value);
30
+ public K findKey(V value);
31
+ }
@@ -0,0 +1,3863 @@
1
+ /*
2
+ * Written by Doug Lea with assistance from members of JCP JSR-166
3
+ * Expert Group and released to the public domain, as explained at
4
+ * http://creativecommons.org/publicdomain/zero/1.0/
5
+ */
6
+
7
+ // This is based on the 1.79 version.
8
+
9
+ package com.concurrent_ruby.ext.jsr166e;
10
+
11
+ import org.jruby.RubyClass;
12
+ import org.jruby.RubyNumeric;
13
+ import org.jruby.RubyObject;
14
+ import org.jruby.exceptions.RaiseException;
15
+ import com.concurrent_ruby.ext.jsr166y.ThreadLocalRandom;
16
+ import org.jruby.runtime.ThreadContext;
17
+ import org.jruby.runtime.builtin.IRubyObject;
18
+
19
+ import java.util.Arrays;
20
+ import java.util.Map;
21
+ import java.util.Set;
22
+ import java.util.Collection;
23
+ import java.util.Hashtable;
24
+ import java.util.HashMap;
25
+ import java.util.Iterator;
26
+ import java.util.Enumeration;
27
+ import java.util.ConcurrentModificationException;
28
+ import java.util.NoSuchElementException;
29
+ import java.util.concurrent.ConcurrentMap;
30
+ import java.util.concurrent.locks.AbstractQueuedSynchronizer;
31
+
32
+ import java.io.Serializable;
33
+
34
+ /**
35
+ * A hash table supporting full concurrency of retrievals and
36
+ * high expected concurrency for updates. This class obeys the
37
+ * same functional specification as {@link java.util.Hashtable}, and
38
+ * includes versions of methods corresponding to each method of
39
+ * {@code Hashtable}. However, even though all operations are
40
+ * thread-safe, retrieval operations do <em>not</em> entail locking,
41
+ * and there is <em>not</em> any support for locking the entire table
42
+ * in a way that prevents all access. This class is fully
43
+ * interoperable with {@code Hashtable} in programs that rely on its
44
+ * thread safety but not on its synchronization details.
45
+ *
46
+ * <p>Retrieval operations (including {@code get}) generally do not
47
+ * block, so may overlap with update operations (including {@code put}
48
+ * and {@code remove}). Retrievals reflect the results of the most
49
+ * recently <em>completed</em> update operations holding upon their
50
+ * onset. (More formally, an update operation for a given key bears a
51
+ * <em>happens-before</em> relation with any (non-null) retrieval for
52
+ * that key reporting the updated value.) For aggregate operations
53
+ * such as {@code putAll} and {@code clear}, concurrent retrievals may
54
+ * reflect insertion or removal of only some entries. Similarly,
55
+ * Iterators and Enumerations return elements reflecting the state of
56
+ * the hash table at some point at or since the creation of the
57
+ * iterator/enumeration. They do <em>not</em> throw {@link
58
+ * ConcurrentModificationException}. However, iterators are designed
59
+ * to be used by only one thread at a time. Bear in mind that the
60
+ * results of aggregate status methods including {@code size}, {@code
61
+ * isEmpty}, and {@code containsValue} are typically useful only when
62
+ * a map is not undergoing concurrent updates in other threads.
63
+ * Otherwise the results of these methods reflect transient states
64
+ * that may be adequate for monitoring or estimation purposes, but not
65
+ * for program control.
66
+ *
67
+ * <p>The table is dynamically expanded when there are too many
68
+ * collisions (i.e., keys that have distinct hash codes but fall into
69
+ * the same slot modulo the table size), with the expected average
70
+ * effect of maintaining roughly two bins per mapping (corresponding
71
+ * to a 0.75 load factor threshold for resizing). There may be much
72
+ * variance around this average as mappings are added and removed, but
73
+ * overall, this maintains a commonly accepted time/space tradeoff for
74
+ * hash tables. However, resizing this or any other kind of hash
75
+ * table may be a relatively slow operation. When possible, it is a
76
+ * good idea to provide a size estimate as an optional {@code
77
+ * initialCapacity} constructor argument. An additional optional
78
+ * {@code loadFactor} constructor argument provides a further means of
79
+ * customizing initial table capacity by specifying the table density
80
+ * to be used in calculating the amount of space to allocate for the
81
+ * given number of elements. Also, for compatibility with previous
82
+ * versions of this class, constructors may optionally specify an
83
+ * expected {@code concurrencyLevel} as an additional hint for
84
+ * internal sizing. Note that using many keys with exactly the same
85
+ * {@code hashCode()} is a sure way to slow down performance of any
86
+ * hash table.
87
+ *
88
+ * <p>A {@link Set} projection of a ConcurrentHashMapV8 may be created
89
+ * (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
90
+ * (using {@link #keySet(Object)} when only keys are of interest, and the
91
+ * mapped values are (perhaps transiently) not used or all take the
92
+ * same mapping value.
93
+ *
94
+ * <p>A ConcurrentHashMapV8 can be used as scalable frequency map (a
95
+ * form of histogram or multiset) by using {@link LongAdder} values
96
+ * and initializing via {@link #computeIfAbsent}. For example, to add
97
+ * a count to a {@code ConcurrentHashMapV8<String,LongAdder> freqs}, you
98
+ * can use {@code freqs.computeIfAbsent(k -> new
99
+ * LongAdder()).increment();}
100
+ *
101
+ * <p>This class and its views and iterators implement all of the
102
+ * <em>optional</em> methods of the {@link Map} and {@link Iterator}
103
+ * interfaces.
104
+ *
105
+ * <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
106
+ * does <em>not</em> allow {@code null} to be used as a key or value.
107
+ *
108
+ * <p>ConcurrentHashMapV8s support parallel operations using the {@link
109
+ * ForkJoinPool#commonPool}. (Tasks that may be used in other contexts
110
+ * are available in class {@link ForkJoinTasks}). These operations are
111
+ * designed to be safely, and often sensibly, applied even with maps
112
+ * that are being concurrently updated by other threads; for example,
113
+ * when computing a snapshot summary of the values in a shared
114
+ * registry. There are three kinds of operation, each with four
115
+ * forms, accepting functions with Keys, Values, Entries, and (Key,
116
+ * Value) arguments and/or return values. (The first three forms are
117
+ * also available via the {@link #keySet()}, {@link #values()} and
118
+ * {@link #entrySet()} views). Because the elements of a
119
+ * ConcurrentHashMapV8 are not ordered in any particular way, and may be
120
+ * processed in different orders in different parallel executions, the
121
+ * correctness of supplied functions should not depend on any
122
+ * ordering, or on any other objects or values that may transiently
123
+ * change while computation is in progress; and except for forEach
124
+ * actions, should ideally be side-effect-free.
125
+ *
126
+ * <ul>
127
+ * <li> forEach: Perform a given action on each element.
128
+ * A variant form applies a given transformation on each element
129
+ * before performing the action.</li>
130
+ *
131
+ * <li> search: Return the first available non-null result of
132
+ * applying a given function on each element; skipping further
133
+ * search when a result is found.</li>
134
+ *
135
+ * <li> reduce: Accumulate each element. The supplied reduction
136
+ * function cannot rely on ordering (more formally, it should be
137
+ * both associative and commutative). There are five variants:
138
+ *
139
+ * <ul>
140
+ *
141
+ * <li> Plain reductions. (There is not a form of this method for
142
+ * (key, value) function arguments since there is no corresponding
143
+ * return type.)</li>
144
+ *
145
+ * <li> Mapped reductions that accumulate the results of a given
146
+ * function applied to each element.</li>
147
+ *
148
+ * <li> Reductions to scalar doubles, longs, and ints, using a
149
+ * given basis value.</li>
150
+ *
151
+ * </li>
152
+ * </ul>
153
+ * </ul>
154
+ *
155
+ * <p>The concurrency properties of bulk operations follow
156
+ * from those of ConcurrentHashMapV8: Any non-null result returned
157
+ * from {@code get(key)} and related access methods bears a
158
+ * happens-before relation with the associated insertion or
159
+ * update. The result of any bulk operation reflects the
160
+ * composition of these per-element relations (but is not
161
+ * necessarily atomic with respect to the map as a whole unless it
162
+ * is somehow known to be quiescent). Conversely, because keys
163
+ * and values in the map are never null, null serves as a reliable
164
+ * atomic indicator of the current lack of any result. To
165
+ * maintain this property, null serves as an implicit basis for
166
+ * all non-scalar reduction operations. For the double, long, and
167
+ * int versions, the basis should be one that, when combined with
168
+ * any other value, returns that other value (more formally, it
169
+ * should be the identity element for the reduction). Most common
170
+ * reductions have these properties; for example, computing a sum
171
+ * with basis 0 or a minimum with basis MAX_VALUE.
172
+ *
173
+ * <p>Search and transformation functions provided as arguments
174
+ * should similarly return null to indicate the lack of any result
175
+ * (in which case it is not used). In the case of mapped
176
+ * reductions, this also enables transformations to serve as
177
+ * filters, returning null (or, in the case of primitive
178
+ * specializations, the identity basis) if the element should not
179
+ * be combined. You can create compound transformations and
180
+ * filterings by composing them yourself under this "null means
181
+ * there is nothing there now" rule before using them in search or
182
+ * reduce operations.
183
+ *
184
+ * <p>Methods accepting and/or returning Entry arguments maintain
185
+ * key-value associations. They may be useful for example when
186
+ * finding the key for the greatest value. Note that "plain" Entry
187
+ * arguments can be supplied using {@code new
188
+ * AbstractMap.SimpleEntry(k,v)}.
189
+ *
190
+ * <p>Bulk operations may complete abruptly, throwing an
191
+ * exception encountered in the application of a supplied
192
+ * function. Bear in mind when handling such exceptions that other
193
+ * concurrently executing functions could also have thrown
194
+ * exceptions, or would have done so if the first exception had
195
+ * not occurred.
196
+ *
197
+ * <p>Parallel speedups for bulk operations compared to sequential
198
+ * processing are common but not guaranteed. Operations involving
199
+ * brief functions on small maps may execute more slowly than
200
+ * sequential loops if the underlying work to parallelize the
201
+ * computation is more expensive than the computation itself.
202
+ * Similarly, parallelization may not lead to much actual parallelism
203
+ * if all processors are busy performing unrelated tasks.
204
+ *
205
+ * <p>All arguments to all task methods must be non-null.
206
+ *
207
+ * <p><em>jsr166e note: During transition, this class
208
+ * uses nested functional interfaces with different names but the
209
+ * same forms as those expected for JDK8.</em>
210
+ *
211
+ * <p>This class is a member of the
212
+ * <a href="{@docRoot}/../technotes/guides/collections/index.html">
213
+ * Java Collections Framework</a>.
214
+ *
215
+ * @since 1.5
216
+ * @author Doug Lea
217
+ * @param <K> the type of keys maintained by this map
218
+ * @param <V> the type of mapped values
219
+ */
220
+ public class ConcurrentHashMapV8<K, V>
221
+ implements ConcurrentMap<K, V>, Serializable, ConcurrentHashMap<K, V> {
222
+ private static final long serialVersionUID = 7249069246763182397L;
223
+
224
+ /**
225
+ * A partitionable iterator. A Spliterator can be traversed
226
+ * directly, but can also be partitioned (before traversal) by
227
+ * creating another Spliterator that covers a non-overlapping
228
+ * portion of the elements, and so may be amenable to parallel
229
+ * execution.
230
+ *
231
+ * <p>This interface exports a subset of expected JDK8
232
+ * functionality.
233
+ *
234
+ * <p>Sample usage: Here is one (of the several) ways to compute
235
+ * the sum of the values held in a map using the ForkJoin
236
+ * framework. As illustrated here, Spliterators are well suited to
237
+ * designs in which a task repeatedly splits off half its work
238
+ * into forked subtasks until small enough to process directly,
239
+ * and then joins these subtasks. Variants of this style can also
240
+ * be used in completion-based designs.
241
+ *
242
+ * <pre>
243
+ * {@code ConcurrentHashMapV8<String, Long> m = ...
244
+ * // split as if have 8 * parallelism, for load balance
245
+ * int n = m.size();
246
+ * int p = aForkJoinPool.getParallelism() * 8;
247
+ * int split = (n < p)? n : p;
248
+ * long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
249
+ * // ...
250
+ * static class SumValues extends RecursiveTask<Long> {
251
+ * final Spliterator<Long> s;
252
+ * final int split; // split while > 1
253
+ * final SumValues nextJoin; // records forked subtasks to join
254
+ * SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
255
+ * this.s = s; this.depth = depth; this.nextJoin = nextJoin;
256
+ * }
257
+ * public Long compute() {
258
+ * long sum = 0;
259
+ * SumValues subtasks = null; // fork subtasks
260
+ * for (int s = split >>> 1; s > 0; s >>>= 1)
261
+ * (subtasks = new SumValues(s.split(), s, subtasks)).fork();
262
+ * while (s.hasNext()) // directly process remaining elements
263
+ * sum += s.next();
264
+ * for (SumValues t = subtasks; t != null; t = t.nextJoin)
265
+ * sum += t.join(); // collect subtask results
266
+ * return sum;
267
+ * }
268
+ * }
269
+ * }</pre>
270
+ */
271
+ public static interface Spliterator<T> extends Iterator<T> {
272
+ /**
273
+ * Returns a Spliterator covering approximately half of the
274
+ * elements, guaranteed not to overlap with those subsequently
275
+ * returned by this Spliterator. After invoking this method,
276
+ * the current Spliterator will <em>not</em> produce any of
277
+ * the elements of the returned Spliterator, but the two
278
+ * Spliterators together will produce all of the elements that
279
+ * would have been produced by this Spliterator had this
280
+ * method not been called. The exact number of elements
281
+ * produced by the returned Spliterator is not guaranteed, and
282
+ * may be zero (i.e., with {@code hasNext()} reporting {@code
283
+ * false}) if this Spliterator cannot be further split.
284
+ *
285
+ * @return a Spliterator covering approximately half of the
286
+ * elements
287
+ * @throws IllegalStateException if this Spliterator has
288
+ * already commenced traversing elements
289
+ */
290
+ Spliterator<T> split();
291
+ }
292
+
293
+
294
+ /*
295
+ * Overview:
296
+ *
297
+ * The primary design goal of this hash table is to maintain
298
+ * concurrent readability (typically method get(), but also
299
+ * iterators and related methods) while minimizing update
300
+ * contention. Secondary goals are to keep space consumption about
301
+ * the same or better than java.util.HashMap, and to support high
302
+ * initial insertion rates on an empty table by many threads.
303
+ *
304
+ * Each key-value mapping is held in a Node. Because Node fields
305
+ * can contain special values, they are defined using plain Object
306
+ * types. Similarly in turn, all internal methods that use them
307
+ * work off Object types. And similarly, so do the internal
308
+ * methods of auxiliary iterator and view classes. All public
309
+ * generic typed methods relay in/out of these internal methods,
310
+ * supplying null-checks and casts as needed. This also allows
311
+ * many of the public methods to be factored into a smaller number
312
+ * of internal methods (although sadly not so for the five
313
+ * variants of put-related operations). The validation-based
314
+ * approach explained below leads to a lot of code sprawl because
315
+ * retry-control precludes factoring into smaller methods.
316
+ *
317
+ * The table is lazily initialized to a power-of-two size upon the
318
+ * first insertion. Each bin in the table normally contains a
319
+ * list of Nodes (most often, the list has only zero or one Node).
320
+ * Table accesses require volatile/atomic reads, writes, and
321
+ * CASes. Because there is no other way to arrange this without
322
+ * adding further indirections, we use intrinsics
323
+ * (sun.misc.Unsafe) operations. The lists of nodes within bins
324
+ * are always accurately traversable under volatile reads, so long
325
+ * as lookups check hash code and non-nullness of value before
326
+ * checking key equality.
327
+ *
328
+ * We use the top two bits of Node hash fields for control
329
+ * purposes -- they are available anyway because of addressing
330
+ * constraints. As explained further below, these top bits are
331
+ * used as follows:
332
+ * 00 - Normal
333
+ * 01 - Locked
334
+ * 11 - Locked and may have a thread waiting for lock
335
+ * 10 - Node is a forwarding node
336
+ *
337
+ * The lower 30 bits of each Node's hash field contain a
338
+ * transformation of the key's hash code, except for forwarding
339
+ * nodes, for which the lower bits are zero (and so always have
340
+ * hash field == MOVED).
341
+ *
342
+ * Insertion (via put or its variants) of the first node in an
343
+ * empty bin is performed by just CASing it to the bin. This is
344
+ * by far the most common case for put operations under most
345
+ * key/hash distributions. Other update operations (insert,
346
+ * delete, and replace) require locks. We do not want to waste
347
+ * the space required to associate a distinct lock object with
348
+ * each bin, so instead use the first node of a bin list itself as
349
+ * a lock. Blocking support for these locks relies on the builtin
350
+ * "synchronized" monitors. However, we also need a tryLock
351
+ * construction, so we overlay these by using bits of the Node
352
+ * hash field for lock control (see above), and so normally use
353
+ * builtin monitors only for blocking and signalling using
354
+ * wait/notifyAll constructions. See Node.tryAwaitLock.
355
+ *
356
+ * Using the first node of a list as a lock does not by itself
357
+ * suffice though: When a node is locked, any update must first
358
+ * validate that it is still the first node after locking it, and
359
+ * retry if not. Because new nodes are always appended to lists,
360
+ * once a node is first in a bin, it remains first until deleted
361
+ * or the bin becomes invalidated (upon resizing). However,
362
+ * operations that only conditionally update may inspect nodes
363
+ * until the point of update. This is a converse of sorts to the
364
+ * lazy locking technique described by Herlihy & Shavit.
365
+ *
366
+ * The main disadvantage of per-bin locks is that other update
367
+ * operations on other nodes in a bin list protected by the same
368
+ * lock can stall, for example when user equals() or mapping
369
+ * functions take a long time. However, statistically, under
370
+ * random hash codes, this is not a common problem. Ideally, the
371
+ * frequency of nodes in bins follows a Poisson distribution
372
+ * (http://en.wikipedia.org/wiki/Poisson_distribution) with a
373
+ * parameter of about 0.5 on average, given the resizing threshold
374
+ * of 0.75, although with a large variance because of resizing
375
+ * granularity. Ignoring variance, the expected occurrences of
376
+ * list size k are (exp(-0.5) * pow(0.5, k) / factorial(k)). The
377
+ * first values are:
378
+ *
379
+ * 0: 0.60653066
380
+ * 1: 0.30326533
381
+ * 2: 0.07581633
382
+ * 3: 0.01263606
383
+ * 4: 0.00157952
384
+ * 5: 0.00015795
385
+ * 6: 0.00001316
386
+ * 7: 0.00000094
387
+ * 8: 0.00000006
388
+ * more: less than 1 in ten million
389
+ *
390
+ * Lock contention probability for two threads accessing distinct
391
+ * elements is roughly 1 / (8 * #elements) under random hashes.
392
+ *
393
+ * Actual hash code distributions encountered in practice
394
+ * sometimes deviate significantly from uniform randomness. This
395
+ * includes the case when N > (1<<30), so some keys MUST collide.
396
+ * Similarly for dumb or hostile usages in which multiple keys are
397
+ * designed to have identical hash codes. Also, although we guard
398
+ * against the worst effects of this (see method spread), sets of
399
+ * hashes may differ only in bits that do not impact their bin
400
+ * index for a given power-of-two mask. So we use a secondary
401
+ * strategy that applies when the number of nodes in a bin exceeds
402
+ * a threshold, and at least one of the keys implements
403
+ * Comparable. These TreeBins use a balanced tree to hold nodes
404
+ * (a specialized form of red-black trees), bounding search time
405
+ * to O(log N). Each search step in a TreeBin is around twice as
406
+ * slow as in a regular list, but given that N cannot exceed
407
+ * (1<<64) (before running out of addresses) this bounds search
408
+ * steps, lock hold times, etc, to reasonable constants (roughly
409
+ * 100 nodes inspected per operation worst case) so long as keys
410
+ * are Comparable (which is very common -- String, Long, etc).
411
+ * TreeBin nodes (TreeNodes) also maintain the same "next"
412
+ * traversal pointers as regular nodes, so can be traversed in
413
+ * iterators in the same way.
414
+ *
415
+ * The table is resized when occupancy exceeds a percentage
416
+ * threshold (nominally, 0.75, but see below). Only a single
417
+ * thread performs the resize (using field "sizeCtl", to arrange
418
+ * exclusion), but the table otherwise remains usable for reads
419
+ * and updates. Resizing proceeds by transferring bins, one by
420
+ * one, from the table to the next table. Because we are using
421
+ * power-of-two expansion, the elements from each bin must either
422
+ * stay at same index, or move with a power of two offset. We
423
+ * eliminate unnecessary node creation by catching cases where old
424
+ * nodes can be reused because their next fields won't change. On
425
+ * average, only about one-sixth of them need cloning when a table
426
+ * doubles. The nodes they replace will be garbage collectable as
427
+ * soon as they are no longer referenced by any reader thread that
428
+ * may be in the midst of concurrently traversing table. Upon
429
+ * transfer, the old table bin contains only a special forwarding
430
+ * node (with hash field "MOVED") that contains the next table as
431
+ * its key. On encountering a forwarding node, access and update
432
+ * operations restart, using the new table.
433
+ *
434
+ * Each bin transfer requires its bin lock. However, unlike other
435
+ * cases, a transfer can skip a bin if it fails to acquire its
436
+ * lock, and revisit it later (unless it is a TreeBin). Method
437
+ * rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that
438
+ * have been skipped because of failure to acquire a lock, and
439
+ * blocks only if none are available (i.e., only very rarely).
440
+ * The transfer operation must also ensure that all accessible
441
+ * bins in both the old and new table are usable by any traversal.
442
+ * When there are no lock acquisition failures, this is arranged
443
+ * simply by proceeding from the last bin (table.length - 1) up
444
+ * towards the first. Upon seeing a forwarding node, traversals
445
+ * (see class Iter) arrange to move to the new table
446
+ * without revisiting nodes. However, when any node is skipped
447
+ * during a transfer, all earlier table bins may have become
448
+ * visible, so are initialized with a reverse-forwarding node back
449
+ * to the old table until the new ones are established. (This
450
+ * sometimes requires transiently locking a forwarding node, which
451
+ * is possible under the above encoding.) These more expensive
452
+ * mechanics trigger only when necessary.
453
+ *
454
+ * The traversal scheme also applies to partial traversals of
455
+ * ranges of bins (via an alternate Traverser constructor)
456
+ * to support partitioned aggregate operations. Also, read-only
457
+ * operations give up if ever forwarded to a null table, which
458
+ * provides support for shutdown-style clearing, which is also not
459
+ * currently implemented.
460
+ *
461
+ * Lazy table initialization minimizes footprint until first use,
462
+ * and also avoids resizings when the first operation is from a
463
+ * putAll, constructor with map argument, or deserialization.
464
+ * These cases attempt to override the initial capacity settings,
465
+ * but harmlessly fail to take effect in cases of races.
466
+ *
467
+ * The element count is maintained using a LongAdder, which avoids
468
+ * contention on updates but can encounter cache thrashing if read
469
+ * too frequently during concurrent access. To avoid reading so
470
+ * often, resizing is attempted either when a bin lock is
471
+ * contended, or upon adding to a bin already holding two or more
472
+ * nodes (checked before adding in the xIfAbsent methods, after
473
+ * adding in others). Under uniform hash distributions, the
474
+ * probability of this occurring at threshold is around 13%,
475
+ * meaning that only about 1 in 8 puts check threshold (and after
476
+ * resizing, many fewer do so). But this approximation has high
477
+ * variance for small table sizes, so we check on any collision
478
+ * for sizes <= 64. The bulk putAll operation further reduces
479
+ * contention by only committing count updates upon these size
480
+ * checks.
481
+ *
482
+ * Maintaining API and serialization compatibility with previous
483
+ * versions of this class introduces several oddities. Mainly: We
484
+ * leave untouched but unused constructor arguments refering to
485
+ * concurrencyLevel. We accept a loadFactor constructor argument,
486
+ * but apply it only to initial table capacity (which is the only
487
+ * time that we can guarantee to honor it.) We also declare an
488
+ * unused "Segment" class that is instantiated in minimal form
489
+ * only when serializing.
490
+ */
491
+
492
+ /* ---------------- Constants -------------- */
493
+
494
+ /**
495
+ * The largest possible table capacity. This value must be
496
+ * exactly 1<<30 to stay within Java array allocation and indexing
497
+ * bounds for power of two table sizes, and is further required
498
+ * because the top two bits of 32bit hash fields are used for
499
+ * control purposes.
500
+ */
501
+ private static final int MAXIMUM_CAPACITY = 1 << 30;
502
+
503
+ /**
504
+ * The default initial table capacity. Must be a power of 2
505
+ * (i.e., at least 1) and at most MAXIMUM_CAPACITY.
506
+ */
507
+ private static final int DEFAULT_CAPACITY = 16;
508
+
509
+ /**
510
+ * The largest possible (non-power of two) array size.
511
+ * Needed by toArray and related methods.
512
+ */
513
+ static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
514
+
515
+ /**
516
+ * The default concurrency level for this table. Unused but
517
+ * defined for compatibility with previous versions of this class.
518
+ */
519
+ private static final int DEFAULT_CONCURRENCY_LEVEL = 16;
520
+
521
+ /**
522
+ * The load factor for this table. Overrides of this value in
523
+ * constructors affect only the initial table capacity. The
524
+ * actual floating point value isn't normally used -- it is
525
+ * simpler to use expressions such as {@code n - (n >>> 2)} for
526
+ * the associated resizing threshold.
527
+ */
528
+ private static final float LOAD_FACTOR = 0.75f;
529
+
530
+ /**
531
+ * The buffer size for skipped bins during transfers. The
532
+ * value is arbitrary but should be large enough to avoid
533
+ * most locking stalls during resizes.
534
+ */
535
+ private static final int TRANSFER_BUFFER_SIZE = 32;
536
+
537
+ /**
538
+ * The bin count threshold for using a tree rather than list for a
539
+ * bin. The value reflects the approximate break-even point for
540
+ * using tree-based operations.
541
+ * Note that Doug's version defaults to 8, but when dealing with
542
+ * Ruby objects it is actually beneficial to avoid TreeNodes
543
+ * as long as possible as it usually means going into Ruby land.
544
+ */
545
+ private static final int TREE_THRESHOLD = 16;
546
+
547
+ /*
548
+ * Encodings for special uses of Node hash fields. See above for
549
+ * explanation.
550
+ */
551
+ static final int MOVED = 0x80000000; // hash field for forwarding nodes
552
+ static final int LOCKED = 0x40000000; // set/tested only as a bit
553
+ static final int WAITING = 0xc0000000; // both bits set/tested together
554
+ static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
555
+
556
+ /* ---------------- Fields -------------- */
557
+
558
+ /**
559
+ * The array of bins. Lazily initialized upon first insertion.
560
+ * Size is always a power of two. Accessed directly by iterators.
561
+ */
562
+ transient volatile Node[] table;
563
+
564
+ /**
565
+ * The counter maintaining number of elements.
566
+ */
567
+ private transient final LongAdder counter;
568
+
569
+ /**
570
+ * Table initialization and resizing control. When negative, the
571
+ * table is being initialized or resized. Otherwise, when table is
572
+ * null, holds the initial table size to use upon creation, or 0
573
+ * for default. After initialization, holds the next element count
574
+ * value upon which to resize the table.
575
+ */
576
+ private transient volatile int sizeCtl;
577
+
578
+ // views
579
+ private transient KeySetView<K,V> keySet;
580
+ private transient ValuesView<K,V> values;
581
+ private transient EntrySetView<K,V> entrySet;
582
+
583
+ /** For serialization compatibility. Null unless serialized; see below */
584
+ private Segment<K,V>[] segments;
585
+
586
+ /* ---------------- Table element access -------------- */
587
+
588
+ /*
589
+ * Volatile access methods are used for table elements as well as
590
+ * elements of in-progress next table while resizing. Uses are
591
+ * null checked by callers, and implicitly bounds-checked, relying
592
+ * on the invariants that tab arrays have non-zero size, and all
593
+ * indices are masked with (tab.length - 1) which is never
594
+ * negative and always less than length. Note that, to be correct
595
+ * wrt arbitrary concurrency errors by users, bounds checks must
596
+ * operate on local variables, which accounts for some odd-looking
597
+ * inline assignments below.
598
+ */
599
+
600
+ static final Node tabAt(Node[] tab, int i) { // used by Iter
601
+ return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
602
+ }
603
+
604
+ private static final boolean casTabAt(Node[] tab, int i, Node c, Node v) {
605
+ return UNSAFE.compareAndSwapObject(tab, ((long)i<<ASHIFT)+ABASE, c, v);
606
+ }
607
+
608
+ private static final void setTabAt(Node[] tab, int i, Node v) {
609
+ UNSAFE.putObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE, v);
610
+ }
611
+
612
+ /* ---------------- Nodes -------------- */
613
+
614
+ /**
615
+ * Key-value entry. Note that this is never exported out as a
616
+ * user-visible Map.Entry (see MapEntry below). Nodes with a hash
617
+ * field of MOVED are special, and do not contain user keys or
618
+ * values. Otherwise, keys are never null, and null val fields
619
+ * indicate that a node is in the process of being deleted or
620
+ * created. For purposes of read-only access, a key may be read
621
+ * before a val, but can only be used after checking val to be
622
+ * non-null.
623
+ */
624
+ static class Node {
625
+ volatile int hash;
626
+ final Object key;
627
+ volatile Object val;
628
+ volatile Node next;
629
+
630
+ Node(int hash, Object key, Object val, Node next) {
631
+ this.hash = hash;
632
+ this.key = key;
633
+ this.val = val;
634
+ this.next = next;
635
+ }
636
+
637
+ /** CompareAndSet the hash field */
638
+ final boolean casHash(int cmp, int val) {
639
+ return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val);
640
+ }
641
+
642
+ /** The number of spins before blocking for a lock */
643
+ static final int MAX_SPINS =
644
+ Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1;
645
+
646
+ /**
647
+ * Spins a while if LOCKED bit set and this node is the first
648
+ * of its bin, and then sets WAITING bits on hash field and
649
+ * blocks (once) if they are still set. It is OK for this
650
+ * method to return even if lock is not available upon exit,
651
+ * which enables these simple single-wait mechanics.
652
+ *
653
+ * The corresponding signalling operation is performed within
654
+ * callers: Upon detecting that WAITING has been set when
655
+ * unlocking lock (via a failed CAS from non-waiting LOCKED
656
+ * state), unlockers acquire the sync lock and perform a
657
+ * notifyAll.
658
+ *
659
+ * The initial sanity check on tab and bounds is not currently
660
+ * necessary in the only usages of this method, but enables
661
+ * use in other future contexts.
662
+ */
663
+ final void tryAwaitLock(Node[] tab, int i) {
664
+ if (tab != null && i >= 0 && i < tab.length) { // sanity check
665
+ int r = ThreadLocalRandom.current().nextInt(); // randomize spins
666
+ int spins = MAX_SPINS, h;
667
+ while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
668
+ if (spins >= 0) {
669
+ r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
670
+ if (r >= 0 && --spins == 0)
671
+ Thread.yield(); // yield before block
672
+ }
673
+ else if (casHash(h, h | WAITING)) {
674
+ synchronized (this) {
675
+ if (tabAt(tab, i) == this &&
676
+ (hash & WAITING) == WAITING) {
677
+ try {
678
+ wait();
679
+ } catch (InterruptedException ie) {
680
+ Thread.currentThread().interrupt();
681
+ }
682
+ }
683
+ else
684
+ notifyAll(); // possibly won race vs signaller
685
+ }
686
+ break;
687
+ }
688
+ }
689
+ }
690
+ }
691
+
692
+ // Unsafe mechanics for casHash
693
+ private static final sun.misc.Unsafe UNSAFE;
694
+ private static final long hashOffset;
695
+
696
+ static {
697
+ try {
698
+ UNSAFE = getUnsafe();
699
+ Class<?> k = Node.class;
700
+ hashOffset = UNSAFE.objectFieldOffset
701
+ (k.getDeclaredField("hash"));
702
+ } catch (Exception e) {
703
+ throw new Error(e);
704
+ }
705
+ }
706
+ }
707
+
708
+ /* ---------------- TreeBins -------------- */
709
+
710
+ /**
711
+ * Nodes for use in TreeBins
712
+ */
713
+ static final class TreeNode extends Node {
714
+ TreeNode parent; // red-black tree links
715
+ TreeNode left;
716
+ TreeNode right;
717
+ TreeNode prev; // needed to unlink next upon deletion
718
+ boolean red;
719
+
720
+ TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) {
721
+ super(hash, key, val, next);
722
+ this.parent = parent;
723
+ }
724
+ }
725
+
726
+ /**
727
+ * A specialized form of red-black tree for use in bins
728
+ * whose size exceeds a threshold.
729
+ *
730
+ * TreeBins use a special form of comparison for search and
731
+ * related operations (which is the main reason we cannot use
732
+ * existing collections such as TreeMaps). TreeBins contain
733
+ * Comparable elements, but may contain others, as well as
734
+ * elements that are Comparable but not necessarily Comparable<T>
735
+ * for the same T, so we cannot invoke compareTo among them. To
736
+ * handle this, the tree is ordered primarily by hash value, then
737
+ * by getClass().getName() order, and then by Comparator order
738
+ * among elements of the same class. On lookup at a node, if
739
+ * elements are not comparable or compare as 0, both left and
740
+ * right children may need to be searched in the case of tied hash
741
+ * values. (This corresponds to the full list search that would be
742
+ * necessary if all elements were non-Comparable and had tied
743
+ * hashes.) The red-black balancing code is updated from
744
+ * pre-jdk-collections
745
+ * (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
746
+ * based in turn on Cormen, Leiserson, and Rivest "Introduction to
747
+ * Algorithms" (CLR).
748
+ *
749
+ * TreeBins also maintain a separate locking discipline than
750
+ * regular bins. Because they are forwarded via special MOVED
751
+ * nodes at bin heads (which can never change once established),
752
+ * we cannot use those nodes as locks. Instead, TreeBin
753
+ * extends AbstractQueuedSynchronizer to support a simple form of
754
+ * read-write lock. For update operations and table validation,
755
+ * the exclusive form of lock behaves in the same way as bin-head
756
+ * locks. However, lookups use shared read-lock mechanics to allow
757
+ * multiple readers in the absence of writers. Additionally,
758
+ * these lookups do not ever block: While the lock is not
759
+ * available, they proceed along the slow traversal path (via
760
+ * next-pointers) until the lock becomes available or the list is
761
+ * exhausted, whichever comes first. (These cases are not fast,
762
+ * but maximize aggregate expected throughput.) The AQS mechanics
763
+ * for doing this are straightforward. The lock state is held as
764
+ * AQS getState(). Read counts are negative; the write count (1)
765
+ * is positive. There are no signalling preferences among readers
766
+ * and writers. Since we don't need to export full Lock API, we
767
+ * just override the minimal AQS methods and use them directly.
768
+ */
769
+ static final class TreeBin extends AbstractQueuedSynchronizer {
770
+ private static final long serialVersionUID = 2249069246763182397L;
771
+ transient TreeNode root; // root of tree
772
+ transient TreeNode first; // head of next-pointer list
773
+
774
+ /* AQS overrides */
775
+ public final boolean isHeldExclusively() { return getState() > 0; }
776
+ public final boolean tryAcquire(int ignore) {
777
+ if (compareAndSetState(0, 1)) {
778
+ setExclusiveOwnerThread(Thread.currentThread());
779
+ return true;
780
+ }
781
+ return false;
782
+ }
783
+ public final boolean tryRelease(int ignore) {
784
+ setExclusiveOwnerThread(null);
785
+ setState(0);
786
+ return true;
787
+ }
788
+ public final int tryAcquireShared(int ignore) {
789
+ for (int c;;) {
790
+ if ((c = getState()) > 0)
791
+ return -1;
792
+ if (compareAndSetState(c, c -1))
793
+ return 1;
794
+ }
795
+ }
796
+ public final boolean tryReleaseShared(int ignore) {
797
+ int c;
798
+ do {} while (!compareAndSetState(c = getState(), c + 1));
799
+ return c == -1;
800
+ }
801
+
802
+ /** From CLR */
803
+ private void rotateLeft(TreeNode p) {
804
+ if (p != null) {
805
+ TreeNode r = p.right, pp, rl;
806
+ if ((rl = p.right = r.left) != null)
807
+ rl.parent = p;
808
+ if ((pp = r.parent = p.parent) == null)
809
+ root = r;
810
+ else if (pp.left == p)
811
+ pp.left = r;
812
+ else
813
+ pp.right = r;
814
+ r.left = p;
815
+ p.parent = r;
816
+ }
817
+ }
818
+
819
+ /** From CLR */
820
+ private void rotateRight(TreeNode p) {
821
+ if (p != null) {
822
+ TreeNode l = p.left, pp, lr;
823
+ if ((lr = p.left = l.right) != null)
824
+ lr.parent = p;
825
+ if ((pp = l.parent = p.parent) == null)
826
+ root = l;
827
+ else if (pp.right == p)
828
+ pp.right = l;
829
+ else
830
+ pp.left = l;
831
+ l.right = p;
832
+ p.parent = l;
833
+ }
834
+ }
835
+
836
+ @SuppressWarnings("unchecked") final TreeNode getTreeNode
837
+ (int h, Object k, TreeNode p) {
838
+ return getTreeNode(h, (RubyObject)k, p);
839
+ }
840
+
841
+ /**
842
+ * Returns the TreeNode (or null if not found) for the given key
843
+ * starting at given root.
844
+ */
845
+ @SuppressWarnings("unchecked") final TreeNode getTreeNode
846
+ (int h, RubyObject k, TreeNode p) {
847
+ RubyClass c = k.getMetaClass(); boolean kNotComparable = !k.respondsTo("<=>");
848
+ while (p != null) {
849
+ int dir, ph; RubyObject pk; RubyClass pc;
850
+ if ((ph = p.hash) == h) {
851
+ if ((pk = (RubyObject)p.key) == k || k.equals(pk))
852
+ return p;
853
+ if (c != (pc = (RubyClass)pk.getMetaClass()) ||
854
+ kNotComparable ||
855
+ (dir = rubyCompare(k, pk)) == 0) {
856
+ dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
857
+ if (dir == 0) { // if still stuck, need to check both sides
858
+ TreeNode r = null, pl, pr;
859
+ // try to recurse on the right
860
+ if ((pr = p.right) != null && h >= pr.hash && (r = getTreeNode(h, k, pr)) != null)
861
+ return r;
862
+ // try to continue iterating on the left side
863
+ else if ((pl = p.left) != null && h <= pl.hash)
864
+ dir = -1;
865
+ else // no matching node found
866
+ return null;
867
+ }
868
+ }
869
+ }
870
+ else
871
+ dir = (h < ph) ? -1 : 1;
872
+ p = (dir > 0) ? p.right : p.left;
873
+ }
874
+ return null;
875
+ }
876
+
877
+ int rubyCompare(RubyObject l, RubyObject r) {
878
+ ThreadContext context = l.getMetaClass().getRuntime().getCurrentContext();
879
+ IRubyObject result;
880
+ try {
881
+ result = l.callMethod(context, "<=>", r);
882
+ } catch (RaiseException e) {
883
+ // handle objects "lying" about responding to <=>, ie: an Array containing non-comparable keys
884
+ if (context.runtime.getNoMethodError().isInstance(e.getException())) {
885
+ return 0;
886
+ }
887
+ throw e;
888
+ }
889
+
890
+ return result.isNil() ? 0 : RubyNumeric.num2int(result.convertToInteger());
891
+ }
892
+
893
+ /**
894
+ * Wrapper for getTreeNode used by CHM.get. Tries to obtain
895
+ * read-lock to call getTreeNode, but during failure to get
896
+ * lock, searches along next links.
897
+ */
898
+ final Object getValue(int h, Object k) {
899
+ Node r = null;
900
+ int c = getState(); // Must read lock state first
901
+ for (Node e = first; e != null; e = e.next) {
902
+ if (c <= 0 && compareAndSetState(c, c - 1)) {
903
+ try {
904
+ r = getTreeNode(h, k, root);
905
+ } finally {
906
+ releaseShared(0);
907
+ }
908
+ break;
909
+ }
910
+ else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
911
+ r = e;
912
+ break;
913
+ }
914
+ else
915
+ c = getState();
916
+ }
917
+ return r == null ? null : r.val;
918
+ }
919
+
920
+ @SuppressWarnings("unchecked") final TreeNode putTreeNode
921
+ (int h, Object k, Object v) {
922
+ return putTreeNode(h, (RubyObject)k, v);
923
+ }
924
+
925
+ /**
926
+ * Finds or adds a node.
927
+ * @return null if added
928
+ */
929
+ @SuppressWarnings("unchecked") final TreeNode putTreeNode
930
+ (int h, RubyObject k, Object v) {
931
+ RubyClass c = k.getMetaClass();
932
+ boolean kNotComparable = !k.respondsTo("<=>");
933
+ TreeNode pp = root, p = null;
934
+ int dir = 0;
935
+ while (pp != null) { // find existing node or leaf to insert at
936
+ int ph; RubyObject pk; RubyClass pc;
937
+ p = pp;
938
+ if ((ph = p.hash) == h) {
939
+ if ((pk = (RubyObject)p.key) == k || k.equals(pk))
940
+ return p;
941
+ if (c != (pc = pk.getMetaClass()) ||
942
+ kNotComparable ||
943
+ (dir = rubyCompare(k, pk)) == 0) {
944
+ dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
945
+ if (dir == 0) { // if still stuck, need to check both sides
946
+ TreeNode r = null, pr;
947
+ // try to recurse on the right
948
+ if ((pr = p.right) != null && h >= pr.hash && (r = getTreeNode(h, k, pr)) != null)
949
+ return r;
950
+ else // continue descending down the left subtree
951
+ dir = -1;
952
+ }
953
+ }
954
+ }
955
+ else
956
+ dir = (h < ph) ? -1 : 1;
957
+ pp = (dir > 0) ? p.right : p.left;
958
+ }
959
+
960
+ TreeNode f = first;
961
+ TreeNode x = first = new TreeNode(h, (Object)k, v, f, p);
962
+ if (p == null)
963
+ root = x;
964
+ else { // attach and rebalance; adapted from CLR
965
+ TreeNode xp, xpp;
966
+ if (f != null)
967
+ f.prev = x;
968
+ if (dir <= 0)
969
+ p.left = x;
970
+ else
971
+ p.right = x;
972
+ x.red = true;
973
+ while (x != null && (xp = x.parent) != null && xp.red &&
974
+ (xpp = xp.parent) != null) {
975
+ TreeNode xppl = xpp.left;
976
+ if (xp == xppl) {
977
+ TreeNode y = xpp.right;
978
+ if (y != null && y.red) {
979
+ y.red = false;
980
+ xp.red = false;
981
+ xpp.red = true;
982
+ x = xpp;
983
+ }
984
+ else {
985
+ if (x == xp.right) {
986
+ rotateLeft(x = xp);
987
+ xpp = (xp = x.parent) == null ? null : xp.parent;
988
+ }
989
+ if (xp != null) {
990
+ xp.red = false;
991
+ if (xpp != null) {
992
+ xpp.red = true;
993
+ rotateRight(xpp);
994
+ }
995
+ }
996
+ }
997
+ }
998
+ else {
999
+ TreeNode y = xppl;
1000
+ if (y != null && y.red) {
1001
+ y.red = false;
1002
+ xp.red = false;
1003
+ xpp.red = true;
1004
+ x = xpp;
1005
+ }
1006
+ else {
1007
+ if (x == xp.left) {
1008
+ rotateRight(x = xp);
1009
+ xpp = (xp = x.parent) == null ? null : xp.parent;
1010
+ }
1011
+ if (xp != null) {
1012
+ xp.red = false;
1013
+ if (xpp != null) {
1014
+ xpp.red = true;
1015
+ rotateLeft(xpp);
1016
+ }
1017
+ }
1018
+ }
1019
+ }
1020
+ }
1021
+ TreeNode r = root;
1022
+ if (r != null && r.red)
1023
+ r.red = false;
1024
+ }
1025
+ return null;
1026
+ }
1027
+
1028
+ /**
1029
+ * Removes the given node, that must be present before this
1030
+ * call. This is messier than typical red-black deletion code
1031
+ * because we cannot swap the contents of an interior node
1032
+ * with a leaf successor that is pinned by "next" pointers
1033
+ * that are accessible independently of lock. So instead we
1034
+ * swap the tree linkages.
1035
+ */
1036
+ final void deleteTreeNode(TreeNode p) {
1037
+ TreeNode next = (TreeNode)p.next; // unlink traversal pointers
1038
+ TreeNode pred = p.prev;
1039
+ if (pred == null)
1040
+ first = next;
1041
+ else
1042
+ pred.next = next;
1043
+ if (next != null)
1044
+ next.prev = pred;
1045
+ TreeNode replacement;
1046
+ TreeNode pl = p.left;
1047
+ TreeNode pr = p.right;
1048
+ if (pl != null && pr != null) {
1049
+ TreeNode s = pr, sl;
1050
+ while ((sl = s.left) != null) // find successor
1051
+ s = sl;
1052
+ boolean c = s.red; s.red = p.red; p.red = c; // swap colors
1053
+ TreeNode sr = s.right;
1054
+ TreeNode pp = p.parent;
1055
+ if (s == pr) { // p was s's direct parent
1056
+ p.parent = s;
1057
+ s.right = p;
1058
+ }
1059
+ else {
1060
+ TreeNode sp = s.parent;
1061
+ if ((p.parent = sp) != null) {
1062
+ if (s == sp.left)
1063
+ sp.left = p;
1064
+ else
1065
+ sp.right = p;
1066
+ }
1067
+ if ((s.right = pr) != null)
1068
+ pr.parent = s;
1069
+ }
1070
+ p.left = null;
1071
+ if ((p.right = sr) != null)
1072
+ sr.parent = p;
1073
+ if ((s.left = pl) != null)
1074
+ pl.parent = s;
1075
+ if ((s.parent = pp) == null)
1076
+ root = s;
1077
+ else if (p == pp.left)
1078
+ pp.left = s;
1079
+ else
1080
+ pp.right = s;
1081
+ replacement = sr;
1082
+ }
1083
+ else
1084
+ replacement = (pl != null) ? pl : pr;
1085
+ TreeNode pp = p.parent;
1086
+ if (replacement == null) {
1087
+ if (pp == null) {
1088
+ root = null;
1089
+ return;
1090
+ }
1091
+ replacement = p;
1092
+ }
1093
+ else {
1094
+ replacement.parent = pp;
1095
+ if (pp == null)
1096
+ root = replacement;
1097
+ else if (p == pp.left)
1098
+ pp.left = replacement;
1099
+ else
1100
+ pp.right = replacement;
1101
+ p.left = p.right = p.parent = null;
1102
+ }
1103
+ if (!p.red) { // rebalance, from CLR
1104
+ TreeNode x = replacement;
1105
+ while (x != null) {
1106
+ TreeNode xp, xpl;
1107
+ if (x.red || (xp = x.parent) == null) {
1108
+ x.red = false;
1109
+ break;
1110
+ }
1111
+ if (x == (xpl = xp.left)) {
1112
+ TreeNode sib = xp.right;
1113
+ if (sib != null && sib.red) {
1114
+ sib.red = false;
1115
+ xp.red = true;
1116
+ rotateLeft(xp);
1117
+ sib = (xp = x.parent) == null ? null : xp.right;
1118
+ }
1119
+ if (sib == null)
1120
+ x = xp;
1121
+ else {
1122
+ TreeNode sl = sib.left, sr = sib.right;
1123
+ if ((sr == null || !sr.red) &&
1124
+ (sl == null || !sl.red)) {
1125
+ sib.red = true;
1126
+ x = xp;
1127
+ }
1128
+ else {
1129
+ if (sr == null || !sr.red) {
1130
+ if (sl != null)
1131
+ sl.red = false;
1132
+ sib.red = true;
1133
+ rotateRight(sib);
1134
+ sib = (xp = x.parent) == null ? null : xp.right;
1135
+ }
1136
+ if (sib != null) {
1137
+ sib.red = (xp == null) ? false : xp.red;
1138
+ if ((sr = sib.right) != null)
1139
+ sr.red = false;
1140
+ }
1141
+ if (xp != null) {
1142
+ xp.red = false;
1143
+ rotateLeft(xp);
1144
+ }
1145
+ x = root;
1146
+ }
1147
+ }
1148
+ }
1149
+ else { // symmetric
1150
+ TreeNode sib = xpl;
1151
+ if (sib != null && sib.red) {
1152
+ sib.red = false;
1153
+ xp.red = true;
1154
+ rotateRight(xp);
1155
+ sib = (xp = x.parent) == null ? null : xp.left;
1156
+ }
1157
+ if (sib == null)
1158
+ x = xp;
1159
+ else {
1160
+ TreeNode sl = sib.left, sr = sib.right;
1161
+ if ((sl == null || !sl.red) &&
1162
+ (sr == null || !sr.red)) {
1163
+ sib.red = true;
1164
+ x = xp;
1165
+ }
1166
+ else {
1167
+ if (sl == null || !sl.red) {
1168
+ if (sr != null)
1169
+ sr.red = false;
1170
+ sib.red = true;
1171
+ rotateLeft(sib);
1172
+ sib = (xp = x.parent) == null ? null : xp.left;
1173
+ }
1174
+ if (sib != null) {
1175
+ sib.red = (xp == null) ? false : xp.red;
1176
+ if ((sl = sib.left) != null)
1177
+ sl.red = false;
1178
+ }
1179
+ if (xp != null) {
1180
+ xp.red = false;
1181
+ rotateRight(xp);
1182
+ }
1183
+ x = root;
1184
+ }
1185
+ }
1186
+ }
1187
+ }
1188
+ }
1189
+ if (p == replacement && (pp = p.parent) != null) {
1190
+ if (p == pp.left) // detach pointers
1191
+ pp.left = null;
1192
+ else if (p == pp.right)
1193
+ pp.right = null;
1194
+ p.parent = null;
1195
+ }
1196
+ }
1197
+ }
1198
+
1199
+ /* ---------------- Collision reduction methods -------------- */
1200
+
1201
+ /**
1202
+ * Spreads higher bits to lower, and also forces top 2 bits to 0.
1203
+ * Because the table uses power-of-two masking, sets of hashes
1204
+ * that vary only in bits above the current mask will always
1205
+ * collide. (Among known examples are sets of Float keys holding
1206
+ * consecutive whole numbers in small tables.) To counter this,
1207
+ * we apply a transform that spreads the impact of higher bits
1208
+ * downward. There is a tradeoff between speed, utility, and
1209
+ * quality of bit-spreading. Because many common sets of hashes
1210
+ * are already reasonably distributed across bits (so don't benefit
1211
+ * from spreading), and because we use trees to handle large sets
1212
+ * of collisions in bins, we don't need excessively high quality.
1213
+ */
1214
+ private static final int spread(int h) {
1215
+ h ^= (h >>> 18) ^ (h >>> 12);
1216
+ return (h ^ (h >>> 10)) & HASH_BITS;
1217
+ }
1218
+
1219
+ /**
1220
+ * Replaces a list bin with a tree bin. Call only when locked.
1221
+ * Fails to replace if the given key is non-comparable or table
1222
+ * is, or needs, resizing.
1223
+ */
1224
+ private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
1225
+ if ((key instanceof Comparable) &&
1226
+ (tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
1227
+ TreeBin t = new TreeBin();
1228
+ for (Node e = tabAt(tab, index); e != null; e = e.next)
1229
+ t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
1230
+ setTabAt(tab, index, new Node(MOVED, t, null, null));
1231
+ }
1232
+ }
1233
+
1234
+ /* ---------------- Internal access and update methods -------------- */
1235
+
1236
+ /** Implementation for get and containsKey */
1237
+ private final Object internalGet(Object k) {
1238
+ int h = spread(k.hashCode());
1239
+ retry: for (Node[] tab = table; tab != null;) {
1240
+ Node e, p; Object ek, ev; int eh; // locals to read fields once
1241
+ for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
1242
+ if ((eh = e.hash) == MOVED) {
1243
+ if ((ek = e.key) instanceof TreeBin) // search TreeBin
1244
+ return ((TreeBin)ek).getValue(h, k);
1245
+ else { // restart with new table
1246
+ tab = (Node[])ek;
1247
+ continue retry;
1248
+ }
1249
+ }
1250
+ else if ((eh & HASH_BITS) == h && (ev = e.val) != null &&
1251
+ ((ek = e.key) == k || k.equals(ek)))
1252
+ return ev;
1253
+ }
1254
+ break;
1255
+ }
1256
+ return null;
1257
+ }
1258
+
1259
+ /**
1260
+ * Implementation for the four public remove/replace methods:
1261
+ * Replaces node value with v, conditional upon match of cv if
1262
+ * non-null. If resulting value is null, delete.
1263
+ */
1264
+ private final Object internalReplace(Object k, Object v, Object cv) {
1265
+ int h = spread(k.hashCode());
1266
+ Object oldVal = null;
1267
+ for (Node[] tab = table;;) {
1268
+ Node f; int i, fh; Object fk;
1269
+ if (tab == null ||
1270
+ (f = tabAt(tab, i = (tab.length - 1) & h)) == null)
1271
+ break;
1272
+ else if ((fh = f.hash) == MOVED) {
1273
+ if ((fk = f.key) instanceof TreeBin) {
1274
+ TreeBin t = (TreeBin)fk;
1275
+ boolean validated = false;
1276
+ boolean deleted = false;
1277
+ t.acquire(0);
1278
+ try {
1279
+ if (tabAt(tab, i) == f) {
1280
+ validated = true;
1281
+ TreeNode p = t.getTreeNode(h, k, t.root);
1282
+ if (p != null) {
1283
+ Object pv = p.val;
1284
+ if (cv == null || cv == pv || cv.equals(pv)) {
1285
+ oldVal = pv;
1286
+ if ((p.val = v) == null) {
1287
+ deleted = true;
1288
+ t.deleteTreeNode(p);
1289
+ }
1290
+ }
1291
+ }
1292
+ }
1293
+ } finally {
1294
+ t.release(0);
1295
+ }
1296
+ if (validated) {
1297
+ if (deleted)
1298
+ counter.add(-1L);
1299
+ break;
1300
+ }
1301
+ }
1302
+ else
1303
+ tab = (Node[])fk;
1304
+ }
1305
+ else if ((fh & HASH_BITS) != h && f.next == null) // precheck
1306
+ break; // rules out possible existence
1307
+ else if ((fh & LOCKED) != 0) {
1308
+ checkForResize(); // try resizing if can't get lock
1309
+ f.tryAwaitLock(tab, i);
1310
+ }
1311
+ else if (f.casHash(fh, fh | LOCKED)) {
1312
+ boolean validated = false;
1313
+ boolean deleted = false;
1314
+ try {
1315
+ if (tabAt(tab, i) == f) {
1316
+ validated = true;
1317
+ for (Node e = f, pred = null;;) {
1318
+ Object ek, ev;
1319
+ if ((e.hash & HASH_BITS) == h &&
1320
+ ((ev = e.val) != null) &&
1321
+ ((ek = e.key) == k || k.equals(ek))) {
1322
+ if (cv == null || cv == ev || cv.equals(ev)) {
1323
+ oldVal = ev;
1324
+ if ((e.val = v) == null) {
1325
+ deleted = true;
1326
+ Node en = e.next;
1327
+ if (pred != null)
1328
+ pred.next = en;
1329
+ else
1330
+ setTabAt(tab, i, en);
1331
+ }
1332
+ }
1333
+ break;
1334
+ }
1335
+ pred = e;
1336
+ if ((e = e.next) == null)
1337
+ break;
1338
+ }
1339
+ }
1340
+ } finally {
1341
+ if (!f.casHash(fh | LOCKED, fh)) {
1342
+ f.hash = fh;
1343
+ synchronized (f) { f.notifyAll(); };
1344
+ }
1345
+ }
1346
+ if (validated) {
1347
+ if (deleted)
1348
+ counter.add(-1L);
1349
+ break;
1350
+ }
1351
+ }
1352
+ }
1353
+ return oldVal;
1354
+ }
1355
+
1356
+ /*
1357
+ * Internal versions of the six insertion methods, each a
1358
+ * little more complicated than the last. All have
1359
+ * the same basic structure as the first (internalPut):
1360
+ * 1. If table uninitialized, create
1361
+ * 2. If bin empty, try to CAS new node
1362
+ * 3. If bin stale, use new table
1363
+ * 4. if bin converted to TreeBin, validate and relay to TreeBin methods
1364
+ * 5. Lock and validate; if valid, scan and add or update
1365
+ *
1366
+ * The others interweave other checks and/or alternative actions:
1367
+ * * Plain put checks for and performs resize after insertion.
1368
+ * * putIfAbsent prescans for mapping without lock (and fails to add
1369
+ * if present), which also makes pre-emptive resize checks worthwhile.
1370
+ * * computeIfAbsent extends form used in putIfAbsent with additional
1371
+ * mechanics to deal with, calls, potential exceptions and null
1372
+ * returns from function call.
1373
+ * * compute uses the same function-call mechanics, but without
1374
+ * the prescans
1375
+ * * merge acts as putIfAbsent in the absent case, but invokes the
1376
+ * update function if present
1377
+ * * putAll attempts to pre-allocate enough table space
1378
+ * and more lazily performs count updates and checks.
1379
+ *
1380
+ * Someday when details settle down a bit more, it might be worth
1381
+ * some factoring to reduce sprawl.
1382
+ */
1383
+
1384
+ /** Implementation for put */
1385
+ private final Object internalPut(Object k, Object v) {
1386
+ int h = spread(k.hashCode());
1387
+ int count = 0;
1388
+ for (Node[] tab = table;;) {
1389
+ int i; Node f; int fh; Object fk;
1390
+ if (tab == null)
1391
+ tab = initTable();
1392
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1393
+ if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1394
+ break; // no lock when adding to empty bin
1395
+ }
1396
+ else if ((fh = f.hash) == MOVED) {
1397
+ if ((fk = f.key) instanceof TreeBin) {
1398
+ TreeBin t = (TreeBin)fk;
1399
+ Object oldVal = null;
1400
+ t.acquire(0);
1401
+ try {
1402
+ if (tabAt(tab, i) == f) {
1403
+ count = 2;
1404
+ TreeNode p = t.putTreeNode(h, k, v);
1405
+ if (p != null) {
1406
+ oldVal = p.val;
1407
+ p.val = v;
1408
+ }
1409
+ }
1410
+ } finally {
1411
+ t.release(0);
1412
+ }
1413
+ if (count != 0) {
1414
+ if (oldVal != null)
1415
+ return oldVal;
1416
+ break;
1417
+ }
1418
+ }
1419
+ else
1420
+ tab = (Node[])fk;
1421
+ }
1422
+ else if ((fh & LOCKED) != 0) {
1423
+ checkForResize();
1424
+ f.tryAwaitLock(tab, i);
1425
+ }
1426
+ else if (f.casHash(fh, fh | LOCKED)) {
1427
+ Object oldVal = null;
1428
+ try { // needed in case equals() throws
1429
+ if (tabAt(tab, i) == f) {
1430
+ count = 1;
1431
+ for (Node e = f;; ++count) {
1432
+ Object ek, ev;
1433
+ if ((e.hash & HASH_BITS) == h &&
1434
+ (ev = e.val) != null &&
1435
+ ((ek = e.key) == k || k.equals(ek))) {
1436
+ oldVal = ev;
1437
+ e.val = v;
1438
+ break;
1439
+ }
1440
+ Node last = e;
1441
+ if ((e = e.next) == null) {
1442
+ last.next = new Node(h, k, v, null);
1443
+ if (count >= TREE_THRESHOLD)
1444
+ replaceWithTreeBin(tab, i, k);
1445
+ break;
1446
+ }
1447
+ }
1448
+ }
1449
+ } finally { // unlock and signal if needed
1450
+ if (!f.casHash(fh | LOCKED, fh)) {
1451
+ f.hash = fh;
1452
+ synchronized (f) { f.notifyAll(); };
1453
+ }
1454
+ }
1455
+ if (count != 0) {
1456
+ if (oldVal != null)
1457
+ return oldVal;
1458
+ if (tab.length <= 64)
1459
+ count = 2;
1460
+ break;
1461
+ }
1462
+ }
1463
+ }
1464
+ counter.add(1L);
1465
+ if (count > 1)
1466
+ checkForResize();
1467
+ return null;
1468
+ }
1469
+
1470
+ /** Implementation for putIfAbsent */
1471
+ private final Object internalPutIfAbsent(Object k, Object v) {
1472
+ int h = spread(k.hashCode());
1473
+ int count = 0;
1474
+ for (Node[] tab = table;;) {
1475
+ int i; Node f; int fh; Object fk, fv;
1476
+ if (tab == null)
1477
+ tab = initTable();
1478
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1479
+ if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1480
+ break;
1481
+ }
1482
+ else if ((fh = f.hash) == MOVED) {
1483
+ if ((fk = f.key) instanceof TreeBin) {
1484
+ TreeBin t = (TreeBin)fk;
1485
+ Object oldVal = null;
1486
+ t.acquire(0);
1487
+ try {
1488
+ if (tabAt(tab, i) == f) {
1489
+ count = 2;
1490
+ TreeNode p = t.putTreeNode(h, k, v);
1491
+ if (p != null)
1492
+ oldVal = p.val;
1493
+ }
1494
+ } finally {
1495
+ t.release(0);
1496
+ }
1497
+ if (count != 0) {
1498
+ if (oldVal != null)
1499
+ return oldVal;
1500
+ break;
1501
+ }
1502
+ }
1503
+ else
1504
+ tab = (Node[])fk;
1505
+ }
1506
+ else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1507
+ ((fk = f.key) == k || k.equals(fk)))
1508
+ return fv;
1509
+ else {
1510
+ Node g = f.next;
1511
+ if (g != null) { // at least 2 nodes -- search and maybe resize
1512
+ for (Node e = g;;) {
1513
+ Object ek, ev;
1514
+ if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1515
+ ((ek = e.key) == k || k.equals(ek)))
1516
+ return ev;
1517
+ if ((e = e.next) == null) {
1518
+ checkForResize();
1519
+ break;
1520
+ }
1521
+ }
1522
+ }
1523
+ if (((fh = f.hash) & LOCKED) != 0) {
1524
+ checkForResize();
1525
+ f.tryAwaitLock(tab, i);
1526
+ }
1527
+ else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1528
+ Object oldVal = null;
1529
+ try {
1530
+ if (tabAt(tab, i) == f) {
1531
+ count = 1;
1532
+ for (Node e = f;; ++count) {
1533
+ Object ek, ev;
1534
+ if ((e.hash & HASH_BITS) == h &&
1535
+ (ev = e.val) != null &&
1536
+ ((ek = e.key) == k || k.equals(ek))) {
1537
+ oldVal = ev;
1538
+ break;
1539
+ }
1540
+ Node last = e;
1541
+ if ((e = e.next) == null) {
1542
+ last.next = new Node(h, k, v, null);
1543
+ if (count >= TREE_THRESHOLD)
1544
+ replaceWithTreeBin(tab, i, k);
1545
+ break;
1546
+ }
1547
+ }
1548
+ }
1549
+ } finally {
1550
+ if (!f.casHash(fh | LOCKED, fh)) {
1551
+ f.hash = fh;
1552
+ synchronized (f) { f.notifyAll(); };
1553
+ }
1554
+ }
1555
+ if (count != 0) {
1556
+ if (oldVal != null)
1557
+ return oldVal;
1558
+ if (tab.length <= 64)
1559
+ count = 2;
1560
+ break;
1561
+ }
1562
+ }
1563
+ }
1564
+ }
1565
+ counter.add(1L);
1566
+ if (count > 1)
1567
+ checkForResize();
1568
+ return null;
1569
+ }
1570
+
1571
+ /** Implementation for computeIfAbsent */
1572
+ private final Object internalComputeIfAbsent(K k,
1573
+ Fun<? super K, ?> mf) {
1574
+ int h = spread(k.hashCode());
1575
+ Object val = null;
1576
+ int count = 0;
1577
+ for (Node[] tab = table;;) {
1578
+ Node f; int i, fh; Object fk, fv;
1579
+ if (tab == null)
1580
+ tab = initTable();
1581
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1582
+ Node node = new Node(fh = h | LOCKED, k, null, null);
1583
+ if (casTabAt(tab, i, null, node)) {
1584
+ count = 1;
1585
+ try {
1586
+ if ((val = mf.apply(k)) != null)
1587
+ node.val = val;
1588
+ } finally {
1589
+ if (val == null)
1590
+ setTabAt(tab, i, null);
1591
+ if (!node.casHash(fh, h)) {
1592
+ node.hash = h;
1593
+ synchronized (node) { node.notifyAll(); };
1594
+ }
1595
+ }
1596
+ }
1597
+ if (count != 0)
1598
+ break;
1599
+ }
1600
+ else if ((fh = f.hash) == MOVED) {
1601
+ if ((fk = f.key) instanceof TreeBin) {
1602
+ TreeBin t = (TreeBin)fk;
1603
+ boolean added = false;
1604
+ t.acquire(0);
1605
+ try {
1606
+ if (tabAt(tab, i) == f) {
1607
+ count = 1;
1608
+ TreeNode p = t.getTreeNode(h, k, t.root);
1609
+ if (p != null)
1610
+ val = p.val;
1611
+ else if ((val = mf.apply(k)) != null) {
1612
+ added = true;
1613
+ count = 2;
1614
+ t.putTreeNode(h, k, val);
1615
+ }
1616
+ }
1617
+ } finally {
1618
+ t.release(0);
1619
+ }
1620
+ if (count != 0) {
1621
+ if (!added)
1622
+ return val;
1623
+ break;
1624
+ }
1625
+ }
1626
+ else
1627
+ tab = (Node[])fk;
1628
+ }
1629
+ else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1630
+ ((fk = f.key) == k || k.equals(fk)))
1631
+ return fv;
1632
+ else {
1633
+ Node g = f.next;
1634
+ if (g != null) {
1635
+ for (Node e = g;;) {
1636
+ Object ek, ev;
1637
+ if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1638
+ ((ek = e.key) == k || k.equals(ek)))
1639
+ return ev;
1640
+ if ((e = e.next) == null) {
1641
+ checkForResize();
1642
+ break;
1643
+ }
1644
+ }
1645
+ }
1646
+ if (((fh = f.hash) & LOCKED) != 0) {
1647
+ checkForResize();
1648
+ f.tryAwaitLock(tab, i);
1649
+ }
1650
+ else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1651
+ boolean added = false;
1652
+ try {
1653
+ if (tabAt(tab, i) == f) {
1654
+ count = 1;
1655
+ for (Node e = f;; ++count) {
1656
+ Object ek, ev;
1657
+ if ((e.hash & HASH_BITS) == h &&
1658
+ (ev = e.val) != null &&
1659
+ ((ek = e.key) == k || k.equals(ek))) {
1660
+ val = ev;
1661
+ break;
1662
+ }
1663
+ Node last = e;
1664
+ if ((e = e.next) == null) {
1665
+ if ((val = mf.apply(k)) != null) {
1666
+ added = true;
1667
+ last.next = new Node(h, k, val, null);
1668
+ if (count >= TREE_THRESHOLD)
1669
+ replaceWithTreeBin(tab, i, k);
1670
+ }
1671
+ break;
1672
+ }
1673
+ }
1674
+ }
1675
+ } finally {
1676
+ if (!f.casHash(fh | LOCKED, fh)) {
1677
+ f.hash = fh;
1678
+ synchronized (f) { f.notifyAll(); };
1679
+ }
1680
+ }
1681
+ if (count != 0) {
1682
+ if (!added)
1683
+ return val;
1684
+ if (tab.length <= 64)
1685
+ count = 2;
1686
+ break;
1687
+ }
1688
+ }
1689
+ }
1690
+ }
1691
+ if (val != null) {
1692
+ counter.add(1L);
1693
+ if (count > 1)
1694
+ checkForResize();
1695
+ }
1696
+ return val;
1697
+ }
1698
+
1699
+ /** Implementation for compute */
1700
+ @SuppressWarnings("unchecked") private final Object internalCompute
1701
+ (K k, boolean onlyIfPresent, BiFun<? super K, ? super V, ? extends V> mf) {
1702
+ int h = spread(k.hashCode());
1703
+ Object val = null;
1704
+ int delta = 0;
1705
+ int count = 0;
1706
+ for (Node[] tab = table;;) {
1707
+ Node f; int i, fh; Object fk;
1708
+ if (tab == null)
1709
+ tab = initTable();
1710
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1711
+ if (onlyIfPresent)
1712
+ break;
1713
+ Node node = new Node(fh = h | LOCKED, k, null, null);
1714
+ if (casTabAt(tab, i, null, node)) {
1715
+ try {
1716
+ count = 1;
1717
+ if ((val = mf.apply(k, null)) != null) {
1718
+ node.val = val;
1719
+ delta = 1;
1720
+ }
1721
+ } finally {
1722
+ if (delta == 0)
1723
+ setTabAt(tab, i, null);
1724
+ if (!node.casHash(fh, h)) {
1725
+ node.hash = h;
1726
+ synchronized (node) { node.notifyAll(); };
1727
+ }
1728
+ }
1729
+ }
1730
+ if (count != 0)
1731
+ break;
1732
+ }
1733
+ else if ((fh = f.hash) == MOVED) {
1734
+ if ((fk = f.key) instanceof TreeBin) {
1735
+ TreeBin t = (TreeBin)fk;
1736
+ t.acquire(0);
1737
+ try {
1738
+ if (tabAt(tab, i) == f) {
1739
+ count = 1;
1740
+ TreeNode p = t.getTreeNode(h, k, t.root);
1741
+ Object pv;
1742
+ if (p == null) {
1743
+ if (onlyIfPresent)
1744
+ break;
1745
+ pv = null;
1746
+ } else
1747
+ pv = p.val;
1748
+ if ((val = mf.apply(k, (V)pv)) != null) {
1749
+ if (p != null)
1750
+ p.val = val;
1751
+ else {
1752
+ count = 2;
1753
+ delta = 1;
1754
+ t.putTreeNode(h, k, val);
1755
+ }
1756
+ }
1757
+ else if (p != null) {
1758
+ delta = -1;
1759
+ t.deleteTreeNode(p);
1760
+ }
1761
+ }
1762
+ } finally {
1763
+ t.release(0);
1764
+ }
1765
+ if (count != 0)
1766
+ break;
1767
+ }
1768
+ else
1769
+ tab = (Node[])fk;
1770
+ }
1771
+ else if ((fh & LOCKED) != 0) {
1772
+ checkForResize();
1773
+ f.tryAwaitLock(tab, i);
1774
+ }
1775
+ else if (f.casHash(fh, fh | LOCKED)) {
1776
+ try {
1777
+ if (tabAt(tab, i) == f) {
1778
+ count = 1;
1779
+ for (Node e = f, pred = null;; ++count) {
1780
+ Object ek, ev;
1781
+ if ((e.hash & HASH_BITS) == h &&
1782
+ (ev = e.val) != null &&
1783
+ ((ek = e.key) == k || k.equals(ek))) {
1784
+ val = mf.apply(k, (V)ev);
1785
+ if (val != null)
1786
+ e.val = val;
1787
+ else {
1788
+ delta = -1;
1789
+ Node en = e.next;
1790
+ if (pred != null)
1791
+ pred.next = en;
1792
+ else
1793
+ setTabAt(tab, i, en);
1794
+ }
1795
+ break;
1796
+ }
1797
+ pred = e;
1798
+ if ((e = e.next) == null) {
1799
+ if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
1800
+ pred.next = new Node(h, k, val, null);
1801
+ delta = 1;
1802
+ if (count >= TREE_THRESHOLD)
1803
+ replaceWithTreeBin(tab, i, k);
1804
+ }
1805
+ break;
1806
+ }
1807
+ }
1808
+ }
1809
+ } finally {
1810
+ if (!f.casHash(fh | LOCKED, fh)) {
1811
+ f.hash = fh;
1812
+ synchronized (f) { f.notifyAll(); };
1813
+ }
1814
+ }
1815
+ if (count != 0) {
1816
+ if (tab.length <= 64)
1817
+ count = 2;
1818
+ break;
1819
+ }
1820
+ }
1821
+ }
1822
+ if (delta != 0) {
1823
+ counter.add((long)delta);
1824
+ if (count > 1)
1825
+ checkForResize();
1826
+ }
1827
+ return val;
1828
+ }
1829
+
1830
+ /** Implementation for merge */
1831
+ @SuppressWarnings("unchecked") private final Object internalMerge
1832
+ (K k, V v, BiFun<? super V, ? super V, ? extends V> mf) {
1833
+ int h = spread(k.hashCode());
1834
+ Object val = null;
1835
+ int delta = 0;
1836
+ int count = 0;
1837
+ for (Node[] tab = table;;) {
1838
+ int i; Node f; int fh; Object fk, fv;
1839
+ if (tab == null)
1840
+ tab = initTable();
1841
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1842
+ if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1843
+ delta = 1;
1844
+ val = v;
1845
+ break;
1846
+ }
1847
+ }
1848
+ else if ((fh = f.hash) == MOVED) {
1849
+ if ((fk = f.key) instanceof TreeBin) {
1850
+ TreeBin t = (TreeBin)fk;
1851
+ t.acquire(0);
1852
+ try {
1853
+ if (tabAt(tab, i) == f) {
1854
+ count = 1;
1855
+ TreeNode p = t.getTreeNode(h, k, t.root);
1856
+ val = (p == null) ? v : mf.apply((V)p.val, v);
1857
+ if (val != null) {
1858
+ if (p != null)
1859
+ p.val = val;
1860
+ else {
1861
+ count = 2;
1862
+ delta = 1;
1863
+ t.putTreeNode(h, k, val);
1864
+ }
1865
+ }
1866
+ else if (p != null) {
1867
+ delta = -1;
1868
+ t.deleteTreeNode(p);
1869
+ }
1870
+ }
1871
+ } finally {
1872
+ t.release(0);
1873
+ }
1874
+ if (count != 0)
1875
+ break;
1876
+ }
1877
+ else
1878
+ tab = (Node[])fk;
1879
+ }
1880
+ else if ((fh & LOCKED) != 0) {
1881
+ checkForResize();
1882
+ f.tryAwaitLock(tab, i);
1883
+ }
1884
+ else if (f.casHash(fh, fh | LOCKED)) {
1885
+ try {
1886
+ if (tabAt(tab, i) == f) {
1887
+ count = 1;
1888
+ for (Node e = f, pred = null;; ++count) {
1889
+ Object ek, ev;
1890
+ if ((e.hash & HASH_BITS) == h &&
1891
+ (ev = e.val) != null &&
1892
+ ((ek = e.key) == k || k.equals(ek))) {
1893
+ val = mf.apply((V)ev, v);
1894
+ if (val != null)
1895
+ e.val = val;
1896
+ else {
1897
+ delta = -1;
1898
+ Node en = e.next;
1899
+ if (pred != null)
1900
+ pred.next = en;
1901
+ else
1902
+ setTabAt(tab, i, en);
1903
+ }
1904
+ break;
1905
+ }
1906
+ pred = e;
1907
+ if ((e = e.next) == null) {
1908
+ val = v;
1909
+ pred.next = new Node(h, k, val, null);
1910
+ delta = 1;
1911
+ if (count >= TREE_THRESHOLD)
1912
+ replaceWithTreeBin(tab, i, k);
1913
+ break;
1914
+ }
1915
+ }
1916
+ }
1917
+ } finally {
1918
+ if (!f.casHash(fh | LOCKED, fh)) {
1919
+ f.hash = fh;
1920
+ synchronized (f) { f.notifyAll(); };
1921
+ }
1922
+ }
1923
+ if (count != 0) {
1924
+ if (tab.length <= 64)
1925
+ count = 2;
1926
+ break;
1927
+ }
1928
+ }
1929
+ }
1930
+ if (delta != 0) {
1931
+ counter.add((long)delta);
1932
+ if (count > 1)
1933
+ checkForResize();
1934
+ }
1935
+ return val;
1936
+ }
1937
+
1938
+ /** Implementation for putAll */
1939
+ private final void internalPutAll(Map<?, ?> m) {
1940
+ tryPresize(m.size());
1941
+ long delta = 0L; // number of uncommitted additions
1942
+ boolean npe = false; // to throw exception on exit for nulls
1943
+ try { // to clean up counts on other exceptions
1944
+ for (Map.Entry<?, ?> entry : m.entrySet()) {
1945
+ Object k, v;
1946
+ if (entry == null || (k = entry.getKey()) == null ||
1947
+ (v = entry.getValue()) == null) {
1948
+ npe = true;
1949
+ break;
1950
+ }
1951
+ int h = spread(k.hashCode());
1952
+ for (Node[] tab = table;;) {
1953
+ int i; Node f; int fh; Object fk;
1954
+ if (tab == null)
1955
+ tab = initTable();
1956
+ else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
1957
+ if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1958
+ ++delta;
1959
+ break;
1960
+ }
1961
+ }
1962
+ else if ((fh = f.hash) == MOVED) {
1963
+ if ((fk = f.key) instanceof TreeBin) {
1964
+ TreeBin t = (TreeBin)fk;
1965
+ boolean validated = false;
1966
+ t.acquire(0);
1967
+ try {
1968
+ if (tabAt(tab, i) == f) {
1969
+ validated = true;
1970
+ TreeNode p = t.getTreeNode(h, k, t.root);
1971
+ if (p != null)
1972
+ p.val = v;
1973
+ else {
1974
+ t.putTreeNode(h, k, v);
1975
+ ++delta;
1976
+ }
1977
+ }
1978
+ } finally {
1979
+ t.release(0);
1980
+ }
1981
+ if (validated)
1982
+ break;
1983
+ }
1984
+ else
1985
+ tab = (Node[])fk;
1986
+ }
1987
+ else if ((fh & LOCKED) != 0) {
1988
+ counter.add(delta);
1989
+ delta = 0L;
1990
+ checkForResize();
1991
+ f.tryAwaitLock(tab, i);
1992
+ }
1993
+ else if (f.casHash(fh, fh | LOCKED)) {
1994
+ int count = 0;
1995
+ try {
1996
+ if (tabAt(tab, i) == f) {
1997
+ count = 1;
1998
+ for (Node e = f;; ++count) {
1999
+ Object ek, ev;
2000
+ if ((e.hash & HASH_BITS) == h &&
2001
+ (ev = e.val) != null &&
2002
+ ((ek = e.key) == k || k.equals(ek))) {
2003
+ e.val = v;
2004
+ break;
2005
+ }
2006
+ Node last = e;
2007
+ if ((e = e.next) == null) {
2008
+ ++delta;
2009
+ last.next = new Node(h, k, v, null);
2010
+ if (count >= TREE_THRESHOLD)
2011
+ replaceWithTreeBin(tab, i, k);
2012
+ break;
2013
+ }
2014
+ }
2015
+ }
2016
+ } finally {
2017
+ if (!f.casHash(fh | LOCKED, fh)) {
2018
+ f.hash = fh;
2019
+ synchronized (f) { f.notifyAll(); };
2020
+ }
2021
+ }
2022
+ if (count != 0) {
2023
+ if (count > 1) {
2024
+ counter.add(delta);
2025
+ delta = 0L;
2026
+ checkForResize();
2027
+ }
2028
+ break;
2029
+ }
2030
+ }
2031
+ }
2032
+ }
2033
+ } finally {
2034
+ if (delta != 0)
2035
+ counter.add(delta);
2036
+ }
2037
+ if (npe)
2038
+ throw new NullPointerException();
2039
+ }
2040
+
2041
+ /* ---------------- Table Initialization and Resizing -------------- */
2042
+
2043
+ /**
2044
+ * Returns a power of two table size for the given desired capacity.
2045
+ * See Hackers Delight, sec 3.2
2046
+ */
2047
+ private static final int tableSizeFor(int c) {
2048
+ int n = c - 1;
2049
+ n |= n >>> 1;
2050
+ n |= n >>> 2;
2051
+ n |= n >>> 4;
2052
+ n |= n >>> 8;
2053
+ n |= n >>> 16;
2054
+ return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
2055
+ }
2056
+
2057
+ /**
2058
+ * Initializes table, using the size recorded in sizeCtl.
2059
+ */
2060
+ private final Node[] initTable() {
2061
+ Node[] tab; int sc;
2062
+ while ((tab = table) == null) {
2063
+ if ((sc = sizeCtl) < 0)
2064
+ Thread.yield(); // lost initialization race; just spin
2065
+ else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2066
+ try {
2067
+ if ((tab = table) == null) {
2068
+ int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
2069
+ tab = table = new Node[n];
2070
+ sc = n - (n >>> 2);
2071
+ }
2072
+ } finally {
2073
+ sizeCtl = sc;
2074
+ }
2075
+ break;
2076
+ }
2077
+ }
2078
+ return tab;
2079
+ }
2080
+
2081
+ /**
2082
+ * If table is too small and not already resizing, creates next
2083
+ * table and transfers bins. Rechecks occupancy after a transfer
2084
+ * to see if another resize is already needed because resizings
2085
+ * are lagging additions.
2086
+ */
2087
+ private final void checkForResize() {
2088
+ Node[] tab; int n, sc;
2089
+ while ((tab = table) != null &&
2090
+ (n = tab.length) < MAXIMUM_CAPACITY &&
2091
+ (sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
2092
+ UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2093
+ try {
2094
+ if (tab == table) {
2095
+ table = rebuild(tab);
2096
+ sc = (n << 1) - (n >>> 1);
2097
+ }
2098
+ } finally {
2099
+ sizeCtl = sc;
2100
+ }
2101
+ }
2102
+ }
2103
+
2104
+ /**
2105
+ * Tries to presize table to accommodate the given number of elements.
2106
+ *
2107
+ * @param size number of elements (doesn't need to be perfectly accurate)
2108
+ */
2109
+ private final void tryPresize(int size) {
2110
+ int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
2111
+ tableSizeFor(size + (size >>> 1) + 1);
2112
+ int sc;
2113
+ while ((sc = sizeCtl) >= 0) {
2114
+ Node[] tab = table; int n;
2115
+ if (tab == null || (n = tab.length) == 0) {
2116
+ n = (sc > c) ? sc : c;
2117
+ if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2118
+ try {
2119
+ if (table == tab) {
2120
+ table = new Node[n];
2121
+ sc = n - (n >>> 2);
2122
+ }
2123
+ } finally {
2124
+ sizeCtl = sc;
2125
+ }
2126
+ }
2127
+ }
2128
+ else if (c <= sc || n >= MAXIMUM_CAPACITY)
2129
+ break;
2130
+ else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2131
+ try {
2132
+ if (table == tab) {
2133
+ table = rebuild(tab);
2134
+ sc = (n << 1) - (n >>> 1);
2135
+ }
2136
+ } finally {
2137
+ sizeCtl = sc;
2138
+ }
2139
+ }
2140
+ }
2141
+ }
2142
+
2143
+ /*
2144
+ * Moves and/or copies the nodes in each bin to new table. See
2145
+ * above for explanation.
2146
+ *
2147
+ * @return the new table
2148
+ */
2149
+ private static final Node[] rebuild(Node[] tab) {
2150
+ int n = tab.length;
2151
+ Node[] nextTab = new Node[n << 1];
2152
+ Node fwd = new Node(MOVED, nextTab, null, null);
2153
+ int[] buffer = null; // holds bins to revisit; null until needed
2154
+ Node rev = null; // reverse forwarder; null until needed
2155
+ int nbuffered = 0; // the number of bins in buffer list
2156
+ int bufferIndex = 0; // buffer index of current buffered bin
2157
+ int bin = n - 1; // current non-buffered bin or -1 if none
2158
+
2159
+ for (int i = bin;;) { // start upwards sweep
2160
+ int fh; Node f;
2161
+ if ((f = tabAt(tab, i)) == null) {
2162
+ if (bin >= 0) { // Unbuffered; no lock needed (or available)
2163
+ if (!casTabAt(tab, i, f, fwd))
2164
+ continue;
2165
+ }
2166
+ else { // transiently use a locked forwarding node
2167
+ Node g = new Node(MOVED|LOCKED, nextTab, null, null);
2168
+ if (!casTabAt(tab, i, f, g))
2169
+ continue;
2170
+ setTabAt(nextTab, i, null);
2171
+ setTabAt(nextTab, i + n, null);
2172
+ setTabAt(tab, i, fwd);
2173
+ if (!g.casHash(MOVED|LOCKED, MOVED)) {
2174
+ g.hash = MOVED;
2175
+ synchronized (g) { g.notifyAll(); }
2176
+ }
2177
+ }
2178
+ }
2179
+ else if ((fh = f.hash) == MOVED) {
2180
+ Object fk = f.key;
2181
+ if (fk instanceof TreeBin) {
2182
+ TreeBin t = (TreeBin)fk;
2183
+ boolean validated = false;
2184
+ t.acquire(0);
2185
+ try {
2186
+ if (tabAt(tab, i) == f) {
2187
+ validated = true;
2188
+ splitTreeBin(nextTab, i, t);
2189
+ setTabAt(tab, i, fwd);
2190
+ }
2191
+ } finally {
2192
+ t.release(0);
2193
+ }
2194
+ if (!validated)
2195
+ continue;
2196
+ }
2197
+ }
2198
+ else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
2199
+ boolean validated = false;
2200
+ try { // split to lo and hi lists; copying as needed
2201
+ if (tabAt(tab, i) == f) {
2202
+ validated = true;
2203
+ splitBin(nextTab, i, f);
2204
+ setTabAt(tab, i, fwd);
2205
+ }
2206
+ } finally {
2207
+ if (!f.casHash(fh | LOCKED, fh)) {
2208
+ f.hash = fh;
2209
+ synchronized (f) { f.notifyAll(); };
2210
+ }
2211
+ }
2212
+ if (!validated)
2213
+ continue;
2214
+ }
2215
+ else {
2216
+ if (buffer == null) // initialize buffer for revisits
2217
+ buffer = new int[TRANSFER_BUFFER_SIZE];
2218
+ if (bin < 0 && bufferIndex > 0) {
2219
+ int j = buffer[--bufferIndex];
2220
+ buffer[bufferIndex] = i;
2221
+ i = j; // swap with another bin
2222
+ continue;
2223
+ }
2224
+ if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
2225
+ f.tryAwaitLock(tab, i);
2226
+ continue; // no other options -- block
2227
+ }
2228
+ if (rev == null) // initialize reverse-forwarder
2229
+ rev = new Node(MOVED, tab, null, null);
2230
+ if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
2231
+ continue; // recheck before adding to list
2232
+ buffer[nbuffered++] = i;
2233
+ setTabAt(nextTab, i, rev); // install place-holders
2234
+ setTabAt(nextTab, i + n, rev);
2235
+ }
2236
+
2237
+ if (bin > 0)
2238
+ i = --bin;
2239
+ else if (buffer != null && nbuffered > 0) {
2240
+ bin = -1;
2241
+ i = buffer[bufferIndex = --nbuffered];
2242
+ }
2243
+ else
2244
+ return nextTab;
2245
+ }
2246
+ }
2247
+
2248
+ /**
2249
+ * Splits a normal bin with list headed by e into lo and hi parts;
2250
+ * installs in given table.
2251
+ */
2252
+ private static void splitBin(Node[] nextTab, int i, Node e) {
2253
+ int bit = nextTab.length >>> 1; // bit to split on
2254
+ int runBit = e.hash & bit;
2255
+ Node lastRun = e, lo = null, hi = null;
2256
+ for (Node p = e.next; p != null; p = p.next) {
2257
+ int b = p.hash & bit;
2258
+ if (b != runBit) {
2259
+ runBit = b;
2260
+ lastRun = p;
2261
+ }
2262
+ }
2263
+ if (runBit == 0)
2264
+ lo = lastRun;
2265
+ else
2266
+ hi = lastRun;
2267
+ for (Node p = e; p != lastRun; p = p.next) {
2268
+ int ph = p.hash & HASH_BITS;
2269
+ Object pk = p.key, pv = p.val;
2270
+ if ((ph & bit) == 0)
2271
+ lo = new Node(ph, pk, pv, lo);
2272
+ else
2273
+ hi = new Node(ph, pk, pv, hi);
2274
+ }
2275
+ setTabAt(nextTab, i, lo);
2276
+ setTabAt(nextTab, i + bit, hi);
2277
+ }
2278
+
2279
+ /**
2280
+ * Splits a tree bin into lo and hi parts; installs in given table.
2281
+ */
2282
+ private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
2283
+ int bit = nextTab.length >>> 1;
2284
+ TreeBin lt = new TreeBin();
2285
+ TreeBin ht = new TreeBin();
2286
+ int lc = 0, hc = 0;
2287
+ for (Node e = t.first; e != null; e = e.next) {
2288
+ int h = e.hash & HASH_BITS;
2289
+ Object k = e.key, v = e.val;
2290
+ if ((h & bit) == 0) {
2291
+ ++lc;
2292
+ lt.putTreeNode(h, k, v);
2293
+ }
2294
+ else {
2295
+ ++hc;
2296
+ ht.putTreeNode(h, k, v);
2297
+ }
2298
+ }
2299
+ Node ln, hn; // throw away trees if too small
2300
+ if (lc <= (TREE_THRESHOLD >>> 1)) {
2301
+ ln = null;
2302
+ for (Node p = lt.first; p != null; p = p.next)
2303
+ ln = new Node(p.hash, p.key, p.val, ln);
2304
+ }
2305
+ else
2306
+ ln = new Node(MOVED, lt, null, null);
2307
+ setTabAt(nextTab, i, ln);
2308
+ if (hc <= (TREE_THRESHOLD >>> 1)) {
2309
+ hn = null;
2310
+ for (Node p = ht.first; p != null; p = p.next)
2311
+ hn = new Node(p.hash, p.key, p.val, hn);
2312
+ }
2313
+ else
2314
+ hn = new Node(MOVED, ht, null, null);
2315
+ setTabAt(nextTab, i + bit, hn);
2316
+ }
2317
+
2318
+ /**
2319
+ * Implementation for clear. Steps through each bin, removing all
2320
+ * nodes.
2321
+ */
2322
+ private final void internalClear() {
2323
+ long delta = 0L; // negative number of deletions
2324
+ int i = 0;
2325
+ Node[] tab = table;
2326
+ while (tab != null && i < tab.length) {
2327
+ int fh; Object fk;
2328
+ Node f = tabAt(tab, i);
2329
+ if (f == null)
2330
+ ++i;
2331
+ else if ((fh = f.hash) == MOVED) {
2332
+ if ((fk = f.key) instanceof TreeBin) {
2333
+ TreeBin t = (TreeBin)fk;
2334
+ t.acquire(0);
2335
+ try {
2336
+ if (tabAt(tab, i) == f) {
2337
+ for (Node p = t.first; p != null; p = p.next) {
2338
+ if (p.val != null) { // (currently always true)
2339
+ p.val = null;
2340
+ --delta;
2341
+ }
2342
+ }
2343
+ t.first = null;
2344
+ t.root = null;
2345
+ ++i;
2346
+ }
2347
+ } finally {
2348
+ t.release(0);
2349
+ }
2350
+ }
2351
+ else
2352
+ tab = (Node[])fk;
2353
+ }
2354
+ else if ((fh & LOCKED) != 0) {
2355
+ counter.add(delta); // opportunistically update count
2356
+ delta = 0L;
2357
+ f.tryAwaitLock(tab, i);
2358
+ }
2359
+ else if (f.casHash(fh, fh | LOCKED)) {
2360
+ try {
2361
+ if (tabAt(tab, i) == f) {
2362
+ for (Node e = f; e != null; e = e.next) {
2363
+ if (e.val != null) { // (currently always true)
2364
+ e.val = null;
2365
+ --delta;
2366
+ }
2367
+ }
2368
+ setTabAt(tab, i, null);
2369
+ ++i;
2370
+ }
2371
+ } finally {
2372
+ if (!f.casHash(fh | LOCKED, fh)) {
2373
+ f.hash = fh;
2374
+ synchronized (f) { f.notifyAll(); };
2375
+ }
2376
+ }
2377
+ }
2378
+ }
2379
+ if (delta != 0)
2380
+ counter.add(delta);
2381
+ }
2382
+
2383
+ /* ----------------Table Traversal -------------- */
2384
+
2385
+ /**
2386
+ * Encapsulates traversal for methods such as containsValue; also
2387
+ * serves as a base class for other iterators and bulk tasks.
2388
+ *
2389
+ * At each step, the iterator snapshots the key ("nextKey") and
2390
+ * value ("nextVal") of a valid node (i.e., one that, at point of
2391
+ * snapshot, has a non-null user value). Because val fields can
2392
+ * change (including to null, indicating deletion), field nextVal
2393
+ * might not be accurate at point of use, but still maintains the
2394
+ * weak consistency property of holding a value that was once
2395
+ * valid. To support iterator.remove, the nextKey field is not
2396
+ * updated (nulled out) when the iterator cannot advance.
2397
+ *
2398
+ * Internal traversals directly access these fields, as in:
2399
+ * {@code while (it.advance() != null) { process(it.nextKey); }}
2400
+ *
2401
+ * Exported iterators must track whether the iterator has advanced
2402
+ * (in hasNext vs next) (by setting/checking/nulling field
2403
+ * nextVal), and then extract key, value, or key-value pairs as
2404
+ * return values of next().
2405
+ *
2406
+ * The iterator visits once each still-valid node that was
2407
+ * reachable upon iterator construction. It might miss some that
2408
+ * were added to a bin after the bin was visited, which is OK wrt
2409
+ * consistency guarantees. Maintaining this property in the face
2410
+ * of possible ongoing resizes requires a fair amount of
2411
+ * bookkeeping state that is difficult to optimize away amidst
2412
+ * volatile accesses. Even so, traversal maintains reasonable
2413
+ * throughput.
2414
+ *
2415
+ * Normally, iteration proceeds bin-by-bin traversing lists.
2416
+ * However, if the table has been resized, then all future steps
2417
+ * must traverse both the bin at the current index as well as at
2418
+ * (index + baseSize); and so on for further resizings. To
2419
+ * paranoically cope with potential sharing by users of iterators
2420
+ * across threads, iteration terminates if a bounds checks fails
2421
+ * for a table read.
2422
+ *
2423
+ * This class extends ForkJoinTask to streamline parallel
2424
+ * iteration in bulk operations (see BulkTask). This adds only an
2425
+ * int of space overhead, which is close enough to negligible in
2426
+ * cases where it is not needed to not worry about it. Because
2427
+ * ForkJoinTask is Serializable, but iterators need not be, we
2428
+ * need to add warning suppressions.
2429
+ */
2430
+ @SuppressWarnings("serial") static class Traverser<K,V,R> {
2431
+ final ConcurrentHashMapV8<K, V> map;
2432
+ Node next; // the next entry to use
2433
+ K nextKey; // cached key field of next
2434
+ V nextVal; // cached val field of next
2435
+ Node[] tab; // current table; updated if resized
2436
+ int index; // index of bin to use next
2437
+ int baseIndex; // current index of initial table
2438
+ int baseLimit; // index bound for initial table
2439
+ int baseSize; // initial table size
2440
+
2441
+ /** Creates iterator for all entries in the table. */
2442
+ Traverser(ConcurrentHashMapV8<K, V> map) {
2443
+ this.map = map;
2444
+ }
2445
+
2446
+ /** Creates iterator for split() methods */
2447
+ Traverser(Traverser<K,V,?> it) {
2448
+ ConcurrentHashMapV8<K, V> m; Node[] t;
2449
+ if ((m = this.map = it.map) == null)
2450
+ t = null;
2451
+ else if ((t = it.tab) == null && // force parent tab initialization
2452
+ (t = it.tab = m.table) != null)
2453
+ it.baseLimit = it.baseSize = t.length;
2454
+ this.tab = t;
2455
+ this.baseSize = it.baseSize;
2456
+ it.baseLimit = this.index = this.baseIndex =
2457
+ ((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1;
2458
+ }
2459
+
2460
+ /**
2461
+ * Advances next; returns nextVal or null if terminated.
2462
+ * See above for explanation.
2463
+ */
2464
+ final V advance() {
2465
+ Node e = next;
2466
+ V ev = null;
2467
+ outer: do {
2468
+ if (e != null) // advance past used/skipped node
2469
+ e = e.next;
2470
+ while (e == null) { // get to next non-null bin
2471
+ ConcurrentHashMapV8<K, V> m;
2472
+ Node[] t; int b, i, n; Object ek; // checks must use locals
2473
+ if ((t = tab) != null)
2474
+ n = t.length;
2475
+ else if ((m = map) != null && (t = tab = m.table) != null)
2476
+ n = baseLimit = baseSize = t.length;
2477
+ else
2478
+ break outer;
2479
+ if ((b = baseIndex) >= baseLimit ||
2480
+ (i = index) < 0 || i >= n)
2481
+ break outer;
2482
+ if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
2483
+ if ((ek = e.key) instanceof TreeBin)
2484
+ e = ((TreeBin)ek).first;
2485
+ else {
2486
+ tab = (Node[])ek;
2487
+ continue; // restarts due to null val
2488
+ }
2489
+ } // visit upper slots if present
2490
+ index = (i += baseSize) < n ? i : (baseIndex = b + 1);
2491
+ }
2492
+ nextKey = (K) e.key;
2493
+ } while ((ev = (V) e.val) == null); // skip deleted or special nodes
2494
+ next = e;
2495
+ return nextVal = ev;
2496
+ }
2497
+
2498
+ public final void remove() {
2499
+ Object k = nextKey;
2500
+ if (k == null && (advance() == null || (k = nextKey) == null))
2501
+ throw new IllegalStateException();
2502
+ map.internalReplace(k, null, null);
2503
+ }
2504
+
2505
+ public final boolean hasNext() {
2506
+ return nextVal != null || advance() != null;
2507
+ }
2508
+
2509
+ public final boolean hasMoreElements() { return hasNext(); }
2510
+ public final void setRawResult(Object x) { }
2511
+ public R getRawResult() { return null; }
2512
+ public boolean exec() { return true; }
2513
+ }
2514
+
2515
+ /* ---------------- Public operations -------------- */
2516
+
2517
+ /**
2518
+ * Creates a new, empty map with the default initial table size (16).
2519
+ */
2520
+ public ConcurrentHashMapV8() {
2521
+ this.counter = new LongAdder();
2522
+ }
2523
+
2524
+ /**
2525
+ * Creates a new, empty map with an initial table size
2526
+ * accommodating the specified number of elements without the need
2527
+ * to dynamically resize.
2528
+ *
2529
+ * @param initialCapacity The implementation performs internal
2530
+ * sizing to accommodate this many elements.
2531
+ * @throws IllegalArgumentException if the initial capacity of
2532
+ * elements is negative
2533
+ */
2534
+ public ConcurrentHashMapV8(int initialCapacity) {
2535
+ if (initialCapacity < 0)
2536
+ throw new IllegalArgumentException();
2537
+ int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
2538
+ MAXIMUM_CAPACITY :
2539
+ tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
2540
+ this.counter = new LongAdder();
2541
+ this.sizeCtl = cap;
2542
+ }
2543
+
2544
+ /**
2545
+ * Creates a new map with the same mappings as the given map.
2546
+ *
2547
+ * @param m the map
2548
+ */
2549
+ public ConcurrentHashMapV8(Map<? extends K, ? extends V> m) {
2550
+ this.counter = new LongAdder();
2551
+ this.sizeCtl = DEFAULT_CAPACITY;
2552
+ internalPutAll(m);
2553
+ }
2554
+
2555
+ /**
2556
+ * Creates a new, empty map with an initial table size based on
2557
+ * the given number of elements ({@code initialCapacity}) and
2558
+ * initial table density ({@code loadFactor}).
2559
+ *
2560
+ * @param initialCapacity the initial capacity. The implementation
2561
+ * performs internal sizing to accommodate this many elements,
2562
+ * given the specified load factor.
2563
+ * @param loadFactor the load factor (table density) for
2564
+ * establishing the initial table size
2565
+ * @throws IllegalArgumentException if the initial capacity of
2566
+ * elements is negative or the load factor is nonpositive
2567
+ *
2568
+ * @since 1.6
2569
+ */
2570
+ public ConcurrentHashMapV8(int initialCapacity, float loadFactor) {
2571
+ this(initialCapacity, loadFactor, 1);
2572
+ }
2573
+
2574
+ /**
2575
+ * Creates a new, empty map with an initial table size based on
2576
+ * the given number of elements ({@code initialCapacity}), table
2577
+ * density ({@code loadFactor}), and number of concurrently
2578
+ * updating threads ({@code concurrencyLevel}).
2579
+ *
2580
+ * @param initialCapacity the initial capacity. The implementation
2581
+ * performs internal sizing to accommodate this many elements,
2582
+ * given the specified load factor.
2583
+ * @param loadFactor the load factor (table density) for
2584
+ * establishing the initial table size
2585
+ * @param concurrencyLevel the estimated number of concurrently
2586
+ * updating threads. The implementation may use this value as
2587
+ * a sizing hint.
2588
+ * @throws IllegalArgumentException if the initial capacity is
2589
+ * negative or the load factor or concurrencyLevel are
2590
+ * nonpositive
2591
+ */
2592
+ public ConcurrentHashMapV8(int initialCapacity,
2593
+ float loadFactor, int concurrencyLevel) {
2594
+ if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
2595
+ throw new IllegalArgumentException();
2596
+ if (initialCapacity < concurrencyLevel) // Use at least as many bins
2597
+ initialCapacity = concurrencyLevel; // as estimated threads
2598
+ long size = (long)(1.0 + (long)initialCapacity / loadFactor);
2599
+ int cap = (size >= (long)MAXIMUM_CAPACITY) ?
2600
+ MAXIMUM_CAPACITY : tableSizeFor((int)size);
2601
+ this.counter = new LongAdder();
2602
+ this.sizeCtl = cap;
2603
+ }
2604
+
2605
+ /**
2606
+ * Creates a new {@link Set} backed by a ConcurrentHashMapV8
2607
+ * from the given type to {@code Boolean.TRUE}.
2608
+ *
2609
+ * @return the new set
2610
+ */
2611
+ public static <K> KeySetView<K,Boolean> newKeySet() {
2612
+ return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(),
2613
+ Boolean.TRUE);
2614
+ }
2615
+
2616
+ /**
2617
+ * Creates a new {@link Set} backed by a ConcurrentHashMapV8
2618
+ * from the given type to {@code Boolean.TRUE}.
2619
+ *
2620
+ * @param initialCapacity The implementation performs internal
2621
+ * sizing to accommodate this many elements.
2622
+ * @throws IllegalArgumentException if the initial capacity of
2623
+ * elements is negative
2624
+ * @return the new set
2625
+ */
2626
+ public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2627
+ return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(initialCapacity),
2628
+ Boolean.TRUE);
2629
+ }
2630
+
2631
+ /**
2632
+ * {@inheritDoc}
2633
+ */
2634
+ public boolean isEmpty() {
2635
+ return counter.sum() <= 0L; // ignore transient negative values
2636
+ }
2637
+
2638
+ /**
2639
+ * {@inheritDoc}
2640
+ */
2641
+ public int size() {
2642
+ long n = counter.sum();
2643
+ return ((n < 0L) ? 0 :
2644
+ (n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
2645
+ (int)n);
2646
+ }
2647
+
2648
+ /**
2649
+ * Returns the number of mappings. This method should be used
2650
+ * instead of {@link #size} because a ConcurrentHashMapV8 may
2651
+ * contain more mappings than can be represented as an int. The
2652
+ * value returned is a snapshot; the actual count may differ if
2653
+ * there are ongoing concurrent insertions or removals.
2654
+ *
2655
+ * @return the number of mappings
2656
+ */
2657
+ public long mappingCount() {
2658
+ long n = counter.sum();
2659
+ return (n < 0L) ? 0L : n; // ignore transient negative values
2660
+ }
2661
+
2662
+ /**
2663
+ * Returns the value to which the specified key is mapped,
2664
+ * or {@code null} if this map contains no mapping for the key.
2665
+ *
2666
+ * <p>More formally, if this map contains a mapping from a key
2667
+ * {@code k} to a value {@code v} such that {@code key.equals(k)},
2668
+ * then this method returns {@code v}; otherwise it returns
2669
+ * {@code null}. (There can be at most one such mapping.)
2670
+ *
2671
+ * @throws NullPointerException if the specified key is null
2672
+ */
2673
+ @SuppressWarnings("unchecked") public V get(Object key) {
2674
+ if (key == null)
2675
+ throw new NullPointerException();
2676
+ return (V)internalGet(key);
2677
+ }
2678
+
2679
+ /**
2680
+ * Returns the value to which the specified key is mapped,
2681
+ * or the given defaultValue if this map contains no mapping for the key.
2682
+ *
2683
+ * @param key the key
2684
+ * @param defaultValue the value to return if this map contains
2685
+ * no mapping for the given key
2686
+ * @return the mapping for the key, if present; else the defaultValue
2687
+ * @throws NullPointerException if the specified key is null
2688
+ */
2689
+ @SuppressWarnings("unchecked") public V getValueOrDefault(Object key, V defaultValue) {
2690
+ if (key == null)
2691
+ throw new NullPointerException();
2692
+ V v = (V) internalGet(key);
2693
+ return v == null ? defaultValue : v;
2694
+ }
2695
+
2696
+ /**
2697
+ * Tests if the specified object is a key in this table.
2698
+ *
2699
+ * @param key possible key
2700
+ * @return {@code true} if and only if the specified object
2701
+ * is a key in this table, as determined by the
2702
+ * {@code equals} method; {@code false} otherwise
2703
+ * @throws NullPointerException if the specified key is null
2704
+ */
2705
+ public boolean containsKey(Object key) {
2706
+ if (key == null)
2707
+ throw new NullPointerException();
2708
+ return internalGet(key) != null;
2709
+ }
2710
+
2711
+ /**
2712
+ * Returns {@code true} if this map maps one or more keys to the
2713
+ * specified value. Note: This method may require a full traversal
2714
+ * of the map, and is much slower than method {@code containsKey}.
2715
+ *
2716
+ * @param value value whose presence in this map is to be tested
2717
+ * @return {@code true} if this map maps one or more keys to the
2718
+ * specified value
2719
+ * @throws NullPointerException if the specified value is null
2720
+ */
2721
+ public boolean containsValue(Object value) {
2722
+ if (value == null)
2723
+ throw new NullPointerException();
2724
+ Object v;
2725
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2726
+ while ((v = it.advance()) != null) {
2727
+ if (v == value || value.equals(v))
2728
+ return true;
2729
+ }
2730
+ return false;
2731
+ }
2732
+
2733
+ public K findKey(Object value) {
2734
+ if (value == null)
2735
+ throw new NullPointerException();
2736
+ Object v;
2737
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2738
+ while ((v = it.advance()) != null) {
2739
+ if (v == value || value.equals(v))
2740
+ return it.nextKey;
2741
+ }
2742
+ return null;
2743
+ }
2744
+
2745
+ /**
2746
+ * Legacy method testing if some key maps into the specified value
2747
+ * in this table. This method is identical in functionality to
2748
+ * {@link #containsValue}, and exists solely to ensure
2749
+ * full compatibility with class {@link java.util.Hashtable},
2750
+ * which supported this method prior to introduction of the
2751
+ * Java Collections framework.
2752
+ *
2753
+ * @param value a value to search for
2754
+ * @return {@code true} if and only if some key maps to the
2755
+ * {@code value} argument in this table as
2756
+ * determined by the {@code equals} method;
2757
+ * {@code false} otherwise
2758
+ * @throws NullPointerException if the specified value is null
2759
+ */
2760
+ public boolean contains(Object value) {
2761
+ return containsValue(value);
2762
+ }
2763
+
2764
+ /**
2765
+ * Maps the specified key to the specified value in this table.
2766
+ * Neither the key nor the value can be null.
2767
+ *
2768
+ * <p>The value can be retrieved by calling the {@code get} method
2769
+ * with a key that is equal to the original key.
2770
+ *
2771
+ * @param key key with which the specified value is to be associated
2772
+ * @param value value to be associated with the specified key
2773
+ * @return the previous value associated with {@code key}, or
2774
+ * {@code null} if there was no mapping for {@code key}
2775
+ * @throws NullPointerException if the specified key or value is null
2776
+ */
2777
+ @SuppressWarnings("unchecked") public V put(K key, V value) {
2778
+ if (key == null || value == null)
2779
+ throw new NullPointerException();
2780
+ return (V)internalPut(key, value);
2781
+ }
2782
+
2783
+ /**
2784
+ * {@inheritDoc}
2785
+ *
2786
+ * @return the previous value associated with the specified key,
2787
+ * or {@code null} if there was no mapping for the key
2788
+ * @throws NullPointerException if the specified key or value is null
2789
+ */
2790
+ @SuppressWarnings("unchecked") public V putIfAbsent(K key, V value) {
2791
+ if (key == null || value == null)
2792
+ throw new NullPointerException();
2793
+ return (V)internalPutIfAbsent(key, value);
2794
+ }
2795
+
2796
+ /**
2797
+ * Copies all of the mappings from the specified map to this one.
2798
+ * These mappings replace any mappings that this map had for any of the
2799
+ * keys currently in the specified map.
2800
+ *
2801
+ * @param m mappings to be stored in this map
2802
+ */
2803
+ public void putAll(Map<? extends K, ? extends V> m) {
2804
+ internalPutAll(m);
2805
+ }
2806
+
2807
+ /**
2808
+ * If the specified key is not already associated with a value,
2809
+ * computes its value using the given mappingFunction and enters
2810
+ * it into the map unless null. This is equivalent to
2811
+ * <pre> {@code
2812
+ * if (map.containsKey(key))
2813
+ * return map.get(key);
2814
+ * value = mappingFunction.apply(key);
2815
+ * if (value != null)
2816
+ * map.put(key, value);
2817
+ * return value;}</pre>
2818
+ *
2819
+ * except that the action is performed atomically. If the
2820
+ * function returns {@code null} no mapping is recorded. If the
2821
+ * function itself throws an (unchecked) exception, the exception
2822
+ * is rethrown to its caller, and no mapping is recorded. Some
2823
+ * attempted update operations on this map by other threads may be
2824
+ * blocked while computation is in progress, so the computation
2825
+ * should be short and simple, and must not attempt to update any
2826
+ * other mappings of this Map. The most appropriate usage is to
2827
+ * construct a new object serving as an initial mapped value, or
2828
+ * memoized result, as in:
2829
+ *
2830
+ * <pre> {@code
2831
+ * map.computeIfAbsent(key, new Fun<K, V>() {
2832
+ * public V map(K k) { return new Value(f(k)); }});}</pre>
2833
+ *
2834
+ * @param key key with which the specified value is to be associated
2835
+ * @param mappingFunction the function to compute a value
2836
+ * @return the current (existing or computed) value associated with
2837
+ * the specified key, or null if the computed value is null
2838
+ * @throws NullPointerException if the specified key or mappingFunction
2839
+ * is null
2840
+ * @throws IllegalStateException if the computation detectably
2841
+ * attempts a recursive update to this map that would
2842
+ * otherwise never complete
2843
+ * @throws RuntimeException or Error if the mappingFunction does so,
2844
+ * in which case the mapping is left unestablished
2845
+ */
2846
+ @SuppressWarnings("unchecked") public V computeIfAbsent
2847
+ (K key, Fun<? super K, ? extends V> mappingFunction) {
2848
+ if (key == null || mappingFunction == null)
2849
+ throw new NullPointerException();
2850
+ return (V)internalComputeIfAbsent(key, mappingFunction);
2851
+ }
2852
+
2853
+ /**
2854
+ * If the given key is present, computes a new mapping value given a key and
2855
+ * its current mapped value. This is equivalent to
2856
+ * <pre> {@code
2857
+ * if (map.containsKey(key)) {
2858
+ * value = remappingFunction.apply(key, map.get(key));
2859
+ * if (value != null)
2860
+ * map.put(key, value);
2861
+ * else
2862
+ * map.remove(key);
2863
+ * }
2864
+ * }</pre>
2865
+ *
2866
+ * except that the action is performed atomically. If the
2867
+ * function returns {@code null}, the mapping is removed. If the
2868
+ * function itself throws an (unchecked) exception, the exception
2869
+ * is rethrown to its caller, and the current mapping is left
2870
+ * unchanged. Some attempted update operations on this map by
2871
+ * other threads may be blocked while computation is in progress,
2872
+ * so the computation should be short and simple, and must not
2873
+ * attempt to update any other mappings of this Map. For example,
2874
+ * to either create or append new messages to a value mapping:
2875
+ *
2876
+ * @param key key with which the specified value is to be associated
2877
+ * @param remappingFunction the function to compute a value
2878
+ * @return the new value associated with the specified key, or null if none
2879
+ * @throws NullPointerException if the specified key or remappingFunction
2880
+ * is null
2881
+ * @throws IllegalStateException if the computation detectably
2882
+ * attempts a recursive update to this map that would
2883
+ * otherwise never complete
2884
+ * @throws RuntimeException or Error if the remappingFunction does so,
2885
+ * in which case the mapping is unchanged
2886
+ */
2887
+ @SuppressWarnings("unchecked") public V computeIfPresent
2888
+ (K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2889
+ if (key == null || remappingFunction == null)
2890
+ throw new NullPointerException();
2891
+ return (V)internalCompute(key, true, remappingFunction);
2892
+ }
2893
+
2894
+ /**
2895
+ * Computes a new mapping value given a key and
2896
+ * its current mapped value (or {@code null} if there is no current
2897
+ * mapping). This is equivalent to
2898
+ * <pre> {@code
2899
+ * value = remappingFunction.apply(key, map.get(key));
2900
+ * if (value != null)
2901
+ * map.put(key, value);
2902
+ * else
2903
+ * map.remove(key);
2904
+ * }</pre>
2905
+ *
2906
+ * except that the action is performed atomically. If the
2907
+ * function returns {@code null}, the mapping is removed. If the
2908
+ * function itself throws an (unchecked) exception, the exception
2909
+ * is rethrown to its caller, and the current mapping is left
2910
+ * unchanged. Some attempted update operations on this map by
2911
+ * other threads may be blocked while computation is in progress,
2912
+ * so the computation should be short and simple, and must not
2913
+ * attempt to update any other mappings of this Map. For example,
2914
+ * to either create or append new messages to a value mapping:
2915
+ *
2916
+ * <pre> {@code
2917
+ * Map<Key, String> map = ...;
2918
+ * final String msg = ...;
2919
+ * map.compute(key, new BiFun<Key, String, String>() {
2920
+ * public String apply(Key k, String v) {
2921
+ * return (v == null) ? msg : v + msg;});}}</pre>
2922
+ *
2923
+ * @param key key with which the specified value is to be associated
2924
+ * @param remappingFunction the function to compute a value
2925
+ * @return the new value associated with the specified key, or null if none
2926
+ * @throws NullPointerException if the specified key or remappingFunction
2927
+ * is null
2928
+ * @throws IllegalStateException if the computation detectably
2929
+ * attempts a recursive update to this map that would
2930
+ * otherwise never complete
2931
+ * @throws RuntimeException or Error if the remappingFunction does so,
2932
+ * in which case the mapping is unchanged
2933
+ */
2934
+ @SuppressWarnings("unchecked") public V compute
2935
+ (K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2936
+ if (key == null || remappingFunction == null)
2937
+ throw new NullPointerException();
2938
+ return (V)internalCompute(key, false, remappingFunction);
2939
+ }
2940
+
2941
+ /**
2942
+ * If the specified key is not already associated
2943
+ * with a value, associate it with the given value.
2944
+ * Otherwise, replace the value with the results of
2945
+ * the given remapping function. This is equivalent to:
2946
+ * <pre> {@code
2947
+ * if (!map.containsKey(key))
2948
+ * map.put(value);
2949
+ * else {
2950
+ * newValue = remappingFunction.apply(map.get(key), value);
2951
+ * if (value != null)
2952
+ * map.put(key, value);
2953
+ * else
2954
+ * map.remove(key);
2955
+ * }
2956
+ * }</pre>
2957
+ * except that the action is performed atomically. If the
2958
+ * function returns {@code null}, the mapping is removed. If the
2959
+ * function itself throws an (unchecked) exception, the exception
2960
+ * is rethrown to its caller, and the current mapping is left
2961
+ * unchanged. Some attempted update operations on this map by
2962
+ * other threads may be blocked while computation is in progress,
2963
+ * so the computation should be short and simple, and must not
2964
+ * attempt to update any other mappings of this Map.
2965
+ */
2966
+ @SuppressWarnings("unchecked") public V merge
2967
+ (K key, V value, BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2968
+ if (key == null || value == null || remappingFunction == null)
2969
+ throw new NullPointerException();
2970
+ return (V)internalMerge(key, value, remappingFunction);
2971
+ }
2972
+
2973
+ /**
2974
+ * Removes the key (and its corresponding value) from this map.
2975
+ * This method does nothing if the key is not in the map.
2976
+ *
2977
+ * @param key the key that needs to be removed
2978
+ * @return the previous value associated with {@code key}, or
2979
+ * {@code null} if there was no mapping for {@code key}
2980
+ * @throws NullPointerException if the specified key is null
2981
+ */
2982
+ @SuppressWarnings("unchecked") public V remove(Object key) {
2983
+ if (key == null)
2984
+ throw new NullPointerException();
2985
+ return (V)internalReplace(key, null, null);
2986
+ }
2987
+
2988
+ /**
2989
+ * {@inheritDoc}
2990
+ *
2991
+ * @throws NullPointerException if the specified key is null
2992
+ */
2993
+ public boolean remove(Object key, Object value) {
2994
+ if (key == null)
2995
+ throw new NullPointerException();
2996
+ if (value == null)
2997
+ return false;
2998
+ return internalReplace(key, null, value) != null;
2999
+ }
3000
+
3001
+ /**
3002
+ * {@inheritDoc}
3003
+ *
3004
+ * @throws NullPointerException if any of the arguments are null
3005
+ */
3006
+ public boolean replace(K key, V oldValue, V newValue) {
3007
+ if (key == null || oldValue == null || newValue == null)
3008
+ throw new NullPointerException();
3009
+ return internalReplace(key, newValue, oldValue) != null;
3010
+ }
3011
+
3012
+ /**
3013
+ * {@inheritDoc}
3014
+ *
3015
+ * @return the previous value associated with the specified key,
3016
+ * or {@code null} if there was no mapping for the key
3017
+ * @throws NullPointerException if the specified key or value is null
3018
+ */
3019
+ @SuppressWarnings("unchecked") public V replace(K key, V value) {
3020
+ if (key == null || value == null)
3021
+ throw new NullPointerException();
3022
+ return (V)internalReplace(key, value, null);
3023
+ }
3024
+
3025
+ /**
3026
+ * Removes all of the mappings from this map.
3027
+ */
3028
+ public void clear() {
3029
+ internalClear();
3030
+ }
3031
+
3032
+ /**
3033
+ * Returns a {@link Set} view of the keys contained in this map.
3034
+ * The set is backed by the map, so changes to the map are
3035
+ * reflected in the set, and vice-versa.
3036
+ *
3037
+ * @return the set view
3038
+ */
3039
+ public KeySetView<K,V> keySet() {
3040
+ KeySetView<K,V> ks = keySet;
3041
+ return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null));
3042
+ }
3043
+
3044
+ /**
3045
+ * Returns a {@link Set} view of the keys in this map, using the
3046
+ * given common mapped value for any additions (i.e., {@link
3047
+ * Collection#add} and {@link Collection#addAll}). This is of
3048
+ * course only appropriate if it is acceptable to use the same
3049
+ * value for all additions from this view.
3050
+ *
3051
+ * @param mappedValue the mapped value to use for any
3052
+ * additions.
3053
+ * @return the set view
3054
+ * @throws NullPointerException if the mappedValue is null
3055
+ */
3056
+ public KeySetView<K,V> keySet(V mappedValue) {
3057
+ if (mappedValue == null)
3058
+ throw new NullPointerException();
3059
+ return new KeySetView<K,V>(this, mappedValue);
3060
+ }
3061
+
3062
+ /**
3063
+ * Returns a {@link Collection} view of the values contained in this map.
3064
+ * The collection is backed by the map, so changes to the map are
3065
+ * reflected in the collection, and vice-versa.
3066
+ */
3067
+ public ValuesView<K,V> values() {
3068
+ ValuesView<K,V> vs = values;
3069
+ return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
3070
+ }
3071
+
3072
+ /**
3073
+ * Returns a {@link Set} view of the mappings contained in this map.
3074
+ * The set is backed by the map, so changes to the map are
3075
+ * reflected in the set, and vice-versa. The set supports element
3076
+ * removal, which removes the corresponding mapping from the map,
3077
+ * via the {@code Iterator.remove}, {@code Set.remove},
3078
+ * {@code removeAll}, {@code retainAll}, and {@code clear}
3079
+ * operations. It does not support the {@code add} or
3080
+ * {@code addAll} operations.
3081
+ *
3082
+ * <p>The view's {@code iterator} is a "weakly consistent" iterator
3083
+ * that will never throw {@link ConcurrentModificationException},
3084
+ * and guarantees to traverse elements as they existed upon
3085
+ * construction of the iterator, and may (but is not guaranteed to)
3086
+ * reflect any modifications subsequent to construction.
3087
+ */
3088
+ public Set<Map.Entry<K,V>> entrySet() {
3089
+ EntrySetView<K,V> es = entrySet;
3090
+ return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
3091
+ }
3092
+
3093
+ /**
3094
+ * Returns an enumeration of the keys in this table.
3095
+ *
3096
+ * @return an enumeration of the keys in this table
3097
+ * @see #keySet()
3098
+ */
3099
+ public Enumeration<K> keys() {
3100
+ return new KeyIterator<K,V>(this);
3101
+ }
3102
+
3103
+ /**
3104
+ * Returns an enumeration of the values in this table.
3105
+ *
3106
+ * @return an enumeration of the values in this table
3107
+ * @see #values()
3108
+ */
3109
+ public Enumeration<V> elements() {
3110
+ return new ValueIterator<K,V>(this);
3111
+ }
3112
+
3113
+ /**
3114
+ * Returns a partitionable iterator of the keys in this map.
3115
+ *
3116
+ * @return a partitionable iterator of the keys in this map
3117
+ */
3118
+ public Spliterator<K> keySpliterator() {
3119
+ return new KeyIterator<K,V>(this);
3120
+ }
3121
+
3122
+ /**
3123
+ * Returns a partitionable iterator of the values in this map.
3124
+ *
3125
+ * @return a partitionable iterator of the values in this map
3126
+ */
3127
+ public Spliterator<V> valueSpliterator() {
3128
+ return new ValueIterator<K,V>(this);
3129
+ }
3130
+
3131
+ /**
3132
+ * Returns a partitionable iterator of the entries in this map.
3133
+ *
3134
+ * @return a partitionable iterator of the entries in this map
3135
+ */
3136
+ public Spliterator<Map.Entry<K,V>> entrySpliterator() {
3137
+ return new EntryIterator<K,V>(this);
3138
+ }
3139
+
3140
+ /**
3141
+ * Returns the hash code value for this {@link Map}, i.e.,
3142
+ * the sum of, for each key-value pair in the map,
3143
+ * {@code key.hashCode() ^ value.hashCode()}.
3144
+ *
3145
+ * @return the hash code value for this map
3146
+ */
3147
+ public int hashCode() {
3148
+ int h = 0;
3149
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3150
+ Object v;
3151
+ while ((v = it.advance()) != null) {
3152
+ h += it.nextKey.hashCode() ^ v.hashCode();
3153
+ }
3154
+ return h;
3155
+ }
3156
+
3157
+ /**
3158
+ * Returns a string representation of this map. The string
3159
+ * representation consists of a list of key-value mappings (in no
3160
+ * particular order) enclosed in braces ("{@code {}}"). Adjacent
3161
+ * mappings are separated by the characters {@code ", "} (comma
3162
+ * and space). Each key-value mapping is rendered as the key
3163
+ * followed by an equals sign ("{@code =}") followed by the
3164
+ * associated value.
3165
+ *
3166
+ * @return a string representation of this map
3167
+ */
3168
+ public String toString() {
3169
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3170
+ StringBuilder sb = new StringBuilder();
3171
+ sb.append('{');
3172
+ Object v;
3173
+ if ((v = it.advance()) != null) {
3174
+ for (;;) {
3175
+ Object k = it.nextKey;
3176
+ sb.append(k == this ? "(this Map)" : k);
3177
+ sb.append('=');
3178
+ sb.append(v == this ? "(this Map)" : v);
3179
+ if ((v = it.advance()) == null)
3180
+ break;
3181
+ sb.append(',').append(' ');
3182
+ }
3183
+ }
3184
+ return sb.append('}').toString();
3185
+ }
3186
+
3187
+ /**
3188
+ * Compares the specified object with this map for equality.
3189
+ * Returns {@code true} if the given object is a map with the same
3190
+ * mappings as this map. This operation may return misleading
3191
+ * results if either map is concurrently modified during execution
3192
+ * of this method.
3193
+ *
3194
+ * @param o object to be compared for equality with this map
3195
+ * @return {@code true} if the specified object is equal to this map
3196
+ */
3197
+ public boolean equals(Object o) {
3198
+ if (o != this) {
3199
+ if (!(o instanceof Map))
3200
+ return false;
3201
+ Map<?,?> m = (Map<?,?>) o;
3202
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3203
+ Object val;
3204
+ while ((val = it.advance()) != null) {
3205
+ Object v = m.get(it.nextKey);
3206
+ if (v == null || (v != val && !v.equals(val)))
3207
+ return false;
3208
+ }
3209
+ for (Map.Entry<?,?> e : m.entrySet()) {
3210
+ Object mk, mv, v;
3211
+ if ((mk = e.getKey()) == null ||
3212
+ (mv = e.getValue()) == null ||
3213
+ (v = internalGet(mk)) == null ||
3214
+ (mv != v && !mv.equals(v)))
3215
+ return false;
3216
+ }
3217
+ }
3218
+ return true;
3219
+ }
3220
+
3221
+ /* ----------------Iterators -------------- */
3222
+
3223
+ @SuppressWarnings("serial") static final class KeyIterator<K,V> extends Traverser<K,V,Object>
3224
+ implements Spliterator<K>, Enumeration<K> {
3225
+ KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3226
+ KeyIterator(Traverser<K,V,Object> it) {
3227
+ super(it);
3228
+ }
3229
+ public KeyIterator<K,V> split() {
3230
+ if (nextKey != null)
3231
+ throw new IllegalStateException();
3232
+ return new KeyIterator<K,V>(this);
3233
+ }
3234
+ @SuppressWarnings("unchecked") public final K next() {
3235
+ if (nextVal == null && advance() == null)
3236
+ throw new NoSuchElementException();
3237
+ Object k = nextKey;
3238
+ nextVal = null;
3239
+ return (K) k;
3240
+ }
3241
+
3242
+ public final K nextElement() { return next(); }
3243
+ }
3244
+
3245
+ @SuppressWarnings("serial") static final class ValueIterator<K,V> extends Traverser<K,V,Object>
3246
+ implements Spliterator<V>, Enumeration<V> {
3247
+ ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3248
+ ValueIterator(Traverser<K,V,Object> it) {
3249
+ super(it);
3250
+ }
3251
+ public ValueIterator<K,V> split() {
3252
+ if (nextKey != null)
3253
+ throw new IllegalStateException();
3254
+ return new ValueIterator<K,V>(this);
3255
+ }
3256
+
3257
+ @SuppressWarnings("unchecked") public final V next() {
3258
+ Object v;
3259
+ if ((v = nextVal) == null && (v = advance()) == null)
3260
+ throw new NoSuchElementException();
3261
+ nextVal = null;
3262
+ return (V) v;
3263
+ }
3264
+
3265
+ public final V nextElement() { return next(); }
3266
+ }
3267
+
3268
+ @SuppressWarnings("serial") static final class EntryIterator<K,V> extends Traverser<K,V,Object>
3269
+ implements Spliterator<Map.Entry<K,V>> {
3270
+ EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3271
+ EntryIterator(Traverser<K,V,Object> it) {
3272
+ super(it);
3273
+ }
3274
+ public EntryIterator<K,V> split() {
3275
+ if (nextKey != null)
3276
+ throw new IllegalStateException();
3277
+ return new EntryIterator<K,V>(this);
3278
+ }
3279
+
3280
+ @SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
3281
+ Object v;
3282
+ if ((v = nextVal) == null && (v = advance()) == null)
3283
+ throw new NoSuchElementException();
3284
+ Object k = nextKey;
3285
+ nextVal = null;
3286
+ return new MapEntry<K,V>((K)k, (V)v, map);
3287
+ }
3288
+ }
3289
+
3290
+ /**
3291
+ * Exported Entry for iterators
3292
+ */
3293
+ static final class MapEntry<K,V> implements Map.Entry<K, V> {
3294
+ final K key; // non-null
3295
+ V val; // non-null
3296
+ final ConcurrentHashMapV8<K, V> map;
3297
+ MapEntry(K key, V val, ConcurrentHashMapV8<K, V> map) {
3298
+ this.key = key;
3299
+ this.val = val;
3300
+ this.map = map;
3301
+ }
3302
+ public final K getKey() { return key; }
3303
+ public final V getValue() { return val; }
3304
+ public final int hashCode() { return key.hashCode() ^ val.hashCode(); }
3305
+ public final String toString(){ return key + "=" + val; }
3306
+
3307
+ public final boolean equals(Object o) {
3308
+ Object k, v; Map.Entry<?,?> e;
3309
+ return ((o instanceof Map.Entry) &&
3310
+ (k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3311
+ (v = e.getValue()) != null &&
3312
+ (k == key || k.equals(key)) &&
3313
+ (v == val || v.equals(val)));
3314
+ }
3315
+
3316
+ /**
3317
+ * Sets our entry's value and writes through to the map. The
3318
+ * value to return is somewhat arbitrary here. Since we do not
3319
+ * necessarily track asynchronous changes, the most recent
3320
+ * "previous" value could be different from what we return (or
3321
+ * could even have been removed in which case the put will
3322
+ * re-establish). We do not and cannot guarantee more.
3323
+ */
3324
+ public final V setValue(V value) {
3325
+ if (value == null) throw new NullPointerException();
3326
+ V v = val;
3327
+ val = value;
3328
+ map.put(key, value);
3329
+ return v;
3330
+ }
3331
+ }
3332
+
3333
+ /* ---------------- Serialization Support -------------- */
3334
+
3335
+ /**
3336
+ * Stripped-down version of helper class used in previous version,
3337
+ * declared for the sake of serialization compatibility
3338
+ */
3339
+ static class Segment<K,V> implements Serializable {
3340
+ private static final long serialVersionUID = 2249069246763182397L;
3341
+ final float loadFactor;
3342
+ Segment(float lf) { this.loadFactor = lf; }
3343
+ }
3344
+
3345
+ /**
3346
+ * Saves the state of the {@code ConcurrentHashMapV8} instance to a
3347
+ * stream (i.e., serializes it).
3348
+ * @param s the stream
3349
+ * @serialData
3350
+ * the key (Object) and value (Object)
3351
+ * for each key-value mapping, followed by a null pair.
3352
+ * The key-value mappings are emitted in no particular order.
3353
+ */
3354
+ @SuppressWarnings("unchecked") private void writeObject(java.io.ObjectOutputStream s)
3355
+ throws java.io.IOException {
3356
+ if (segments == null) { // for serialization compatibility
3357
+ segments = (Segment<K,V>[])
3358
+ new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
3359
+ for (int i = 0; i < segments.length; ++i)
3360
+ segments[i] = new Segment<K,V>(LOAD_FACTOR);
3361
+ }
3362
+ s.defaultWriteObject();
3363
+ Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3364
+ Object v;
3365
+ while ((v = it.advance()) != null) {
3366
+ s.writeObject(it.nextKey);
3367
+ s.writeObject(v);
3368
+ }
3369
+ s.writeObject(null);
3370
+ s.writeObject(null);
3371
+ segments = null; // throw away
3372
+ }
3373
+
3374
+ /**
3375
+ * Reconstitutes the instance from a stream (that is, deserializes it).
3376
+ * @param s the stream
3377
+ */
3378
+ @SuppressWarnings("unchecked") private void readObject(java.io.ObjectInputStream s)
3379
+ throws java.io.IOException, ClassNotFoundException {
3380
+ s.defaultReadObject();
3381
+ this.segments = null; // unneeded
3382
+ // initialize transient final field
3383
+ UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
3384
+
3385
+ // Create all nodes, then place in table once size is known
3386
+ long size = 0L;
3387
+ Node p = null;
3388
+ for (;;) {
3389
+ K k = (K) s.readObject();
3390
+ V v = (V) s.readObject();
3391
+ if (k != null && v != null) {
3392
+ int h = spread(k.hashCode());
3393
+ p = new Node(h, k, v, p);
3394
+ ++size;
3395
+ }
3396
+ else
3397
+ break;
3398
+ }
3399
+ if (p != null) {
3400
+ boolean init = false;
3401
+ int n;
3402
+ if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
3403
+ n = MAXIMUM_CAPACITY;
3404
+ else {
3405
+ int sz = (int)size;
3406
+ n = tableSizeFor(sz + (sz >>> 1) + 1);
3407
+ }
3408
+ int sc = sizeCtl;
3409
+ boolean collide = false;
3410
+ if (n > sc &&
3411
+ UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
3412
+ try {
3413
+ if (table == null) {
3414
+ init = true;
3415
+ Node[] tab = new Node[n];
3416
+ int mask = n - 1;
3417
+ while (p != null) {
3418
+ int j = p.hash & mask;
3419
+ Node next = p.next;
3420
+ Node q = p.next = tabAt(tab, j);
3421
+ setTabAt(tab, j, p);
3422
+ if (!collide && q != null && q.hash == p.hash)
3423
+ collide = true;
3424
+ p = next;
3425
+ }
3426
+ table = tab;
3427
+ counter.add(size);
3428
+ sc = n - (n >>> 2);
3429
+ }
3430
+ } finally {
3431
+ sizeCtl = sc;
3432
+ }
3433
+ if (collide) { // rescan and convert to TreeBins
3434
+ Node[] tab = table;
3435
+ for (int i = 0; i < tab.length; ++i) {
3436
+ int c = 0;
3437
+ for (Node e = tabAt(tab, i); e != null; e = e.next) {
3438
+ if (++c > TREE_THRESHOLD &&
3439
+ (e.key instanceof Comparable)) {
3440
+ replaceWithTreeBin(tab, i, e.key);
3441
+ break;
3442
+ }
3443
+ }
3444
+ }
3445
+ }
3446
+ }
3447
+ if (!init) { // Can only happen if unsafely published.
3448
+ while (p != null) {
3449
+ internalPut(p.key, p.val);
3450
+ p = p.next;
3451
+ }
3452
+ }
3453
+ }
3454
+ }
3455
+
3456
+
3457
+ // -------------------------------------------------------
3458
+
3459
+ // Sams
3460
+ /** Interface describing a void action of one argument */
3461
+ public interface Action<A> { void apply(A a); }
3462
+ /** Interface describing a void action of two arguments */
3463
+ public interface BiAction<A,B> { void apply(A a, B b); }
3464
+ /** Interface describing a function of one argument */
3465
+ public interface Generator<T> { T apply(); }
3466
+ /** Interface describing a function mapping its argument to a double */
3467
+ public interface ObjectToDouble<A> { double apply(A a); }
3468
+ /** Interface describing a function mapping its argument to a long */
3469
+ public interface ObjectToLong<A> { long apply(A a); }
3470
+ /** Interface describing a function mapping its argument to an int */
3471
+ public interface ObjectToInt<A> {int apply(A a); }
3472
+ /** Interface describing a function mapping two arguments to a double */
3473
+ public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
3474
+ /** Interface describing a function mapping two arguments to a long */
3475
+ public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
3476
+ /** Interface describing a function mapping two arguments to an int */
3477
+ public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
3478
+ /** Interface describing a function mapping a double to a double */
3479
+ public interface DoubleToDouble { double apply(double a); }
3480
+ /** Interface describing a function mapping a long to a long */
3481
+ public interface LongToLong { long apply(long a); }
3482
+ /** Interface describing a function mapping an int to an int */
3483
+ public interface IntToInt { int apply(int a); }
3484
+ /** Interface describing a function mapping two doubles to a double */
3485
+ public interface DoubleByDoubleToDouble { double apply(double a, double b); }
3486
+ /** Interface describing a function mapping two longs to a long */
3487
+ public interface LongByLongToLong { long apply(long a, long b); }
3488
+ /** Interface describing a function mapping two ints to an int */
3489
+ public interface IntByIntToInt { int apply(int a, int b); }
3490
+
3491
+
3492
+ /* ----------------Views -------------- */
3493
+
3494
+ /**
3495
+ * Base class for views.
3496
+ */
3497
+ static abstract class CHMView<K, V> {
3498
+ final ConcurrentHashMapV8<K, V> map;
3499
+ CHMView(ConcurrentHashMapV8<K, V> map) { this.map = map; }
3500
+
3501
+ /**
3502
+ * Returns the map backing this view.
3503
+ *
3504
+ * @return the map backing this view
3505
+ */
3506
+ public ConcurrentHashMapV8<K,V> getMap() { return map; }
3507
+
3508
+ public final int size() { return map.size(); }
3509
+ public final boolean isEmpty() { return map.isEmpty(); }
3510
+ public final void clear() { map.clear(); }
3511
+
3512
+ // implementations below rely on concrete classes supplying these
3513
+ abstract public Iterator<?> iterator();
3514
+ abstract public boolean contains(Object o);
3515
+ abstract public boolean remove(Object o);
3516
+
3517
+ private static final String oomeMsg = "Required array size too large";
3518
+
3519
+ public final Object[] toArray() {
3520
+ long sz = map.mappingCount();
3521
+ if (sz > (long)(MAX_ARRAY_SIZE))
3522
+ throw new OutOfMemoryError(oomeMsg);
3523
+ int n = (int)sz;
3524
+ Object[] r = new Object[n];
3525
+ int i = 0;
3526
+ Iterator<?> it = iterator();
3527
+ while (it.hasNext()) {
3528
+ if (i == n) {
3529
+ if (n >= MAX_ARRAY_SIZE)
3530
+ throw new OutOfMemoryError(oomeMsg);
3531
+ if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3532
+ n = MAX_ARRAY_SIZE;
3533
+ else
3534
+ n += (n >>> 1) + 1;
3535
+ r = Arrays.copyOf(r, n);
3536
+ }
3537
+ r[i++] = it.next();
3538
+ }
3539
+ return (i == n) ? r : Arrays.copyOf(r, i);
3540
+ }
3541
+
3542
+ @SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
3543
+ long sz = map.mappingCount();
3544
+ if (sz > (long)(MAX_ARRAY_SIZE))
3545
+ throw new OutOfMemoryError(oomeMsg);
3546
+ int m = (int)sz;
3547
+ T[] r = (a.length >= m) ? a :
3548
+ (T[])java.lang.reflect.Array
3549
+ .newInstance(a.getClass().getComponentType(), m);
3550
+ int n = r.length;
3551
+ int i = 0;
3552
+ Iterator<?> it = iterator();
3553
+ while (it.hasNext()) {
3554
+ if (i == n) {
3555
+ if (n >= MAX_ARRAY_SIZE)
3556
+ throw new OutOfMemoryError(oomeMsg);
3557
+ if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3558
+ n = MAX_ARRAY_SIZE;
3559
+ else
3560
+ n += (n >>> 1) + 1;
3561
+ r = Arrays.copyOf(r, n);
3562
+ }
3563
+ r[i++] = (T)it.next();
3564
+ }
3565
+ if (a == r && i < n) {
3566
+ r[i] = null; // null-terminate
3567
+ return r;
3568
+ }
3569
+ return (i == n) ? r : Arrays.copyOf(r, i);
3570
+ }
3571
+
3572
+ public final int hashCode() {
3573
+ int h = 0;
3574
+ for (Iterator<?> it = iterator(); it.hasNext();)
3575
+ h += it.next().hashCode();
3576
+ return h;
3577
+ }
3578
+
3579
+ public final String toString() {
3580
+ StringBuilder sb = new StringBuilder();
3581
+ sb.append('[');
3582
+ Iterator<?> it = iterator();
3583
+ if (it.hasNext()) {
3584
+ for (;;) {
3585
+ Object e = it.next();
3586
+ sb.append(e == this ? "(this Collection)" : e);
3587
+ if (!it.hasNext())
3588
+ break;
3589
+ sb.append(',').append(' ');
3590
+ }
3591
+ }
3592
+ return sb.append(']').toString();
3593
+ }
3594
+
3595
+ public final boolean containsAll(Collection<?> c) {
3596
+ if (c != this) {
3597
+ for (Iterator<?> it = c.iterator(); it.hasNext();) {
3598
+ Object e = it.next();
3599
+ if (e == null || !contains(e))
3600
+ return false;
3601
+ }
3602
+ }
3603
+ return true;
3604
+ }
3605
+
3606
+ public final boolean removeAll(Collection<?> c) {
3607
+ boolean modified = false;
3608
+ for (Iterator<?> it = iterator(); it.hasNext();) {
3609
+ if (c.contains(it.next())) {
3610
+ it.remove();
3611
+ modified = true;
3612
+ }
3613
+ }
3614
+ return modified;
3615
+ }
3616
+
3617
+ public final boolean retainAll(Collection<?> c) {
3618
+ boolean modified = false;
3619
+ for (Iterator<?> it = iterator(); it.hasNext();) {
3620
+ if (!c.contains(it.next())) {
3621
+ it.remove();
3622
+ modified = true;
3623
+ }
3624
+ }
3625
+ return modified;
3626
+ }
3627
+
3628
+ }
3629
+
3630
+ /**
3631
+ * A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
3632
+ * which additions may optionally be enabled by mapping to a
3633
+ * common value. This class cannot be directly instantiated. See
3634
+ * {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
3635
+ * {@link #newKeySet(int)}.
3636
+ */
3637
+ public static class KeySetView<K,V> extends CHMView<K,V> implements Set<K>, java.io.Serializable {
3638
+ private static final long serialVersionUID = 7249069246763182397L;
3639
+ private final V value;
3640
+ KeySetView(ConcurrentHashMapV8<K, V> map, V value) { // non-public
3641
+ super(map);
3642
+ this.value = value;
3643
+ }
3644
+
3645
+ /**
3646
+ * Returns the default mapped value for additions,
3647
+ * or {@code null} if additions are not supported.
3648
+ *
3649
+ * @return the default mapped value for additions, or {@code null}
3650
+ * if not supported.
3651
+ */
3652
+ public V getMappedValue() { return value; }
3653
+
3654
+ // implement Set API
3655
+
3656
+ public boolean contains(Object o) { return map.containsKey(o); }
3657
+ public boolean remove(Object o) { return map.remove(o) != null; }
3658
+
3659
+ /**
3660
+ * Returns a "weakly consistent" iterator that will never
3661
+ * throw {@link ConcurrentModificationException}, and
3662
+ * guarantees to traverse elements as they existed upon
3663
+ * construction of the iterator, and may (but is not
3664
+ * guaranteed to) reflect any modifications subsequent to
3665
+ * construction.
3666
+ *
3667
+ * @return an iterator over the keys of this map
3668
+ */
3669
+ public Iterator<K> iterator() { return new KeyIterator<K,V>(map); }
3670
+ public boolean add(K e) {
3671
+ V v;
3672
+ if ((v = value) == null)
3673
+ throw new UnsupportedOperationException();
3674
+ if (e == null)
3675
+ throw new NullPointerException();
3676
+ return map.internalPutIfAbsent(e, v) == null;
3677
+ }
3678
+ public boolean addAll(Collection<? extends K> c) {
3679
+ boolean added = false;
3680
+ V v;
3681
+ if ((v = value) == null)
3682
+ throw new UnsupportedOperationException();
3683
+ for (K e : c) {
3684
+ if (e == null)
3685
+ throw new NullPointerException();
3686
+ if (map.internalPutIfAbsent(e, v) == null)
3687
+ added = true;
3688
+ }
3689
+ return added;
3690
+ }
3691
+ public boolean equals(Object o) {
3692
+ Set<?> c;
3693
+ return ((o instanceof Set) &&
3694
+ ((c = (Set<?>)o) == this ||
3695
+ (containsAll(c) && c.containsAll(this))));
3696
+ }
3697
+ }
3698
+
3699
+ /**
3700
+ * A view of a ConcurrentHashMapV8 as a {@link Collection} of
3701
+ * values, in which additions are disabled. This class cannot be
3702
+ * directly instantiated. See {@link #values},
3703
+ *
3704
+ * <p>The view's {@code iterator} is a "weakly consistent" iterator
3705
+ * that will never throw {@link ConcurrentModificationException},
3706
+ * and guarantees to traverse elements as they existed upon
3707
+ * construction of the iterator, and may (but is not guaranteed to)
3708
+ * reflect any modifications subsequent to construction.
3709
+ */
3710
+ public static final class ValuesView<K,V> extends CHMView<K,V>
3711
+ implements Collection<V> {
3712
+ ValuesView(ConcurrentHashMapV8<K, V> map) { super(map); }
3713
+ public final boolean contains(Object o) { return map.containsValue(o); }
3714
+ public final boolean remove(Object o) {
3715
+ if (o != null) {
3716
+ Iterator<V> it = new ValueIterator<K,V>(map);
3717
+ while (it.hasNext()) {
3718
+ if (o.equals(it.next())) {
3719
+ it.remove();
3720
+ return true;
3721
+ }
3722
+ }
3723
+ }
3724
+ return false;
3725
+ }
3726
+
3727
+ /**
3728
+ * Returns a "weakly consistent" iterator that will never
3729
+ * throw {@link ConcurrentModificationException}, and
3730
+ * guarantees to traverse elements as they existed upon
3731
+ * construction of the iterator, and may (but is not
3732
+ * guaranteed to) reflect any modifications subsequent to
3733
+ * construction.
3734
+ *
3735
+ * @return an iterator over the values of this map
3736
+ */
3737
+ public final Iterator<V> iterator() {
3738
+ return new ValueIterator<K,V>(map);
3739
+ }
3740
+ public final boolean add(V e) {
3741
+ throw new UnsupportedOperationException();
3742
+ }
3743
+ public final boolean addAll(Collection<? extends V> c) {
3744
+ throw new UnsupportedOperationException();
3745
+ }
3746
+ }
3747
+
3748
+ /**
3749
+ * A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value)
3750
+ * entries. This class cannot be directly instantiated. See
3751
+ * {@link #entrySet}.
3752
+ */
3753
+ public static final class EntrySetView<K,V> extends CHMView<K,V>
3754
+ implements Set<Map.Entry<K,V>> {
3755
+ EntrySetView(ConcurrentHashMapV8<K, V> map) { super(map); }
3756
+ public final boolean contains(Object o) {
3757
+ Object k, v, r; Map.Entry<?,?> e;
3758
+ return ((o instanceof Map.Entry) &&
3759
+ (k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3760
+ (r = map.get(k)) != null &&
3761
+ (v = e.getValue()) != null &&
3762
+ (v == r || v.equals(r)));
3763
+ }
3764
+ public final boolean remove(Object o) {
3765
+ Object k, v; Map.Entry<?,?> e;
3766
+ return ((o instanceof Map.Entry) &&
3767
+ (k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3768
+ (v = e.getValue()) != null &&
3769
+ map.remove(k, v));
3770
+ }
3771
+
3772
+ /**
3773
+ * Returns a "weakly consistent" iterator that will never
3774
+ * throw {@link ConcurrentModificationException}, and
3775
+ * guarantees to traverse elements as they existed upon
3776
+ * construction of the iterator, and may (but is not
3777
+ * guaranteed to) reflect any modifications subsequent to
3778
+ * construction.
3779
+ *
3780
+ * @return an iterator over the entries of this map
3781
+ */
3782
+ public final Iterator<Map.Entry<K,V>> iterator() {
3783
+ return new EntryIterator<K,V>(map);
3784
+ }
3785
+
3786
+ public final boolean add(Entry<K,V> e) {
3787
+ K key = e.getKey();
3788
+ V value = e.getValue();
3789
+ if (key == null || value == null)
3790
+ throw new NullPointerException();
3791
+ return map.internalPut(key, value) == null;
3792
+ }
3793
+ public final boolean addAll(Collection<? extends Entry<K,V>> c) {
3794
+ boolean added = false;
3795
+ for (Entry<K,V> e : c) {
3796
+ if (add(e))
3797
+ added = true;
3798
+ }
3799
+ return added;
3800
+ }
3801
+ public boolean equals(Object o) {
3802
+ Set<?> c;
3803
+ return ((o instanceof Set) &&
3804
+ ((c = (Set<?>)o) == this ||
3805
+ (containsAll(c) && c.containsAll(this))));
3806
+ }
3807
+ }
3808
+
3809
+ // Unsafe mechanics
3810
+ private static final sun.misc.Unsafe UNSAFE;
3811
+ private static final long counterOffset;
3812
+ private static final long sizeCtlOffset;
3813
+ private static final long ABASE;
3814
+ private static final int ASHIFT;
3815
+
3816
+ static {
3817
+ int ss;
3818
+ try {
3819
+ UNSAFE = getUnsafe();
3820
+ Class<?> k = ConcurrentHashMapV8.class;
3821
+ counterOffset = UNSAFE.objectFieldOffset
3822
+ (k.getDeclaredField("counter"));
3823
+ sizeCtlOffset = UNSAFE.objectFieldOffset
3824
+ (k.getDeclaredField("sizeCtl"));
3825
+ Class<?> sc = Node[].class;
3826
+ ABASE = UNSAFE.arrayBaseOffset(sc);
3827
+ ss = UNSAFE.arrayIndexScale(sc);
3828
+ } catch (Exception e) {
3829
+ throw new Error(e);
3830
+ }
3831
+ if ((ss & (ss-1)) != 0)
3832
+ throw new Error("data type scale not a power of two");
3833
+ ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
3834
+ }
3835
+
3836
+ /**
3837
+ * Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package.
3838
+ * Replace with a simple call to Unsafe.getUnsafe when integrating
3839
+ * into a jdk.
3840
+ *
3841
+ * @return a sun.misc.Unsafe
3842
+ */
3843
+ private static sun.misc.Unsafe getUnsafe() {
3844
+ try {
3845
+ return sun.misc.Unsafe.getUnsafe();
3846
+ } catch (SecurityException se) {
3847
+ try {
3848
+ return java.security.AccessController.doPrivileged
3849
+ (new java.security
3850
+ .PrivilegedExceptionAction<sun.misc.Unsafe>() {
3851
+ public sun.misc.Unsafe run() throws Exception {
3852
+ java.lang.reflect.Field f = sun.misc
3853
+ .Unsafe.class.getDeclaredField("theUnsafe");
3854
+ f.setAccessible(true);
3855
+ return (sun.misc.Unsafe) f.get(null);
3856
+ }});
3857
+ } catch (java.security.PrivilegedActionException e) {
3858
+ throw new RuntimeException("Could not initialize intrinsics",
3859
+ e.getCause());
3860
+ }
3861
+ }
3862
+ }
3863
+ }