cloudsmith-api 0.49.21 → 0.51.34

data/vendor/bundle/ruby/2.6.0/gems/hashdiff-1.0.0/changelog.md

@@ -1,96 +0,0 @@
-# Change Log
-
-## 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/2.6.0/gems/hashdiff-1.0.0/hashdiff.gemspec

@@ -1,39 +0,0 @@
-# frozen_string_literal: true
-
-$LOAD_PATH << File.expand_path('lib', __dir__)
-require 'hashdiff/version'
-
-Gem::Specification.new do |s|
-  s.name        = 'hashdiff'
-  s.version     = Hashdiff::VERSION
-  s.license     = 'MIT'
-  s.summary     = ' Hashdiff is a diff lib to compute the smallest difference between two hashes. '
-  s.description = ' Hashdiff is a diff lib to compute the smallest difference between two hashes. '
-
-  s.files         = `git ls-files`.split("\n")
-  s.test_files    = `git ls-files -- Appraisals {spec}/*`.split("\n")
-
-  s.require_paths = ['lib']
-  s.required_ruby_version = Gem::Requirement.new('>= 2.0.0')
-
-  s.authors = ['Liu Fengyun']
-  s.email   = ['liufengyunchina@gmail.com']
-
-  s.homepage = 'https://github.com/liufengyun/hashdiff'
-
-  s.add_development_dependency('bluecloth')
-  s.add_development_dependency('rspec', '~> 2.0')
-  s.add_development_dependency('rubocop')
-  s.add_development_dependency('rubocop-rspec')
-  s.add_development_dependency('yard')
-
-  if s.respond_to?(:metadata)
-    s.metadata = {
-      'bug_tracker_uri' => 'https://github.com/liufengyun/hashdiff/issues',
-      'changelog_uri' => 'https://github.com/liufengyun/hashdiff/blob/master/changelog.md',
-      'documentation_uri' => 'https://www.rubydoc.info/gems/hashdiff',
-      'homepage_uri' => 'https://github.com/liufengyun/hashdiff',
-      'source_code_uri' => 'https://github.com/liufengyun/hashdiff'
-    }
-  end
-end

data/vendor/bundle/ruby/2.6.0/gems/hashdiff-1.0.0/lib/hashdiff/compare_hashes.rb

@@ -1,56 +0,0 @@
-# frozen_string_literal: true
-
-module Hashdiff
-  # @private
-  # Used to compare hashes
-  class CompareHashes
-    class << self
-      def call(obj1, obj2, opts = {})
-        return [] if obj1.empty? && obj2.empty?
-
-        obj1_keys = obj1.keys
-        obj2_keys = obj2.keys
-
-        added_keys = (obj2_keys - obj1_keys).sort_by(&:to_s)
-        common_keys = (obj1_keys & obj2_keys).sort_by(&:to_s)
-        deleted_keys = (obj1_keys - obj2_keys).sort_by(&:to_s)
-
-        result = []
-
-        # add deleted properties
-        deleted_keys.each do |k|
-          change_key = Hashdiff.prefix_append_key(opts[:prefix], k, opts)
-          custom_result = Hashdiff.custom_compare(opts[:comparison], change_key, obj1[k], nil)
-
-          if custom_result
-            result.concat(custom_result)
-          else
-            result << ['-', change_key, obj1[k]]
-          end
-        end
-
-        # recursive comparison for common keys
-        common_keys.each do |k|
-          prefix = Hashdiff.prefix_append_key(opts[:prefix], k, opts)
-
-          result.concat(Hashdiff.diff(obj1[k], obj2[k], opts.merge(prefix: prefix)))
-        end
-
-        # added properties
-        added_keys.each do |k|
-          change_key = Hashdiff.prefix_append_key(opts[:prefix], k, opts)
-
-          custom_result = Hashdiff.custom_compare(opts[:comparison], change_key, nil, obj2[k])
-
-          if custom_result
-            result.concat(custom_result)
-          else
-            result << ['+', change_key, obj2[k]]
-          end
-        end
-
-        result
-      end
-    end
-  end
-end

data/vendor/bundle/ruby/2.6.0/gems/hashdiff-1.0.0/lib/hashdiff/diff.rb

