logstash-output-scalyr 0.1.5 → 0.1.10.beta

data/vendor/bundle/jruby/2.5.0/gems/{connection_pool-2.2.3 → connection_pool-2.2.5}/test/test_connection_pool.rb

@@ -8,8 +8,14 @@ class TestConnectionPool < Minitest::Test
       @x = 0
     end
 
-    def do_something
-      @x += 1
+    def do_something(*_args, increment: 1)
+      @x += increment
+      sleep SLEEP_TIME
+      @x
+    end
+
+    def do_something_with_positional_hash(options)
+      @x += options[:increment] || 1
       sleep SLEEP_TIME
       @x
     end
@@ -117,6 +123,12 @@ class TestConnectionPool < Minitest::Test
     assert Thread.new { pool.checkout }.join
   end
 
+  def test_then
+    pool = ConnectionPool.new { Object.new }
+
+    assert_equal pool.method(:then), pool.method(:with)
+  end
+
   def test_with_timeout
     pool = ConnectionPool.new(timeout: 0, size: 1) { Object.new }
 
@@ -326,6 +338,8 @@ class TestConnectionPool < Minitest::Test
     assert_equal 2, pool.do_something
     assert_equal 5, pool.do_something_with_block { 3 }
     assert_equal 6, pool.with { |net| net.fast }
+    assert_equal 8, pool.do_something(increment: 2)
+    assert_equal 10, pool.do_something_with_positional_hash({ increment: 2, symbol_key: 3, "string_key" => 4 })
   end
 
   def test_passthru_respond_to

data/vendor/bundle/jruby/2.5.0/gems/{connection_pool-2.2.3 → connection_pool-2.2.5}/test/test_connection_pool_timed_stack.rb

@@ -102,6 +102,16 @@ class TestConnectionPoolTimedStack < Minitest::Test
     end
   end
 
+  def test_pop_shutdown_reload
+    stack = ConnectionPool::TimedStack.new(1) { Object.new }
+    object = stack.pop
+    stack.push(object)
+
+    stack.shutdown(reload: true) {}
+
+    refute_equal object, stack.pop
+  end
+
   def test_push
     stack = ConnectionPool::TimedStack.new(1) { Object.new }
 

data/vendor/bundle/jruby/2.5.0/gems/{net-http-persistent-4.0.0 → net-http-persistent-4.0.1}/History.txt

@@ -1,3 +1,9 @@
+=== 4.0.1 / 2021-01-12
+
+Bug fixes:
+
+* Loosen Ruby version requirement so Ruby 3.0 will work.
+
 === 4.0.0 / 2020-04-30
 
 Breaking changes:

data/vendor/bundle/jruby/2.5.0/gems/{net-http-persistent-4.0.0 → net-http-persistent-4.0.1}/Rakefile

@@ -13,7 +13,7 @@ Hoe.spec 'net-http-persistent' do
   self.readme_file      = 'README.rdoc'
   self.extra_rdoc_files += Dir['*.rdoc']
 
-  self.require_ruby_version '~> 2.3'
+  self.require_ruby_version '>= 2.3'
 
   license 'MIT'
 

data/vendor/bundle/jruby/2.5.0/gems/{net-http-persistent-4.0.0 → net-http-persistent-4.0.1}/lib/net/http/persistent.rb

@@ -172,7 +172,7 @@ class Net::HTTP::Persistent
   ##
   # The version of Net::HTTP::Persistent you are using
 
-  VERSION = '4.0.0'
+  VERSION = '4.0.1'
 
   ##
   # Error class for errors raised by Net::HTTP::Persistent.  Various

data/vendor/bundle/jruby/2.5.0/gems/quantile-0.2.1/LICENSE

