acfs 2.0.0 → 2.2.1

data/vendor/bundle/ruby/3.4.0/gems/benchmark-0.4.0/README.md

@@ -1,138 +0,0 @@
-# Benchmark
-
-The Benchmark module provides methods for benchmarking Ruby code, giving detailed reports on the time taken for each task.
-
-## Installation
-
-Add this line to your application's Gemfile:
-
-```ruby
-gem 'benchmark'
-```
-
-And then execute:
-
-    $ bundle
-
-Or install it yourself as:
-
-    $ gem install benchmark
-
-## Usage
-
-The Benchmark module provides methods to measure and report the time used to execute Ruby code.
-
-Measure the time to construct the string given by the expression <code>"a"*1_000_000_000</code>:
-
-```ruby
-require 'benchmark'
-puts Benchmark.measure { "a"*1_000_000_000 }
-```
-
-On my machine (OSX 10.8.3 on i5 1.7 GHz) this generates:
-
-```
-0.350000   0.400000   0.750000 (  0.835234)
-```
-
-This report shows the user CPU time, system CPU time, the sum of the user and system CPU times, and the elapsed real time. The unit of time is seconds.
-
-Do some experiments sequentially using the #bm method:
-
-```ruby
-require 'benchmark'
-n = 5000000
-Benchmark.bm do |x|
-  x.report { for i in 1..n; a = "1"; end }
-  x.report { n.times do   ; a = "1"; end }
-  x.report { 1.upto(n) do ; a = "1"; end }
-end
-```
-
-The result:
-
-```
-    user     system      total        real
-1.010000   0.000000   1.010000 (  1.014479)
-1.000000   0.000000   1.000000 (  0.998261)
-0.980000   0.000000   0.980000 (  0.981335)
-```
-
-Continuing the previous example, put a label in each report:
-
-```ruby
-require 'benchmark'
-n = 5000000
-Benchmark.bm(7) do |x|
-  x.report("for:")   { for i in 1..n; a = "1"; end }
-  x.report("times:") { n.times do   ; a = "1"; end }
-  x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-end
-```
-
-The result:
-
-```
-              user     system      total        real
-for:      1.010000   0.000000   1.010000 (  1.015688)
-times:    1.000000   0.000000   1.000000 (  1.003611)
-upto:     1.030000   0.000000   1.030000 (  1.028098)
-```
-
-The times for some benchmarks depend on the order in which items are run.  These differences are due to the cost of memory allocation and garbage collection. To avoid these discrepancies, the #bmbm method is provided.  For example, to compare ways to sort an array of floats:
-
-```ruby
-require 'benchmark'
-array = (1..1000000).map { rand }
-Benchmark.bmbm do |x|
-  x.report("sort!") { array.dup.sort! }
-  x.report("sort")  { array.dup.sort  }
-end
-```
-
-The result:
-
-```
-Rehearsal -----------------------------------------
-sort!   1.490000   0.010000   1.500000 (  1.490520)
-sort    1.460000   0.000000   1.460000 (  1.463025)
--------------------------------- total: 2.960000sec
-            user     system      total        real
-sort!   1.460000   0.000000   1.460000 (  1.460465)
-sort    1.450000   0.010000   1.460000 (  1.448327)
-```
-
-Report statistics of sequential experiments with unique labels, using the #benchmark method:
-
-```ruby
-require 'benchmark'
-include Benchmark         # we need the CAPTION and FORMAT constants
-n = 5000000
-Benchmark.benchmark(CAPTION, 7, FORMAT, ">total:", ">avg:") do |x|
-  tf = x.report("for:")   { for i in 1..n; a = "1"; end }
-  tt = x.report("times:") { n.times do   ; a = "1"; end }
-  tu = x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-  [tf+tt+tu, (tf+tt+tu)/3]
-end
-```
-
-The result:
-
-```
-             user     system      total        real
-for:      0.950000   0.000000   0.950000 (  0.952039)
-times:    0.980000   0.000000   0.980000 (  0.984938)
-upto:     0.950000   0.000000   0.950000 (  0.946787)
->total:   2.880000   0.000000   2.880000 (  2.883764)
->avg:     0.960000   0.000000   0.960000 (  0.961255)
-```
-
-## Development
-
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
-
-To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
-
-## Contributing
-
-Bug reports and pull requests are welcome on GitHub at https://github.com/ruby/benchmark.