@@ -1,174 +0,0 @@
-# frozen_string_literal: true
-
-module Hashdiff
-  # Best diff two objects, which tries to generate the smallest change set using different similarity values.
-  #
-  # Hashdiff.best_diff is useful in case of comparing two objects which include similar hashes in arrays.
-  #
-  # @param [Array, Hash] obj1
-  # @param [Array, Hash] obj2
-  # @param [Hash] options the options to use when comparing
-  #   * :strict (Boolean) [true] whether numeric values will be compared on type as well as value.  Set to false to allow comparing Integer, Float, BigDecimal to each other
-  #   * :delimiter (String) ['.'] the delimiter used when returning nested key references
-  #   * :numeric_tolerance (Numeric) [0] should be a positive numeric value.  Value by which numeric differences must be greater than.  By default, numeric values are compared exactly; with the :tolerance option, the difference between numeric values must be greater than the given value.
-  #   * :strip (Boolean) [false] whether or not to call #strip on strings before comparing
-  #   * :array_path (Boolean) [false] whether to return the path references for nested values in an array, can be used for patch compatibility with non string keys.
-  #   * :use_lcs (Boolean) [true] whether or not to use an implementation of the Longest common subsequence algorithm for comparing arrays, produces better diffs but is slower.
-  #
-  # @yield [path, value1, value2] Optional block is used to compare each value, instead of default #==. If the block returns value other than true of false, then other specified comparison options will be used to do the comparison.
-  #
-  # @return [Array] an array of changes.
-  #   e.g. [[ '+', 'a.b', '45' ], [ '-', 'a.c', '5' ], [ '~', 'a.x', '45', '63']]
-  #
-  # @example
-  #   a = {'x' => [{'a' => 1, 'c' => 3, 'e' => 5}, {'y' => 3}]}
-  #   b = {'x' => [{'a' => 1, 'b' => 2, 'e' => 5}] }
-  #   diff = Hashdiff.best_diff(a, b)
-  #   diff.should == [['-', 'x[0].c', 3], ['+', 'x[0].b', 2], ['-', 'x[1].y', 3], ['-', 'x[1]', {}]]
-  #
-  # @since 0.0.1
-  def self.best_diff(obj1, obj2, options = {}, &block)
-    options[:comparison] = block if block_given?
-
-    opts = { similarity: 0.3 }.merge!(options)
-    diffs1 = diff(obj1, obj2, opts)
-    count1 = count_diff diffs1
-
-    opts = { similarity: 0.5 }.merge!(options)
-    diffs2 = diff(obj1, obj2, opts)
-    count2 = count_diff diffs2
-
-    opts = { similarity: 0.8 }.merge!(options)
-    diffs3 = diff(obj1, obj2, opts)
-    count3 = count_diff diffs3
-
-    count, diffs = count1 < count2 ? [count1, diffs1] : [count2, diffs2]
-    count < count3 ? diffs : diffs3
-  end
-
-  # Compute the diff of two hashes or arrays
-  #
-  # @param [Array, Hash] obj1
-  # @param [Array, Hash] obj2
-  # @param [Hash] options the options to use when comparing
-  #   * :strict (Boolean) [true] whether numeric values will be compared on type as well as value.  Set to false to allow comparing Integer, Float, BigDecimal to each other
-  #   * :similarity (Numeric) [0.8] should be between (0, 1]. Meaningful if there are similar hashes in arrays. See {best_diff}.
-  #   * :delimiter (String) ['.'] the delimiter used when returning nested key references
-  #   * :numeric_tolerance (Numeric) [0] should be a positive numeric value.  Value by which numeric differences must be greater than.  By default, numeric values are compared exactly; with the :tolerance option, the difference between numeric values must be greater than the given value.
-  #   * :strip (Boolean) [false] whether or not to call #strip on strings before comparing
-  #   * :array_path (Boolean) [false] whether to return the path references for nested values in an array, can be used for patch compatibility with non string keys.
-  #   * :use_lcs (Boolean) [true] whether or not to use an implementation of the Longest common subsequence algorithm for comparing arrays, produces better diffs but is slower.
-  #
-  #
-  # @yield [path, value1, value2] Optional block is used to compare each value, instead of default #==. If the block returns value other than true of false, then other specified comparison options will be used to do the comparison.
-  #
-  # @return [Array] an array of changes.
-  #   e.g. [[ '+', 'a.b', '45' ], [ '-', 'a.c', '5' ], [ '~', 'a.x', '45', '63']]
-  #
-  # @example
-  #   a = {"a" => 1, "b" => {"b1" => 1, "b2" =>2}}
-  #   b = {"a" => 1, "b" => {}}
-  #
-  #   diff = Hashdiff.diff(a, b)
-  #   diff.should == [['-', 'b.b1', 1], ['-', 'b.b2', 2]]
-  #
-  # @since 0.0.1
-  def self.diff(obj1, obj2, options = {}, &block)
-    opts = {
-      prefix: '',
-      similarity: 0.8,
-      delimiter: '.',
-      strict: true,
-      strip: false,
-      numeric_tolerance: 0,
-      array_path: false,
-      use_lcs: true
-    }.merge!(options)
-
-    opts[:prefix] = [] if opts[:array_path] && opts[:prefix] == ''
-
-    opts[:comparison] = block if block_given?
-
-    # prefer to compare with provided block
-    result = custom_compare(opts[:comparison], opts[:prefix], obj1, obj2)
-    return result if result
-
-    return [] if obj1.nil? && obj2.nil?
-
-    return [['~', opts[:prefix], obj1, obj2]] if obj1.nil? || obj2.nil?
-
-    return [['~', opts[:prefix], obj1, obj2]] unless comparable?(obj1, obj2, opts[:strict])
-
-    return LcsCompareArrays.call(obj1, obj2, opts) if obj1.is_a?(Array) && opts[:use_lcs]
-
-    return LinearCompareArray.call(obj1, obj2, opts) if obj1.is_a?(Array) && !opts[:use_lcs]
-
-    return CompareHashes.call(obj1, obj2, opts) if obj1.is_a?(Hash)
-
-    return [] if compare_values(obj1, obj2, opts)
-
-    [['~', opts[:prefix], obj1, obj2]]
-  end
-
-  # @private
-  #
-  # diff array using LCS algorithm
-  def self.diff_array_lcs(arraya, arrayb, options = {})
-    return [] if arraya.empty? && arrayb.empty?
-
-    change_set = []
-
-    if arraya.empty?
-      arrayb.each_index do |index|
-        change_set << ['+', index, arrayb[index]]
-      end
-
-      return change_set
-    end
-
-    if arrayb.empty?
-      arraya.each_index do |index|
-        i = arraya.size - index - 1
-        change_set << ['-', i, arraya[i]]
-      end
-
-      return change_set
-    end
-
-    opts = {
-      prefix: '',
-      similarity: 0.8,
-      delimiter: '.'
-    }.merge!(options)
-
-    links = lcs(arraya, arrayb, opts)
-
-    # yield common
-    yield links if block_given?
-
-    # padding the end
-    links << [arraya.size, arrayb.size]
-
-    last_x = -1
-    last_y = -1
-    links.each do |pair|
-      x, y = pair
-
-      # remove from a, beginning from the end
-      (x > last_x + 1) && (x - last_x - 2).downto(0).each do |i|
-        change_set << ['-', last_y + i + 1, arraya[i + last_x + 1]]
-      end
-
-      # add from b, beginning from the head
-      (y > last_y + 1) && 0.upto(y - last_y - 2).each do |i|
-        change_set << ['+', last_y + i + 1, arrayb[i + last_y + 1]]
-      end
-
-      # update flags
-      last_x = x
-      last_y = y
-    end
-
-    change_set
-  end
-end

