logstash-codec-json 2.0.2 → 2.0.3
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/CHANGELOG.md +7 -3
- data/README.md +3 -0
- data/logstash-codec-json.gemspec +1 -1
- data/spec/codecs/json_spec.rb +1 -1
- data/vendor/bin/coderay +23 -0
- data/vendor/bin/htmldiff +25 -0
- data/vendor/bin/kramdown +23 -0
- data/vendor/bin/ldiff +25 -0
- data/vendor/bin/minitar +23 -0
- data/vendor/bin/pry +23 -0
- data/vendor/bin/rake +23 -0
- data/vendor/bin/rspec +23 -0
- data/vendor/bin/rubygems-cabin-test +23 -0
- data/vendor/bin/tt +23 -0
- data/vendor/cache/cabin-0.7.2.gem +0 -0
- data/vendor/cache/clamp-0.6.5.gem +0 -0
- data/vendor/cache/coderay-1.1.0.gem +0 -0
- data/vendor/cache/concurrent-ruby-0.9.1-java.gem +0 -0
- data/vendor/cache/diff-lcs-1.2.5.gem +0 -0
- data/vendor/cache/ffi-1.9.10-java.gem +0 -0
- data/vendor/cache/filesize-0.0.4.gem +0 -0
- data/vendor/cache/gem_publisher-1.5.0.gem +0 -0
- data/vendor/cache/gems-0.8.3.gem +0 -0
- data/vendor/cache/i18n-0.6.9.gem +0 -0
- data/vendor/cache/insist-1.0.0.gem +0 -0
- data/vendor/cache/jrjackson-0.3.6.gem +0 -0
- data/vendor/cache/jruby-openssl-0.9.12-java.gem +0 -0
- data/vendor/cache/kramdown-1.9.0.gem +0 -0
- data/vendor/cache/logstash-devutils-0.0.18-java.gem +0 -0
- data/vendor/cache/method_source-0.8.2.gem +0 -0
- data/vendor/cache/minitar-0.5.4.gem +0 -0
- data/vendor/cache/polyglot-0.3.5.gem +0 -0
- data/vendor/cache/pry-0.10.3-java.gem +0 -0
- data/vendor/cache/rake-10.4.2.gem +0 -0
- data/vendor/cache/rspec-3.1.0.gem +0 -0
- data/vendor/cache/rspec-core-3.1.7.gem +0 -0
- data/vendor/cache/rspec-expectations-3.1.2.gem +0 -0
- data/vendor/cache/rspec-mocks-3.1.3.gem +0 -0
- data/vendor/cache/rspec-support-3.1.2.gem +0 -0
- data/vendor/cache/rspec-wait-0.0.7.gem +0 -0
- data/vendor/cache/slop-3.6.0.gem +0 -0
- data/vendor/cache/spoon-0.0.4.gem +0 -0
- data/vendor/cache/stud-0.0.22.gem +0 -0
- data/vendor/cache/thread_safe-0.3.5-java.gem +0 -0
- data/vendor/cache/treetop-1.4.15.gem +0 -0
- data/vendor/gems/cabin-0.7.2/CHANGELIST +16 -0
- data/vendor/gems/cabin-0.7.2/LICENSE +14 -0
- data/vendor/gems/cabin-0.7.2/bin/rubygems-cabin-test +5 -0
- data/vendor/gems/cabin-0.7.2/examples/fibonacci-timing.rb +28 -0
- data/vendor/gems/cabin-0.7.2/examples/metrics.rb +41 -0
- data/vendor/gems/cabin-0.7.2/examples/pipe.rb +14 -0
- data/vendor/gems/cabin-0.7.2/examples/sample.rb +46 -0
- data/vendor/gems/cabin-0.7.2/examples/sinatra-logging.rb +27 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin.rb +1 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/channel.rb +194 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/context.rb +50 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/inspectable.rb +56 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metric.rb +22 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics.rb +124 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics/counter.rb +42 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics/gauge.rb +24 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics/histogram.rb +66 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics/meter.rb +39 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/metrics/timer.rb +39 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/CAPSLOCK.rb +16 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/colors.rb +24 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/dragons.rb +34 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/logger.rb +126 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/pipe.rb +51 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/terminal.rb +11 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/timer.rb +25 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/mixins/timestamp.rb +13 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/namespace.rb +8 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/outputs/em/stdlib-logger.rb +42 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/outputs/io.rb +93 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/outputs/stdlib-logger.rb +37 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/outputs/zeromq.rb +96 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/publisher.rb +20 -0
- data/vendor/gems/cabin-0.7.2/lib/cabin/timer.rb +20 -0
- data/vendor/gems/cabin-0.7.2/test/all.rb +17 -0
- data/vendor/gems/cabin-0.7.2/test/minitest-patch.rb +13 -0
- data/vendor/gems/cabin-0.7.2/test/test_logging.rb +171 -0
- data/vendor/gems/cabin-0.7.2/test/test_metrics.rb +97 -0
- data/vendor/gems/cabin-0.7.2/test/test_pipe.rb +84 -0
- data/vendor/gems/cabin-0.7.2/test/test_zeromq.rb +99 -0
- data/vendor/gems/clamp-0.6.5/CHANGES.md +33 -0
- data/vendor/gems/clamp-0.6.5/Gemfile +9 -0
- data/vendor/gems/clamp-0.6.5/LICENSE +20 -0
- data/vendor/gems/clamp-0.6.5/README.md +403 -0
- data/vendor/gems/clamp-0.6.5/Rakefile +12 -0
- data/vendor/gems/clamp-0.6.5/clamp.gemspec +26 -0
- data/vendor/gems/clamp-0.6.5/examples/admin +20 -0
- data/vendor/gems/clamp-0.6.5/examples/flipflop +29 -0
- data/vendor/gems/clamp-0.6.5/examples/fubar +21 -0
- data/vendor/gems/clamp-0.6.5/examples/gitdown +70 -0
- data/vendor/gems/clamp-0.6.5/examples/scoop +17 -0
- data/vendor/gems/clamp-0.6.5/examples/speak +31 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp.rb +7 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/attribute/declaration.rb +54 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/attribute/definition.rb +90 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/attribute/instance.rb +79 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/command.rb +152 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/errors.rb +41 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/help.rb +100 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/option/declaration.rb +59 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/option/definition.rb +94 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/option/parsing.rb +68 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/parameter/declaration.rb +29 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/parameter/definition.rb +48 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/parameter/parsing.rb +29 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/subcommand/declaration.rb +77 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/subcommand/definition.rb +25 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/subcommand/execution.rb +35 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/subcommand/parsing.rb +24 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/truthy.rb +9 -0
- data/vendor/gems/clamp-0.6.5/lib/clamp/version.rb +3 -0
- data/vendor/gems/clamp-0.6.5/spec/clamp/command_group_spec.rb +327 -0
- data/vendor/gems/clamp-0.6.5/spec/clamp/command_spec.rb +983 -0
- data/vendor/gems/clamp-0.6.5/spec/clamp/option/definition_spec.rb +260 -0
- data/vendor/gems/clamp-0.6.5/spec/clamp/option_module_spec.rb +37 -0
- data/vendor/gems/clamp-0.6.5/spec/clamp/parameter/definition_spec.rb +242 -0
- data/vendor/gems/clamp-0.6.5/spec/spec_helper.rb +60 -0
- data/vendor/gems/coderay-1.1.0/README_INDEX.rdoc +123 -0
- data/vendor/gems/coderay-1.1.0/Rakefile +37 -0
- data/vendor/gems/coderay-1.1.0/bin/coderay +215 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay.rb +284 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/duo.rb +81 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoder.rb +201 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/_map.rb +17 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/comment_filter.rb +25 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/count.rb +39 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/debug.rb +49 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/debug_lint.rb +63 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/div.rb +23 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/filter.rb +58 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/html.rb +332 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/html/css.rb +65 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/html/numbering.rb +108 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/html/output.rb +166 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/json.rb +83 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/lines_of_code.rb +45 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/lint.rb +59 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/null.rb +18 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/page.rb +24 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/span.rb +23 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/statistic.rb +95 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/terminal.rb +195 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/text.rb +46 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/token_kind_filter.rb +111 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/xml.rb +72 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/encoders/yaml.rb +50 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/for_redcloth.rb +95 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/helpers/file_type.rb +151 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/helpers/plugin.rb +274 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/helpers/word_list.rb +72 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanner.rb +355 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/_map.rb +24 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/c.rb +189 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/clojure.rb +217 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/cpp.rb +215 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/css.rb +196 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/debug.rb +75 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/delphi.rb +144 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/diff.rb +221 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/erb.rb +81 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/go.rb +208 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/groovy.rb +268 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/haml.rb +168 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/html.rb +275 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/java.rb +174 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/java/builtin_types.rb +421 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/java_script.rb +237 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/json.rb +98 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/lua.rb +280 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/php.rb +527 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/python.rb +287 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/raydebug.rb +75 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/ruby.rb +470 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/ruby/patterns.rb +178 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/ruby/string_state.rb +71 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/sass.rb +232 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/sql.rb +177 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/taskpaper.rb +36 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/text.rb +26 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/xml.rb +17 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/scanners/yaml.rb +140 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/style.rb +23 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/styles/_map.rb +7 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/styles/alpha.rb +152 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/token_kinds.rb +85 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/tokens.rb +161 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/tokens_proxy.rb +55 -0
- data/vendor/gems/coderay-1.1.0/lib/coderay/version.rb +3 -0
- data/vendor/gems/coderay-1.1.0/test/functional/basic.rb +318 -0
- data/vendor/gems/coderay-1.1.0/test/functional/examples.rb +129 -0
- data/vendor/gems/coderay-1.1.0/test/functional/for_redcloth.rb +78 -0
- data/vendor/gems/coderay-1.1.0/test/functional/suite.rb +15 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/CHANGELOG.md +275 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/LICENSE.txt +21 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/README.md +295 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent.rb +121 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/async.rb +298 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atom.rb +131 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/atomic_boolean.rb +151 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/atomic_fixnum.rb +195 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/atomic_reference.rb +49 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/condition.rb +78 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/count_down_latch.rb +118 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/cyclic_barrier.rb +106 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/event.rb +89 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/read_write_lock.rb +252 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/reentrant_read_write_lock.rb +375 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/semaphore.rb +207 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic/thread_local_var.rb +331 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/concurrent_update_error.rb +8 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/direct_update.rb +81 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/jruby.rb +16 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/mutex_atomic.rb +55 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/numeric_cas_wrapper.rb +28 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/rbx.rb +22 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomic_reference/ruby.rb +32 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/atomics.rb +82 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/collection/copy_on_notify_observer_set.rb +115 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/collection/copy_on_write_observer_set.rb +119 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/collection/priority_queue.rb +360 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/concern/deprecation.rb +34 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/concern/dereferenceable.rb +88 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/concern/logging.rb +27 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/concern/obligation.rb +228 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/concern/observable.rb +85 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/configuration.rb +296 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/dataflow.rb +78 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/delay.rb +194 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/edge.rb +30 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/errors.rb +46 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/exchanger.rb +58 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/cached_thread_pool.rb +62 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/executor.rb +68 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/executor_service.rb +521 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/fixed_thread_pool.rb +206 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/immediate_executor.rb +65 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/indirect_immediate_executor.rb +44 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/java_single_thread_executor.rb +29 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/java_thread_pool_executor.rb +121 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/ruby_single_thread_executor.rb +78 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/ruby_thread_pool_executor.rb +344 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/safe_task_executor.rb +36 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/serialized_execution.rb +130 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/simple_executor_service.rb +109 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/single_thread_executor.rb +46 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/thread_pool_executor.rb +81 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executor/timer_set.rb +166 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/executors.rb +10 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/future.rb +136 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/immutable_struct.rb +89 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/ivar.rb +212 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/lazy_register.rb +78 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/maybe.rb +226 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/mutable_struct.rb +227 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/mvar.rb +218 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/promise.rb +540 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/scheduled_task.rb +376 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/settable_struct.rb +127 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization.rb +17 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/abstract_object.rb +163 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/abstract_struct.rb +158 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/condition.rb +53 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/java_object.rb +34 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/lock.rb +32 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/monitor_object.rb +27 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/mutex_object.rb +43 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/object.rb +83 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/synchronization/rbx_object.rb +88 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/timer_task.rb +330 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/tvar.rb +254 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utilities.rb +5 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/at_exit.rb +97 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/engine.rb +44 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/monotonic_time.rb +59 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/native_extension_loader.rb +53 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/processor_counter.rb +156 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/timeout.rb +39 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/utility/timer.rb +26 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent/version.rb +4 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent_ruby.rb +2 -0
- data/vendor/gems/concurrent-ruby-0.9.1-java/lib/concurrent_ruby_ext.jar +0 -0
- data/vendor/gems/diff-lcs-1.2.5/Contributing.rdoc +64 -0
- data/vendor/gems/diff-lcs-1.2.5/Gemfile +20 -0
- data/vendor/gems/diff-lcs-1.2.5/History.rdoc +152 -0
- data/vendor/gems/diff-lcs-1.2.5/License.rdoc +39 -0
- data/vendor/gems/diff-lcs-1.2.5/Manifest.txt +38 -0
- data/vendor/gems/diff-lcs-1.2.5/README.rdoc +85 -0
- data/vendor/gems/diff-lcs-1.2.5/Rakefile +41 -0
- data/vendor/gems/diff-lcs-1.2.5/autotest/discover.rb +1 -0
- data/vendor/gems/diff-lcs-1.2.5/bin/htmldiff +32 -0
- data/vendor/gems/diff-lcs-1.2.5/bin/ldiff +6 -0
- data/vendor/gems/diff-lcs-1.2.5/docs/COPYING.txt +339 -0
- data/vendor/gems/diff-lcs-1.2.5/docs/artistic.txt +127 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff-lcs.rb +3 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs.rb +805 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/array.rb +7 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/block.rb +37 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/callbacks.rb +322 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/change.rb +177 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/htmldiff.rb +149 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/hunk.rb +276 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/internals.rb +301 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/ldiff.rb +195 -0
- data/vendor/gems/diff-lcs-1.2.5/lib/diff/lcs/string.rb +5 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/change_spec.rb +65 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/diff_spec.rb +47 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/hunk_spec.rb +72 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/issues_spec.rb +24 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/lcs_spec.rb +54 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/patch_spec.rb +414 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/sdiff_spec.rb +214 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/spec_helper.rb +290 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/traverse_balanced_spec.rb +310 -0
- data/vendor/gems/diff-lcs-1.2.5/spec/traverse_sequences_spec.rb +139 -0
- data/vendor/gems/ffi-1.9.10-java/COPYING +49 -0
- data/vendor/gems/ffi-1.9.10-java/LICENSE +24 -0
- data/vendor/gems/ffi-1.9.10-java/README.md +109 -0
- data/vendor/gems/ffi-1.9.10-java/Rakefile +210 -0
- data/vendor/gems/filesize-0.0.4/CHANGELOG +3 -0
- data/vendor/gems/filesize-0.0.4/README.markdown +52 -0
- data/vendor/gems/filesize-0.0.4/filesize.gemspec +19 -0
- data/vendor/gems/filesize-0.0.4/lib/filesize.rb +178 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher.rb +28 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/builder.rb +13 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/cli_facade.rb +17 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/git_remote.rb +26 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/publisher.rb +45 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/pusher.rb +26 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/gem_publisher/version.rb +3 -0
- data/vendor/gems/gem_publisher-1.5.0/lib/rubygems_plugin.rb +48 -0
- data/vendor/gems/gem_publisher-1.5.0/test/builder_test.rb +16 -0
- data/vendor/gems/gem_publisher-1.5.0/test/cli_facade_test.rb +43 -0
- data/vendor/gems/gem_publisher-1.5.0/test/common.rb +15 -0
- data/vendor/gems/gem_publisher-1.5.0/test/data/example.gemspec +12 -0
- data/vendor/gems/gem_publisher-1.5.0/test/data/gem_build +4 -0
- data/vendor/gems/gem_publisher-1.5.0/test/data/tags +10 -0
- data/vendor/gems/gem_publisher-1.5.0/test/data/toplevel_version.gemspec +12 -0
- data/vendor/gems/gem_publisher-1.5.0/test/git_remote_test.rb +32 -0
- data/vendor/gems/gem_publisher-1.5.0/test/integration_test.rb +49 -0
- data/vendor/gems/gem_publisher-1.5.0/test/publisher_test.rb +102 -0
- data/vendor/gems/gem_publisher-1.5.0/test/rubygems_plugin_test.rb +76 -0
- data/vendor/gems/gems-0.8.3/CONTRIBUTING.md +45 -0
- data/vendor/gems/gems-0.8.3/LICENSE.md +20 -0
- data/vendor/gems/gems-0.8.3/README.md +158 -0
- data/vendor/gems/gems-0.8.3/Rakefile +11 -0
- data/vendor/gems/gems-0.8.3/gems.gemspec +24 -0
- data/vendor/gems/gems-0.8.3/lib/gems.rb +24 -0
- data/vendor/gems/gems-0.8.3/lib/gems/client.rb +318 -0
- data/vendor/gems/gems-0.8.3/lib/gems/configuration.rb +54 -0
- data/vendor/gems/gems-0.8.3/lib/gems/request.rb +73 -0
- data/vendor/gems/gems-0.8.3/lib/gems/version.rb +17 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/add_owner +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/add_web_hook +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/api_key +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/dependencies +0 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/downloads.yaml +91 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/fire_web_hook +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/gems-0.0.8.gem +0 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/gems.yaml +1072 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/just_updated.yaml +1376 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/latest.yaml +1098 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/most_downloaded.yaml +20 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/most_downloaded_today.yaml +1053 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/owners.yaml +2 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/push +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/rails.yaml +33 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/rails_admin-0.0.0.yaml +3 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/remove_owner +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/remove_web_hook +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/reverse_dependencies_short.yaml +70 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/script_helpers.yaml +17 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/search.yaml +898 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/total_downloads.yaml +2 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/unyank +1 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/web_hooks.yaml +4 -0
- data/vendor/gems/gems-0.8.3/spec/fixtures/yank +1 -0
- data/vendor/gems/gems-0.8.3/spec/gems/client_spec.rb +432 -0
- data/vendor/gems/gems-0.8.3/spec/gems/request_spec.rb +31 -0
- data/vendor/gems/gems-0.8.3/spec/gems_spec.rb +73 -0
- data/vendor/gems/gems-0.8.3/spec/helper.rb +64 -0
- data/vendor/gems/i18n-0.6.9/MIT-LICENSE +20 -0
- data/vendor/gems/i18n-0.6.9/README.textile +105 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.no-rails +5 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.no-rails.lock +14 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.rails-2.3.x +9 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.rails-2.3.x.lock +23 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.rails-3.x +9 -0
- data/vendor/gems/i18n-0.6.9/ci/Gemfile.rails-3.x.lock +23 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n.rb +367 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend.rb +18 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/base.rb +190 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/cache.rb +96 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/cascade.rb +54 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/chain.rb +83 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/fallbacks.rb +65 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/flatten.rb +113 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/gettext.rb +72 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/interpolation_compiler.rb +121 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/key_value.rb +101 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/memoize.rb +46 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/metadata.rb +65 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/pluralization.rb +53 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/simple.rb +87 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/backend/transliterator.rb +99 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/config.rb +121 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/core_ext/hash.rb +29 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/core_ext/kernel/surpress_warnings.rb +9 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/core_ext/string/interpolate.rb +105 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/exceptions.rb +128 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/gettext.rb +25 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/gettext/helpers.rb +64 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/gettext/po_parser.rb +329 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/interpolate/ruby.rb +37 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale.rb +6 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale/fallbacks.rb +96 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale/tag.rb +28 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale/tag/parents.rb +22 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale/tag/rfc4646.rb +74 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/locale/tag/simple.rb +39 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests.rb +12 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/basics.rb +59 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/defaults.rb +40 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/interpolation.rb +133 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/link.rb +56 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/localization.rb +19 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/localization/date.rb +91 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/localization/date_time.rb +82 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/localization/procs.rb +116 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/localization/time.rb +81 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/lookup.rb +81 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/pluralization.rb +35 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/tests/procs.rb +55 -0
- data/vendor/gems/i18n-0.6.9/lib/i18n/version.rb +3 -0
- data/vendor/gems/i18n-0.6.9/test/all.rb +8 -0
- data/vendor/gems/i18n-0.6.9/test/api/all_features_test.rb +58 -0
- data/vendor/gems/i18n-0.6.9/test/api/cascade_test.rb +28 -0
- data/vendor/gems/i18n-0.6.9/test/api/chain_test.rb +24 -0
- data/vendor/gems/i18n-0.6.9/test/api/fallbacks_test.rb +30 -0
- data/vendor/gems/i18n-0.6.9/test/api/key_value_test.rb +28 -0
- data/vendor/gems/i18n-0.6.9/test/api/memoize_test.rb +60 -0
- data/vendor/gems/i18n-0.6.9/test/api/override_test.rb +48 -0
- data/vendor/gems/i18n-0.6.9/test/api/pluralization_test.rb +30 -0
- data/vendor/gems/i18n-0.6.9/test/api/simple_test.rb +28 -0
- data/vendor/gems/i18n-0.6.9/test/backend/cache_test.rb +85 -0
- data/vendor/gems/i18n-0.6.9/test/backend/cascade_test.rb +85 -0
- data/vendor/gems/i18n-0.6.9/test/backend/chain_test.rb +76 -0
- data/vendor/gems/i18n-0.6.9/test/backend/exceptions_test.rb +35 -0
- data/vendor/gems/i18n-0.6.9/test/backend/fallbacks_test.rb +125 -0
- data/vendor/gems/i18n-0.6.9/test/backend/interpolation_compiler_test.rb +119 -0
- data/vendor/gems/i18n-0.6.9/test/backend/key_value_test.rb +46 -0
- data/vendor/gems/i18n-0.6.9/test/backend/memoize_test.rb +47 -0
- data/vendor/gems/i18n-0.6.9/test/backend/metadata_test.rb +47 -0
- data/vendor/gems/i18n-0.6.9/test/backend/pluralization_test.rb +44 -0
- data/vendor/gems/i18n-0.6.9/test/backend/simple_test.rb +83 -0
- data/vendor/gems/i18n-0.6.9/test/backend/transliterator_test.rb +85 -0
- data/vendor/gems/i18n-0.6.9/test/core_ext/hash_test.rb +30 -0
- data/vendor/gems/i18n-0.6.9/test/core_ext/string/interpolate_test.rb +99 -0
- data/vendor/gems/i18n-0.6.9/test/gettext/api_test.rb +206 -0
- data/vendor/gems/i18n-0.6.9/test/gettext/backend_test.rb +101 -0
- data/vendor/gems/i18n-0.6.9/test/i18n/exceptions_test.rb +120 -0
- data/vendor/gems/i18n-0.6.9/test/i18n/interpolate_test.rb +79 -0
- data/vendor/gems/i18n-0.6.9/test/i18n/load_path_test.rb +33 -0
- data/vendor/gems/i18n-0.6.9/test/i18n_test.rb +365 -0
- data/vendor/gems/i18n-0.6.9/test/locale/fallbacks_test.rb +136 -0
- data/vendor/gems/i18n-0.6.9/test/locale/tag/rfc4646_test.rb +142 -0
- data/vendor/gems/i18n-0.6.9/test/locale/tag/simple_test.rb +32 -0
- data/vendor/gems/i18n-0.6.9/test/run_all.rb +21 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/de.po +82 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/en.rb +3 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/en.yml +3 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/invalid/empty.yml +0 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/invalid/syntax.yml +4 -0
- data/vendor/gems/i18n-0.6.9/test/test_data/locales/plurals.rb +113 -0
- data/vendor/gems/i18n-0.6.9/test/test_helper.rb +56 -0
- data/vendor/gems/insist-1.0.0/Gemfile +7 -0
- data/vendor/gems/insist-1.0.0/Gemfile.lock +25 -0
- data/vendor/gems/insist-1.0.0/LICENSE +14 -0
- data/vendor/gems/insist-1.0.0/Makefile +50 -0
- data/vendor/gems/insist-1.0.0/README.md +57 -0
- data/vendor/gems/insist-1.0.0/insist.gemspec +20 -0
- data/vendor/gems/insist-1.0.0/lib/insist.rb +81 -0
- data/vendor/gems/insist-1.0.0/lib/insist/assert.rb +10 -0
- data/vendor/gems/insist-1.0.0/lib/insist/comparators.rb +41 -0
- data/vendor/gems/insist-1.0.0/lib/insist/comparators19.rb +23 -0
- data/vendor/gems/insist-1.0.0/lib/insist/enumerables.rb +14 -0
- data/vendor/gems/insist-1.0.0/lib/insist/failure.rb +4 -0
- data/vendor/gems/insist-1.0.0/lib/insist/namespace.rb +1 -0
- data/vendor/gems/insist-1.0.0/lib/insist/nil.rb +7 -0
- data/vendor/gems/insist-1.0.0/lib/insist/predicates.rb +41 -0
- data/vendor/gems/insist-1.0.0/lib/insist/raises.rb +19 -0
- data/vendor/gems/insist-1.0.0/notify-failure.sh +15 -0
- data/vendor/gems/insist-1.0.0/spec/insist/comparators_spec.rb +110 -0
- data/vendor/gems/insist-1.0.0/spec/insist/enumerables_spec.rb +18 -0
- data/vendor/gems/insist-1.0.0/spec/insist/nil_spec.rb +16 -0
- data/vendor/gems/insist-1.0.0/spec/insist/predicates_spec.rb +53 -0
- data/vendor/gems/insist-1.0.0/spec/insist/reject_spec.rb +18 -0
- data/vendor/gems/insist-1.0.0/spec/insist_spec.rb +14 -0
- data/vendor/gems/insist-1.0.0/spec/spec_setup.rb +1 -0
- data/vendor/gems/insist-1.0.0/test/all.rb +24 -0
- data/vendor/gems/insist-1.0.0/test/docs.rb +42 -0
- data/vendor/gems/insist-1.0.0/test/testing.rb +14 -0
- data/vendor/gems/jrjackson-0.3.6/Gemfile +10 -0
- data/vendor/gems/jrjackson-0.3.6/README.md +150 -0
- data/vendor/gems/jrjackson-0.3.6/Rakefile +10 -0
- data/vendor/gems/jrjackson-0.3.6/alt_bench.rb +46 -0
- data/vendor/gems/jrjackson-0.3.6/changelog.md +113 -0
- data/vendor/gems/jrjackson-0.3.6/dependency-reduced-pom.xml +88 -0
- data/vendor/gems/jrjackson-0.3.6/jrjackson.gemspec +23 -0
- data/vendor/gems/jrjackson-0.3.6/lib/jrjackson.rb +2 -0
- data/vendor/gems/jrjackson-0.3.6/lib/jrjackson/build_info.rb +15 -0
- data/vendor/gems/jrjackson-0.3.6/lib/jrjackson/jars/jrjackson-1.2.16.jar +0 -0
- data/vendor/gems/jrjackson-0.3.6/lib/jrjackson/jrjackson.rb +91 -0
- data/vendor/gems/jrjackson-0.3.6/lib/require_relative_patch.rb +6 -0
- data/vendor/gems/jrjackson-0.3.6/pom.xml +98 -0
- data/vendor/gems/jrjackson-0.3.6/profiling/profiled.rb +15 -0
- data/vendor/gems/jrjackson-0.3.6/run_all_individual_bench.sh +25 -0
- data/vendor/gems/jrjackson-0.3.6/run_jruby_individual_bench.sh +20 -0
- data/vendor/gems/jrjackson-0.3.6/run_mri_individual_bench.sh +7 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/IParseHandler.java +53 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaBigDecimalValueConverter.java +17 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaBigIntValueConverter.java +17 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaConverter.java +10 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaFloatValueConverter.java +16 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaHandler.java +118 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JavaLongValueConverter.java +16 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JjParse.java +147 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonBase.java +159 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonJava.java +81 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonRaw.java +108 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonRuby.java +117 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonSaj.java +26 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonSch.java +25 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrJacksonService.java +38 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/JrParse.java +149 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/ParseError.java +16 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyAnySerializer.java +235 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyBigDecimalValueConverter.java +18 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyBigIntValueConverter.java +21 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyConverter.java +12 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyDateFormat.java +34 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyFloatValueConverter.java +18 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyHandler.java +119 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyIntValueConverter.java +18 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyJacksonModule.java +67 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyKeyConverter.java +12 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyNameConverter.java +9 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyObjectDeserializer.java +182 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyStringConverter.java +18 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyStringKeyConverter.java +15 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyStringNameConverter.java +12 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubySymbolKeyConverter.java +15 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubySymbolNameConverter.java +12 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/RubyUtils.java +150 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/SajParse.java +169 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/SchParse.java +209 -0
- data/vendor/gems/jrjackson-0.3.6/src/main/java/com/jrjackson/StreamParse.java +66 -0
- data/vendor/gems/jrjackson-0.3.6/test/jrjackson_test.rb +527 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/History.md +366 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/LICENSE.txt +37 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/README.md +55 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/Rakefile +63 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl.jar +0 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl/load.rb +37 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl/version.rb +6 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl.rb +23 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/bn.rb +25 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/buffering.rb +241 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/cipher.rb +28 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/config.rb +316 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/digest.rb +32 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/pkcs7.rb +25 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/ssl-internal.rb +112 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/ssl.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/x509-internal.rb +110 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl18/openssl/x509.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl.rb +22 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/bn.rb +29 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/buffering.rb +449 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/cipher.rb +28 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/config.rb +472 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/digest.rb +32 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/ssl-internal.rb +119 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/ssl.rb +2 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/x509-internal.rb +115 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl19/openssl/x509.rb +2 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl.rb +22 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/bn.rb +28 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/buffering.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/cipher.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/config.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/digest.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/ssl.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl21/openssl/x509.rb +119 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl.rb +22 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/bn.rb +39 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/buffering.rb +456 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/cipher.rb +28 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/config.rb +313 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/digest.rb +54 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/ssl.rb +193 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jopenssl22/openssl/x509.rb +139 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/jruby-openssl.rb +5 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl.rb +1 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/bn.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/buffering.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/cipher.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/config.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/digest.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/pkcs12.rb +106 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/pkcs7.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/ssl-internal.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/ssl.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/x509-internal.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/openssl/x509.rb +9 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/org/bouncycastle/bcpkix-jdk15on/1.50/bcpkix-jdk15on-1.50.jar +0 -0
- data/vendor/gems/jruby-openssl-0.9.12-java/lib/org/bouncycastle/bcprov-jdk15on/1.50/bcprov-jdk15on-1.50.jar +0 -0
- data/vendor/gems/kramdown-1.9.0/AUTHORS +1 -0
- data/vendor/gems/kramdown-1.9.0/CONTRIBUTERS +42 -0
- data/vendor/gems/kramdown-1.9.0/COPYING +30 -0
- data/vendor/gems/kramdown-1.9.0/README.md +71 -0
- data/vendor/gems/kramdown-1.9.0/Rakefile +270 -0
- data/vendor/gems/kramdown-1.9.0/VERSION +1 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/benchmark.rb +43 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/benchmark.sh +74 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/generate_data.rb +119 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/mdbasics.text +306 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/mdsyntax.text +888 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/testing.sh +12 -0
- data/vendor/gems/kramdown-1.9.0/benchmark/timing.sh +10 -0
- data/vendor/gems/kramdown-1.9.0/bin/kramdown +67 -0
- data/vendor/gems/kramdown-1.9.0/data/kramdown/document.html +22 -0
- data/vendor/gems/kramdown-1.9.0/data/kramdown/document.latex +50 -0
- data/vendor/gems/kramdown-1.9.0/doc/_design.scss +441 -0
- data/vendor/gems/kramdown-1.9.0/doc/bg.png +0 -0
- data/vendor/gems/kramdown-1.9.0/doc/default.scss +192 -0
- data/vendor/gems/kramdown-1.9.0/doc/default.template +68 -0
- data/vendor/gems/kramdown-1.9.0/doc/documentation.page +84 -0
- data/vendor/gems/kramdown-1.9.0/doc/documentation.template +29 -0
- data/vendor/gems/kramdown-1.9.0/doc/index.page +109 -0
- data/vendor/gems/kramdown-1.9.0/doc/installation.page +86 -0
- data/vendor/gems/kramdown-1.9.0/doc/links.markdown +6 -0
- data/vendor/gems/kramdown-1.9.0/doc/metainfo +3 -0
- data/vendor/gems/kramdown-1.9.0/doc/news.feed +9 -0
- data/vendor/gems/kramdown-1.9.0/doc/news.page +29 -0
- data/vendor/gems/kramdown-1.9.0/doc/options.page +49 -0
- data/vendor/gems/kramdown-1.9.0/doc/quickref.page +599 -0
- data/vendor/gems/kramdown-1.9.0/doc/sidebar.template +19 -0
- data/vendor/gems/kramdown-1.9.0/doc/sitemap.sitemap +5 -0
- data/vendor/gems/kramdown-1.9.0/doc/syntax.page +1737 -0
- data/vendor/gems/kramdown-1.9.0/doc/tests.page +104 -0
- data/vendor/gems/kramdown-1.9.0/doc/virtual +14 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown.rb +10 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/compatibility.rb +36 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter.rb +67 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/base.rb +260 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/hash_ast.rb +36 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/html.rb +463 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/kramdown.rb +429 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/latex.rb +613 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/math_engine/itex2mml.rb +39 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/math_engine/mathjax.rb +48 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/math_engine/mathjaxnode.rb +48 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/math_engine/ritex.rb +38 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/pdf.rb +625 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/remove_html_tags.rb +55 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/syntax_highlighter.rb +53 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/syntax_highlighter/coderay.rb +78 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/syntax_highlighter/minted.rb +35 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/syntax_highlighter/rouge.rb +58 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/converter/toc.rb +69 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/document.rb +144 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/element.rb +518 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/error.rb +17 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/options.rb +598 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser.rb +27 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/base.rb +134 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/gfm.rb +65 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/html.rb +589 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown.rb +362 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/abbreviation.rb +75 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/autolink.rb +37 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/blank_line.rb +30 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/block_boundary.rb +33 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/blockquote.rb +39 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/codeblock.rb +55 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/codespan.rb +44 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/emphasis.rb +61 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/eob.rb +26 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/escaped_chars.rb +25 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/extensions.rb +202 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/footnote.rb +63 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/header.rb +59 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/horizontal_rule.rb +27 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/html.rb +161 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/html_entity.rb +33 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/line_break.rb +25 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/link.rb +143 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/list.rb +248 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/math.rb +54 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/paragraph.rb +51 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/smart_quotes.rb +174 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/table.rb +173 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/kramdown/typographic_symbol.rb +44 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/parser/markdown.rb +56 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils.rb +58 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/configurable.rb +44 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/entities.rb +347 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/html.rb +77 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/ordered_hash.rb +92 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/string_scanner.rb +82 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/utils/unidecoder.rb +48 -0
- data/vendor/gems/kramdown-1.9.0/lib/kramdown/version.rb +15 -0
- data/vendor/gems/kramdown-1.9.0/man/man1/kramdown.1 +481 -0
- data/vendor/gems/kramdown-1.9.0/setup.rb +1585 -0
- data/vendor/gems/kramdown-1.9.0/test/run_tests.rb +46 -0
- data/vendor/gems/kramdown-1.9.0/test/test_files.rb +357 -0
- data/vendor/gems/kramdown-1.9.0/test/test_location.rb +229 -0
- data/vendor/gems/kramdown-1.9.0/test/test_string_scanner_kramdown.rb +30 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/01_blank_line/spaces.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/01_blank_line/spaces.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/01_blank_line/tabs.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/01_blank_line/tabs.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/beginning.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/beginning.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/end.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/end.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/middle.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/02_eob/middle.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/indented.html +18 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/indented.html.gfm +18 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/indented.text +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/no_newline_at_end.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/no_newline_at_end.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/one_para.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/one_para.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/two_para.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/03_paragraph/two_para.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/atx_header.html +51 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/atx_header.text +48 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/atx_header_no_newline_at_end.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/atx_header_no_newline_at_end.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/header_type_offset.html +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/header_type_offset.kramdown +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/header_type_offset.latex +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/header_type_offset.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/header_type_offset.text +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/setext_header.html +32 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/setext_header.text +39 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/setext_header_no_newline_at_end.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/setext_header_no_newline_at_end.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_prefix.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_prefix.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_prefix.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_stripping.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_stripping.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_id_stripping.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_ids.html +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_ids.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/04_header/with_auto_ids.text +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/indented.html +25 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/indented.text +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/lazy.html +34 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/lazy.text +20 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/nested.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/nested.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/no_newline_at_end.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/no_newline_at_end.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/very_long_line.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/very_long_line.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/with_code_blocks.html +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/05_blockquote/with_code_blocks.text +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/disable-highlighting.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/disable-highlighting.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/disable-highlighting.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/error.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/error.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted-with-opts.latex +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted-with-opts.options +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted-with-opts.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted.latex +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted.options +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-minted.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-opts.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-opts.options +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting-opts.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting.options +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/highlighting.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/issue_gh45.html +164 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/issue_gh45.test +188 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/lazy.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/lazy.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/no_newline_at_end.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/no_newline_at_end.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/no_newline_at_end_1.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/no_newline_at_end_1.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/normal.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/normal.text +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/disabled.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/disabled.options +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/disabled.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/simple.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/simple.options +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/rouge/simple.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/tilde_syntax.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/tilde_syntax.text +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/whitespace.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/whitespace.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_blank_line.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_blank_line.text +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_eob_marker.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_eob_marker.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_ial.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_ial.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block.html +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block.text +33 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block_name_with_dash.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block_name_with_dash.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/06_codeblock/with_lang_in_fenced_block_name_with_dash.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/error.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/error.html.19 +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/error.text +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/normal.html +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/normal.text +20 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/sepspaces.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/sepspaces.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/septabs.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/07_horizontal_rule/septabs.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/escaping.html +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/escaping.text +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/item_ial.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/item_ial.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/lazy.html +39 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/lazy.text +29 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/list_and_hr.html +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/list_and_hr.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/list_and_others.html +40 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/list_and_others.text +26 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/mixed.html +117 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/mixed.text +66 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/nested.html +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/nested.text +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/other_first_element.html +39 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/other_first_element.text +18 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/simple_ol.html +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/simple_ol.text +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/simple_ul.html +48 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/simple_ul.text +36 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/single_item.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/single_item.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/special_cases.html +62 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/08_list/special_cases.text +40 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/comment.html +18 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/comment.text +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/deflists.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/deflists.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/deflists.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/tables.html +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/tables.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/content_model/tables.text +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html5_attributes.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html5_attributes.text +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_after_block.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_after_block.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_and_codeblocks.html +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_and_codeblocks.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_and_codeblocks.text +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_and_headers.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_and_headers.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/code.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/code.text +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/comment.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/comment.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/emphasis.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/emphasis.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/entity.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/entity.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/header.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/header.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/header.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_dl.html +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_dl.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_ol.html +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_ol.text +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_ul.html +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/list_ul.text +22 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/paragraph.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/paragraph.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/table_normal.html +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/table_normal.text +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/table_simple.html +61 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/table_simple.text +71 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/typography.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/typography.html.19 +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/html_to_native/typography.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/invalid_html_1.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/invalid_html_1.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/invalid_html_2.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/invalid_html_2.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/markdown_attr.html +38 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/markdown_attr.text +38 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/not_parsed.html +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/not_parsed.text +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_raw.html +35 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_raw.htmlinput +34 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_raw.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_raw.text +33 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_span.html +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_span.htmlinput +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_span.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_as_span.text +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_block_html.html +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_block_html.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/parse_block_html.text +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/processing_instruction.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/processing_instruction.text +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/simple.html +64 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/simple.html.19 +64 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/simple.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/simple.text +59 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/textarea.html +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/09_html/textarea.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/10_ald/simple.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/10_ald/simple.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/auto_id_and_ial.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/auto_id_and_ial.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/auto_id_and_ial.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/nested.html +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/nested.text +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/simple.html +29 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/11_ial/simple.text +41 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/comment.html +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/comment.text +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/ignored.html +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/ignored.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/nomarkdown.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/nomarkdown.kramdown +20 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/nomarkdown.latex +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/nomarkdown.text +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options.html +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options.text +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options2.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options2.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options3.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/12_extension/options3.text +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/definition_at_beginning.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/definition_at_beginning.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/deflist_ial.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/deflist_ial.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/item_ial.html +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/item_ial.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/multiple_terms.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/multiple_terms.text +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/no_def_list.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/no_def_list.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/para_wrapping.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/para_wrapping.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/separated_by_eob.html +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/separated_by_eob.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/simple.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/simple.text +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/styled_terms.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/styled_terms.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/too_much_space.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/too_much_space.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/with_blocks.html +38 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/13_definition_list/with_blocks.text +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/errors.html +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/errors.text +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/escaping.html +52 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/escaping.text +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/footer.html +65 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/footer.text +25 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/header.html +96 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/header.text +32 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/no_table.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/no_table.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/simple.html +177 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/simple.html.19 +177 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/simple.text +49 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/table_with_footnote.html +25 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/table_with_footnote.latex +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/14_table/table_with_footnote.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/gh_128.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/gh_128.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/itex2mml.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/itex2mml.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/itex2mml.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview_simple.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview_simple.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjax_preview_simple.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode.html.19 +27 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_notexhints.html.19 +23 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_notexhints.options +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_notexhints.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_semantics.html.19 +32 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_semantics.options +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/mathjaxnode_semantics.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/normal.html +29 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/normal.text +30 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/ritex.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/ritex.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/15_math/ritex.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/no_toc.html +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/no_toc.text +16 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_exclude.html +35 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_exclude.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_exclude.text +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_levels.html +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_levels.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_levels.text +16 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_with_footnotes.html +13 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_with_footnotes.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/block/16_toc/toc_with_footnotes.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/encoding.html +46 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/encoding.text +28 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/empty.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/empty.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/empty_title.htmlinput +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/empty_title.text +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/image_in_a.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/image_in_a.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/imagelinks.html +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/imagelinks.text +18 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/inline.html +46 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/inline.html.19 +46 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/inline.text +48 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/link_defs.html +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/link_defs.text +27 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/link_defs_with_ial.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/link_defs_with_ial.text +16 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/links_with_angle_brackets.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/links_with_angle_brackets.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/reference.html +37 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/reference.html.19 +37 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/reference.options +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/01_link/reference.text +53 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/empty.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/empty.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/errors.html +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/errors.text +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/nesting.html +41 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/nesting.text +36 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/normal.html +48 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/02_emphasis/normal.text +48 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/empty.html +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/empty.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/errors.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/errors.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/highlighting-minted.latex +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/highlighting-minted.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/highlighting-minted.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/highlighting.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/highlighting.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/normal.html +16 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/normal.text +16 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/disabled.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/disabled.options +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/disabled.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/simple.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/simple.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/03_codespan/rouge/simple.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/backlink_text.html +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/backlink_text.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/backlink_text.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/definitions.html +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/definitions.latex +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/definitions.text +24 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/footnote_nr.html +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/footnote_nr.latex +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/footnote_nr.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/footnote_nr.text +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/inside_footnote.html +17 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/inside_footnote.text +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/markers.html +46 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/markers.latex +23 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/markers.text +27 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/placement.html +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/placement.text +8 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/regexp_problem.html +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/regexp_problem.text +52 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/without_backlink.html +9 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/without_backlink.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/04_footnote/without_backlink.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/across_lines.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/across_lines.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/button.html +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/button.text +7 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/invalid.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/invalid.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/link_with_mailto.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/link_with_mailto.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/markdown_attr.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/markdown_attr.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/normal.html +43 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/normal.text +43 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/raw_span_elements.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/05_html/raw_span_elements.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/abbreviations/abbrev.html +21 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/abbreviations/abbrev.text +34 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/abbreviations/abbrev_defs.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/abbreviations/abbrev_defs.text +5 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/autolinks/url_links.html +14 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/autolinks/url_links.text +15 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/escaped_chars/normal.html +47 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/escaped_chars/normal.text +47 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/comment.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/comment.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/ignored.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/ignored.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/nomarkdown.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/nomarkdown.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/options.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/extension/options.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/ial/simple.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/ial/simple.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/line_breaks/normal.html +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/line_breaks/normal.latex +12 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/line_breaks/normal.text +11 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/itex2mml.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/itex2mml.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/itex2mml.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/mathjaxnode.html.19 +27 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/mathjaxnode.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/mathjaxnode.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/normal.html +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/normal.text +10 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/ritex.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/ritex.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/math/ritex.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities.html +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities.text +6 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_char.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_char.html.19 +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_char.options +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_char.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_input.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_input.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_as_input.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_numeric.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_numeric.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_numeric.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_symbolic.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_symbolic.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/entities_symbolic.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/greaterthan.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/greaterthan.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/lowerthan.html +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/lowerthan.text +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/typography.html +38 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/typography.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases/span/text_substitutions/typography.text +38 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/atx_header.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/atx_header.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/backticks_disable_highlighting.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/backticks_disable_highlighting.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/backticks_disable_highlighting.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/backticks_syntax.html +20 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/backticks_syntax.text +19 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/hard_line_breaks.html +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/hard_line_breaks.text +3 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/hard_line_breaks_off.html +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/hard_line_breaks_off.options +1 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/hard_line_breaks_off.text +2 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/two_para_hard_line_breaks.html +4 -0
- data/vendor/gems/kramdown-1.9.0/test/testcases_gfm/two_para_hard_line_breaks.text +4 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/Gemfile +2 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/LICENSE +202 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rake.rb +3 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rake/publish.rake +30 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rake/vendor.rake +176 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rspec/logstash_helpers.rb +112 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rspec/shared_examples.rb +21 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/lib/logstash/devutils/rspec/spec_helper.rb +70 -0
- data/vendor/gems/logstash-devutils-0.0.18-java/logstash-devutils.gemspec +34 -0
- data/vendor/gems/method_source-0.8.2/Gemfile +2 -0
- data/vendor/gems/method_source-0.8.2/LICENSE +25 -0
- data/vendor/gems/method_source-0.8.2/README.markdown +91 -0
- data/vendor/gems/method_source-0.8.2/Rakefile +79 -0
- data/vendor/gems/method_source-0.8.2/lib/method_source.rb +141 -0
- data/vendor/gems/method_source-0.8.2/lib/method_source/code_helpers.rb +154 -0
- data/vendor/gems/method_source-0.8.2/lib/method_source/source_location.rb +138 -0
- data/vendor/gems/method_source-0.8.2/lib/method_source/version.rb +3 -0
- data/vendor/gems/method_source-0.8.2/method_source.gemspec +33 -0
- data/vendor/gems/method_source-0.8.2/test/test.rb +138 -0
- data/vendor/gems/method_source-0.8.2/test/test_code_helpers.rb +41 -0
- data/vendor/gems/method_source-0.8.2/test/test_helper.rb +98 -0
- data/vendor/gems/minitar-0.5.4/ChangeLog +17 -0
- data/vendor/gems/minitar-0.5.4/Install +6 -0
- data/vendor/gems/minitar-0.5.4/README +68 -0
- data/vendor/gems/minitar-0.5.4/Rakefile +113 -0
- data/vendor/gems/minitar-0.5.4/bin/minitar +27 -0
- data/vendor/gems/minitar-0.5.4/lib/archive/tar/minitar.rb +985 -0
- data/vendor/gems/minitar-0.5.4/lib/archive/tar/minitar/command.rb +814 -0
- data/vendor/gems/minitar-0.5.4/tests/tc_tar.rb +629 -0
- data/vendor/gems/minitar-0.5.4/tests/testall.rb +10 -0
- data/vendor/gems/polyglot-0.3.5/History.txt +72 -0
- data/vendor/gems/polyglot-0.3.5/License.txt +20 -0
- data/vendor/gems/polyglot-0.3.5/README.txt +87 -0
- data/vendor/gems/polyglot-0.3.5/Rakefile +42 -0
- data/vendor/gems/polyglot-0.3.5/lib/polyglot.rb +76 -0
- data/vendor/gems/polyglot-0.3.5/lib/polyglot/version.rb +9 -0
- data/vendor/gems/pry-0.10.3-java/CHANGELOG.md +718 -0
- data/vendor/gems/pry-0.10.3-java/LICENSE +25 -0
- data/vendor/gems/pry-0.10.3-java/README.md +406 -0
- data/vendor/gems/pry-0.10.3-java/bin/pry +16 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry.rb +161 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/cli.rb +220 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/code.rb +346 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/code/code_file.rb +103 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/code/code_range.rb +71 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/code/loc.rb +92 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/code_object.rb +172 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/color_printer.rb +55 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/command.rb +692 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/command_set.rb +443 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands.rb +6 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/amend_line.rb +99 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/bang.rb +20 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/bang_pry.rb +17 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cat.rb +62 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cat/abstract_formatter.rb +27 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cat/exception_formatter.rb +77 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cat/file_formatter.rb +67 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cat/input_expression_formatter.rb +43 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/cd.rb +41 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/change_inspector.rb +27 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/change_prompt.rb +26 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/code_collector.rb +165 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/disable_pry.rb +27 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/disabled_commands.rb +2 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/easter_eggs.rb +112 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/edit.rb +195 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/edit/exception_patcher.rb +25 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/edit/file_and_line_locator.rb +36 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/exit.rb +42 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/exit_all.rb +29 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/exit_program.rb +23 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/find_method.rb +193 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/fix_indent.rb +19 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/gem_cd.rb +26 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/gem_install.rb +32 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/gem_list.rb +33 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/gem_open.rb +29 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/gist.rb +101 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/help.rb +164 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/hist.rb +180 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/import_set.rb +22 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/install_command.rb +53 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/jump_to.rb +29 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/list_inspectors.rb +35 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/list_prompts.rb +35 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls.rb +114 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/constants.rb +47 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/formatter.rb +49 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/globals.rb +48 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/grep.rb +21 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/instance_vars.rb +39 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/interrogatable.rb +18 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/jruby_hacks.rb +49 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/local_names.rb +35 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/local_vars.rb +39 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/ls_entity.rb +70 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/methods.rb +57 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/methods_helper.rb +46 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ls/self_methods.rb +32 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/nesting.rb +25 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/play.rb +103 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/pry_backtrace.rb +25 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/pry_version.rb +17 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/raise_up.rb +32 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/reload_code.rb +62 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/reset.rb +18 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/ri.rb +60 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/save_file.rb +61 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/shell_command.rb +48 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/shell_mode.rb +25 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/show_doc.rb +83 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/show_info.rb +195 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/show_input.rb +17 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/show_source.rb +50 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/simple_prompt.rb +22 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/stat.rb +40 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/switch_to.rb +23 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/toggle_color.rb +24 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/watch_expression.rb +105 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/watch_expression/expression.rb +38 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/whereami.rb +190 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/commands/wtf.rb +57 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/config.rb +24 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/config/behavior.rb +139 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/config/convenience.rb +25 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/config/default.rb +161 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/core_extensions.rb +131 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/editor.rb +135 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/exceptions.rb +78 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers.rb +5 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/base_helpers.rb +113 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/command_helpers.rb +156 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/documentation_helpers.rb +75 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/options_helpers.rb +27 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/table.rb +109 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/helpers/text.rb +107 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/history.rb +127 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/history_array.rb +121 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/hooks.rb +230 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/indent.rb +406 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/input_completer.rb +242 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/input_lock.rb +132 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/inspector.rb +27 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/last_exception.rb +61 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/method.rb +546 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/method/disowned.rb +53 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/method/patcher.rb +125 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/method/weird_method_locator.rb +188 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/module_candidate.rb +136 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/object_path.rb +82 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/output.rb +50 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/pager.rb +236 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/plugins.rb +103 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/prompt.rb +26 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/pry_class.rb +375 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/pry_instance.rb +664 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/rbx_path.rb +22 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/repl.rb +202 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/repl_file_loader.rb +74 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/rubygem.rb +82 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/terminal.rb +79 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/test/helper.rb +170 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/version.rb +3 -0
- data/vendor/gems/pry-0.10.3-java/lib/pry/wrapped_module.rb +377 -0
- data/vendor/gems/rake-10.4.2/CONTRIBUTING.rdoc +34 -0
- data/vendor/gems/rake-10.4.2/History.rdoc +651 -0
- data/vendor/gems/rake-10.4.2/MIT-LICENSE +21 -0
- data/vendor/gems/rake-10.4.2/Manifest.txt +166 -0
- data/vendor/gems/rake-10.4.2/README.rdoc +140 -0
- data/vendor/gems/rake-10.4.2/Rakefile +81 -0
- data/vendor/gems/rake-10.4.2/bin/rake +33 -0
- data/vendor/gems/rake-10.4.2/doc/command_line_usage.rdoc +158 -0
- data/vendor/gems/rake-10.4.2/doc/example/Rakefile1 +38 -0
- data/vendor/gems/rake-10.4.2/doc/example/Rakefile2 +35 -0
- data/vendor/gems/rake-10.4.2/doc/example/a.c +6 -0
- data/vendor/gems/rake-10.4.2/doc/example/b.c +6 -0
- data/vendor/gems/rake-10.4.2/doc/example/main.c +11 -0
- data/vendor/gems/rake-10.4.2/doc/glossary.rdoc +43 -0
- data/vendor/gems/rake-10.4.2/doc/jamis.rb +591 -0
- data/vendor/gems/rake-10.4.2/doc/proto_rake.rdoc +127 -0
- data/vendor/gems/rake-10.4.2/doc/rake.1 +141 -0
- data/vendor/gems/rake-10.4.2/doc/rakefile.rdoc +653 -0
- data/vendor/gems/rake-10.4.2/doc/rational.rdoc +151 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.4.14.rdoc +23 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.4.15.rdoc +35 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.5.0.rdoc +53 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.5.3.rdoc +78 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.5.4.rdoc +46 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.6.0.rdoc +141 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.7.0.rdoc +119 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.7.1.rdoc +59 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.7.2.rdoc +121 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.7.3.rdoc +47 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.0.rdoc +114 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.2.rdoc +165 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.3.rdoc +112 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.4.rdoc +147 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.5.rdoc +53 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.6.rdoc +37 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.8.7.rdoc +55 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.0.rdoc +112 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.1.rdoc +52 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.2.2.rdoc +55 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.2.rdoc +49 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.3.rdoc +102 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.4.rdoc +60 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.5.rdoc +55 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-0.9.6.rdoc +64 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-10.0.0.rdoc +178 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-10.0.1.rdoc +58 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-10.0.2.rdoc +53 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-10.0.3.rdoc +191 -0
- data/vendor/gems/rake-10.4.2/doc/release_notes/rake-10.1.0.rdoc +61 -0
- data/vendor/gems/rake-10.4.2/lib/rake.rb +79 -0
- data/vendor/gems/rake-10.4.2/lib/rake/alt_system.rb +110 -0
- data/vendor/gems/rake-10.4.2/lib/rake/application.rb +790 -0
- data/vendor/gems/rake-10.4.2/lib/rake/backtrace.rb +23 -0
- data/vendor/gems/rake-10.4.2/lib/rake/clean.rb +76 -0
- data/vendor/gems/rake-10.4.2/lib/rake/cloneable.rb +16 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/compositepublisher.rb +21 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/ftptools.rb +137 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/publisher.rb +81 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/rubyforgepublisher.rb +18 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/sshpublisher.rb +61 -0
- data/vendor/gems/rake-10.4.2/lib/rake/contrib/sys.rb +4 -0
- data/vendor/gems/rake-10.4.2/lib/rake/cpu_counter.rb +125 -0
- data/vendor/gems/rake-10.4.2/lib/rake/default_loader.rb +14 -0
- data/vendor/gems/rake-10.4.2/lib/rake/dsl_definition.rb +201 -0
- data/vendor/gems/rake-10.4.2/lib/rake/early_time.rb +21 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ext/core.rb +25 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ext/module.rb +2 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ext/pathname.rb +25 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ext/string.rb +173 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ext/time.rb +16 -0
- data/vendor/gems/rake-10.4.2/lib/rake/file_creation_task.rb +24 -0
- data/vendor/gems/rake-10.4.2/lib/rake/file_list.rb +428 -0
- data/vendor/gems/rake-10.4.2/lib/rake/file_task.rb +46 -0
- data/vendor/gems/rake-10.4.2/lib/rake/file_utils.rb +128 -0
- data/vendor/gems/rake-10.4.2/lib/rake/file_utils_ext.rb +144 -0
- data/vendor/gems/rake-10.4.2/lib/rake/gempackagetask.rb +4 -0
- data/vendor/gems/rake-10.4.2/lib/rake/invocation_chain.rb +56 -0
- data/vendor/gems/rake-10.4.2/lib/rake/invocation_exception_mixin.rb +16 -0
- data/vendor/gems/rake-10.4.2/lib/rake/late_time.rb +17 -0
- data/vendor/gems/rake-10.4.2/lib/rake/linked_list.rb +103 -0
- data/vendor/gems/rake-10.4.2/lib/rake/loaders/makefile.rb +40 -0
- data/vendor/gems/rake-10.4.2/lib/rake/multi_task.rb +13 -0
- data/vendor/gems/rake-10.4.2/lib/rake/name_space.rb +38 -0
- data/vendor/gems/rake-10.4.2/lib/rake/packagetask.rb +199 -0
- data/vendor/gems/rake-10.4.2/lib/rake/pathmap.rb +3 -0
- data/vendor/gems/rake-10.4.2/lib/rake/phony.rb +15 -0
- data/vendor/gems/rake-10.4.2/lib/rake/private_reader.rb +20 -0
- data/vendor/gems/rake-10.4.2/lib/rake/promise.rb +99 -0
- data/vendor/gems/rake-10.4.2/lib/rake/pseudo_status.rb +29 -0
- data/vendor/gems/rake-10.4.2/lib/rake/rake_module.rb +38 -0
- data/vendor/gems/rake-10.4.2/lib/rake/rake_test_loader.rb +22 -0
- data/vendor/gems/rake-10.4.2/lib/rake/rdoctask.rb +4 -0
- data/vendor/gems/rake-10.4.2/lib/rake/ruby182_test_unit_fix.rb +29 -0
- data/vendor/gems/rake-10.4.2/lib/rake/rule_recursion_overflow_error.rb +20 -0
- data/vendor/gems/rake-10.4.2/lib/rake/runtest.rb +27 -0
- data/vendor/gems/rake-10.4.2/lib/rake/scope.rb +42 -0
- data/vendor/gems/rake-10.4.2/lib/rake/task.rb +383 -0
- data/vendor/gems/rake-10.4.2/lib/rake/task_argument_error.rb +7 -0
- data/vendor/gems/rake-10.4.2/lib/rake/task_arguments.rb +98 -0
- data/vendor/gems/rake-10.4.2/lib/rake/task_manager.rb +310 -0
- data/vendor/gems/rake-10.4.2/lib/rake/tasklib.rb +24 -0
- data/vendor/gems/rake-10.4.2/lib/rake/testtask.rb +212 -0
- data/vendor/gems/rake-10.4.2/lib/rake/thread_history_display.rb +48 -0
- data/vendor/gems/rake-10.4.2/lib/rake/thread_pool.rb +164 -0
- data/vendor/gems/rake-10.4.2/lib/rake/trace_output.rb +22 -0
- data/vendor/gems/rake-10.4.2/lib/rake/version.rb +7 -0
- data/vendor/gems/rake-10.4.2/lib/rake/win32.rb +56 -0
- data/vendor/gems/rake-10.4.2/rakelib/publish.rake +20 -0
- data/vendor/gems/rake-10.4.2/rakelib/test_times.rake +25 -0
- data/vendor/gems/rake-10.4.2/test/file_creation.rb +34 -0
- data/vendor/gems/rake-10.4.2/test/helper.rb +130 -0
- data/vendor/gems/rake-10.4.2/test/support/rakefile_definitions.rb +478 -0
- data/vendor/gems/rake-10.4.2/test/support/ruby_runner.rb +34 -0
- data/vendor/gems/rake-10.4.2/test/test_private_reader.rb +42 -0
- data/vendor/gems/rake-10.4.2/test/test_rake.rb +40 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_application.rb +643 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_application_options.rb +466 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_backtrace.rb +119 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_clean.rb +61 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_cpu_counter.rb +68 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_definitions.rb +84 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_directory_task.rb +76 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_dsl.rb +40 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_early_time.rb +31 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_extension.rb +59 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_file_creation_task.rb +56 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_file_list.rb +655 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_file_list_path_map.rb +8 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_file_task.rb +197 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_file_utils.rb +309 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_ftp_file.rb +74 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_functional.rb +482 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_invocation_chain.rb +64 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_late_time.rb +18 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_linked_list.rb +84 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_makefile_loader.rb +46 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_multi_task.rb +64 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_name_space.rb +57 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_package_task.rb +79 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_path_map.rb +168 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_path_map_explode.rb +34 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_path_map_partial.rb +18 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_pathname_extensions.rb +15 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_pseudo_status.rb +21 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_rake_test_loader.rb +20 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_reduce_compat.rb +26 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_require.rb +40 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_rules.rb +388 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_scope.rb +44 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task.rb +393 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_argument_parsing.rb +119 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_arguments.rb +127 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_lib.rb +9 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_manager.rb +178 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_manager_argument_resolution.rb +19 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_task_with_arguments.rb +172 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_test_task.rb +146 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_thread_pool.rb +145 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_top_level_functions.rb +71 -0
- data/vendor/gems/rake-10.4.2/test/test_rake_win32.rb +72 -0
- data/vendor/gems/rake-10.4.2/test/test_thread_history_display.rb +101 -0
- data/vendor/gems/rake-10.4.2/test/test_trace_output.rb +52 -0
- data/vendor/gems/rspec-3.1.0/License.txt +24 -0
- data/vendor/gems/rspec-3.1.0/README.md +47 -0
- data/vendor/gems/rspec-3.1.0/lib/rspec.rb +3 -0
- data/vendor/gems/rspec-3.1.0/lib/rspec/version.rb +5 -0
- data/vendor/gems/rspec-core-3.1.7/Changelog.md +1641 -0
- data/vendor/gems/rspec-core-3.1.7/License.txt +25 -0
- data/vendor/gems/rspec-core-3.1.7/README.md +243 -0
- data/vendor/gems/rspec-core-3.1.7/exe/rspec +4 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/autorun.rb +2 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core.rb +169 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/backport_random.rb +336 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/backtrace_formatter.rb +66 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/configuration.rb +1440 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/configuration_options.rb +173 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/drb.rb +111 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/dsl.rb +93 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/example.rb +502 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/example_group.rb +606 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/filter_manager.rb +259 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/flat_map.rb +18 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters.rb +240 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/base_formatter.rb +67 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/base_text_formatter.rb +76 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/console_codes.rb +64 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/deprecation_formatter.rb +222 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/documentation_formatter.rb +68 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/helpers.rb +87 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/html_formatter.rb +149 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/html_printer.rb +403 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/json_formatter.rb +94 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/profile_formatter.rb +65 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/progress_formatter.rb +28 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/protocol.rb +163 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/formatters/snippet_extractor.rb +104 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/hooks.rb +591 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/memoized_helpers.rb +472 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/metadata.rb +437 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/metadata_filter.rb +95 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/minitest_assertions_adapter.rb +28 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/mocking_adapters/flexmock.rb +31 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/mocking_adapters/mocha.rb +57 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/mocking_adapters/null.rb +14 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/mocking_adapters/rr.rb +31 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/mocking_adapters/rspec.rb +32 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/notifications.rb +542 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/option_parser.rb +222 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/ordering.rb +155 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/pending.rb +163 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/project_initializer.rb +48 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/project_initializer/spec/spec_helper.rb +89 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/rake_task.rb +187 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/reporter.rb +149 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/ruby_project.rb +45 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/runner.rb +158 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/shared_context.rb +55 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/shared_example_group.rb +182 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/test_unit_assertions_adapter.rb +30 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/version.rb +9 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/warnings.rb +40 -0
- data/vendor/gems/rspec-core-3.1.7/lib/rspec/core/world.rb +183 -0
- data/vendor/gems/rspec-expectations-3.1.2/Changelog.md +835 -0
- data/vendor/gems/rspec-expectations-3.1.2/License.txt +24 -0
- data/vendor/gems/rspec-expectations-3.1.2/README.md +278 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations.rb +68 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/configuration.rb +147 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/expectation_target.rb +119 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/fail_with.rb +34 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/handler.rb +167 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/minitest_integration.rb +17 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/syntax.rb +132 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/expectations/version.rb +8 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers.rb +967 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/aliased_matcher.rb +116 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in.rb +52 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/all.rb +85 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/base_matcher.rb +132 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/be.rb +277 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/be_between.rb +77 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/be_instance_of.rb +22 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/be_kind_of.rb +16 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/be_within.rb +72 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/change.rb +337 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/compound.rb +258 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/contain_exactly.rb +249 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/cover.rb +24 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/eq.rb +75 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/eql.rb +34 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/equal.rb +81 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/exist.rb +86 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/has.rb +101 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/have_attributes.rb +84 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/include.rb +105 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/match.rb +29 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/operators.rb +119 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/output.rb +152 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/raise_error.rb +174 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/respond_to.rb +91 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/satisfy.rb +39 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/start_and_end_with.rb +82 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/throw_symbol.rb +132 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/built_in/yield.rb +420 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/composable.rb +183 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/dsl.rb +391 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/generated_descriptions.rb +42 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/matcher_delegator.rb +33 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/matcher_protocol.rb +99 -0
- data/vendor/gems/rspec-expectations-3.1.2/lib/rspec/matchers/pretty.rb +77 -0
- data/vendor/gems/rspec-mocks-3.1.3/Changelog.md +817 -0
- data/vendor/gems/rspec-mocks-3.1.3/License.txt +24 -0
- data/vendor/gems/rspec-mocks-3.1.3/README.md +397 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks.rb +126 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance.rb +10 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/chain.rb +109 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/expect_chain_chain.rb +35 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/expectation_chain.rb +48 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/message_chains.rb +85 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/proxy.rb +116 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/recorder.rb +267 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/stub_chain.rb +45 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/any_instance/stub_chain_chain.rb +27 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/argument_list_matcher.rb +72 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/argument_matchers.rb +282 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/configuration.rb +157 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/error_generator.rb +253 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/example_methods.rb +379 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/instance_method_stasher.rb +135 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/marshal_extension.rb +41 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/matchers/expectation_customization.rb +20 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/matchers/have_received.rb +121 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/matchers/receive.rb +106 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/matchers/receive_message_chain.rb +66 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/matchers/receive_messages.rb +71 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/message_chain.rb +91 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/message_expectation.rb +694 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/method_double.rb +260 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/method_reference.rb +155 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/mutate_const.rb +324 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/object_reference.rb +91 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/order_group.rb +81 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/proxy.rb +431 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/space.rb +221 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/standalone.rb +3 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/syntax.rb +329 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/targets.rb +97 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/test_double.rb +135 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/verifying_double.rb +127 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/verifying_message_expecation.rb +62 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/verifying_proxy.rb +171 -0
- data/vendor/gems/rspec-mocks-3.1.3/lib/rspec/mocks/version.rb +9 -0
- data/vendor/gems/rspec-support-3.1.2/Changelog.md +77 -0
- data/vendor/gems/rspec-support-3.1.2/LICENSE.txt +22 -0
- data/vendor/gems/rspec-support-3.1.2/README.md +17 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support.rb +76 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/caller_filter.rb +63 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/differ.rb +214 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/directory_maker.rb +61 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/encoded_string.rb +69 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/fuzzy_matcher.rb +48 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/hunk_generator.rb +47 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/matcher_definition.rb +31 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/method_signature_verifier.rb +272 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/os.rb +18 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/recursive_const_methods.rb +76 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/ruby_features.rb +45 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec.rb +72 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/deprecation_helpers.rb +60 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/formatting_support.rb +9 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/in_sub_process.rb +43 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/prevent_load_time_warnings.rb +44 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/shell_out.rb +69 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/stderr_splitter.rb +52 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/with_isolated_directory.rb +9 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/spec/with_isolated_stderr.rb +13 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/version.rb +7 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/version_checker.rb +53 -0
- data/vendor/gems/rspec-support-3.1.2/lib/rspec/support/warnings.rb +39 -0
- data/vendor/gems/rspec-wait-0.0.7/CHANGELOG.md +29 -0
- data/vendor/gems/rspec-wait-0.0.7/CONTRIBUTING.md +48 -0
- data/vendor/gems/rspec-wait-0.0.7/Gemfile +3 -0
- data/vendor/gems/rspec-wait-0.0.7/LICENSE.txt +22 -0
- data/vendor/gems/rspec-wait-0.0.7/README.md +147 -0
- data/vendor/gems/rspec-wait-0.0.7/Rakefile +6 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_2_11.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_2_12.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_2_13.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_2_14.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_3_0.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_3_1.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_3_2.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/gemfiles/rspec_3_3.gemfile +9 -0
- data/vendor/gems/rspec-wait-0.0.7/lib/rspec/wait.rb +49 -0
- data/vendor/gems/rspec-wait-0.0.7/lib/rspec/wait/error.rb +7 -0
- data/vendor/gems/rspec-wait-0.0.7/lib/rspec/wait/handler.rb +36 -0
- data/vendor/gems/rspec-wait-0.0.7/lib/rspec/wait/proxy.rb +13 -0
- data/vendor/gems/rspec-wait-0.0.7/lib/rspec/wait/target.rb +48 -0
- data/vendor/gems/rspec-wait-0.0.7/rspec-wait.gemspec +21 -0
- data/vendor/gems/rspec-wait-0.0.7/spec/spec_helper.rb +6 -0
- data/vendor/gems/rspec-wait-0.0.7/spec/wait_for_spec.rb +162 -0
- data/vendor/gems/rspec-wait-0.0.7/spec/wait_spec.rb +176 -0
- data/vendor/gems/slop-3.6.0/CHANGES.md +309 -0
- data/vendor/gems/slop-3.6.0/Gemfile +3 -0
- data/vendor/gems/slop-3.6.0/LICENSE +20 -0
- data/vendor/gems/slop-3.6.0/README.md +202 -0
- data/vendor/gems/slop-3.6.0/Rakefile +29 -0
- data/vendor/gems/slop-3.6.0/lib/slop.rb +687 -0
- data/vendor/gems/slop-3.6.0/lib/slop/commands.rb +196 -0
- data/vendor/gems/slop-3.6.0/lib/slop/option.rb +214 -0
- data/vendor/gems/slop-3.6.0/slop.gemspec +17 -0
- data/vendor/gems/slop-3.6.0/test/commands_test.rb +26 -0
- data/vendor/gems/slop-3.6.0/test/helper.rb +12 -0
- data/vendor/gems/slop-3.6.0/test/option_test.rb +145 -0
- data/vendor/gems/slop-3.6.0/test/slop_test.rb +518 -0
- data/vendor/gems/spoon-0.0.4/LICENSE +144 -0
- data/vendor/gems/spoon-0.0.4/examples/ls.rb +25 -0
- data/vendor/gems/spoon-0.0.4/examples/vi.rb +16 -0
- data/vendor/gems/spoon-0.0.4/lib/spoon.rb +19 -0
- data/vendor/gems/spoon-0.0.4/lib/spoon/unix.rb +181 -0
- data/vendor/gems/spoon-0.0.4/lib/spoon/windows.rb +50 -0
- data/vendor/gems/spoon-0.0.4/spoon.gemspec +10 -0
- data/vendor/gems/stud-0.0.22/CHANGELIST +0 -0
- data/vendor/gems/stud-0.0.22/LICENSE +14 -0
- data/vendor/gems/stud-0.0.22/README.md +27 -0
- data/vendor/gems/stud-0.0.22/lib/stud/buffer.rb +260 -0
- data/vendor/gems/stud-0.0.22/lib/stud/interval.rb +110 -0
- data/vendor/gems/stud-0.0.22/lib/stud/pool.rb +215 -0
- data/vendor/gems/stud-0.0.22/lib/stud/secret.rb +35 -0
- data/vendor/gems/stud-0.0.22/lib/stud/task.rb +64 -0
- data/vendor/gems/stud-0.0.22/lib/stud/temporary.rb +63 -0
- data/vendor/gems/stud-0.0.22/lib/stud/trap.rb +80 -0
- data/vendor/gems/stud-0.0.22/lib/stud/try.rb +127 -0
- data/vendor/gems/stud-0.0.22/lib/stud/with.rb +22 -0
- data/vendor/gems/thread_safe-0.3.5-java/Gemfile +17 -0
- data/vendor/gems/thread_safe-0.3.5-java/LICENSE +144 -0
- data/vendor/gems/thread_safe-0.3.5-java/README.md +56 -0
- data/vendor/gems/thread_safe-0.3.5-java/Rakefile +61 -0
- data/vendor/gems/thread_safe-0.3.5-java/examples/bench_cache.rb +35 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/JRubyCacheBackendLibrary.java +245 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMap.java +31 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMapV8.java +3863 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/LongAdder.java +203 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/Striped64.java +342 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/ConcurrentHashMapV8.java +3800 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/LongAdder.java +204 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/nounsafe/Striped64.java +291 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166y/ThreadLocalRandom.java +199 -0
- data/vendor/gems/thread_safe-0.3.5-java/ext/thread_safe/JrubyCacheBackendService.java +15 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe.rb +65 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/atomic_reference_cache_backend.rb +908 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/cache.rb +163 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/jruby_cache_backend.jar +0 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/mri_cache_backend.rb +69 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/non_concurrent_cache_backend.rb +135 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/synchronized_cache_backend.rb +77 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/synchronized_delegator.rb +60 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util.rb +16 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/adder.rb +62 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/atomic_reference.rb +45 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/cheap_lockable.rb +106 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/power_of_two_tuple.rb +26 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/striped64.rb +222 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/volatile.rb +64 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/volatile_tuple.rb +46 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/util/xor_shift_random.rb +41 -0
- data/vendor/gems/thread_safe-0.3.5-java/lib/thread_safe/version.rb +21 -0
- data/vendor/gems/thread_safe-0.3.5-java/tasks/update_doc.rake +45 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/src/thread_safe/SecurityManager.java +21 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_array.rb +18 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_cache.rb +901 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_cache_loops.rb +449 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_hash.rb +17 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_helper.rb +134 -0
- data/vendor/gems/thread_safe-0.3.5-java/test/test_synchronized_delegator.rb +84 -0
- data/vendor/gems/thread_safe-0.3.5-java/thread_safe.gemspec +26 -0
- data/vendor/gems/thread_safe-0.3.5-java/yard-template/default/fulldoc/html/css/common.css +125 -0
- data/vendor/gems/thread_safe-0.3.5-java/yard-template/default/layout/html/footer.erb +16 -0
- data/vendor/gems/treetop-1.4.15/LICENSE +19 -0
- data/vendor/gems/treetop-1.4.15/README.md +190 -0
- data/vendor/gems/treetop-1.4.15/Rakefile +64 -0
- data/vendor/gems/treetop-1.4.15/bin/tt +112 -0
- data/vendor/gems/treetop-1.4.15/doc/contributing_and_planned_features.markdown +102 -0
- data/vendor/gems/treetop-1.4.15/doc/grammar_composition.markdown +65 -0
- data/vendor/gems/treetop-1.4.15/doc/index.markdown +88 -0
- data/vendor/gems/treetop-1.4.15/doc/pitfalls_and_advanced_techniques.markdown +51 -0
- data/vendor/gems/treetop-1.4.15/doc/semantic_interpretation.markdown +218 -0
- data/vendor/gems/treetop-1.4.15/doc/site.rb +112 -0
- data/vendor/gems/treetop-1.4.15/doc/sitegen.rb +65 -0
- data/vendor/gems/treetop-1.4.15/doc/syntactic_recognition.markdown +215 -0
- data/vendor/gems/treetop-1.4.15/doc/tt.1 +83 -0
- data/vendor/gems/treetop-1.4.15/doc/using_in_ruby.markdown +105 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/arithmetic.rb +551 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/arithmetic.treetop +98 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/arithmetic_node_classes.rb +9 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/arithmetic_test.rb +58 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/lambda_calculus +0 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/lambda_calculus.rb +718 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/lambda_calculus.treetop +132 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/lambda_calculus_node_classes.rb +5 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/lambda_calculus_test.rb +89 -0
- data/vendor/gems/treetop-1.4.15/examples/lambda_calculus/test_helper.rb +18 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop.rb +3 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/bootstrap_gen_1_metagrammar.rb +42 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler.rb +7 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/grammar_compiler.rb +49 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/lexical_address_space.rb +17 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/metagrammar.rb +3984 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/metagrammar.treetop +503 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes.rb +19 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/anything_symbol.rb +18 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/atomic_expression.rb +14 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/character_class.rb +28 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/choice.rb +31 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/declaration_sequence.rb +24 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/grammar.rb +28 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/inline_module.rb +27 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/nonterminal.rb +13 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/optional.rb +19 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/parenthesized_expression.rb +9 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/parsing_expression.rb +146 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/parsing_rule.rb +58 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/predicate.rb +45 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/predicate_block.rb +16 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/repetition.rb +89 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/sequence.rb +71 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/terminal.rb +20 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/transient_prefix.rb +9 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/node_classes/treetop_file.rb +9 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/compiler/ruby_builder.rb +115 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/polyglot.rb +9 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/ruby_extensions.rb +1 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/ruby_extensions/string.rb +40 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime.rb +6 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/compiled_parser.rb +115 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/interval_skip_list.rb +3 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/interval_skip_list/head_node.rb +15 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/interval_skip_list/interval_skip_list.rb +200 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/interval_skip_list/node.rb +164 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/syntax_node.rb +114 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/terminal_parse_failure.rb +16 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/runtime/terminal_syntax_node.rb +17 -0
- data/vendor/gems/treetop-1.4.15/lib/treetop/version.rb +9 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/and_predicate_spec.rb +36 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/anything_symbol_spec.rb +44 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/character_class_spec.rb +301 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/choice_spec.rb +80 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/circular_compilation_spec.rb +30 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/failure_propagation_functional_spec.rb +21 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/grammar_compiler_spec.rb +113 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/grammar_spec.rb +41 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/multibyte_chars_spec.rb +38 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/namespace_spec.rb +42 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/nonterminal_symbol_spec.rb +40 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/not_predicate_spec.rb +38 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/occurrence_range_spec.rb +189 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/one_or_more_spec.rb +35 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/optional_spec.rb +37 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/parenthesized_expression_spec.rb +19 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/parsing_rule_spec.rb +61 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/repeated_subrule_spec.rb +29 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/semantic_predicate_spec.rb +175 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/sequence_spec.rb +129 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/terminal_spec.rb +81 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/terminal_symbol_spec.rb +37 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/test_grammar.treetop +7 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/test_grammar.tt +7 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/test_grammar_do.treetop +7 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/test_grammar_magic_coding.treetop +8 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/test_grammar_magic_encoding.treetop +8 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/tt_compiler_spec.rb +224 -0
- data/vendor/gems/treetop-1.4.15/spec/compiler/zero_or_more_spec.rb +56 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/a.treetop +11 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/b.treetop +11 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/c.treetop +10 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/d.treetop +10 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/f.treetop +17 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/grammar_composition_spec.rb +40 -0
- data/vendor/gems/treetop-1.4.15/spec/composition/subfolder/e_includes_c.treetop +15 -0
- data/vendor/gems/treetop-1.4.15/spec/ruby_extensions/string_spec.rb +32 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/compiled_parser_spec.rb +123 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/delete_spec.rb +147 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/expire_range_spec.rb +349 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/insert_and_delete_node_spec.rb +385 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/insert_spec.rb +660 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/interval_skip_list_spec.graffle +6175 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/interval_skip_list_spec.rb +58 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/palindromic_fixture.rb +35 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/palindromic_fixture_spec.rb +163 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/interval_skip_list/spec_helper.rb +91 -0
- data/vendor/gems/treetop-1.4.15/spec/runtime/syntax_node_spec.rb +77 -0
- data/vendor/gems/treetop-1.4.15/spec/spec_helper.rb +115 -0
- data/vendor/gems/treetop-1.4.15/treetop.gemspec +176 -0
- data/vendor/specifications/cabin-0.7.2.gemspec +0 -0
- data/vendor/specifications/clamp-0.6.5.gemspec +20 -0
- data/vendor/specifications/coderay-1.1.0.gemspec +26 -0
- data/vendor/specifications/concurrent-ruby-0.9.1-java.gemspec +24 -0
- data/vendor/specifications/diff-lcs-1.2.5.gemspec +68 -0
- data/vendor/specifications/ffi-1.9.10-java.gemspec +22 -0
- data/vendor/specifications/filesize-0.0.4.gemspec +35 -0
- data/vendor/specifications/gem_publisher-1.5.0.gemspec +37 -0
- data/vendor/specifications/gems-0.8.3.gemspec +33 -0
- data/vendor/specifications/i18n-0.6.9.gemspec +42 -0
- data/vendor/specifications/insist-1.0.0.gemspec +0 -0
- data/vendor/specifications/jrjackson-0.3.6.gemspec +32 -0
- data/vendor/specifications/jruby-openssl-0.9.12-java.gemspec +40 -0
- data/vendor/specifications/kramdown-1.9.0.gemspec +53 -0
- data/vendor/specifications/logstash-devutils-0.0.18-java.gemspec +0 -0
- data/vendor/specifications/method_source-0.8.2.gemspec +34 -0
- data/vendor/specifications/minitar-0.5.4.gemspec +25 -0
- data/vendor/specifications/polyglot-0.3.5.gemspec +22 -0
- data/vendor/specifications/pry-0.10.3-java.gemspec +47 -0
- data/vendor/specifications/rake-10.4.2.gemspec +43 -0
- data/vendor/specifications/rspec-3.1.0.gemspec +43 -0
- data/vendor/specifications/rspec-core-3.1.7.gemspec +66 -0
- data/vendor/specifications/rspec-expectations-3.1.2.gemspec +51 -0
- data/vendor/specifications/rspec-mocks-3.1.3.gemspec +48 -0
- data/vendor/specifications/rspec-support-3.1.2.gemspec +39 -0
- data/vendor/specifications/rspec-wait-0.0.7.gemspec +38 -0
- data/vendor/specifications/slop-3.6.0.gemspec +36 -0
- data/vendor/specifications/spoon-0.0.4.gemspec +29 -0
- data/vendor/specifications/stud-0.0.22.gemspec +0 -0
- data/vendor/specifications/thread_safe-0.3.5-java.gemspec +39 -0
- data/vendor/specifications/treetop-1.4.15.gemspec +56 -0
- metadata +1925 -2
@@ -0,0 +1,56 @@
|
|
1
|
+
# Threadsafe
|
2
|
+
|
3
|
+
[![Gem Version](https://badge.fury.io/rb/thread_safe.svg)](http://badge.fury.io/rb/thread_safe) [![Build Status](https://travis-ci.org/ruby-concurrency/thread_safe.svg?branch=master)](https://travis-ci.org/ruby-concurrency/thread_safe) [![Coverage Status](https://img.shields.io/coveralls/ruby-concurrency/thread_safe/master.svg)](https://coveralls.io/r/ruby-concurrency/thread_safe) [![Code Climate](https://codeclimate.com/github/ruby-concurrency/thread_safe.svg)](https://codeclimate.com/github/ruby-concurrency/thread_safe) [![Dependency Status](https://gemnasium.com/ruby-concurrency/thread_safe.svg)](https://gemnasium.com/ruby-concurrency/thread_safe) [![License](https://img.shields.io/badge/license-apache-green.svg)](http://opensource.org/licenses/MIT) [![Gitter chat](http://img.shields.io/badge/gitter-join%20chat%20%E2%86%92-brightgreen.svg)](https://gitter.im/ruby-concurrency/concurrent-ruby)
|
4
|
+
|
5
|
+
A collection of thread-safe versions of common core Ruby classes.
|
6
|
+
|
7
|
+
## Installation
|
8
|
+
|
9
|
+
Add this line to your application's Gemfile:
|
10
|
+
|
11
|
+
gem 'thread_safe'
|
12
|
+
|
13
|
+
And then execute:
|
14
|
+
|
15
|
+
$ bundle
|
16
|
+
|
17
|
+
Or install it yourself as:
|
18
|
+
|
19
|
+
$ gem install thread_safe
|
20
|
+
|
21
|
+
## Usage
|
22
|
+
|
23
|
+
```ruby
|
24
|
+
require 'thread_safe'
|
25
|
+
|
26
|
+
sa = ThreadSafe::Array.new # supports standard Array.new forms
|
27
|
+
sh = ThreadSafe::Hash.new # supports standard Hash.new forms
|
28
|
+
```
|
29
|
+
|
30
|
+
`ThreadSafe::Cache` also exists, as a hash-like object, and should have
|
31
|
+
much better performance characteristics esp. under high concurrency than
|
32
|
+
`ThreadSafe::Hash`. However, `ThreadSafe::Cache` is not strictly semantically
|
33
|
+
equivalent to a ruby `Hash` -- for instance, it does not necessarily retain
|
34
|
+
ordering by insertion time as `Hash` does. For most uses it should do fine
|
35
|
+
though, and we recommend you consider `ThreadSafe::Cache` instead of
|
36
|
+
`ThreadSafe::Hash` for your concurrency-safe hash needs. It understands some
|
37
|
+
options when created (depending on your ruby platform) that control some of the
|
38
|
+
internals - when unsure just leave them out:
|
39
|
+
|
40
|
+
|
41
|
+
```ruby
|
42
|
+
require 'thread_safe'
|
43
|
+
|
44
|
+
cache = ThreadSafe::Cache.new
|
45
|
+
```
|
46
|
+
|
47
|
+
## Contributing
|
48
|
+
|
49
|
+
1. Fork it
|
50
|
+
2. Clone it (`git clone git@github.com:you/thread_safe.git`)
|
51
|
+
3. Create your feature branch (`git checkout -b my-new-feature`)
|
52
|
+
4. Build the jar (`rake jar`) NOTE: Requires JRuby
|
53
|
+
5. Install dependencies (`bundle install`)
|
54
|
+
6. Commit your changes (`git commit -am 'Added some feature'`)
|
55
|
+
7. Push to the branch (`git push origin my-new-feature`)
|
56
|
+
8. Create new Pull Request
|
@@ -0,0 +1,61 @@
|
|
1
|
+
require "bundler/gem_tasks"
|
2
|
+
require "rake/testtask"
|
3
|
+
|
4
|
+
## safely load all the rake tasks in the `tasks` directory
|
5
|
+
def safe_load(file)
|
6
|
+
begin
|
7
|
+
load file
|
8
|
+
rescue LoadError => ex
|
9
|
+
puts "Error loading rake tasks from '#{file}' but will continue..."
|
10
|
+
puts ex.message
|
11
|
+
end
|
12
|
+
end
|
13
|
+
Dir.glob('tasks/**/*.rake').each do |rakefile|
|
14
|
+
safe_load rakefile
|
15
|
+
end
|
16
|
+
|
17
|
+
task :default => :test
|
18
|
+
|
19
|
+
if defined?(JRUBY_VERSION)
|
20
|
+
require "ant"
|
21
|
+
|
22
|
+
directory "pkg/classes"
|
23
|
+
directory 'pkg/tests'
|
24
|
+
|
25
|
+
desc "Clean up build artifacts"
|
26
|
+
task :clean do
|
27
|
+
rm_rf "pkg/classes"
|
28
|
+
rm_rf "pkg/tests"
|
29
|
+
rm_rf "lib/thread_safe/jruby_cache_backend.jar"
|
30
|
+
end
|
31
|
+
|
32
|
+
desc "Compile the extension"
|
33
|
+
task :compile => "pkg/classes" do |t|
|
34
|
+
ant.javac :srcdir => "ext", :destdir => t.prerequisites.first,
|
35
|
+
:source => "1.5", :target => "1.5", :debug => true,
|
36
|
+
:classpath => "${java.class.path}:${sun.boot.class.path}"
|
37
|
+
end
|
38
|
+
|
39
|
+
desc "Build the jar"
|
40
|
+
task :jar => :compile do
|
41
|
+
ant.jar :basedir => "pkg/classes", :destfile => "lib/thread_safe/jruby_cache_backend.jar", :includes => "**/*.class"
|
42
|
+
end
|
43
|
+
|
44
|
+
desc "Build test jar"
|
45
|
+
task 'test-jar' => 'pkg/tests' do |t|
|
46
|
+
ant.javac :srcdir => 'test/src', :destdir => t.prerequisites.first,
|
47
|
+
:source => "1.5", :target => "1.5", :debug => true
|
48
|
+
|
49
|
+
ant.jar :basedir => 'pkg/tests', :destfile => 'test/package.jar', :includes => '**/*.class'
|
50
|
+
end
|
51
|
+
|
52
|
+
task :package => [ :clean, :compile, :jar, 'test-jar' ]
|
53
|
+
else
|
54
|
+
# No need to package anything for non-jruby rubies
|
55
|
+
task :package
|
56
|
+
end
|
57
|
+
|
58
|
+
Rake::TestTask.new :test => :package do |t|
|
59
|
+
t.libs << "lib"
|
60
|
+
t.test_files = FileList["test/**/*.rb"]
|
61
|
+
end
|
@@ -0,0 +1,35 @@
|
|
1
|
+
#!/usr/bin/env ruby -wKU
|
2
|
+
|
3
|
+
require "benchmark"
|
4
|
+
require "thread_safe"
|
5
|
+
|
6
|
+
hash = {}
|
7
|
+
cache = ThreadSafe::Cache.new
|
8
|
+
|
9
|
+
ENTRIES = 10_000
|
10
|
+
|
11
|
+
ENTRIES.times do |i|
|
12
|
+
hash[i] = i
|
13
|
+
cache[i] = i
|
14
|
+
end
|
15
|
+
|
16
|
+
TESTS = 40_000_000
|
17
|
+
Benchmark.bmbm do |results|
|
18
|
+
key = rand(10_000)
|
19
|
+
|
20
|
+
results.report('Hash#[]') do
|
21
|
+
TESTS.times { hash[key] }
|
22
|
+
end
|
23
|
+
|
24
|
+
results.report('Cache#[]') do
|
25
|
+
TESTS.times { cache[key] }
|
26
|
+
end
|
27
|
+
|
28
|
+
results.report('Hash#each_pair') do
|
29
|
+
(TESTS / ENTRIES).times { hash.each_pair {|k,v| v} }
|
30
|
+
end
|
31
|
+
|
32
|
+
results.report('Cache#each_pair') do
|
33
|
+
(TESTS / ENTRIES).times { cache.each_pair {|k,v| v} }
|
34
|
+
end
|
35
|
+
end
|
data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/JRubyCacheBackendLibrary.java
ADDED
@@ -0,0 +1,245 @@
|
|
1
|
+
package org.jruby.ext.thread_safe;
|
2
|
+
|
3
|
+
import org.jruby.*;
|
4
|
+
import org.jruby.anno.JRubyClass;
|
5
|
+
import org.jruby.anno.JRubyMethod;
|
6
|
+
import org.jruby.ext.thread_safe.jsr166e.ConcurrentHashMap;
|
7
|
+
import org.jruby.ext.thread_safe.jsr166e.ConcurrentHashMapV8;
|
8
|
+
import org.jruby.ext.thread_safe.jsr166e.nounsafe.*;
|
9
|
+
import org.jruby.runtime.Block;
|
10
|
+
import org.jruby.runtime.ObjectAllocator;
|
11
|
+
import org.jruby.runtime.ThreadContext;
|
12
|
+
import org.jruby.runtime.builtin.IRubyObject;
|
13
|
+
import org.jruby.runtime.load.Library;
|
14
|
+
|
15
|
+
import java.io.IOException;
|
16
|
+
import java.util.Map;
|
17
|
+
|
18
|
+
import static org.jruby.runtime.Visibility.PRIVATE;
|
19
|
+
|
20
|
+
/**
|
21
|
+
* Native Java implementation to avoid the JI overhead.
|
22
|
+
*
|
23
|
+
* @author thedarkone
|
24
|
+
*/
|
25
|
+
public class JRubyCacheBackendLibrary implements Library {
|
26
|
+
public void load(Ruby runtime, boolean wrap) throws IOException {
|
27
|
+
RubyClass jrubyRefClass = runtime.defineClassUnder("JRubyCacheBackend", runtime.getObject(), BACKEND_ALLOCATOR, runtime.getModule("ThreadSafe"));
|
28
|
+
jrubyRefClass.setAllocator(BACKEND_ALLOCATOR);
|
29
|
+
jrubyRefClass.defineAnnotatedMethods(JRubyCacheBackend.class);
|
30
|
+
}
|
31
|
+
|
32
|
+
private static final ObjectAllocator BACKEND_ALLOCATOR = new ObjectAllocator() {
|
33
|
+
public IRubyObject allocate(Ruby runtime, RubyClass klazz) {
|
34
|
+
return new JRubyCacheBackend(runtime, klazz);
|
35
|
+
}
|
36
|
+
};
|
37
|
+
|
38
|
+
@JRubyClass(name="JRubyCacheBackend", parent="Object")
|
39
|
+
public static class JRubyCacheBackend extends RubyObject {
|
40
|
+
// Defaults used by the CHM
|
41
|
+
static final int DEFAULT_INITIAL_CAPACITY = 16;
|
42
|
+
static final float DEFAULT_LOAD_FACTOR = 0.75f;
|
43
|
+
|
44
|
+
public static final boolean CAN_USE_UNSAFE_CHM = canUseUnsafeCHM();
|
45
|
+
|
46
|
+
private ConcurrentHashMap<IRubyObject, IRubyObject> map;
|
47
|
+
|
48
|
+
private static ConcurrentHashMap<IRubyObject, IRubyObject> newCHM(int initialCapacity, float loadFactor) {
|
49
|
+
if (CAN_USE_UNSAFE_CHM) {
|
50
|
+
return new ConcurrentHashMapV8<IRubyObject, IRubyObject>(initialCapacity, loadFactor);
|
51
|
+
} else {
|
52
|
+
return new org.jruby.ext.thread_safe.jsr166e.nounsafe.ConcurrentHashMapV8<IRubyObject, IRubyObject>(initialCapacity, loadFactor);
|
53
|
+
}
|
54
|
+
}
|
55
|
+
|
56
|
+
private static ConcurrentHashMap<IRubyObject, IRubyObject> newCHM() {
|
57
|
+
return newCHM(DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR);
|
58
|
+
}
|
59
|
+
|
60
|
+
private static boolean canUseUnsafeCHM() {
|
61
|
+
try {
|
62
|
+
new org.jruby.ext.thread_safe.jsr166e.ConcurrentHashMapV8(); // force class load and initialization
|
63
|
+
return true;
|
64
|
+
} catch (Throwable t) { // ensuring we really do catch everything
|
65
|
+
// Doug's Unsafe setup errors always have this "Could not ini.." message
|
66
|
+
if (isCausedBySecurityException(t)) {
|
67
|
+
return false;
|
68
|
+
}
|
69
|
+
throw (t instanceof RuntimeException ? (RuntimeException) t : new RuntimeException(t));
|
70
|
+
}
|
71
|
+
}
|
72
|
+
|
73
|
+
private static boolean isCausedBySecurityException(Throwable t) {
|
74
|
+
while (t != null) {
|
75
|
+
if ((t.getMessage() != null && t.getMessage().contains("Could not initialize intrinsics")) || t instanceof SecurityException) {
|
76
|
+
return true;
|
77
|
+
}
|
78
|
+
t = t.getCause();
|
79
|
+
}
|
80
|
+
return false;
|
81
|
+
}
|
82
|
+
|
83
|
+
public JRubyCacheBackend(Ruby runtime, RubyClass klass) {
|
84
|
+
super(runtime, klass);
|
85
|
+
}
|
86
|
+
|
87
|
+
@JRubyMethod
|
88
|
+
public IRubyObject initialize(ThreadContext context) {
|
89
|
+
map = newCHM();
|
90
|
+
return context.getRuntime().getNil();
|
91
|
+
}
|
92
|
+
|
93
|
+
@JRubyMethod
|
94
|
+
public IRubyObject initialize(ThreadContext context, IRubyObject options) {
|
95
|
+
map = toCHM(context, options);
|
96
|
+
return context.getRuntime().getNil();
|
97
|
+
}
|
98
|
+
|
99
|
+
private ConcurrentHashMap<IRubyObject, IRubyObject> toCHM(ThreadContext context, IRubyObject options) {
|
100
|
+
Ruby runtime = context.getRuntime();
|
101
|
+
if (!options.isNil() && options.respondsTo("[]")) {
|
102
|
+
IRubyObject rInitialCapacity = options.callMethod(context, "[]", runtime.newSymbol("initial_capacity"));
|
103
|
+
IRubyObject rLoadFactor = options.callMethod(context, "[]", runtime.newSymbol("load_factor"));
|
104
|
+
int initialCapacity = !rInitialCapacity.isNil() ? RubyNumeric.num2int(rInitialCapacity.convertToInteger()) : DEFAULT_INITIAL_CAPACITY;
|
105
|
+
float loadFactor = !rLoadFactor.isNil() ? (float)RubyNumeric.num2dbl(rLoadFactor.convertToFloat()) : DEFAULT_LOAD_FACTOR;
|
106
|
+
return newCHM(initialCapacity, loadFactor);
|
107
|
+
} else {
|
108
|
+
return newCHM();
|
109
|
+
}
|
110
|
+
}
|
111
|
+
|
112
|
+
@JRubyMethod(name = "[]", required = 1)
|
113
|
+
public IRubyObject op_aref(ThreadContext context, IRubyObject key) {
|
114
|
+
IRubyObject value;
|
115
|
+
return ((value = map.get(key)) == null) ? context.getRuntime().getNil() : value;
|
116
|
+
}
|
117
|
+
|
118
|
+
@JRubyMethod(name = {"[]="}, required = 2)
|
119
|
+
public IRubyObject op_aset(IRubyObject key, IRubyObject value) {
|
120
|
+
map.put(key, value);
|
121
|
+
return value;
|
122
|
+
}
|
123
|
+
|
124
|
+
@JRubyMethod
|
125
|
+
public IRubyObject put_if_absent(IRubyObject key, IRubyObject value) {
|
126
|
+
IRubyObject result = map.putIfAbsent(key, value);
|
127
|
+
return result == null ? getRuntime().getNil() : result;
|
128
|
+
}
|
129
|
+
|
130
|
+
@JRubyMethod
|
131
|
+
public IRubyObject compute_if_absent(final ThreadContext context, final IRubyObject key, final Block block) {
|
132
|
+
return map.computeIfAbsent(key, new ConcurrentHashMap.Fun<IRubyObject, IRubyObject>() {
|
133
|
+
@Override
|
134
|
+
public IRubyObject apply(IRubyObject key) {
|
135
|
+
return block.yieldSpecific(context);
|
136
|
+
}
|
137
|
+
});
|
138
|
+
}
|
139
|
+
|
140
|
+
@JRubyMethod
|
141
|
+
public IRubyObject compute_if_present(final ThreadContext context, final IRubyObject key, final Block block) {
|
142
|
+
IRubyObject result = map.computeIfPresent(key, new ConcurrentHashMap.BiFun<IRubyObject, IRubyObject, IRubyObject>() {
|
143
|
+
@Override
|
144
|
+
public IRubyObject apply(IRubyObject key, IRubyObject oldValue) {
|
145
|
+
IRubyObject result = block.yieldSpecific(context, oldValue == null ? context.getRuntime().getNil() : oldValue);
|
146
|
+
return result.isNil() ? null : result;
|
147
|
+
}
|
148
|
+
});
|
149
|
+
return result == null ? context.getRuntime().getNil() : result;
|
150
|
+
}
|
151
|
+
|
152
|
+
@JRubyMethod
|
153
|
+
public IRubyObject compute(final ThreadContext context, final IRubyObject key, final Block block) {
|
154
|
+
IRubyObject result = map.compute(key, new ConcurrentHashMap.BiFun<IRubyObject, IRubyObject, IRubyObject>() {
|
155
|
+
@Override
|
156
|
+
public IRubyObject apply(IRubyObject key, IRubyObject oldValue) {
|
157
|
+
IRubyObject result = block.yieldSpecific(context, oldValue == null ? context.getRuntime().getNil() : oldValue);
|
158
|
+
return result.isNil() ? null : result;
|
159
|
+
}
|
160
|
+
});
|
161
|
+
return result == null ? context.getRuntime().getNil() : result;
|
162
|
+
}
|
163
|
+
|
164
|
+
@JRubyMethod
|
165
|
+
public IRubyObject merge_pair(final ThreadContext context, final IRubyObject key, final IRubyObject value, final Block block) {
|
166
|
+
IRubyObject result = map.merge(key, value, new ConcurrentHashMap.BiFun<IRubyObject, IRubyObject, IRubyObject>() {
|
167
|
+
@Override
|
168
|
+
public IRubyObject apply(IRubyObject oldValue, IRubyObject newValue) {
|
169
|
+
IRubyObject result = block.yieldSpecific(context, oldValue == null ? context.getRuntime().getNil() : oldValue);
|
170
|
+
return result.isNil() ? null : result;
|
171
|
+
}
|
172
|
+
});
|
173
|
+
return result == null ? context.getRuntime().getNil() : result;
|
174
|
+
}
|
175
|
+
|
176
|
+
@JRubyMethod
|
177
|
+
public RubyBoolean replace_pair(IRubyObject key, IRubyObject oldValue, IRubyObject newValue) {
|
178
|
+
return getRuntime().newBoolean(map.replace(key, oldValue, newValue));
|
179
|
+
}
|
180
|
+
|
181
|
+
@JRubyMethod(name = "key?", required = 1)
|
182
|
+
public RubyBoolean has_key_p(IRubyObject key) {
|
183
|
+
return map.containsKey(key) ? getRuntime().getTrue() : getRuntime().getFalse();
|
184
|
+
}
|
185
|
+
|
186
|
+
@JRubyMethod
|
187
|
+
public IRubyObject key(IRubyObject value) {
|
188
|
+
final IRubyObject key = map.findKey(value);
|
189
|
+
return key == null ? getRuntime().getNil() : key;
|
190
|
+
}
|
191
|
+
|
192
|
+
@JRubyMethod
|
193
|
+
public IRubyObject replace_if_exists(IRubyObject key, IRubyObject value) {
|
194
|
+
IRubyObject result = map.replace(key, value);
|
195
|
+
return result == null ? getRuntime().getNil() : result;
|
196
|
+
}
|
197
|
+
|
198
|
+
@JRubyMethod
|
199
|
+
public IRubyObject get_and_set(IRubyObject key, IRubyObject value) {
|
200
|
+
IRubyObject result = map.put(key, value);
|
201
|
+
return result == null ? getRuntime().getNil() : result;
|
202
|
+
}
|
203
|
+
|
204
|
+
@JRubyMethod
|
205
|
+
public IRubyObject delete(IRubyObject key) {
|
206
|
+
IRubyObject result = map.remove(key);
|
207
|
+
return result == null ? getRuntime().getNil() : result;
|
208
|
+
}
|
209
|
+
|
210
|
+
@JRubyMethod
|
211
|
+
public RubyBoolean delete_pair(IRubyObject key, IRubyObject value) {
|
212
|
+
return getRuntime().newBoolean(map.remove(key, value));
|
213
|
+
}
|
214
|
+
|
215
|
+
@JRubyMethod
|
216
|
+
public IRubyObject clear() {
|
217
|
+
map.clear();
|
218
|
+
return this;
|
219
|
+
}
|
220
|
+
|
221
|
+
@JRubyMethod
|
222
|
+
public IRubyObject each_pair(ThreadContext context, Block block) {
|
223
|
+
for (Map.Entry<IRubyObject,IRubyObject> entry : map.entrySet()) {
|
224
|
+
block.yieldSpecific(context, entry.getKey(), entry.getValue());
|
225
|
+
}
|
226
|
+
return this;
|
227
|
+
}
|
228
|
+
|
229
|
+
@JRubyMethod
|
230
|
+
public RubyFixnum size(ThreadContext context) {
|
231
|
+
return context.getRuntime().newFixnum(map.size());
|
232
|
+
}
|
233
|
+
|
234
|
+
@JRubyMethod
|
235
|
+
public IRubyObject get_or_default(IRubyObject key, IRubyObject defaultValue) {
|
236
|
+
return map.getValueOrDefault(key, defaultValue);
|
237
|
+
}
|
238
|
+
|
239
|
+
@JRubyMethod(visibility = PRIVATE)
|
240
|
+
public JRubyCacheBackend initialize_copy(ThreadContext context, IRubyObject other) {
|
241
|
+
map = newCHM();
|
242
|
+
return this;
|
243
|
+
}
|
244
|
+
}
|
245
|
+
}
|
data/vendor/gems/thread_safe-0.3.5-java/ext/org/jruby/ext/thread_safe/jsr166e/ConcurrentHashMap.java
ADDED
@@ -0,0 +1,31 @@
|
|
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
|
+
}
|
@@ -0,0 +1,3863 @@
|
|
1
|
+
/*
|
2
|
+
* Written by Doug Lea with assistance from members of JCP JSR-166
|
3
|
+
* Expert Group and released to the public domain, as explained at
|
4
|
+
* http://creativecommons.org/publicdomain/zero/1.0/
|
5
|
+
*/
|
6
|
+
|
7
|
+
// This is based on the 1.79 version.
|
8
|
+
|
9
|
+
package 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
|
+
}
|