data/vendor/bundle/ruby/3.4.0/gems/benchmark-0.4.0/benchmark.gemspec

@@ -1,32 +0,0 @@
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", Array.new(name.count("-")+1, ".").join("/")].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Yukihiro Matsumoto"]
-  spec.email         = ["matz@ruby-lang.org"]
-
-  spec.summary       = %q{a performance benchmarking library}
-  spec.description   = spec.summary
-  spec.homepage      = "https://github.com/ruby/benchmark"
-  spec.licenses       = ["Ruby", "BSD-2-Clause"]
-
-  spec.required_ruby_version = ">= 2.1.0"
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = "exe"
-  spec.executables   = []
-  spec.require_paths = ["lib"]
-end

data/vendor/bundle/ruby/3.4.0/gems/connection_pool-2.5.0/connection_pool.gemspec

@@ -1,24 +0,0 @@
-require "./lib/connection_pool/version"
-
-Gem::Specification.new do |s|
-  s.name = "connection_pool"
-  s.version = ConnectionPool::VERSION
-  s.platform = Gem::Platform::RUBY
-  s.authors = ["Mike Perham", "Damian Janowski"]
-  s.email = ["mperham@gmail.com", "damian@educabilia.com"]
-  s.homepage = "https://github.com/mperham/connection_pool"
-  s.description = s.summary = "Generic connection pool for Ruby"
-
-  s.files = ["Changes.md", "LICENSE", "README.md", "connection_pool.gemspec",
-    "lib/connection_pool.rb", "lib/connection_pool/timed_stack.rb",
-    "lib/connection_pool/version.rb", "lib/connection_pool/wrapper.rb"]
-  s.executables = []
-  s.require_paths = ["lib"]
-  s.license = "MIT"
-  s.add_development_dependency "bundler"
-  s.add_development_dependency "minitest", ">= 5.0.0"
-  s.add_development_dependency "rake"
-  s.required_ruby_version = ">= 2.5.0"
-
-  s.metadata = {"changelog_uri" => "https://github.com/mperham/connection_pool/blob/main/Changes.md", "rubygems_mfa_required" => "true"}
-end

data/vendor/bundle/ruby/3.4.0/gems/diff-lcs-1.5.1/README.rdoc

