lazy_record 0.2.1 → 0.2.2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (1338) hide show
  1. checksums.yaml +4 -4
  2. data/.gitignore +2 -1
  3. data/lazy_record.gemspec +6 -5
  4. data/lib/lazy_record/associations.rb +19 -15
  5. data/lib/lazy_record/base_module.rb +8 -10
  6. data/lib/lazy_record/relation.rb +15 -8
  7. data/lib/lazy_record/version.rb +1 -1
  8. metadata +2 -1332
  9. data/example/cat.rb +0 -5
  10. data/example/dog.rb +0 -12
  11. data/example/friend.rb +0 -5
  12. data/example/person.rb +0 -84
  13. data/vendor/bundle/bin/coderay +0 -22
  14. data/vendor/bundle/bin/htmldiff +0 -24
  15. data/vendor/bundle/bin/ldiff +0 -24
  16. data/vendor/bundle/bin/pry +0 -22
  17. data/vendor/bundle/bin/rake +0 -22
  18. data/vendor/bundle/bin/rspec +0 -22
  19. data/vendor/bundle/cache/activesupport-5.0.2.gem +0 -0
  20. data/vendor/bundle/cache/coderay-1.1.1.gem +0 -0
  21. data/vendor/bundle/cache/concurrent-ruby-1.0.5.gem +0 -0
  22. data/vendor/bundle/cache/diff-lcs-1.3.gem +0 -0
  23. data/vendor/bundle/cache/i18n-0.8.1.gem +0 -0
  24. data/vendor/bundle/cache/method_source-0.8.2.gem +0 -0
  25. data/vendor/bundle/cache/minitest-5.10.1.gem +0 -0
  26. data/vendor/bundle/cache/pry-0.10.4.gem +0 -0
  27. data/vendor/bundle/cache/rake-10.5.0.gem +0 -0
  28. data/vendor/bundle/cache/rspec-3.5.0.gem +0 -0
  29. data/vendor/bundle/cache/rspec-core-3.5.4.gem +0 -0
  30. data/vendor/bundle/cache/rspec-expectations-3.5.0.gem +0 -0
  31. data/vendor/bundle/cache/rspec-mocks-3.5.0.gem +0 -0
  32. data/vendor/bundle/cache/rspec-support-3.5.0.gem +0 -0
  33. data/vendor/bundle/cache/slop-3.6.0.gem +0 -0
  34. data/vendor/bundle/cache/thread_safe-0.3.6.gem +0 -0
  35. data/vendor/bundle/cache/tzinfo-1.2.2.gem +0 -0
  36. data/vendor/bundle/gems/activesupport-5.0.2/CHANGELOG.md +0 -922
  37. data/vendor/bundle/gems/activesupport-5.0.2/MIT-LICENSE +0 -20
  38. data/vendor/bundle/gems/activesupport-5.0.2/README.rdoc +0 -39
  39. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support.rb +0 -99
  40. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/all.rb +0 -3
  41. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/array_inquirer.rb +0 -44
  42. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/backtrace_cleaner.rb +0 -103
  43. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/benchmarkable.rb +0 -49
  44. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/builder.rb +0 -6
  45. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache.rb +0 -701
  46. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/file_store.rb +0 -204
  47. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/mem_cache_store.rb +0 -207
  48. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/memory_store.rb +0 -167
  49. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/null_store.rb +0 -41
  50. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/strategy/local_cache.rb +0 -172
  51. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/cache/strategy/local_cache_middleware.rb +0 -44
  52. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/callbacks.rb +0 -791
  53. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/concern.rb +0 -142
  54. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/concurrency/latch.rb +0 -26
  55. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/concurrency/share_lock.rb +0 -226
  56. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/configurable.rb +0 -148
  57. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext.rb +0 -4
  58. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array.rb +0 -7
  59. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/access.rb +0 -90
  60. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/conversions.rb +0 -211
  61. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/extract_options.rb +0 -29
  62. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/grouping.rb +0 -107
  63. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/inquiry.rb +0 -17
  64. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/prepend_and_append.rb +0 -7
  65. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/array/wrap.rb +0 -46
  66. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/benchmark.rb +0 -14
  67. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/big_decimal.rb +0 -1
  68. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/big_decimal/conversions.rb +0 -14
  69. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/class.rb +0 -2
  70. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/class/attribute.rb +0 -128
  71. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/class/attribute_accessors.rb +0 -4
  72. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/class/subclasses.rb +0 -41
  73. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date.rb +0 -5
  74. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date/acts_like.rb +0 -8
  75. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date/blank.rb +0 -12
  76. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date/calculations.rb +0 -143
  77. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date/conversions.rb +0 -95
  78. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date/zones.rb +0 -6
  79. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_and_time/calculations.rb +0 -335
  80. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_and_time/compatibility.rb +0 -22
  81. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_and_time/zones.rb +0 -40
  82. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time.rb +0 -5
  83. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time/acts_like.rb +0 -14
  84. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time/blank.rb +0 -12
  85. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time/calculations.rb +0 -199
  86. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time/compatibility.rb +0 -5
  87. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/date_time/conversions.rb +0 -105
  88. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/digest/uuid.rb +0 -51
  89. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/enumerable.rb +0 -124
  90. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/file.rb +0 -1
  91. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/file/atomic.rb +0 -68
  92. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash.rb +0 -9
  93. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/compact.rb +0 -24
  94. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/conversions.rb +0 -262
  95. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/deep_merge.rb +0 -38
  96. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/except.rb +0 -22
  97. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/indifferent_access.rb +0 -23
  98. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/keys.rb +0 -170
  99. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/reverse_merge.rb +0 -22
  100. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/slice.rb +0 -48
  101. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/hash/transform_values.rb +0 -29
  102. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/integer.rb +0 -3
  103. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/integer/inflections.rb +0 -29
  104. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/integer/multiple.rb +0 -10
  105. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/integer/time.rb +0 -29
  106. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel.rb +0 -4
  107. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel/agnostics.rb +0 -11
  108. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel/concern.rb +0 -12
  109. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel/debugger.rb +0 -3
  110. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel/reporting.rb +0 -43
  111. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/kernel/singleton_class.rb +0 -6
  112. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/load_error.rb +0 -31
  113. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/marshal.rb +0 -22
  114. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module.rb +0 -12
  115. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/aliasing.rb +0 -74
  116. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/anonymous.rb +0 -28
  117. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/attr_internal.rb +0 -36
  118. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/attribute_accessors.rb +0 -212
  119. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/attribute_accessors_per_thread.rb +0 -141
  120. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/concerning.rb +0 -135
  121. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/delegation.rb +0 -216
  122. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/deprecation.rb +0 -23
  123. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/introspection.rb +0 -68
  124. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/method_transplanting.rb +0 -3
  125. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/qualified_const.rb +0 -70
  126. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/reachable.rb +0 -8
  127. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/module/remove_method.rb +0 -35
  128. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/name_error.rb +0 -31
  129. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/numeric.rb +0 -4
  130. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/numeric/bytes.rb +0 -64
  131. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/numeric/conversions.rb +0 -144
  132. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/numeric/inquiry.rb +0 -26
  133. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/numeric/time.rb +0 -74
  134. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object.rb +0 -14
  135. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/acts_like.rb +0 -10
  136. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/blank.rb +0 -143
  137. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/conversions.rb +0 -4
  138. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/deep_dup.rb +0 -53
  139. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/duplicable.rb +0 -124
  140. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/inclusion.rb +0 -27
  141. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/instance_variables.rb +0 -28
  142. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/json.rb +0 -205
  143. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/to_param.rb +0 -1
  144. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/to_query.rb +0 -84
  145. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/try.rb +0 -146
  146. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/object/with_options.rb +0 -69
  147. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/range.rb +0 -4
  148. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/range/conversions.rb +0 -31
  149. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/range/each.rb +0 -21
  150. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/range/include_range.rb +0 -23
  151. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/range/overlaps.rb +0 -8
  152. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/regexp.rb +0 -5
  153. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/securerandom.rb +0 -23
  154. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string.rb +0 -13
  155. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/access.rb +0 -104
  156. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/behavior.rb +0 -6
  157. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/conversions.rb +0 -57
  158. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/exclude.rb +0 -11
  159. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/filters.rb +0 -102
  160. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/indent.rb +0 -43
  161. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/inflections.rb +0 -244
  162. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/inquiry.rb +0 -13
  163. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/multibyte.rb +0 -53
  164. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/output_safety.rb +0 -260
  165. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/starts_ends_with.rb +0 -4
  166. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/strip.rb +0 -23
  167. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/string/zones.rb +0 -14
  168. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/struct.rb +0 -3
  169. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time.rb +0 -5
  170. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/acts_like.rb +0 -8
  171. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/calculations.rb +0 -290
  172. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/compatibility.rb +0 -5
  173. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/conversions.rb +0 -67
  174. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/marshal.rb +0 -3
  175. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/time/zones.rb +0 -111
  176. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/core_ext/uri.rb +0 -24
  177. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/dependencies.rb +0 -754
  178. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/dependencies/autoload.rb +0 -77
  179. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/dependencies/interlock.rb +0 -55
  180. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation.rb +0 -43
  181. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation/behaviors.rb +0 -90
  182. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation/instance_delegator.rb +0 -37
  183. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation/method_wrappers.rb +0 -70
  184. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation/proxy_wrappers.rb +0 -149
  185. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/deprecation/reporting.rb +0 -112
  186. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/descendants_tracker.rb +0 -60
  187. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/duration.rb +0 -182
  188. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/duration/iso8601_parser.rb +0 -122
  189. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/duration/iso8601_serializer.rb +0 -51
  190. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/evented_file_update_checker.rb +0 -194
  191. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/execution_wrapper.rb +0 -126
  192. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/executor.rb +0 -6
  193. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/file_update_checker.rb +0 -157
  194. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/gem_version.rb +0 -15
  195. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/gzip.rb +0 -36
  196. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/hash_with_indifferent_access.rb +0 -329
  197. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/i18n.rb +0 -13
  198. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/i18n_railtie.rb +0 -115
  199. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/inflections.rb +0 -70
  200. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/inflector.rb +0 -7
  201. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/inflector/inflections.rb +0 -242
  202. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/inflector/methods.rb +0 -390
  203. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/inflector/transliterate.rb +0 -112
  204. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/json.rb +0 -2
  205. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/json/decoding.rb +0 -74
  206. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/json/encoding.rb +0 -127
  207. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/key_generator.rb +0 -71
  208. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/lazy_load_hooks.rb +0 -56
  209. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/locale/en.yml +0 -135
  210. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/log_subscriber.rb +0 -109
  211. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/log_subscriber/test_helper.rb +0 -104
  212. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/logger.rb +0 -106
  213. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/logger_silence.rb +0 -28
  214. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/logger_thread_safe_level.rb +0 -31
  215. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/message_encryptor.rb +0 -114
  216. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/message_verifier.rb +0 -134
  217. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/multibyte.rb +0 -21
  218. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/multibyte/chars.rb +0 -231
  219. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/multibyte/unicode.rb +0 -413
  220. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/notifications.rb +0 -212
  221. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/notifications/fanout.rb +0 -157
  222. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/notifications/instrumenter.rb +0 -91
  223. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper.rb +0 -368
  224. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_converter.rb +0 -182
  225. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_currency_converter.rb +0 -44
  226. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_delimited_converter.rb +0 -28
  227. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_human_converter.rb +0 -68
  228. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_human_size_converter.rb +0 -62
  229. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_percentage_converter.rb +0 -12
  230. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_phone_converter.rb +0 -58
  231. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/number_helper/number_to_rounded_converter.rb +0 -92
  232. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/option_merger.rb +0 -25
  233. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/ordered_hash.rb +0 -48
  234. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/ordered_options.rb +0 -81
  235. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/per_thread_registry.rb +0 -58
  236. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/proxy_object.rb +0 -13
  237. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/rails.rb +0 -27
  238. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/railtie.rb +0 -51
  239. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/reloader.rb +0 -129
  240. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/rescuable.rb +0 -167
  241. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/security_utils.rb +0 -27
  242. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/string_inquirer.rb +0 -26
  243. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/subscriber.rb +0 -120
  244. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/tagged_logging.rb +0 -77
  245. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/test_case.rb +0 -88
  246. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/assertions.rb +0 -99
  247. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/autorun.rb +0 -9
  248. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/constant_lookup.rb +0 -50
  249. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/declarative.rb +0 -26
  250. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/deprecation.rb +0 -36
  251. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/file_fixtures.rb +0 -34
  252. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/isolation.rb +0 -115
  253. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/method_call_assertions.rb +0 -41
  254. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/setup_and_teardown.rb +0 -50
  255. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/stream.rb +0 -42
  256. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/tagged_logging.rb +0 -25
  257. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/testing/time_helpers.rb +0 -134
  258. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/time.rb +0 -18
  259. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/time_with_zone.rb +0 -500
  260. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/values/time_zone.rb +0 -474
  261. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/values/unicode_tables.dat +0 -0
  262. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/version.rb +0 -8
  263. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini.rb +0 -209
  264. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/jdom.rb +0 -181
  265. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/libxml.rb +0 -79
  266. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/libxmlsax.rb +0 -85
  267. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/nokogiri.rb +0 -83
  268. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/nokogirisax.rb +0 -87
  269. data/vendor/bundle/gems/activesupport-5.0.2/lib/active_support/xml_mini/rexml.rb +0 -128
  270. data/vendor/bundle/gems/coderay-1.1.1/README_INDEX.rdoc +0 -123
  271. data/vendor/bundle/gems/coderay-1.1.1/Rakefile +0 -37
  272. data/vendor/bundle/gems/coderay-1.1.1/bin/coderay +0 -215
  273. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay.rb +0 -284
  274. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/duo.rb +0 -81
  275. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders.rb +0 -18
  276. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/_map.rb +0 -17
  277. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/comment_filter.rb +0 -25
  278. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/count.rb +0 -39
  279. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/debug.rb +0 -49
  280. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/debug_lint.rb +0 -63
  281. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/div.rb +0 -23
  282. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/encoder.rb +0 -190
  283. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/filter.rb +0 -58
  284. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/html.rb +0 -333
  285. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/html/css.rb +0 -65
  286. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/html/numbering.rb +0 -108
  287. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/html/output.rb +0 -166
  288. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/json.rb +0 -83
  289. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/lines_of_code.rb +0 -45
  290. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/lint.rb +0 -59
  291. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/null.rb +0 -18
  292. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/page.rb +0 -24
  293. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/span.rb +0 -23
  294. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/statistic.rb +0 -95
  295. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/terminal.rb +0 -195
  296. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/text.rb +0 -46
  297. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/token_kind_filter.rb +0 -111
  298. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/xml.rb +0 -72
  299. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/encoders/yaml.rb +0 -50
  300. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/for_redcloth.rb +0 -95
  301. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/helpers/file_type.rb +0 -151
  302. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/helpers/plugin.rb +0 -55
  303. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/helpers/plugin_host.rb +0 -221
  304. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/helpers/word_list.rb +0 -72
  305. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners.rb +0 -27
  306. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/_map.rb +0 -24
  307. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/c.rb +0 -189
  308. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/clojure.rb +0 -217
  309. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/cpp.rb +0 -215
  310. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/css.rb +0 -196
  311. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/debug.rb +0 -75
  312. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/delphi.rb +0 -144
  313. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/diff.rb +0 -221
  314. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/erb.rb +0 -81
  315. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/go.rb +0 -208
  316. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/groovy.rb +0 -268
  317. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/haml.rb +0 -168
  318. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/html.rb +0 -275
  319. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/java.rb +0 -174
  320. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/java/builtin_types.rb +0 -421
  321. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/java_script.rb +0 -237
  322. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/json.rb +0 -98
  323. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/lua.rb +0 -280
  324. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/php.rb +0 -527
  325. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/python.rb +0 -287
  326. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/raydebug.rb +0 -75
  327. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/ruby.rb +0 -477
  328. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/ruby/patterns.rb +0 -178
  329. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/ruby/string_state.rb +0 -79
  330. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/sass.rb +0 -232
  331. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/scanner.rb +0 -337
  332. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/sql.rb +0 -169
  333. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/taskpaper.rb +0 -36
  334. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/text.rb +0 -26
  335. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/xml.rb +0 -17
  336. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/scanners/yaml.rb +0 -140
  337. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/styles.rb +0 -15
  338. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/styles/_map.rb +0 -7
  339. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/styles/alpha.rb +0 -153
  340. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/styles/style.rb +0 -18
  341. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/token_kinds.rb +0 -85
  342. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/tokens.rb +0 -161
  343. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/tokens_proxy.rb +0 -55
  344. data/vendor/bundle/gems/coderay-1.1.1/lib/coderay/version.rb +0 -3
  345. data/vendor/bundle/gems/coderay-1.1.1/test/functional/basic.rb +0 -318
  346. data/vendor/bundle/gems/coderay-1.1.1/test/functional/examples.rb +0 -129
  347. data/vendor/bundle/gems/coderay-1.1.1/test/functional/for_redcloth.rb +0 -78
  348. data/vendor/bundle/gems/coderay-1.1.1/test/functional/suite.rb +0 -15
  349. data/vendor/bundle/gems/concurrent-ruby-1.0.5/CHANGELOG.md +0 -387
  350. data/vendor/bundle/gems/concurrent-ruby-1.0.5/LICENSE.txt +0 -21
  351. data/vendor/bundle/gems/concurrent-ruby-1.0.5/README.md +0 -247
  352. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent.rb +0 -130
  353. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/agent.rb +0 -587
  354. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/array.rb +0 -39
  355. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/async.rb +0 -445
  356. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atom.rb +0 -222
  357. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/abstract_thread_local_var.rb +0 -66
  358. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/atomic_boolean.rb +0 -122
  359. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/atomic_fixnum.rb +0 -139
  360. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/atomic_reference.rb +0 -51
  361. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/count_down_latch.rb +0 -100
  362. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/cyclic_barrier.rb +0 -128
  363. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/event.rb +0 -109
  364. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/java_count_down_latch.rb +0 -39
  365. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/java_thread_local_var.rb +0 -37
  366. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/mutex_atomic_boolean.rb +0 -60
  367. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/mutex_atomic_fixnum.rb +0 -75
  368. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/mutex_count_down_latch.rb +0 -43
  369. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/mutex_semaphore.rb +0 -115
  370. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/read_write_lock.rb +0 -253
  371. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/reentrant_read_write_lock.rb +0 -377
  372. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/ruby_thread_local_var.rb +0 -161
  373. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/semaphore.rb +0 -145
  374. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic/thread_local_var.rb +0 -104
  375. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/concurrent_update_error.rb +0 -8
  376. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/direct_update.rb +0 -81
  377. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/jruby+truffle.rb +0 -2
  378. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/jruby.rb +0 -16
  379. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/mutex_atomic.rb +0 -61
  380. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/numeric_cas_wrapper.rb +0 -28
  381. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/rbx.rb +0 -22
  382. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomic_reference/ruby.rb +0 -32
  383. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/atomics.rb +0 -53
  384. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/copy_on_notify_observer_set.rb +0 -107
  385. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/copy_on_write_observer_set.rb +0 -111
  386. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/java_non_concurrent_priority_queue.rb +0 -84
  387. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/map/atomic_reference_map_backend.rb +0 -927
  388. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/map/mri_map_backend.rb +0 -66
  389. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/map/non_concurrent_map_backend.rb +0 -141
  390. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/map/synchronized_map_backend.rb +0 -82
  391. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/non_concurrent_priority_queue.rb +0 -143
  392. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/collection/ruby_non_concurrent_priority_queue.rb +0 -150
  393. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/concern/deprecation.rb +0 -34
  394. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/concern/dereferenceable.rb +0 -73
  395. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/concern/logging.rb +0 -27
  396. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/concern/obligation.rb +0 -220
  397. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/concern/observable.rb +0 -110
  398. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/configuration.rb +0 -188
  399. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/constants.rb +0 -8
  400. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/dataflow.rb +0 -80
  401. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/delay.rb +0 -197
  402. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/edge.rb +0 -26
  403. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/errors.rb +0 -69
  404. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/exchanger.rb +0 -356
  405. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/abstract_executor_service.rb +0 -134
  406. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/cached_thread_pool.rb +0 -62
  407. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/executor_service.rb +0 -185
  408. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/fixed_thread_pool.rb +0 -206
  409. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/immediate_executor.rb +0 -66
  410. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/indirect_immediate_executor.rb +0 -44
  411. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/java_executor_service.rb +0 -100
  412. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/java_single_thread_executor.rb +0 -29
  413. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/java_thread_pool_executor.rb +0 -120
  414. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/ruby_executor_service.rb +0 -78
  415. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/ruby_single_thread_executor.rb +0 -22
  416. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/ruby_thread_pool_executor.rb +0 -362
  417. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/safe_task_executor.rb +0 -35
  418. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/serial_executor_service.rb +0 -34
  419. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/serialized_execution.rb +0 -107
  420. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/serialized_execution_delegator.rb +0 -28
  421. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/simple_executor_service.rb +0 -100
  422. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/single_thread_executor.rb +0 -56
  423. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/thread_pool_executor.rb +0 -87
  424. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executor/timer_set.rb +0 -175
  425. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/executors.rb +0 -20
  426. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/future.rb +0 -138
  427. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/hash.rb +0 -36
  428. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/immutable_struct.rb +0 -93
  429. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/ivar.rb +0 -208
  430. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/lazy_register.rb +0 -81
  431. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/map.rb +0 -240
  432. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/maybe.rb +0 -229
  433. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/mutable_struct.rb +0 -228
  434. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/mvar.rb +0 -242
  435. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/options.rb +0 -42
  436. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/promise.rb +0 -547
  437. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/scheduled_task.rb +0 -318
  438. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/settable_struct.rb +0 -128
  439. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization.rb +0 -31
  440. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/abstract_lockable_object.rb +0 -98
  441. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/abstract_object.rb +0 -24
  442. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/abstract_struct.rb +0 -157
  443. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/condition.rb +0 -58
  444. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/jruby_lockable_object.rb +0 -13
  445. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/jruby_object.rb +0 -44
  446. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/lock.rb +0 -34
  447. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/lockable_object.rb +0 -74
  448. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/mri_lockable_object.rb +0 -71
  449. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/mri_object.rb +0 -43
  450. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/object.rb +0 -153
  451. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/rbx_lockable_object.rb +0 -65
  452. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/rbx_object.rb +0 -48
  453. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/truffle_lockable_object.rb +0 -9
  454. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/truffle_object.rb +0 -31
  455. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/synchronization/volatile.rb +0 -34
  456. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/synchronized_delegator.rb +0 -50
  457. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util.rb +0 -16
  458. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/adder.rb +0 -74
  459. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/array_hash_rbx.rb +0 -30
  460. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/cheap_lockable.rb +0 -118
  461. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/power_of_two_tuple.rb +0 -38
  462. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/striped64.rb +0 -241
  463. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/volatile.rb +0 -75
  464. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/thread_safe/util/xor_shift_random.rb +0 -50
  465. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/timer_task.rb +0 -331
  466. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/tuple.rb +0 -86
  467. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/tvar.rb +0 -258
  468. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/at_exit.rb +0 -97
  469. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/engine.rb +0 -56
  470. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/monotonic_time.rb +0 -58
  471. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/native_extension_loader.rb +0 -73
  472. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/native_integer.rb +0 -53
  473. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/utility/processor_counter.rb +0 -160
  474. data/vendor/bundle/gems/concurrent-ruby-1.0.5/lib/concurrent/version.rb +0 -4
  475. data/vendor/bundle/gems/diff-lcs-1.3/.rspec +0 -1
  476. data/vendor/bundle/gems/diff-lcs-1.3/Code-of-Conduct.md +0 -74
  477. data/vendor/bundle/gems/diff-lcs-1.3/Contributing.md +0 -83
  478. data/vendor/bundle/gems/diff-lcs-1.3/History.md +0 -220
  479. data/vendor/bundle/gems/diff-lcs-1.3/License.md +0 -39
  480. data/vendor/bundle/gems/diff-lcs-1.3/Manifest.txt +0 -37
  481. data/vendor/bundle/gems/diff-lcs-1.3/README.rdoc +0 -84
  482. data/vendor/bundle/gems/diff-lcs-1.3/Rakefile +0 -57
  483. data/vendor/bundle/gems/diff-lcs-1.3/autotest/discover.rb +0 -1
  484. data/vendor/bundle/gems/diff-lcs-1.3/bin/htmldiff +0 -32
  485. data/vendor/bundle/gems/diff-lcs-1.3/bin/ldiff +0 -6
  486. data/vendor/bundle/gems/diff-lcs-1.3/docs/COPYING.txt +0 -339
  487. data/vendor/bundle/gems/diff-lcs-1.3/docs/artistic.txt +0 -127
  488. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff-lcs.rb +0 -3
  489. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs.rb +0 -725
  490. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/array.rb +0 -7
  491. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/block.rb +0 -37
  492. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/callbacks.rb +0 -322
  493. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/change.rb +0 -181
  494. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/htmldiff.rb +0 -149
  495. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/hunk.rb +0 -276
  496. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/internals.rb +0 -307
  497. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/ldiff.rb +0 -167
  498. data/vendor/bundle/gems/diff-lcs-1.3/lib/diff/lcs/string.rb +0 -5
  499. data/vendor/bundle/gems/diff-lcs-1.3/spec/change_spec.rb +0 -65
  500. data/vendor/bundle/gems/diff-lcs-1.3/spec/diff_spec.rb +0 -47
  501. data/vendor/bundle/gems/diff-lcs-1.3/spec/fixtures/ds1.csv +0 -50
  502. data/vendor/bundle/gems/diff-lcs-1.3/spec/fixtures/ds2.csv +0 -51
  503. data/vendor/bundle/gems/diff-lcs-1.3/spec/hunk_spec.rb +0 -72
  504. data/vendor/bundle/gems/diff-lcs-1.3/spec/issues_spec.rb +0 -49
  505. data/vendor/bundle/gems/diff-lcs-1.3/spec/lcs_spec.rb +0 -56
  506. data/vendor/bundle/gems/diff-lcs-1.3/spec/ldiff_spec.rb +0 -47
  507. data/vendor/bundle/gems/diff-lcs-1.3/spec/patch_spec.rb +0 -422
  508. data/vendor/bundle/gems/diff-lcs-1.3/spec/sdiff_spec.rb +0 -214
  509. data/vendor/bundle/gems/diff-lcs-1.3/spec/spec_helper.rb +0 -321
  510. data/vendor/bundle/gems/diff-lcs-1.3/spec/traverse_balanced_spec.rb +0 -310
  511. data/vendor/bundle/gems/diff-lcs-1.3/spec/traverse_sequences_spec.rb +0 -139
  512. data/vendor/bundle/gems/i18n-0.8.1/MIT-LICENSE +0 -20
  513. data/vendor/bundle/gems/i18n-0.8.1/README.md +0 -84
  514. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-3.2.x +0 -9
  515. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-4.0.x +0 -9
  516. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-4.1.x +0 -9
  517. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-4.2.x +0 -9
  518. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-5.0.x +0 -9
  519. data/vendor/bundle/gems/i18n-0.8.1/gemfiles/Gemfile.rails-master +0 -9
  520. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n.rb +0 -343
  521. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend.rb +0 -18
  522. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/base.rb +0 -230
  523. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/cache.rb +0 -114
  524. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/cascade.rb +0 -54
  525. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/chain.rb +0 -97
  526. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/fallbacks.rb +0 -84
  527. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/flatten.rb +0 -113
  528. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/gettext.rb +0 -81
  529. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/interpolation_compiler.rb +0 -121
  530. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/key_value.rb +0 -100
  531. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/memoize.rb +0 -46
  532. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/metadata.rb +0 -69
  533. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/pluralization.rb +0 -53
  534. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/simple.rb +0 -87
  535. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/backend/transliterator.rb +0 -106
  536. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/config.rb +0 -142
  537. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/core_ext/hash.rb +0 -29
  538. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/core_ext/kernel/suppress_warnings.rb +0 -8
  539. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/core_ext/string/interpolate.rb +0 -9
  540. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/exceptions.rb +0 -104
  541. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/gettext.rb +0 -25
  542. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/gettext/helpers.rb +0 -73
  543. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/gettext/po_parser.rb +0 -329
  544. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/interpolate/ruby.rb +0 -37
  545. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale.rb +0 -6
  546. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale/fallbacks.rb +0 -96
  547. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale/tag.rb +0 -28
  548. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale/tag/parents.rb +0 -22
  549. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale/tag/rfc4646.rb +0 -74
  550. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/locale/tag/simple.rb +0 -39
  551. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests.rb +0 -12
  552. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/basics.rb +0 -60
  553. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/defaults.rb +0 -48
  554. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/interpolation.rb +0 -153
  555. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/link.rb +0 -56
  556. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/localization.rb +0 -19
  557. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/localization/date.rb +0 -95
  558. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/localization/date_time.rb +0 -82
  559. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/localization/procs.rb +0 -116
  560. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/localization/time.rb +0 -81
  561. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/lookup.rb +0 -81
  562. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/pluralization.rb +0 -35
  563. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/tests/procs.rb +0 -55
  564. data/vendor/bundle/gems/i18n-0.8.1/lib/i18n/version.rb +0 -3
  565. data/vendor/bundle/gems/i18n-0.8.1/test/api/all_features_test.rb +0 -58
  566. data/vendor/bundle/gems/i18n-0.8.1/test/api/cascade_test.rb +0 -28
  567. data/vendor/bundle/gems/i18n-0.8.1/test/api/chain_test.rb +0 -24
  568. data/vendor/bundle/gems/i18n-0.8.1/test/api/fallbacks_test.rb +0 -30
  569. data/vendor/bundle/gems/i18n-0.8.1/test/api/key_value_test.rb +0 -24
  570. data/vendor/bundle/gems/i18n-0.8.1/test/api/memoize_test.rb +0 -56
  571. data/vendor/bundle/gems/i18n-0.8.1/test/api/override_test.rb +0 -42
  572. data/vendor/bundle/gems/i18n-0.8.1/test/api/pluralization_test.rb +0 -30
  573. data/vendor/bundle/gems/i18n-0.8.1/test/api/simple_test.rb +0 -28
  574. data/vendor/bundle/gems/i18n-0.8.1/test/backend/cache_test.rb +0 -108
  575. data/vendor/bundle/gems/i18n-0.8.1/test/backend/cascade_test.rb +0 -86
  576. data/vendor/bundle/gems/i18n-0.8.1/test/backend/chain_test.rb +0 -91
  577. data/vendor/bundle/gems/i18n-0.8.1/test/backend/exceptions_test.rb +0 -36
  578. data/vendor/bundle/gems/i18n-0.8.1/test/backend/fallbacks_test.rb +0 -206
  579. data/vendor/bundle/gems/i18n-0.8.1/test/backend/interpolation_compiler_test.rb +0 -118
  580. data/vendor/bundle/gems/i18n-0.8.1/test/backend/key_value_test.rb +0 -43
  581. data/vendor/bundle/gems/i18n-0.8.1/test/backend/memoize_test.rb +0 -47
  582. data/vendor/bundle/gems/i18n-0.8.1/test/backend/metadata_test.rb +0 -48
  583. data/vendor/bundle/gems/i18n-0.8.1/test/backend/pluralization_test.rb +0 -45
  584. data/vendor/bundle/gems/i18n-0.8.1/test/backend/simple_test.rb +0 -84
  585. data/vendor/bundle/gems/i18n-0.8.1/test/backend/transliterator_test.rb +0 -84
  586. data/vendor/bundle/gems/i18n-0.8.1/test/core_ext/hash_test.rb +0 -42
  587. data/vendor/bundle/gems/i18n-0.8.1/test/gettext/api_test.rb +0 -214
  588. data/vendor/bundle/gems/i18n-0.8.1/test/gettext/backend_test.rb +0 -92
  589. data/vendor/bundle/gems/i18n-0.8.1/test/i18n/exceptions_test.rb +0 -114
  590. data/vendor/bundle/gems/i18n-0.8.1/test/i18n/interpolate_test.rb +0 -91
  591. data/vendor/bundle/gems/i18n-0.8.1/test/i18n/load_path_test.rb +0 -34
  592. data/vendor/bundle/gems/i18n-0.8.1/test/i18n_test.rb +0 -437
  593. data/vendor/bundle/gems/i18n-0.8.1/test/locale/fallbacks_test.rb +0 -133
  594. data/vendor/bundle/gems/i18n-0.8.1/test/locale/tag/rfc4646_test.rb +0 -143
  595. data/vendor/bundle/gems/i18n-0.8.1/test/locale/tag/simple_test.rb +0 -32
  596. data/vendor/bundle/gems/i18n-0.8.1/test/run_all.rb +0 -20
  597. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/de.po +0 -82
  598. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/en.rb +0 -3
  599. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/en.yml +0 -3
  600. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/invalid/empty.yml +0 -0
  601. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/invalid/syntax.yml +0 -4
  602. data/vendor/bundle/gems/i18n-0.8.1/test/test_data/locales/plurals.rb +0 -113
  603. data/vendor/bundle/gems/i18n-0.8.1/test/test_helper.rb +0 -55
  604. data/vendor/bundle/gems/method_source-0.8.2/.gemtest +0 -0
  605. data/vendor/bundle/gems/method_source-0.8.2/.travis.yml +0 -13
  606. data/vendor/bundle/gems/method_source-0.8.2/.yardopts +0 -1
  607. data/vendor/bundle/gems/method_source-0.8.2/Gemfile +0 -2
  608. data/vendor/bundle/gems/method_source-0.8.2/LICENSE +0 -25
  609. data/vendor/bundle/gems/method_source-0.8.2/README.markdown +0 -91
  610. data/vendor/bundle/gems/method_source-0.8.2/Rakefile +0 -79
  611. data/vendor/bundle/gems/method_source-0.8.2/lib/method_source.rb +0 -141
  612. data/vendor/bundle/gems/method_source-0.8.2/lib/method_source/code_helpers.rb +0 -154
  613. data/vendor/bundle/gems/method_source-0.8.2/lib/method_source/source_location.rb +0 -138
  614. data/vendor/bundle/gems/method_source-0.8.2/lib/method_source/version.rb +0 -3
  615. data/vendor/bundle/gems/method_source-0.8.2/method_source.gemspec +0 -33
  616. data/vendor/bundle/gems/method_source-0.8.2/test/test.rb +0 -138
  617. data/vendor/bundle/gems/method_source-0.8.2/test/test_code_helpers.rb +0 -41
  618. data/vendor/bundle/gems/method_source-0.8.2/test/test_helper.rb +0 -98
  619. data/vendor/bundle/gems/minitest-5.10.1/.autotest +0 -34
  620. data/vendor/bundle/gems/minitest-5.10.1/History.rdoc +0 -1207
  621. data/vendor/bundle/gems/minitest-5.10.1/Manifest.txt +0 -26
  622. data/vendor/bundle/gems/minitest-5.10.1/README.rdoc +0 -660
  623. data/vendor/bundle/gems/minitest-5.10.1/Rakefile +0 -86
  624. data/vendor/bundle/gems/minitest-5.10.1/design_rationale.rb +0 -52
  625. data/vendor/bundle/gems/minitest-5.10.1/lib/hoe/minitest.rb +0 -32
  626. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest.rb +0 -842
  627. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/assertions.rb +0 -688
  628. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/autorun.rb +0 -13
  629. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/benchmark.rb +0 -424
  630. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/expectations.rb +0 -284
  631. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/hell.rb +0 -17
  632. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/mock.rb +0 -232
  633. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/parallel.rb +0 -69
  634. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/pride.rb +0 -4
  635. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/pride_plugin.rb +0 -142
  636. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/spec.rb +0 -331
  637. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/test.rb +0 -282
  638. data/vendor/bundle/gems/minitest-5.10.1/lib/minitest/unit.rb +0 -45
  639. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/metametameta.rb +0 -101
  640. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/test_minitest_benchmark.rb +0 -137
  641. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/test_minitest_mock.rb +0 -512
  642. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/test_minitest_reporter.rb +0 -281
  643. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/test_minitest_spec.rb +0 -970
  644. data/vendor/bundle/gems/minitest-5.10.1/test/minitest/test_minitest_test.rb +0 -2058
  645. data/vendor/bundle/gems/pry-0.10.4/CHANGELOG.md +0 -718
  646. data/vendor/bundle/gems/pry-0.10.4/LICENSE +0 -25
  647. data/vendor/bundle/gems/pry-0.10.4/README.md +0 -406
  648. data/vendor/bundle/gems/pry-0.10.4/bin/pry +0 -16
  649. data/vendor/bundle/gems/pry-0.10.4/lib/pry.rb +0 -161
  650. data/vendor/bundle/gems/pry-0.10.4/lib/pry/cli.rb +0 -220
  651. data/vendor/bundle/gems/pry-0.10.4/lib/pry/code.rb +0 -348
  652. data/vendor/bundle/gems/pry-0.10.4/lib/pry/code/code_file.rb +0 -103
  653. data/vendor/bundle/gems/pry-0.10.4/lib/pry/code/code_range.rb +0 -71
  654. data/vendor/bundle/gems/pry-0.10.4/lib/pry/code/loc.rb +0 -92
  655. data/vendor/bundle/gems/pry-0.10.4/lib/pry/code_object.rb +0 -172
  656. data/vendor/bundle/gems/pry-0.10.4/lib/pry/color_printer.rb +0 -55
  657. data/vendor/bundle/gems/pry-0.10.4/lib/pry/command.rb +0 -692
  658. data/vendor/bundle/gems/pry-0.10.4/lib/pry/command_set.rb +0 -443
  659. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands.rb +0 -6
  660. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/amend_line.rb +0 -99
  661. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/bang.rb +0 -20
  662. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/bang_pry.rb +0 -17
  663. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cat.rb +0 -62
  664. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cat/abstract_formatter.rb +0 -27
  665. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cat/exception_formatter.rb +0 -77
  666. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cat/file_formatter.rb +0 -67
  667. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cat/input_expression_formatter.rb +0 -43
  668. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/cd.rb +0 -41
  669. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/change_inspector.rb +0 -27
  670. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/change_prompt.rb +0 -26
  671. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/code_collector.rb +0 -165
  672. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/disable_pry.rb +0 -27
  673. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/disabled_commands.rb +0 -2
  674. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/easter_eggs.rb +0 -112
  675. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/edit.rb +0 -195
  676. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/edit/exception_patcher.rb +0 -25
  677. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/edit/file_and_line_locator.rb +0 -36
  678. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/exit.rb +0 -42
  679. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/exit_all.rb +0 -29
  680. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/exit_program.rb +0 -23
  681. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/find_method.rb +0 -193
  682. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/fix_indent.rb +0 -19
  683. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/gem_cd.rb +0 -26
  684. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/gem_install.rb +0 -32
  685. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/gem_list.rb +0 -33
  686. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/gem_open.rb +0 -29
  687. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/gist.rb +0 -101
  688. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/help.rb +0 -164
  689. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/hist.rb +0 -180
  690. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/import_set.rb +0 -22
  691. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/install_command.rb +0 -53
  692. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/jump_to.rb +0 -29
  693. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/list_inspectors.rb +0 -35
  694. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/list_prompts.rb +0 -35
  695. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls.rb +0 -114
  696. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/constants.rb +0 -47
  697. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/formatter.rb +0 -49
  698. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/globals.rb +0 -48
  699. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/grep.rb +0 -21
  700. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/instance_vars.rb +0 -39
  701. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/interrogatable.rb +0 -18
  702. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/jruby_hacks.rb +0 -49
  703. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/local_names.rb +0 -35
  704. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/local_vars.rb +0 -39
  705. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/ls_entity.rb +0 -70
  706. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/methods.rb +0 -57
  707. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/methods_helper.rb +0 -46
  708. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ls/self_methods.rb +0 -32
  709. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/nesting.rb +0 -25
  710. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/play.rb +0 -103
  711. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/pry_backtrace.rb +0 -25
  712. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/pry_version.rb +0 -17
  713. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/raise_up.rb +0 -32
  714. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/reload_code.rb +0 -62
  715. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/reset.rb +0 -18
  716. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/ri.rb +0 -60
  717. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/save_file.rb +0 -61
  718. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/shell_command.rb +0 -48
  719. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/shell_mode.rb +0 -25
  720. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/show_doc.rb +0 -83
  721. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/show_info.rb +0 -201
  722. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/show_input.rb +0 -17
  723. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/show_source.rb +0 -50
  724. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/simple_prompt.rb +0 -22
  725. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/stat.rb +0 -40
  726. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/switch_to.rb +0 -23
  727. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/toggle_color.rb +0 -24
  728. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/watch_expression.rb +0 -105
  729. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/watch_expression/expression.rb +0 -38
  730. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/whereami.rb +0 -196
  731. data/vendor/bundle/gems/pry-0.10.4/lib/pry/commands/wtf.rb +0 -57
  732. data/vendor/bundle/gems/pry-0.10.4/lib/pry/config.rb +0 -24
  733. data/vendor/bundle/gems/pry-0.10.4/lib/pry/config/behavior.rb +0 -139
  734. data/vendor/bundle/gems/pry-0.10.4/lib/pry/config/convenience.rb +0 -25
  735. data/vendor/bundle/gems/pry-0.10.4/lib/pry/config/default.rb +0 -161
  736. data/vendor/bundle/gems/pry-0.10.4/lib/pry/core_extensions.rb +0 -131
  737. data/vendor/bundle/gems/pry-0.10.4/lib/pry/editor.rb +0 -135
  738. data/vendor/bundle/gems/pry-0.10.4/lib/pry/exceptions.rb +0 -78
  739. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers.rb +0 -5
  740. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/base_helpers.rb +0 -113
  741. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/command_helpers.rb +0 -156
  742. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/documentation_helpers.rb +0 -75
  743. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/options_helpers.rb +0 -27
  744. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/table.rb +0 -109
  745. data/vendor/bundle/gems/pry-0.10.4/lib/pry/helpers/text.rb +0 -107
  746. data/vendor/bundle/gems/pry-0.10.4/lib/pry/history.rb +0 -127
  747. data/vendor/bundle/gems/pry-0.10.4/lib/pry/history_array.rb +0 -121
  748. data/vendor/bundle/gems/pry-0.10.4/lib/pry/hooks.rb +0 -230
  749. data/vendor/bundle/gems/pry-0.10.4/lib/pry/indent.rb +0 -406
  750. data/vendor/bundle/gems/pry-0.10.4/lib/pry/input_completer.rb +0 -242
  751. data/vendor/bundle/gems/pry-0.10.4/lib/pry/input_lock.rb +0 -132
  752. data/vendor/bundle/gems/pry-0.10.4/lib/pry/inspector.rb +0 -27
  753. data/vendor/bundle/gems/pry-0.10.4/lib/pry/last_exception.rb +0 -61
  754. data/vendor/bundle/gems/pry-0.10.4/lib/pry/method.rb +0 -546
  755. data/vendor/bundle/gems/pry-0.10.4/lib/pry/method/disowned.rb +0 -53
  756. data/vendor/bundle/gems/pry-0.10.4/lib/pry/method/patcher.rb +0 -125
  757. data/vendor/bundle/gems/pry-0.10.4/lib/pry/method/weird_method_locator.rb +0 -188
  758. data/vendor/bundle/gems/pry-0.10.4/lib/pry/module_candidate.rb +0 -137
  759. data/vendor/bundle/gems/pry-0.10.4/lib/pry/object_path.rb +0 -82
  760. data/vendor/bundle/gems/pry-0.10.4/lib/pry/output.rb +0 -50
  761. data/vendor/bundle/gems/pry-0.10.4/lib/pry/pager.rb +0 -239
  762. data/vendor/bundle/gems/pry-0.10.4/lib/pry/plugins.rb +0 -103
  763. data/vendor/bundle/gems/pry-0.10.4/lib/pry/prompt.rb +0 -26
  764. data/vendor/bundle/gems/pry-0.10.4/lib/pry/pry_class.rb +0 -375
  765. data/vendor/bundle/gems/pry-0.10.4/lib/pry/pry_instance.rb +0 -664
  766. data/vendor/bundle/gems/pry-0.10.4/lib/pry/rbx_path.rb +0 -22
  767. data/vendor/bundle/gems/pry-0.10.4/lib/pry/repl.rb +0 -202
  768. data/vendor/bundle/gems/pry-0.10.4/lib/pry/repl_file_loader.rb +0 -74
  769. data/vendor/bundle/gems/pry-0.10.4/lib/pry/rubygem.rb +0 -82
  770. data/vendor/bundle/gems/pry-0.10.4/lib/pry/terminal.rb +0 -79
  771. data/vendor/bundle/gems/pry-0.10.4/lib/pry/test/helper.rb +0 -170
  772. data/vendor/bundle/gems/pry-0.10.4/lib/pry/version.rb +0 -3
  773. data/vendor/bundle/gems/pry-0.10.4/lib/pry/wrapped_module.rb +0 -378
  774. data/vendor/bundle/gems/rake-10.5.0/.autotest +0 -7
  775. data/vendor/bundle/gems/rake-10.5.0/.rubocop.yml +0 -27
  776. data/vendor/bundle/gems/rake-10.5.0/.togglerc +0 -7
  777. data/vendor/bundle/gems/rake-10.5.0/CONTRIBUTING.rdoc +0 -38
  778. data/vendor/bundle/gems/rake-10.5.0/History.rdoc +0 -659
  779. data/vendor/bundle/gems/rake-10.5.0/MIT-LICENSE +0 -21
  780. data/vendor/bundle/gems/rake-10.5.0/Manifest.txt +0 -166
  781. data/vendor/bundle/gems/rake-10.5.0/README.rdoc +0 -139
  782. data/vendor/bundle/gems/rake-10.5.0/Rakefile +0 -81
  783. data/vendor/bundle/gems/rake-10.5.0/bin/rake +0 -33
  784. data/vendor/bundle/gems/rake-10.5.0/doc/command_line_usage.rdoc +0 -158
  785. data/vendor/bundle/gems/rake-10.5.0/doc/example/Rakefile1 +0 -38
  786. data/vendor/bundle/gems/rake-10.5.0/doc/example/Rakefile2 +0 -35
  787. data/vendor/bundle/gems/rake-10.5.0/doc/example/a.c +0 -6
  788. data/vendor/bundle/gems/rake-10.5.0/doc/example/b.c +0 -6
  789. data/vendor/bundle/gems/rake-10.5.0/doc/example/main.c +0 -11
  790. data/vendor/bundle/gems/rake-10.5.0/doc/glossary.rdoc +0 -42
  791. data/vendor/bundle/gems/rake-10.5.0/doc/jamis.rb +0 -591
  792. data/vendor/bundle/gems/rake-10.5.0/doc/proto_rake.rdoc +0 -127
  793. data/vendor/bundle/gems/rake-10.5.0/doc/rake.1 +0 -141
  794. data/vendor/bundle/gems/rake-10.5.0/doc/rakefile.rdoc +0 -624
  795. data/vendor/bundle/gems/rake-10.5.0/doc/rational.rdoc +0 -151
  796. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.4.14.rdoc +0 -23
  797. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.4.15.rdoc +0 -35
  798. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.5.0.rdoc +0 -53
  799. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.5.3.rdoc +0 -78
  800. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.5.4.rdoc +0 -46
  801. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.6.0.rdoc +0 -141
  802. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.7.0.rdoc +0 -119
  803. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.7.1.rdoc +0 -59
  804. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.7.2.rdoc +0 -121
  805. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.7.3.rdoc +0 -47
  806. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.0.rdoc +0 -114
  807. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.2.rdoc +0 -165
  808. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.3.rdoc +0 -112
  809. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.4.rdoc +0 -147
  810. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.5.rdoc +0 -53
  811. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.6.rdoc +0 -37
  812. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.8.7.rdoc +0 -55
  813. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.0.rdoc +0 -112
  814. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.1.rdoc +0 -52
  815. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.2.2.rdoc +0 -55
  816. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.2.rdoc +0 -49
  817. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.3.rdoc +0 -102
  818. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.4.rdoc +0 -60
  819. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.5.rdoc +0 -55
  820. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-0.9.6.rdoc +0 -64
  821. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-10.0.0.rdoc +0 -178
  822. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-10.0.1.rdoc +0 -58
  823. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-10.0.2.rdoc +0 -53
  824. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-10.0.3.rdoc +0 -191
  825. data/vendor/bundle/gems/rake-10.5.0/doc/release_notes/rake-10.1.0.rdoc +0 -61
  826. data/vendor/bundle/gems/rake-10.5.0/lib/rake.rb +0 -79
  827. data/vendor/bundle/gems/rake-10.5.0/lib/rake/alt_system.rb +0 -110
  828. data/vendor/bundle/gems/rake-10.5.0/lib/rake/application.rb +0 -790
  829. data/vendor/bundle/gems/rake-10.5.0/lib/rake/backtrace.rb +0 -23
  830. data/vendor/bundle/gems/rake-10.5.0/lib/rake/clean.rb +0 -76
  831. data/vendor/bundle/gems/rake-10.5.0/lib/rake/cloneable.rb +0 -16
  832. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/.document +0 -1
  833. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/compositepublisher.rb +0 -21
  834. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/ftptools.rb +0 -137
  835. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/publisher.rb +0 -81
  836. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/rubyforgepublisher.rb +0 -18
  837. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/sshpublisher.rb +0 -61
  838. data/vendor/bundle/gems/rake-10.5.0/lib/rake/contrib/sys.rb +0 -4
  839. data/vendor/bundle/gems/rake-10.5.0/lib/rake/cpu_counter.rb +0 -125
  840. data/vendor/bundle/gems/rake-10.5.0/lib/rake/default_loader.rb +0 -14
  841. data/vendor/bundle/gems/rake-10.5.0/lib/rake/dsl_definition.rb +0 -201
  842. data/vendor/bundle/gems/rake-10.5.0/lib/rake/early_time.rb +0 -21
  843. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ext/core.rb +0 -25
  844. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ext/module.rb +0 -2
  845. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ext/pathname.rb +0 -25
  846. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ext/string.rb +0 -175
  847. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ext/time.rb +0 -18
  848. data/vendor/bundle/gems/rake-10.5.0/lib/rake/file_creation_task.rb +0 -24
  849. data/vendor/bundle/gems/rake-10.5.0/lib/rake/file_list.rb +0 -428
  850. data/vendor/bundle/gems/rake-10.5.0/lib/rake/file_task.rb +0 -46
  851. data/vendor/bundle/gems/rake-10.5.0/lib/rake/file_utils.rb +0 -128
  852. data/vendor/bundle/gems/rake-10.5.0/lib/rake/file_utils_ext.rb +0 -144
  853. data/vendor/bundle/gems/rake-10.5.0/lib/rake/gempackagetask.rb +0 -4
  854. data/vendor/bundle/gems/rake-10.5.0/lib/rake/invocation_chain.rb +0 -56
  855. data/vendor/bundle/gems/rake-10.5.0/lib/rake/invocation_exception_mixin.rb +0 -16
  856. data/vendor/bundle/gems/rake-10.5.0/lib/rake/late_time.rb +0 -17
  857. data/vendor/bundle/gems/rake-10.5.0/lib/rake/linked_list.rb +0 -103
  858. data/vendor/bundle/gems/rake-10.5.0/lib/rake/loaders/makefile.rb +0 -53
  859. data/vendor/bundle/gems/rake-10.5.0/lib/rake/multi_task.rb +0 -13
  860. data/vendor/bundle/gems/rake-10.5.0/lib/rake/name_space.rb +0 -38
  861. data/vendor/bundle/gems/rake-10.5.0/lib/rake/packagetask.rb +0 -199
  862. data/vendor/bundle/gems/rake-10.5.0/lib/rake/pathmap.rb +0 -3
  863. data/vendor/bundle/gems/rake-10.5.0/lib/rake/phony.rb +0 -15
  864. data/vendor/bundle/gems/rake-10.5.0/lib/rake/private_reader.rb +0 -20
  865. data/vendor/bundle/gems/rake-10.5.0/lib/rake/promise.rb +0 -99
  866. data/vendor/bundle/gems/rake-10.5.0/lib/rake/pseudo_status.rb +0 -29
  867. data/vendor/bundle/gems/rake-10.5.0/lib/rake/rake_module.rb +0 -38
  868. data/vendor/bundle/gems/rake-10.5.0/lib/rake/rake_test_loader.rb +0 -22
  869. data/vendor/bundle/gems/rake-10.5.0/lib/rake/rdoctask.rb +0 -4
  870. data/vendor/bundle/gems/rake-10.5.0/lib/rake/ruby182_test_unit_fix.rb +0 -29
  871. data/vendor/bundle/gems/rake-10.5.0/lib/rake/rule_recursion_overflow_error.rb +0 -20
  872. data/vendor/bundle/gems/rake-10.5.0/lib/rake/runtest.rb +0 -27
  873. data/vendor/bundle/gems/rake-10.5.0/lib/rake/scope.rb +0 -42
  874. data/vendor/bundle/gems/rake-10.5.0/lib/rake/task.rb +0 -383
  875. data/vendor/bundle/gems/rake-10.5.0/lib/rake/task_argument_error.rb +0 -7
  876. data/vendor/bundle/gems/rake-10.5.0/lib/rake/task_arguments.rb +0 -98
  877. data/vendor/bundle/gems/rake-10.5.0/lib/rake/task_manager.rb +0 -307
  878. data/vendor/bundle/gems/rake-10.5.0/lib/rake/tasklib.rb +0 -24
  879. data/vendor/bundle/gems/rake-10.5.0/lib/rake/testtask.rb +0 -213
  880. data/vendor/bundle/gems/rake-10.5.0/lib/rake/thread_history_display.rb +0 -48
  881. data/vendor/bundle/gems/rake-10.5.0/lib/rake/thread_pool.rb +0 -164
  882. data/vendor/bundle/gems/rake-10.5.0/lib/rake/trace_output.rb +0 -22
  883. data/vendor/bundle/gems/rake-10.5.0/lib/rake/version.rb +0 -7
  884. data/vendor/bundle/gems/rake-10.5.0/lib/rake/win32.rb +0 -56
  885. data/vendor/bundle/gems/rake-10.5.0/rakelib/publish.rake +0 -20
  886. data/vendor/bundle/gems/rake-10.5.0/rakelib/test_times.rake +0 -25
  887. data/vendor/bundle/gems/rake-10.5.0/test/file_creation.rb +0 -34
  888. data/vendor/bundle/gems/rake-10.5.0/test/helper.rb +0 -129
  889. data/vendor/bundle/gems/rake-10.5.0/test/support/rakefile_definitions.rb +0 -478
  890. data/vendor/bundle/gems/rake-10.5.0/test/support/ruby_runner.rb +0 -34
  891. data/vendor/bundle/gems/rake-10.5.0/test/test_private_reader.rb +0 -42
  892. data/vendor/bundle/gems/rake-10.5.0/test/test_rake.rb +0 -40
  893. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_application.rb +0 -643
  894. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_application_options.rb +0 -468
  895. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_backtrace.rb +0 -119
  896. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_clean.rb +0 -61
  897. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_cpu_counter.rb +0 -68
  898. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_definitions.rb +0 -84
  899. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_directory_task.rb +0 -76
  900. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_dsl.rb +0 -40
  901. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_early_time.rb +0 -31
  902. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_extension.rb +0 -59
  903. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_file_creation_task.rb +0 -56
  904. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_file_list.rb +0 -670
  905. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_file_list_path_map.rb +0 -8
  906. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_file_task.rb +0 -197
  907. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_file_utils.rb +0 -314
  908. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_ftp_file.rb +0 -74
  909. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_functional.rb +0 -482
  910. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_invocation_chain.rb +0 -64
  911. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_late_time.rb +0 -18
  912. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_linked_list.rb +0 -84
  913. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_makefile_loader.rb +0 -46
  914. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_multi_task.rb +0 -64
  915. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_name_space.rb +0 -57
  916. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_package_task.rb +0 -79
  917. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_path_map.rb +0 -168
  918. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_path_map_explode.rb +0 -34
  919. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_path_map_partial.rb +0 -18
  920. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_pathname_extensions.rb +0 -15
  921. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_pseudo_status.rb +0 -21
  922. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_rake_test_loader.rb +0 -20
  923. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_reduce_compat.rb +0 -26
  924. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_require.rb +0 -40
  925. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_rules.rb +0 -388
  926. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_scope.rb +0 -44
  927. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task.rb +0 -393
  928. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_argument_parsing.rb +0 -119
  929. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_arguments.rb +0 -127
  930. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_lib.rb +0 -9
  931. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_manager.rb +0 -178
  932. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_manager_argument_resolution.rb +0 -19
  933. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_task_with_arguments.rb +0 -172
  934. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_test_task.rb +0 -146
  935. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_thread_pool.rb +0 -145
  936. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_top_level_functions.rb +0 -71
  937. data/vendor/bundle/gems/rake-10.5.0/test/test_rake_win32.rb +0 -72
  938. data/vendor/bundle/gems/rake-10.5.0/test/test_thread_history_display.rb +0 -101
  939. data/vendor/bundle/gems/rake-10.5.0/test/test_trace_output.rb +0 -52
  940. data/vendor/bundle/gems/rspec-3.5.0/LICENSE.md +0 -27
  941. data/vendor/bundle/gems/rspec-3.5.0/README.md +0 -39
  942. data/vendor/bundle/gems/rspec-3.5.0/lib/rspec.rb +0 -3
  943. data/vendor/bundle/gems/rspec-3.5.0/lib/rspec/version.rb +0 -5
  944. data/vendor/bundle/gems/rspec-core-3.5.4/.document +0 -5
  945. data/vendor/bundle/gems/rspec-core-3.5.4/.yardopts +0 -8
  946. data/vendor/bundle/gems/rspec-core-3.5.4/Changelog.md +0 -2102
  947. data/vendor/bundle/gems/rspec-core-3.5.4/LICENSE.md +0 -26
  948. data/vendor/bundle/gems/rspec-core-3.5.4/README.md +0 -384
  949. data/vendor/bundle/gems/rspec-core-3.5.4/exe/rspec +0 -4
  950. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/autorun.rb +0 -3
  951. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core.rb +0 -185
  952. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/backtrace_formatter.rb +0 -65
  953. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/bisect/coordinator.rb +0 -66
  954. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/bisect/example_minimizer.rb +0 -169
  955. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/bisect/runner.rb +0 -169
  956. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/bisect/server.rb +0 -65
  957. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/configuration.rb +0 -2100
  958. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/configuration_options.rb +0 -194
  959. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/drb.rb +0 -111
  960. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/dsl.rb +0 -98
  961. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/example.rb +0 -649
  962. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/example_group.rb +0 -879
  963. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/example_status_persister.rb +0 -235
  964. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/filter_manager.rb +0 -231
  965. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/flat_map.rb +0 -20
  966. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters.rb +0 -255
  967. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/base_formatter.rb +0 -70
  968. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/base_text_formatter.rb +0 -77
  969. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/bisect_formatter.rb +0 -69
  970. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/bisect_progress_formatter.rb +0 -144
  971. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/console_codes.rb +0 -65
  972. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/deprecation_formatter.rb +0 -223
  973. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/documentation_formatter.rb +0 -69
  974. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/exception_presenter.rb +0 -491
  975. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/fallback_message_formatter.rb +0 -28
  976. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/helpers.rb +0 -110
  977. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/html_formatter.rb +0 -151
  978. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/html_printer.rb +0 -414
  979. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/html_snippet_extractor.rb +0 -116
  980. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/json_formatter.rb +0 -96
  981. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/profile_formatter.rb +0 -68
  982. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/progress_formatter.rb +0 -28
  983. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/protocol.rb +0 -181
  984. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/formatters/snippet_extractor.rb +0 -136
  985. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/hooks.rb +0 -624
  986. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/invocations.rb +0 -67
  987. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/memoized_helpers.rb +0 -532
  988. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/metadata.rb +0 -499
  989. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/metadata_filter.rb +0 -243
  990. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/minitest_assertions_adapter.rb +0 -31
  991. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/mocking_adapters/flexmock.rb +0 -31
  992. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/mocking_adapters/mocha.rb +0 -57
  993. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/mocking_adapters/null.rb +0 -14
  994. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/mocking_adapters/rr.rb +0 -31
  995. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/mocking_adapters/rspec.rb +0 -32
  996. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/notifications.rb +0 -498
  997. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/option_parser.rb +0 -289
  998. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/ordering.rb +0 -158
  999. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/pending.rb +0 -165
  1000. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/profiler.rb +0 -32
  1001. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/project_initializer.rb +0 -48
  1002. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/project_initializer/.rspec +0 -2
  1003. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/project_initializer/spec/spec_helper.rb +0 -103
  1004. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/rake_task.rb +0 -168
  1005. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/reporter.rb +0 -248
  1006. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/ruby_project.rb +0 -53
  1007. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/runner.rb +0 -188
  1008. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/sandbox.rb +0 -37
  1009. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/set.rb +0 -49
  1010. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/shared_context.rb +0 -55
  1011. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/shared_example_group.rb +0 -247
  1012. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/shell_escape.rb +0 -49
  1013. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/source.rb +0 -86
  1014. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/source/location.rb +0 -13
  1015. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/source/node.rb +0 -93
  1016. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/source/syntax_highlighter.rb +0 -71
  1017. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/source/token.rb +0 -87
  1018. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/test_unit_assertions_adapter.rb +0 -30
  1019. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/version.rb +0 -9
  1020. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/warnings.rb +0 -40
  1021. data/vendor/bundle/gems/rspec-core-3.5.4/lib/rspec/core/world.rb +0 -256
  1022. data/vendor/bundle/gems/rspec-expectations-3.5.0/.document +0 -5
  1023. data/vendor/bundle/gems/rspec-expectations-3.5.0/.yardopts +0 -6
  1024. data/vendor/bundle/gems/rspec-expectations-3.5.0/Changelog.md +0 -1034
  1025. data/vendor/bundle/gems/rspec-expectations-3.5.0/LICENSE.md +0 -25
  1026. data/vendor/bundle/gems/rspec-expectations-3.5.0/README.md +0 -303
  1027. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations.rb +0 -81
  1028. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/configuration.rb +0 -201
  1029. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/expectation_target.rb +0 -127
  1030. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/fail_with.rb +0 -31
  1031. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/failure_aggregator.rb +0 -194
  1032. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/handler.rb +0 -170
  1033. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/minitest_integration.rb +0 -58
  1034. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/syntax.rb +0 -132
  1035. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/expectations/version.rb +0 -8
  1036. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers.rb +0 -1038
  1037. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/aliased_matcher.rb +0 -116
  1038. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in.rb +0 -52
  1039. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/all.rb +0 -85
  1040. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/base_matcher.rb +0 -181
  1041. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/be.rb +0 -288
  1042. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/be_between.rb +0 -77
  1043. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/be_instance_of.rb +0 -22
  1044. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/be_kind_of.rb +0 -16
  1045. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/be_within.rb +0 -72
  1046. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/change.rb +0 -354
  1047. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/compound.rb +0 -272
  1048. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/contain_exactly.rb +0 -286
  1049. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/cover.rb +0 -24
  1050. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/eq.rb +0 -40
  1051. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/eql.rb +0 -34
  1052. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/equal.rb +0 -81
  1053. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/exist.rb +0 -86
  1054. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/has.rb +0 -103
  1055. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/have_attributes.rb +0 -114
  1056. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/include.rb +0 -143
  1057. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/match.rb +0 -106
  1058. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/operators.rb +0 -128
  1059. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/output.rb +0 -200
  1060. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/raise_error.rb +0 -230
  1061. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/respond_to.rb +0 -165
  1062. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/satisfy.rb +0 -37
  1063. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/start_or_end_with.rb +0 -94
  1064. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/throw_symbol.rb +0 -132
  1065. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/built_in/yield.rb +0 -419
  1066. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/composable.rb +0 -185
  1067. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/dsl.rb +0 -466
  1068. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/english_phrasing.rb +0 -58
  1069. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/expecteds_for_multiple_diffs.rb +0 -73
  1070. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/fail_matchers.rb +0 -42
  1071. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/generated_descriptions.rb +0 -42
  1072. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/matcher_delegator.rb +0 -35
  1073. data/vendor/bundle/gems/rspec-expectations-3.5.0/lib/rspec/matchers/matcher_protocol.rb +0 -99
  1074. data/vendor/bundle/gems/rspec-mocks-3.5.0/.document +0 -5
  1075. data/vendor/bundle/gems/rspec-mocks-3.5.0/.yardopts +0 -6
  1076. data/vendor/bundle/gems/rspec-mocks-3.5.0/Changelog.md +0 -1043
  1077. data/vendor/bundle/gems/rspec-mocks-3.5.0/LICENSE.md +0 -25
  1078. data/vendor/bundle/gems/rspec-mocks-3.5.0/README.md +0 -445
  1079. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks.rb +0 -130
  1080. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance.rb +0 -11
  1081. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/chain.rb +0 -110
  1082. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/error_generator.rb +0 -31
  1083. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/expect_chain_chain.rb +0 -35
  1084. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/expectation_chain.rb +0 -48
  1085. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/message_chains.rb +0 -83
  1086. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/proxy.rb +0 -116
  1087. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/recorder.rb +0 -289
  1088. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/stub_chain.rb +0 -47
  1089. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/any_instance/stub_chain_chain.rb +0 -28
  1090. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/argument_list_matcher.rb +0 -100
  1091. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/argument_matchers.rb +0 -320
  1092. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/configuration.rb +0 -205
  1093. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/error_generator.rb +0 -369
  1094. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/example_methods.rb +0 -422
  1095. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/instance_method_stasher.rb +0 -135
  1096. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/marshal_extension.rb +0 -41
  1097. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/matchers/expectation_customization.rb +0 -20
  1098. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/matchers/have_received.rb +0 -130
  1099. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/matchers/receive.rb +0 -132
  1100. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/matchers/receive_message_chain.rb +0 -82
  1101. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/matchers/receive_messages.rb +0 -77
  1102. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/message_chain.rb +0 -87
  1103. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/message_expectation.rb +0 -740
  1104. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/method_double.rb +0 -287
  1105. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/method_reference.rb +0 -202
  1106. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/minitest_integration.rb +0 -68
  1107. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/mutate_const.rb +0 -335
  1108. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/object_reference.rb +0 -149
  1109. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/order_group.rb +0 -81
  1110. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/proxy.rb +0 -489
  1111. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/space.rb +0 -238
  1112. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/standalone.rb +0 -3
  1113. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/syntax.rb +0 -325
  1114. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/targets.rb +0 -124
  1115. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/test_double.rb +0 -170
  1116. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/verifying_double.rb +0 -129
  1117. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/verifying_message_expectation.rb +0 -54
  1118. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/verifying_proxy.rb +0 -213
  1119. data/vendor/bundle/gems/rspec-mocks-3.5.0/lib/rspec/mocks/version.rb +0 -9
  1120. data/vendor/bundle/gems/rspec-support-3.5.0/Changelog.md +0 -192
  1121. data/vendor/bundle/gems/rspec-support-3.5.0/LICENSE.md +0 -23
  1122. data/vendor/bundle/gems/rspec-support-3.5.0/README.md +0 -40
  1123. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support.rb +0 -139
  1124. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/caller_filter.rb +0 -83
  1125. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/comparable_version.rb +0 -46
  1126. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/differ.rb +0 -215
  1127. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/directory_maker.rb +0 -63
  1128. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/encoded_string.rb +0 -165
  1129. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/fuzzy_matcher.rb +0 -48
  1130. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/hunk_generator.rb +0 -47
  1131. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/matcher_definition.rb +0 -42
  1132. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/method_signature_verifier.rb +0 -392
  1133. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/mutex.rb +0 -73
  1134. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/object_formatter.rb +0 -249
  1135. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/recursive_const_methods.rb +0 -76
  1136. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/reentrant_mutex.rb +0 -53
  1137. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/ruby_features.rb +0 -149
  1138. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec.rb +0 -81
  1139. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/deprecation_helpers.rb +0 -64
  1140. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/formatting_support.rb +0 -9
  1141. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/in_sub_process.rb +0 -52
  1142. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/library_wide_checks.rb +0 -150
  1143. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/shell_out.rb +0 -82
  1144. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/stderr_splitter.rb +0 -63
  1145. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/string_matcher.rb +0 -46
  1146. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/with_isolated_directory.rb +0 -13
  1147. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/spec/with_isolated_stderr.rb +0 -13
  1148. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/version.rb +0 -7
  1149. data/vendor/bundle/gems/rspec-support-3.5.0/lib/rspec/support/warnings.rb +0 -39
  1150. data/vendor/bundle/gems/slop-3.6.0/.gitignore +0 -7
  1151. data/vendor/bundle/gems/slop-3.6.0/.travis.yml +0 -9
  1152. data/vendor/bundle/gems/slop-3.6.0/CHANGES.md +0 -309
  1153. data/vendor/bundle/gems/slop-3.6.0/Gemfile +0 -3
  1154. data/vendor/bundle/gems/slop-3.6.0/LICENSE +0 -20
  1155. data/vendor/bundle/gems/slop-3.6.0/README.md +0 -202
  1156. data/vendor/bundle/gems/slop-3.6.0/Rakefile +0 -29
  1157. data/vendor/bundle/gems/slop-3.6.0/lib/slop.rb +0 -687
  1158. data/vendor/bundle/gems/slop-3.6.0/lib/slop/commands.rb +0 -196
  1159. data/vendor/bundle/gems/slop-3.6.0/lib/slop/option.rb +0 -214
  1160. data/vendor/bundle/gems/slop-3.6.0/slop.gemspec +0 -17
  1161. data/vendor/bundle/gems/slop-3.6.0/test/commands_test.rb +0 -26
  1162. data/vendor/bundle/gems/slop-3.6.0/test/helper.rb +0 -12
  1163. data/vendor/bundle/gems/slop-3.6.0/test/option_test.rb +0 -145
  1164. data/vendor/bundle/gems/slop-3.6.0/test/slop_test.rb +0 -518
  1165. data/vendor/bundle/gems/thread_safe-0.3.6/.rspec +0 -2
  1166. data/vendor/bundle/gems/thread_safe-0.3.6/.travis.yml +0 -46
  1167. data/vendor/bundle/gems/thread_safe-0.3.6/.yardopts +0 -13
  1168. data/vendor/bundle/gems/thread_safe-0.3.6/Gemfile +0 -20
  1169. data/vendor/bundle/gems/thread_safe-0.3.6/LICENSE +0 -144
  1170. data/vendor/bundle/gems/thread_safe-0.3.6/README.md +0 -60
  1171. data/vendor/bundle/gems/thread_safe-0.3.6/Rakefile +0 -62
  1172. data/vendor/bundle/gems/thread_safe-0.3.6/examples/bench_cache.rb +0 -35
  1173. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/JRubyCacheBackendLibrary.java +0 -245
  1174. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMap.java +0 -31
  1175. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMapV8.java +0 -3863
  1176. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/LongAdder.java +0 -203
  1177. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/Striped64.java +0 -342
  1178. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/ConcurrentHashMapV8.java +0 -3800
  1179. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/LongAdder.java +0 -204
  1180. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/Striped64.java +0 -291
  1181. data/vendor/bundle/gems/thread_safe-0.3.6/ext/org/jruby/ext/thread_safe/jsr166y/ThreadLocalRandom.java +0 -199
  1182. data/vendor/bundle/gems/thread_safe-0.3.6/ext/thread_safe/JrubyCacheBackendService.java +0 -15
  1183. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe.rb +0 -65
  1184. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/atomic_reference_cache_backend.rb +0 -908
  1185. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/cache.rb +0 -161
  1186. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/mri_cache_backend.rb +0 -60
  1187. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/non_concurrent_cache_backend.rb +0 -135
  1188. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/synchronized_cache_backend.rb +0 -77
  1189. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/synchronized_delegator.rb +0 -43
  1190. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util.rb +0 -16
  1191. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/adder.rb +0 -62
  1192. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/atomic_reference.rb +0 -44
  1193. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/cheap_lockable.rb +0 -106
  1194. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/power_of_two_tuple.rb +0 -26
  1195. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/striped64.rb +0 -222
  1196. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/volatile.rb +0 -64
  1197. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/volatile_tuple.rb +0 -46
  1198. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/util/xor_shift_random.rb +0 -41
  1199. data/vendor/bundle/gems/thread_safe-0.3.6/lib/thread_safe/version.rb +0 -21
  1200. data/vendor/bundle/gems/thread_safe-0.3.6/spec/.gitignore +0 -0
  1201. data/vendor/bundle/gems/thread_safe-0.3.6/spec/spec_helper.rb +0 -31
  1202. data/vendor/bundle/gems/thread_safe-0.3.6/spec/src/thread_safe/SecurityManager.java +0 -21
  1203. data/vendor/bundle/gems/thread_safe-0.3.6/spec/support/.gitignore +0 -0
  1204. data/vendor/bundle/gems/thread_safe-0.3.6/spec/support/threads.rb +0 -1
  1205. data/vendor/bundle/gems/thread_safe-0.3.6/spec/support/threadsafe_test.rb +0 -75
  1206. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/.gitignore +0 -0
  1207. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/array_spec.rb +0 -18
  1208. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/cache_loops_spec.rb +0 -507
  1209. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/cache_spec.rb +0 -943
  1210. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/hash_spec.rb +0 -17
  1211. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/no_unsafe_spec.rb +0 -27
  1212. data/vendor/bundle/gems/thread_safe-0.3.6/spec/thread_safe/synchronized_delegator_spec.rb +0 -85
  1213. data/vendor/bundle/gems/thread_safe-0.3.6/tasks/update_doc.rake +0 -45
  1214. data/vendor/bundle/gems/thread_safe-0.3.6/thread_safe.gemspec +0 -26
  1215. data/vendor/bundle/gems/thread_safe-0.3.6/yard-template/default/fulldoc/html/css/common.css +0 -125
  1216. data/vendor/bundle/gems/thread_safe-0.3.6/yard-template/default/layout/html/footer.erb +0 -16
  1217. data/vendor/bundle/gems/tzinfo-1.2.2/.yardopts +0 -6
  1218. data/vendor/bundle/gems/tzinfo-1.2.2/CHANGES.md +0 -649
  1219. data/vendor/bundle/gems/tzinfo-1.2.2/LICENSE +0 -19
  1220. data/vendor/bundle/gems/tzinfo-1.2.2/README.md +0 -151
  1221. data/vendor/bundle/gems/tzinfo-1.2.2/Rakefile +0 -104
  1222. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo.rb +0 -40
  1223. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/country.rb +0 -196
  1224. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/country_index_definition.rb +0 -31
  1225. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/country_info.rb +0 -42
  1226. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/country_timezone.rb +0 -123
  1227. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/data_source.rb +0 -190
  1228. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/data_timezone.rb +0 -58
  1229. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/data_timezone_info.rb +0 -55
  1230. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/info_timezone.rb +0 -30
  1231. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/linked_timezone.rb +0 -63
  1232. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/linked_timezone_info.rb +0 -26
  1233. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/offset_rationals.rb +0 -77
  1234. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/ruby_core_support.rb +0 -146
  1235. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/ruby_country_info.rb +0 -70
  1236. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/ruby_data_source.rb +0 -136
  1237. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/time_or_datetime.rb +0 -333
  1238. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone.rb +0 -637
  1239. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_definition.rb +0 -36
  1240. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_index_definition.rb +0 -54
  1241. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_info.rb +0 -30
  1242. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_offset.rb +0 -74
  1243. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_period.rb +0 -204
  1244. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_proxy.rb +0 -70
  1245. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_transition.rb +0 -120
  1246. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/timezone_transition_definition.rb +0 -101
  1247. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/transition_data_timezone_info.rb +0 -274
  1248. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/zoneinfo_country_info.rb +0 -35
  1249. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/zoneinfo_data_source.rb +0 -487
  1250. data/vendor/bundle/gems/tzinfo-1.2.2/lib/tzinfo/zoneinfo_timezone_info.rb +0 -245
  1251. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_country.rb +0 -236
  1252. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_country_index_definition.rb +0 -69
  1253. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_country_info.rb +0 -16
  1254. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_country_timezone.rb +0 -161
  1255. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_data_source.rb +0 -218
  1256. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_data_timezone.rb +0 -99
  1257. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_data_timezone_info.rb +0 -18
  1258. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_info_timezone.rb +0 -34
  1259. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_linked_timezone.rb +0 -155
  1260. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_linked_timezone_info.rb +0 -23
  1261. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_offset_rationals.rb +0 -23
  1262. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_ruby_core_support.rb +0 -168
  1263. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_ruby_country_info.rb +0 -80
  1264. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_ruby_data_source.rb +0 -143
  1265. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_time_or_datetime.rb +0 -639
  1266. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone.rb +0 -1334
  1267. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_definition.rb +0 -113
  1268. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_index_definition.rb +0 -73
  1269. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_info.rb +0 -11
  1270. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_london.rb +0 -143
  1271. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_melbourne.rb +0 -142
  1272. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_new_york.rb +0 -142
  1273. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_offset.rb +0 -126
  1274. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_period.rb +0 -548
  1275. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_proxy.rb +0 -113
  1276. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_transition.rb +0 -352
  1277. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_transition_definition.rb +0 -284
  1278. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_timezone_utc.rb +0 -27
  1279. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_transition_data_timezone_info.rb +0 -423
  1280. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_zoneinfo_country_info.rb +0 -64
  1281. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_zoneinfo_data_source.rb +0 -1122
  1282. data/vendor/bundle/gems/tzinfo-1.2.2/test/tc_zoneinfo_timezone_info.rb +0 -814
  1283. data/vendor/bundle/gems/tzinfo-1.2.2/test/test_utils.rb +0 -132
  1284. data/vendor/bundle/gems/tzinfo-1.2.2/test/ts_all.rb +0 -7
  1285. data/vendor/bundle/gems/tzinfo-1.2.2/test/ts_all_ruby.rb +0 -5
  1286. data/vendor/bundle/gems/tzinfo-1.2.2/test/ts_all_zoneinfo.rb +0 -7
  1287. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data.rb +0 -8
  1288. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/America/Argentina/Buenos_Aires.rb +0 -89
  1289. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/America/New_York.rb +0 -315
  1290. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Australia/Melbourne.rb +0 -218
  1291. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/EST.rb +0 -19
  1292. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Etc/GMT__m__1.rb +0 -21
  1293. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Etc/GMT__p__1.rb +0 -21
  1294. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Etc/UTC.rb +0 -21
  1295. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Europe/Amsterdam.rb +0 -261
  1296. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Europe/Andorra.rb +0 -186
  1297. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Europe/London.rb +0 -321
  1298. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Europe/Paris.rb +0 -265
  1299. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/Europe/Prague.rb +0 -220
  1300. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/definitions/UTC.rb +0 -16
  1301. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/indexes/countries.rb +0 -927
  1302. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/indexes/timezones.rb +0 -596
  1303. data/vendor/bundle/gems/tzinfo-1.2.2/test/tzinfo-data/tzinfo/data/version.rb +0 -14
  1304. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/America/Argentina/Buenos_Aires +0 -0
  1305. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/America/New_York +0 -0
  1306. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Australia/Melbourne +0 -0
  1307. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/EST +0 -0
  1308. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Etc/UTC +0 -0
  1309. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Europe/Amsterdam +0 -0
  1310. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Europe/Andorra +0 -0
  1311. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Europe/London +0 -0
  1312. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Europe/Paris +0 -0
  1313. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Europe/Prague +0 -0
  1314. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/Factory +0 -0
  1315. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/iso3166.tab +0 -275
  1316. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/posix/Europe/London +0 -0
  1317. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/posixrules +0 -0
  1318. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/right/Europe/London +0 -0
  1319. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/zone.tab +0 -439
  1320. data/vendor/bundle/gems/tzinfo-1.2.2/test/zoneinfo/zone1970.tab +0 -369
  1321. data/vendor/bundle/gems/tzinfo-1.2.2/tzinfo.gemspec +0 -21
  1322. data/vendor/bundle/specifications/activesupport-5.0.2.gemspec +0 -43
  1323. data/vendor/bundle/specifications/coderay-1.1.1.gemspec +0 -26
  1324. data/vendor/bundle/specifications/concurrent-ruby-1.0.5.gemspec +0 -23
  1325. data/vendor/bundle/specifications/diff-lcs-1.3.gemspec +0 -61
  1326. data/vendor/bundle/specifications/i18n-0.8.1.gemspec +0 -22
  1327. data/vendor/bundle/specifications/method_source-0.8.2.gemspec +0 -34
  1328. data/vendor/bundle/specifications/minitest-5.10.1.gemspec +0 -39
  1329. data/vendor/bundle/specifications/pry-0.10.4.gemspec +0 -43
  1330. data/vendor/bundle/specifications/rake-10.5.0.gemspec +0 -43
  1331. data/vendor/bundle/specifications/rspec-3.5.0.gemspec +0 -42
  1332. data/vendor/bundle/specifications/rspec-core-3.5.4.gemspec +0 -62
  1333. data/vendor/bundle/specifications/rspec-expectations-3.5.0.gemspec +0 -50
  1334. data/vendor/bundle/specifications/rspec-mocks-3.5.0.gemspec +0 -50
  1335. data/vendor/bundle/specifications/rspec-support-3.5.0.gemspec +0 -41
  1336. data/vendor/bundle/specifications/slop-3.6.0.gemspec +0 -36
  1337. data/vendor/bundle/specifications/thread_safe-0.3.6.gemspec +0 -38
  1338. data/vendor/bundle/specifications/tzinfo-1.2.2.gemspec +0 -37
@@ -1,31 +0,0 @@
1
- package org.jruby.ext.thread_safe.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
- }
@@ -1,3863 +0,0 @@
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 org.jruby.ext.thread_safe.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 org.jruby.ext.thread_safe.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
- }