data/vendor/bundle/ruby/2.6.0/gems/hashdiff-1.0.0/lib/hashdiff/util.rb

@@ -1,154 +0,0 @@
-# frozen_string_literal: true
-
-module Hashdiff
-  # @private
-  #
-  # judge whether two objects are similar
-  def self.similar?(obja, objb, options = {})
-    return compare_values(obja, objb, options) if !options[:comparison] && !any_hash_or_array?(obja, objb)
-
-    count_a = count_nodes(obja)
-    count_b = count_nodes(objb)
-
-    return true if (count_a + count_b).zero?
-
-    opts = { similarity: 0.8 }.merge!(options)
-
-    diffs = count_diff diff(obja, objb, opts)
-
-    (1 - diffs.to_f / (count_a + count_b).to_f) >= opts[:similarity]
-  end
-
-  # @private
-  #
-  # count node differences
-  def self.count_diff(diffs)
-    diffs.inject(0) do |sum, item|
-      old_change_count = count_nodes(item[2])
-      new_change_count = count_nodes(item[3])
-      sum + (old_change_count + new_change_count)
-    end
-  end
-
-  # @private
-  #
-  # count total nodes for an object
-  def self.count_nodes(obj)
-    return 0 unless obj
-
-    count = 0
-    if obj.is_a?(Array)
-      obj.each { |e| count += count_nodes(e) }
-    elsif obj.is_a?(Hash)
-      obj.each_value { |v| count += count_nodes(v) }
-    else
-      return 1
-    end
-
-    count
-  end
-
-  # @private
-  #
-  # decode property path into an array
-  # @param [String] path Property-string
-  # @param [String] delimiter Property-string delimiter
-  #
-  # e.g. "a.b[3].c" => ['a', 'b', 3, 'c']
-  def self.decode_property_path(path, delimiter = '.')
-    path.split(delimiter).inject([]) do |memo, part|
-      if part =~ /^(.*)\[(\d+)\]$/
-        if !Regexp.last_match(1).empty?
-          memo + [Regexp.last_match(1), Regexp.last_match(2).to_i]
-        else
-          memo + [Regexp.last_match(2).to_i]
-        end
-      else
-        memo + [part]
-      end
-    end
-  end
-
-  # @private
-  #
-  # get the node of hash by given path parts
-  def self.node(hash, parts)
-    temp = hash
-    parts.each do |part|
-      temp = temp[part]
-    end
-    temp
-  end
-
-  # @private
-  #
-  # check for equality or "closeness" within given tolerance
-  def self.compare_values(obj1, obj2, options = {})
-    if options[:numeric_tolerance].is_a?(Numeric) &&
-       obj1.is_a?(Numeric) && obj2.is_a?(Numeric)
-      return (obj1 - obj2).abs <= options[:numeric_tolerance]
-    end
-
-    if options[:strip] == true
-      obj1 = obj1.strip if obj1.respond_to?(:strip)
-      obj2 = obj2.strip if obj2.respond_to?(:strip)
-    end
-
-    if options[:case_insensitive] == true
-      obj1 = obj1.downcase if obj1.respond_to?(:downcase)
-      obj2 = obj2.downcase if obj2.respond_to?(:downcase)
-    end
-
-    obj1 == obj2
-  end
-
-  # @private
-  #
-  # check if objects are comparable
-  def self.comparable?(obj1, obj2, strict = true)
-    return true if (obj1.is_a?(Array) || obj1.is_a?(Hash)) && obj2.is_a?(obj1.class)
-    return true if !strict && obj1.is_a?(Numeric) && obj2.is_a?(Numeric)
-
-    obj1.is_a?(obj2.class) && obj2.is_a?(obj1.class)
-  end
-
-  # @private
-  #
-  # try custom comparison
-  def self.custom_compare(method, key, obj1, obj2)
-    return unless method
-
-    res = method.call(key, obj1, obj2)
-
-    # nil != false here
-    return [['~', key, obj1, obj2]] if res == false
-    return [] if res == true
-  end
-
-  def self.prefix_append_key(prefix, key, opts)
-    if opts[:array_path]
-      prefix + [key]
-    else
-      prefix.empty? ? key.to_s : "#{prefix}#{opts[:delimiter]}#{key}"
-    end
-  end
-
-  def self.prefix_append_array_index(prefix, array_index, opts)
-    if opts[:array_path]
-      prefix + [array_index]
-    else
-      "#{prefix}[#{array_index}]"
-    end
-  end
-
-  class << self
-    private
-
-    # @private
-    #
-    # checks if both objects are Arrays or Hashes
-    def any_hash_or_array?(obja, objb)
-      obja.is_a?(Array) || obja.is_a?(Hash) || objb.is_a?(Array) || objb.is_a?(Hash)
-    end
-  end
-end