@@ -0,0 +1,191 @@
+Apache License
+Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and
+distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright
+owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities
+that control, are controlled by, or are under common control with that entity.
+For the purposes of this definition, "control" means (i) the power, direct or
+indirect, to cause the direction or management of such entity, whether by
+contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the
+outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising
+permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including
+but not limited to software source code, documentation source, and configuration
+files.
+
+"Object" form shall mean any form resulting from mechanical transformation or
+translation of a Source form, including but not limited to compiled object code,
+generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made
+available under the License, as indicated by a copyright notice that is included
+in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that
+is based on (or derived from) the Work and for which the editorial revisions,
+annotations, elaborations, or other modifications represent, as a whole, an
+original work of authorship. For the purposes of this License, Derivative Works
+shall not include works that remain separable from, or merely link (or bind by
+name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version
+of the Work and any modifications or additions to that Work or Derivative Works
+thereof, that is intentionally submitted to Licensor for inclusion in the Work
+by the copyright owner or by an individual or Legal Entity authorized to submit
+on behalf of the copyright owner. For the purposes of this definition,
+"submitted" means any form of electronic, verbal, or written communication sent
+to the Licensor or its representatives, including but not limited to
+communication on electronic mailing lists, source code control systems, and
+issue tracking systems that are managed by, or on behalf of, the Licensor for
+the purpose of discussing and improving the Work, but excluding communication
+that is conspicuously marked or otherwise designated in writing by the copyright
+owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf
+of whom a Contribution has been received by Licensor and subsequently
+incorporated within the Work.
+
+2. Grant of Copyright License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable copyright license to reproduce, prepare Derivative Works of,
+publicly display, publicly perform, sublicense, and distribute the Work and such
+Derivative Works in Source or Object form.
+
+3. Grant of Patent License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable (except as stated in this section) patent license to make, have
+made, use, offer to sell, sell, import, and otherwise transfer the Work, where
+such license applies only to those patent claims licensable by such Contributor
+that are necessarily infringed by their Contribution(s) alone or by combination
+of their Contribution(s) with the Work to which such Contribution(s) was
+submitted. If You institute patent litigation against any entity (including a
+cross-claim or counterclaim in a lawsuit) alleging that the Work or a
+Contribution incorporated within the Work constitutes direct or contributory
+patent infringement, then any patent licenses granted to You under this License
+for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution.
+
+You may reproduce and distribute copies of the Work or Derivative Works thereof
+in any medium, with or without modifications, and in Source or Object form,
+provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of
+this License; and
+You must cause any modified files to carry prominent notices stating that You
+changed the files; and
+You must retain, in the Source form of any Derivative Works that You distribute,
+all copyright, patent, trademark, and attribution notices from the Source form
+of the Work, excluding those notices that do not pertain to any part of the
+Derivative Works; and
+If the Work includes a "NOTICE" text file as part of its distribution, then any
+Derivative Works that You distribute must include a readable copy of the
+attribution notices contained within such NOTICE file, excluding those notices
+that do not pertain to any part of the Derivative Works, in at least one of the
+following places: within a NOTICE text file distributed as part of the
+Derivative Works; within the Source form or documentation, if provided along
+with the Derivative Works; or, within a display generated by the Derivative
+Works, if and wherever such third-party notices normally appear. The contents of
+the NOTICE file are for informational purposes only and do not modify the
+License. You may add Your own attribution notices within Derivative Works that
+You distribute, alongside or as an addendum to the NOTICE text from the Work,
+provided that such additional attribution notices cannot be construed as
+modifying the License.
+You may add Your own copyright statement to Your modifications and may provide
+additional or different license terms and conditions for use, reproduction, or
+distribution of Your modifications, or for any such Derivative Works as a whole,
+provided Your use, reproduction, and distribution of the Work otherwise complies
+with the conditions stated in this License.
+
+5. Submission of Contributions.
+
+Unless You explicitly state otherwise, any Contribution intentionally submitted
+for inclusion in the Work by You to the Licensor shall be under the terms and
+conditions of this License, without any additional terms or conditions.
+Notwithstanding the above, nothing herein shall supersede or modify the terms of
+any separate license agreement you may have executed with Licensor regarding
+such Contributions.
+
+6. Trademarks.
+
+This License does not grant permission to use the trade names, trademarks,
+service marks, or product names of the Licensor, except as required for
+reasonable and customary use in describing the origin of the Work and
+reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty.
+
+Unless required by applicable law or agreed to in writing, Licensor provides the
+Work (and each Contributor provides its Contributions) on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,
+including, without limitation, any warranties or conditions of TITLE,
+NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are
+solely responsible for determining the appropriateness of using or
+redistributing the Work and assume any risks associated with Your exercise of
+permissions under this License.
+
+8. Limitation of Liability.
+
+In no event and under no legal theory, whether in tort (including negligence),
+contract, or otherwise, unless required by applicable law (such as deliberate
+and grossly negligent acts) or agreed to in writing, shall any Contributor be
+liable to You for damages, including any direct, indirect, special, incidental,
+or consequential damages of any character arising as a result of this License or
+out of the use or inability to use the Work (including but not limited to
+damages for loss of goodwill, work stoppage, computer failure or malfunction, or
+any and all other commercial damages or losses), even if such Contributor has
+been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability.
+
+While redistributing the Work or Derivative Works thereof, You may choose to
+offer, and charge a fee for, acceptance of support, warranty, indemnity, or
+other liability obligations and/or rights consistent with this License. However,
+in accepting such obligations, You may act only on Your own behalf and on Your
+sole responsibility, not on behalf of any other Contributor, and only if You
+agree to indemnify, defend, and hold each Contributor harmless for any liability
+incurred by, or claims asserted against, such Contributor by reason of your
+accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work
+
+To apply the Apache License to your work, attach the following boilerplate
+notice, with the fields enclosed by brackets "[]" replaced with your own
+identifying information. (Don't include the brackets!) The text should be
+enclosed in the appropriate comment syntax for the file format. We also
+recommend that a file or class name and description of purpose be included on
+the same "printed page" as the copyright notice for easier identification within
+third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+     http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/vendor/bundle/jruby/2.5.0/gems/quantile-0.2.1/README.md

@@ -0,0 +1,55 @@
+# Quantile
+
+Ruby Implementation of Graham Cormode and S. Muthukrishnan's [Effective
+Computation of Biased Quantiles over Data Streams][1] in ICDE’05.
+
+## Installation
+
+```bash
+gem install quantile
+```
+
+## Usage
+
+```ruby
+require 'quantile'
+
+estimator = Quantile::Estimator.new
+
+# Record any amount of Numeric values
+10_000.times do
+  estimator.observe(rand)
+end
+
+# Retrieve the value of a given quantile
+estimator.query(0.5)
+
+# Retrieve the number of observations
+estimator.observations
+
+# Get the sum of all observed values.
+estimator.sum
+```
+
+## Tests [![Build Status][2]][3]
+
+```bash
+# Install dependencies
+gem install bundler
+bundle install
+
+# Run tests
+rake test
+```
+
+## Resources
+
+  * [Paper: Effective Computation of Biased Quantiles over Data Streams][1]
+
+## Author
+
+Matt T. Proud <[matt.proud@gmail.com](mailto:matt.proud@gmail.com)>
+
+[1]: http://www.cs.rutgers.edu/~muthu/bquant.pdf
+[2]: https://secure.travis-ci.org/matttproud/ruby_quantile_estimation.png?branch=master
+[3]: http://travis-ci.org/matttproud/ruby_quantile_estimation

data/vendor/bundle/jruby/2.5.0/gems/quantile-0.2.1/lib/quantile.rb

@@ -0,0 +1,17 @@
+# Copyright 2013 Matt T. Proud
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+require_relative 'quantile/quantile'
+require_relative 'quantile/estimator'
+require_relative 'quantile/version'
+

data/vendor/bundle/jruby/2.5.0/gems/quantile-0.2.1/lib/quantile/estimator.rb

@@ -0,0 +1,186 @@
+# Copyright 2013 Matt T. Proud
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+module Quantile
+  #
+  # Estimate quantile values efficiently where both the rank and the inaccuracy
+  # allowance are known a priori.  This is accomplished via Graham Cormode and
+  # S\. Muthukrishnan's Effective Computation of Biased Quantiles over Data
+  # Streams in ICDE’05.
+  #
+  #
+  # @note {Estimator} is not concurrency safe.
+  #
+  # @see http://www.cs.rutgers.edu/~muthu/bquant.pdf Effective Computation of
+  #      Biased Quantiles over Data Streams
+  #
+  class Estimator
+    #
+    # Create a streaming quantile estimator.
+    #
+    # @param invariants [Quantile] The quantile estimation targets that are provided a priori.
+    # @return [Estimator] An initialized {Estimator} for the given targets.
+    #
+    def initialize(*invariants)
+      if invariants.empty?
+        invariants = [Quantile.new(0.5, 0.05), Quantile.new(0.90, 0.01), Quantile.new(0.99, 0.001)]
+      end
+
+      @invariants = invariants
+      @buffer = []
+      @head = nil
+
+      @observations, @sum = 0, 0
+    end
+
+    #
+    # Get the quantile targets.
+    #
+    attr_accessor :invariants
+
+    #
+    # Get the number of observed values.
+    #
+    def observations
+      flush
+      @observations
+    end
+
+    #
+    # Observe a sample value with this {Estimator}.
+    #
+    # @param value [Numeric] The value to catalog for later analysis.
+    #
+    def observe(value)
+      @buffer << value
+      if @buffer.size == BUFFER_SIZE
+        flush
+      end
+      @observations += 1
+      @sum += value
+    end
+
+    #
+    # Returns the sum of all observed values.
+    #
+    def sum
+      @sum
+    end
+
+    #
+    # Get a quantile value for a given rank.
+    #
+    # @param rank [Float] The target quantile to retrieve.  It *must* be one of
+    #                     the invariants provided in the constructor.
+    #
+    # @return [Numeric, nil]  The quantile value for the rank or nil if no
+    #   observations are present.
+    #
+    def query(rank)
+      flush
+
+      current = @head
+      return unless current
+
+      mid_rank = (rank * @observations).floor
+      max_rank = mid_rank + (invariant(mid_rank, @observations) / 2).floor
+
+      rank = 0.0
+      while current.successor
+        rank += current.rank
+        if rank + current.successor.rank + current.successor.delta > max_rank
+          return current.value
+        end
+
+        current = current.successor
+      end
+
+      return current.value
+    end
+
+    private
+
+    BUFFER_SIZE = 512
+
+    class Sample < Struct.new(:value, :rank, :delta, :successor); end
+
+    def flush
+      return if @buffer.empty?
+      @buffer.sort!
+      replace_batch
+      @buffer.clear
+      compress
+    end
+
+    def replace_batch
+      @head ||= record(@buffer.shift, 1, 0, nil)
+
+      rank = 0.0
+      current = @head
+
+      @buffer.each do |s|
+        if s < @head.value
+          @head = record(s, 1, 0, @head)
+        end
+
+        while current.successor && current.successor.value < s
+          rank += current.rank
+          current = current.successor
+        end
+
+        if current.successor
+          current.successor = record(s, 1, invariant(rank, @observations)-1, current.successor)
+        else
+          current.successor = record(s, 1, 0, nil)
+        end
+        current = current.successor
+      end
+    end
+
+    def record(value, rank, delta, successor)
+      return Sample.new(value, rank, delta, successor)
+    end
+
+    def invariant(rank, n)
+      min = n + 1
+
+      @invariants.each do |i|
+        delta = i.delta(rank, n)
+        if delta < min
+          min = delta
+        end
+      end
+
+      return min.floor
+    end
+
+    def compress
+      rank = 0.0
+      current = @head
+
+      while current && current.successor
+        if current.rank + current.successor.rank + current.successor.delta <= invariant(rank, @observations)
+          removed = current.successor
+
+          current.value = removed.value
+          current.rank += removed.rank
+          current.delta = removed.delta
+          current.successor = removed.successor
+        end
+
+        rank += current.rank
+        current = current.successor
+      end
+    end
+  end
+end