@@ -1,84 +0,0 @@
-= Diff::LCS
-
-home :: https://github.com/halostatue/diff-lcs
-code :: https://github.com/halostatue/diff-lcs
-bugs :: https://github.com/halostatue/diff-lcs/issues
-rdoc :: http://rubydoc.info/github/halostatue/diff-lcs
-continuous integration :: {<img src="https://github.com/halostatue/diff-lcs/workflows/CI/badge.svg" />}[https://github.com/halostatue/diff-lcs/actions]
-
-== Description
-
-Diff::LCS computes the difference between two Enumerable sequences using the
-McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities
-to create a simple HTML diff output format and a standard diff-like tool.
-
-This is release 1.4.3, providing a simple extension that allows for
-Diff::LCS::Change objects to be treated implicitly as arrays and fixes a
-number of formatting issues.
-
-Ruby versions below 2.5 are soft-deprecated, which means that older versions
-are no longer part of the CI test suite. If any changes have been introduced
-that break those versions, bug reports and patches will be accepted, but it
-will be up to the reporter to verify any fixes prior to release. The next
-major release will completely break compatibility.
-
-== Synopsis
-
-Using this module is quite simple. By default, Diff::LCS does not extend
-objects with the Diff::LCS interface, but will be called as if it were a
-function:
-
-  require 'diff/lcs'
-
-  seq1 = %w(a b c e h j l m n p)
-  seq2 = %w(b c d e f j k l m r s t)
-
-  lcs = Diff::LCS.LCS(seq1, seq2)
-  diffs = Diff::LCS.diff(seq1, seq2)
-  sdiff = Diff::LCS.sdiff(seq1, seq2)
-  seq = Diff::LCS.traverse_sequences(seq1, seq2, callback_obj)
-  bal = Diff::LCS.traverse_balanced(seq1, seq2, callback_obj)
-  seq2 == Diff::LCS.patch!(seq1, diffs)
-  seq1 == Diff::LCS.unpatch!(seq2, diffs)
-  seq2 == Diff::LCS.patch!(seq1, sdiff)
-  seq1 == Diff::LCS.unpatch!(seq2, sdiff)
-
-Objects can be extended with Diff::LCS:
-
-  seq1.extend(Diff::LCS)
-  lcs = seq1.lcs(seq2)
-  diffs = seq1.diff(seq2)
-  sdiff = seq1.sdiff(seq2)
-  seq = seq1.traverse_sequences(seq2, callback_obj)
-  bal = seq1.traverse_balanced(seq2, callback_obj)
-  seq2 == seq1.patch!(diffs)
-  seq1 == seq2.unpatch!(diffs)
-  seq2 == seq1.patch!(sdiff)
-  seq1 == seq2.unpatch!(sdiff)
-
-By requiring 'diff/lcs/array' or 'diff/lcs/string', Array or String will be
-extended for use this way.
-
-Note that Diff::LCS requires a sequenced enumerable container, which means that
-the order of enumeration is both predictable and consistent for the same set of
-data. While it is theoretically possible to generate a diff for an unordered
-hash, it will only be meaningful if the enumeration of the hashes is
-consistent. In general, this will mean that containers that behave like String
-or Array will perform best.
-
-== History
-
-Diff::LCS is a port of Perl's Algorithm::Diff that uses the McIlroy-Hunt
-longest common subsequence (LCS) algorithm to compute intelligent differences
-between two sequenced enumerable containers. The implementation is based on
-Mario I. Wolczko's
-{Smalltalk version 1.2}[ftp://st.cs.uiuc.edu/pub/Smalltalk/MANCHESTER/manchester/4.0/diff.st]
-(1993) and Ned Konz's Perl version
-{Algorithm::Diff 1.15}[http://search.cpan.org/~nedkonz/Algorithm-Diff-1.15/].
-Diff::LCS#sdiff and Diff::LCS#traverse_balanced were originally written for the
-Perl version by Mike Schilli.
-
-The algorithm is described in <em>A Fast Algorithm for Computing Longest Common
-Subsequences</em>, CACM, vol.20, no.5, pp.350-353, May 1977, with a few minor
-improvements to improve the speed. A simplified description of the algorithm,
-originally written for the Perl version, was written by Mark-Jason Dominus.

data/vendor/bundle/ruby/3.4.0/gems/ethon-0.16.0/ethon.gemspec

@@ -1,26 +0,0 @@
-# encoding: utf-8
-# frozen_string_literal: true
-lib = File.expand_path('../lib/', __FILE__)
-$:.unshift lib unless $:.include?(lib)
-
-require 'ethon/version'
-
-Gem::Specification.new do |s|
-  s.name         = "ethon"
-  s.version      = Ethon::VERSION
-  s.platform     = Gem::Platform::RUBY
-  s.authors      = ["Hans Hasselberg"]
-  s.email        = ["me@hans.io"]
-  s.homepage     = "https://github.com/typhoeus/ethon"
-  s.summary      = "Libcurl wrapper."
-  s.description  = "Very lightweight libcurl wrapper."
-
-  s.required_rubygems_version = ">= 1.3.6"
-  s.license = 'MIT'
-
-  s.add_dependency('ffi', ['>= 1.15.0'])
-
-  s.files        = `git ls-files`.split("\n")
-  s.test_files   = `git ls-files -- spec/*`.split("\n")
-  s.require_path = 'lib'
-end

data/vendor/bundle/ruby/3.4.0/gems/hashdiff-1.1.2/changelog.md

@@ -1,119 +0,0 @@
-# Change Log
-
-## v1.1.2 2024-11-12
-
-* Fix bundler cache #96 (@olleolleolle)
-* Quote the '3.0' in YAML #95 (@olleolleolle)
-* Fix version in source code #97 (@liufengyun)
-
-## v1.1.1 2024-08-02
-
-* Fix bug in ignore_keys option #88 (@Matzfan)
-* Exclude spec files from gem package #94 (@amatsuda)
-
-## v1.1.0 2023-12-14
-
-* Add ignore_keys option (#86 @Matzfan)
-* Remove pinned version of rake < 11
-* Bump rspec dep ~> 3.5
-* Bump rubocop dep >= 1.52.1
-* Bump rubocop-rspec dep > 1.16.0
-
-## v1.0.1 2020-02-25
-
-* Add indifferent option
-
-## v1.0.0 2019-06-06
-
-* Fix typo in readme (#72 @koic)
-* Fix Rubocop offence (#73 @koic)
-* Bumps version to v1.0.0 (#74 @jfelchner)
-
-## v1.0.0.beta1 2019-06-06
-
-* fix warnings in ci (#69 @y-yagi)
-* drop warnings of the constant change (#70 @jfelchner)
-
-## v0.4.0 2019-05-28
-
-* refactoring (#56 #57 #59 #61 krzysiek1507)
-* fix typo in README (#64 @pboling)
-* change HashDiff to Hashdiff (#65 @jfelchner)
-
-## v0.3.9 2019-04-22
-
-* Performance tweak (thanks @krzysiek1507: #51 #52 #53)
-
-## v0.3.8 2018-12-30
-
-* Add Rubocop and drops Ruby 1.9 support #47
-
-## v0.3.7 2017-10-08
-
-* remove 1.8.7 support from gemspec #39
-
-## v0.3.6 2017-08-22
-
-* add option `use_lcs` #35
-
-## v0.3.5 2017-08-06
-
-* add option `array_path` #34
-
-## v0.3.4 2017-05-01
-
-* performance improvement of `#similar?` #31
-
-## v0.3.2 2016-12-27
-
-* replace `Fixnum` by `Integer` #28
-
-## v0.3.1 2016-11-24
-
-* fix an error when a hash has mixed types #26
-
-## v0.3.0 2016-2-11
-
-* support `:case_insensitive` option
-
-## v0.2.3 2015-11-5
-
-* improve performance of LCS algorithm #12
-
-## v0.2.2 2014-10-6
-
-* make library 1.8.7 compatible
-
-## v0.2.1 2014-7-13
-
-* yield added/deleted keys for custom comparison
-
-## v0.2.0 2014-3-29
-
-* support custom comparison blocks
-* support `:strip`, `:numeric_tolerance` and `:strict` options
-
-## v0.1.0 2013-8-25
-
-* use options for parameters `:delimiter` and `:similarity` in interfaces
-
-## v0.0.6 2013-3-2
-
-* Add parameter for custom property-path delimiter.
-
-## v0.0.5 2012-7-1
-
-* fix a bug in judging whehter two objects are similiar.
-* add more spec test for `.best_diff`
-
-## v0.0.4 2012-6-24
-
-Main changes in this version is to output the whole object in addition & deletion, instead of recursely add/deletes the object.
-
-For example, `diff({a:2, c:[4, 5]}, {a:2}) will generate following output:
-
-    [['-', 'c', [4, 5]]]
-
-instead of following:
-
-    [['-', 'c[0]', 4], ['-', 'c[1]', 5], ['-', 'c', []]]

data/vendor/bundle/ruby/3.4.0/gems/logger-1.6.5/logger.gemspec

@@ -1,28 +0,0 @@
-begin
-  require_relative "lib/logger/version"
-rescue LoadError # Fallback to load version file in ruby core repository
-  require_relative "version"
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = "logger"
-  spec.version       = Logger::VERSION
-  spec.authors       = ["Naotoshi Seo", "SHIBATA Hiroshi"]
-  spec.email         = ["sonots@gmail.com", "hsbt@ruby-lang.org"]
-
-  spec.summary       = %q{Provides a simple logging utility for outputting messages.}
-  spec.description   = %q{Provides a simple logging utility for outputting messages.}
-  spec.homepage      = "https://github.com/ruby/logger"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.require_paths = ["lib"]
-
-  spec.required_ruby_version = ">= 2.5.0"
-
-  spec.metadata["changelog_uri"] = spec.homepage + "/releases"
-end