cloudsmith-api 2.0.21 → 2.0.22

data/vendor/bundle/ruby/2.6.0/gems/{rexml-3.4.1 → rexml-3.4.4}/lib/rexml/validation/relaxng.rb

@@ -157,16 +157,16 @@ module REXML
         if ( @events[@current].matches?(event) )
           @current += 1
           if @events[@current].nil?
-            return @previous.pop
+            @previous.pop
           elsif @events[@current].kind_of? State
             @current += 1
             @events[@current-1].previous = self
-            return @events[@current-1]
+            @events[@current-1]
           else
-            return self
+            self
           end
         else
-          return nil
+          nil
         end
       end
 
@@ -186,7 +186,7 @@ module REXML
       end
 
       def expected
-        return [@events[@current]]
+        [@events[@current]]
       end
 
       def <<( event )
@@ -244,7 +244,7 @@ module REXML
             evt = :end_attribute
           end
         end
-        return Event.new( evt, arg )
+        Event.new( evt, arg )
       end
     end
 
@@ -262,9 +262,10 @@ module REXML
           rv = super
           return rv if rv
           @prior = @previous.pop
-          return @prior.next( event )
+          @prior.next( event )
+        else
+          super
         end
-        super
       end
 
       def matches?(event)
@@ -274,7 +275,7 @@ module REXML
 
       def expected
         return [ @prior.expected, @events[0] ].flatten if @current == 0
-        return [@events[@current]]
+        [@events[@current]]
       end
     end
 
@@ -286,24 +287,24 @@ module REXML
           @current += 1
           if @events[@current].nil?
             @current = 0
-            return self
+            self
           elsif @events[@current].kind_of? State
             @current += 1
             @events[@current-1].previous = self
-            return @events[@current-1]
+            @events[@current-1]
           else
-            return self
+            self
           end
         else
           @prior = @previous.pop
           return @prior.next( event ) if @current == 0
-          return nil
+          nil
         end
       end
 
       def expected
         return [ @prior.expected, @events[0] ].flatten if @current == 0
-        return [@events[@current]]
+        [@events[@current]]
       end
     end
 
@@ -326,17 +327,17 @@ module REXML
           @ord += 1
           if @events[@current].nil?
             @current = 0
-            return self
+            self
           elsif @events[@current].kind_of? State
             @current += 1
             @events[@current-1].previous = self
-            return @events[@current-1]
+            @events[@current-1]
           else
-            return self
+            self
           end
         else
           return @previous.pop.next( event ) if @current == 0 and @ord > 0
-          return nil
+          nil
         end
       end
 
@@ -347,9 +348,9 @@ module REXML
 
       def expected
         if @current == 0 and @ord > 0
-          return [@previous[-1].expected, @events[0]].flatten
+          [@previous[-1].expected, @events[0]].flatten
         else
-          return [@events[@current]]
+          [@events[@current]]
         end
       end
     end
@@ -403,7 +404,7 @@ module REXML
 
       def expected
         return [@events[@current]] if @events.size > 0
-        return @choices.collect do |x|
+        @choices.collect do |x|
           if x[0].kind_of? State
             x[0].expected
           else
@@ -490,16 +491,16 @@ module REXML
           @current += 1
           if @events[@current].nil?
             return self unless @choices[@choice].nil?
-            return @previous.pop
+            @previous.pop
           elsif @events[@current].kind_of? State
             @current += 1
             @events[@current-1].previous = self
-            return @events[@current-1]
+            @events[@current-1]
           else
-            return self
+            self
           end
         else
-          return nil
+          nil
         end
       end
 
@@ -510,7 +511,7 @@ module REXML
 
       def expected
         return [@events[@current]] if @events[@current]
-        return @choices[@choice..-1].collect do |x|
+        @choices[@choice..-1].collect do |x|
           if x[0].kind_of? State
             x[0].expected
           else

data/vendor/bundle/ruby/2.6.0/gems/{rexml-3.4.1 → rexml-3.4.4}/lib/rexml/validation/validation.rb

@@ -80,26 +80,26 @@ module REXML
       end
 
       def single?
-        return (@event_type != :start_element and @event_type != :start_attribute)
+        (@event_type != :start_element and @event_type != :start_attribute)
       end
 
       def matches?( event )
         return false unless event[0] == @event_type
         case event[0]
         when nil
-          return true
+          true
         when :start_element
-          return true if event[1] == @event_arg
+          event[1] == @event_arg
         when :end_element
-          return true
+          true
         when :start_attribute
-          return true if event[1] == @event_arg
+          event[1] == @event_arg
         when :end_attribute
-          return true
+          true
         when :end_document
-          return true
+          true
         when :text
-          return (@event_arg.nil? or @event_arg == event[1])
+          @event_arg.nil? || @event_arg == event[1]
 =begin
         when :processing_instruction
           false

data/vendor/bundle/ruby/2.6.0/gems/{rexml-3.4.1 → rexml-3.4.4}/lib/rexml/xpath.rb

@@ -31,12 +31,7 @@ module REXML
     def XPath::first(element, path=nil, namespaces=nil, variables={}, options={})
       raise "The namespaces argument, if supplied, must be a hash object." unless namespaces.nil? or namespaces.kind_of?(Hash)
       raise "The variables argument, if supplied, must be a hash object." unless variables.kind_of?(Hash)
-      parser = XPathParser.new(**options)
-      parser.namespaces = namespaces
-      parser.variables = variables
-      path = "*" unless path
-      element = [element] unless element.kind_of? Array
-      parser.parse(path, element).flatten[0]
+      match(element, path, namespaces, variables, options).flatten[0]
     end
 
     # Iterates over nodes that match the given path, calling the supplied
@@ -60,12 +55,7 @@ module REXML
     def XPath::each(element, path=nil, namespaces=nil, variables={}, options={}, &block)
       raise "The namespaces argument, if supplied, must be a hash object." unless namespaces.nil? or namespaces.kind_of?(Hash)
       raise "The variables argument, if supplied, must be a hash object." unless variables.kind_of?(Hash)
-      parser = XPathParser.new(**options)
-      parser.namespaces = namespaces
-      parser.variables = variables
-      path = "*" unless path
-      element = [element] unless element.kind_of? Array
-      parser.parse(path, element).each( &block )
+      match(element, path, namespaces, variables, options).each( &block )
     end
 
     # Returns an array of nodes matching a given XPath.
@@ -74,7 +64,6 @@ module REXML
       parser.namespaces = namespaces
       parser.variables = variables
       path = "*" unless path
-      element = [element] unless element.kind_of? Array
       parser.parse(path,element)
     end
   end

data/vendor/bundle/ruby/2.6.0/gems/{rexml-3.4.1 → rexml-3.4.4}/lib/rexml/xpath_parser.rb

@@ -76,19 +76,32 @@ module REXML
       @variables = vars
     end
 
-    def parse path, nodeset
+    def parse path, node
       path_stack = @parser.parse( path )
-      match( path_stack, nodeset )
+      if node.is_a?(Array)
+        Kernel.warn("REXML::XPath.each, REXML::XPath.first, REXML::XPath.match dropped support for nodeset...", uplevel: 1)
+        return [] if node.empty?
+        node = node.first
+      end
+
+      document = node.document
+      if document
+        document.__send__(:enable_cache) do
+          match( path_stack, node )
+        end
+      else
+        match( path_stack, node )
+      end
     end
 
-    def get_first path, nodeset
+    def get_first path, node
       path_stack = @parser.parse( path )
-      first( path_stack, nodeset )
+      first( path_stack, node )
     end
 
-    def predicate path, nodeset
+    def predicate path, node
       path_stack = @parser.parse( path )
-      match( path_stack, nodeset )
+      match( path_stack, node )
     end
 
     def []=( variable_name, value )
@@ -106,7 +119,7 @@ module REXML
       case path[0]
       when :document
         # do nothing
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
       when :child
         for c in node.children
           r = first( path[1..-1], c )
@@ -116,9 +129,9 @@ module REXML
         name = path[2]
         if node.name == name
           return node if path.size == 3
-          return first( path[3..-1], node )
+          first( path[3..-1], node )
         else
-          return nil
+          nil
         end
       when :descendant_or_self
         r = first( path[1..-1], node )
@@ -128,23 +141,21 @@ module REXML
           return r if r
         end
       when :node
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
       when :any
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
+      else
+        nil
       end
-      return nil
     end
 
 
-    def match(path_stack, nodeset)
-      nodeset = nodeset.collect.with_index do |node, i|
-        position = i + 1
-        XPathNode.new(node, position: position)
-      end
+    def match(path_stack, node)
+      nodeset = [XPathNode.new(node, position: 1)]
       result = expr(path_stack, nodeset)
       case result
       when Array # nodeset
-        unnode(result)
+        unnode(result).uniq
       else
         [result]
       end
@@ -162,10 +173,10 @@ module REXML
     #  2. If no mapping was supplied, use the context node to look up the namespace
     def get_namespace( node, prefix )
       if @namespaces
-        return @namespaces[prefix] || ''
+        @namespaces[prefix] || ''
       else
         return node.namespace( prefix ) if node.node_type == :element
-        return ''
+        ''
       end
     end
 
@@ -492,14 +503,10 @@ module REXML
                 if strict?
                   raw_node.name == name and raw_node.namespace == ""
                 else
-                  # FIXME: This DOUBLES the time XPath searches take
-                  ns = get_namespace(raw_node, prefix)
-                  raw_node.name == name and raw_node.namespace == ns
+                  raw_node.name == name and raw_node.namespace == get_namespace(raw_node, prefix)
                 end
               else
-                # FIXME: This DOUBLES the time XPath searches take
-                ns = get_namespace(raw_node, prefix)
-                raw_node.name == name and raw_node.namespace == ns
+                raw_node.name == name and raw_node.namespace == get_namespace(raw_node, prefix)
               end
             when :attribute
               if prefix.nil?
@@ -507,9 +514,7 @@ module REXML
               elsif prefix.empty?
                 raw_node.name == name and raw_node.namespace == ""
               else
-                # FIXME: This DOUBLES the time XPath searches take
-                ns = get_namespace(raw_node.element, prefix)
-                raw_node.name == name and raw_node.namespace == ns
+                raw_node.name == name and raw_node.namespace == get_namespace(raw_node.element, prefix)
               end
             else
               false
@@ -671,7 +676,7 @@ module REXML
         if order == :forward
           index
         else
-          -index
+          index.map(&:-@)
         end
       end
       ordered.collect do |_index, node|
@@ -758,22 +763,19 @@ module REXML
     end
 
     def following_node_of( node )
-      if node.kind_of? Element and node.children.size > 0
-        return node.children[0]
-      end
-      return next_sibling_node(node)
+      return node.children[0] if node.kind_of?(Element) and node.children.size > 0
+
+      next_sibling_node(node)
     end
 
     def next_sibling_node(node)
       psn = node.next_sibling_node
       while psn.nil?
-        if node.parent.nil? or node.parent.class == Document
-          return nil
-        end
+        return nil if node.parent.nil? or node.parent.class == Document
         node = node.parent
         psn = node.next_sibling_node
       end
-      return psn
+      psn
     end
 
     def child(nodeset)
@@ -806,13 +808,13 @@ module REXML
     def norm b
       case b
       when true, false
-        return b
+        b
       when 'true', 'false'
-        return Functions::boolean( b )
+        Functions::boolean( b )
       when /^\d+(\.\d+)?$/, Numeric
-        return Functions::number( b )
+        Functions::number( b )
       else
-        return Functions::string( b )
+        Functions::string( b )
       end
     end
 

data/vendor/bundle/ruby/2.6.0/gems/{rspec-support-3.13.4 → rspec-support-3.13.6}/Changelog.md

@@ -1,5 +1,22 @@
 ### Development
-[Full Changelog](https://github.com/rspec/rspec/compare/rspec-support-v3.13.2...3-13-maintenance)
+[Full Changelog](https://github.com/rspec/rspec/compare/rspec-support-v3.13.6...3-13-maintenance)
+
+### 3.13.6
+[Full Changelog](http://github.com/rspec/rspec/compare/rspec-support-v3.13.5...rspec-support-v3.13.6)
+
+Bug Fixes:
+
+* Change `RSpec::Support::HunkGenerator` to autoload rather than manual require, avoids
+  a load order issue. (Jon Rowe, rspec/rspec#249)
+
+### 3.13.5
+[Full Changelog](http://github.com/rspec/rspec/compare/rspec-support-v3.13.4...rspec-support-v3.13.5)
+
+Bug Fixes:
+
+* Fix regression in `RSpec::Support::MethodSignature` where positional argument arity confused
+  a check for keyword arguments, meaning a hash would be wrongly detected as keyword arguments
+  when it should have been a positional argument. (Malcolm O'Hare, rspec/rspec#121)
 
 ### 3.13.4
 [Full Changelog](http://github.com/rspec/rspec/compare/rspec-support-v3.13.3...rspec-support-v3.13.4)

data/vendor/bundle/ruby/2.6.0/gems/{rspec-support-3.13.4 → rspec-support-3.13.6}/lib/rspec/support/differ.rb

@@ -1,7 +1,6 @@
 # frozen_string_literal: true
 
 RSpec::Support.require_rspec_support 'encoded_string'
-RSpec::Support.require_rspec_support 'hunk_generator'
 RSpec::Support.require_rspec_support "object_formatter"
 
 require 'pp'

data/vendor/bundle/ruby/2.6.0/gems/{rspec-support-3.13.4 → rspec-support-3.13.6}/lib/rspec/support/method_signature_verifier.rb

@@ -79,12 +79,37 @@ module RSpec
           given_kw_args - @allowed_kw_args
         end
 
-        # If the last argument is Hash, Ruby will treat only symbol keys as keyword arguments
-        # the rest will be grouped in another Hash and passed as positional argument.
-        def has_kw_args_in?(args)
-          Hash === args.last &&
-            could_contain_kw_args?(args) &&
-            (RubyFeatures.kw_arg_separation? || args.last.empty? || args.last.keys.any? { |x| x.is_a?(Symbol) })
+        # Considering the arg types, are there kw_args?
+        if RubyFeatures.kw_arg_separation?
+          def has_kw_args_in?(args)
+            # If the last arg is a hash, depending on the signature it could be kw_args or a positional parameter.
+            return false unless Hash === args.last && could_contain_kw_args?(args)
+
+            # If the position of the hash is beyond the count of required and optional positional
+            # args then it is the kwargs hash
+            return true if args.count > @max_non_kw_args
+
+            # This is the proper way to disambiguate between positional args and keywords hash
+            # but relies on beginning of the call chain annotating the method with
+            # ruby2_keywords, so only use it for positive feedback as without the annotation
+            # this is always false
+            return true if Hash.ruby2_keywords_hash?(args[-1])
+
+            # Otherwise, the hash could be defined kw_args or an optional positional parameter
+            # inspect the keys against known kwargs to determine what it is
+            # Note: the problem with this is that if a user passes only invalid keyword args,
+            #       rspec no longer detects is and will assign this to a positional argument
+            return arbitrary_kw_args? || args.last.keys.all? { |x| @allowed_kw_args.include?(x) }
+          end
+        else
+          def has_kw_args_in?(args)
+            # Version <= Ruby 2.7
+            # If the last argument is Hash, Ruby will treat only symbol keys as keyword arguments
+            # the rest will be grouped in another Hash and passed as positional argument.
+            Hash === args.last &&
+              could_contain_kw_args?(args) &&
+              (args.last.empty? || args.last.keys.any? { |x| x.is_a?(Symbol) })
+          end
         end
 
         # Without considering what the last arg is, could it
@@ -282,7 +307,7 @@ module RSpec
 
       def initialize(signature, args=[])
         @signature = signature
-        @non_kw_args, @kw_args = split_args(*args)
+        @non_kw_args, @kw_args = split_args(args.clone)
         @min_non_kw_args = @max_non_kw_args = @non_kw_args
         @arbitrary_kw_args = @unlimited_args = false
       end
@@ -362,7 +387,7 @@ module RSpec
         !@unlimited_args || @signature.unlimited_args?
       end
 
-      def split_args(*args)
+      def split_args(args)
         kw_args = if @signature.has_kw_args_in?(args) && !RubyFeatures.kw_arg_separation?
                     last = args.pop
                     non_kw_args = last.reject { |k, _| k.is_a?(Symbol) }
@@ -395,13 +420,13 @@ module RSpec
     class LooseSignatureVerifier < MethodSignatureVerifier
     private
 
-      def split_args(*args)
+      def split_args(args)
         if RSpec::Support.is_a_matcher?(args.last) && @signature.could_contain_kw_args?(args)
           args.pop
           @signature = SignatureWithKeywordArgumentsMatcher.new(@signature)
         end
 
-        super(*args)
+        super(args)
       end
 
       # If a matcher is used in a signature in place of keyword arguments, all

data/vendor/bundle/ruby/2.6.0/gems/{rspec-support-3.13.4 → rspec-support-3.13.6}/lib/rspec/support/version.rb

@@ -3,7 +3,7 @@
 module RSpec
   module Support
     module Version
-      STRING = '3.13.4'
+      STRING = '3.13.6'
     end
   end
 end

data/vendor/bundle/ruby/2.6.0/gems/{rspec-support-3.13.4 → rspec-support-3.13.6}/lib/rspec/support.rb

@@ -158,5 +158,6 @@ module RSpec
     # pp, etc by avoiding an unnecessary require. Instead, autoload will take
     # care of loading the differ on first use.
     autoload :Differ, "rspec/support/differ"
+    autoload :HunkGenerator, "rspec/support/hunk_generator"
   end
 end

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/CHANGES.md

@@ -1,3 +1,8 @@
+## 1.4.0 - 26-Aug-2025
+* The sysname, nodename, release, version and machine methods are now memoized.
+* The memoist gem has been added as a dependency.
+* Specs added for memoization.
+
 ## 1.3.1 - 19-Nov-2024
 * Remove a useless ostruct require. Thanks go to Koichi Ito for the spot and patch.
 

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/README.md

@@ -26,6 +26,14 @@ p Sys::Uname.uname
 p Sys::Platform.linux? # => true
 p Sys::Platform::ARCH  # => :x86_64
 ```
+
+## Memoist Notes
+As of version 1.4.0 most methods are memoized via the memoist gem since
+these values are unlikely to change during without a restart/reboot. As
+per the memoist documentation, you can force a cache flush if desired to
+refresh the values.
+
+https://github.com/matthewrudy/memoist
    
 ## BSD flavors, including OS X
 Users on BSD platforms get the extra `Uname.model` method.

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/Rakefile

@@ -34,6 +34,9 @@ end
 RuboCop::RakeTask.new
 
 desc "Run the test suite"
-RSpec::Core::RakeTask.new(:spec)
+RSpec::Core::RakeTask.new(:spec) do |t|
+  t.verbose = true
+  t.rspec_opts = '-f documentation'
+end
 
 task :default => :spec

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/doc/uname.rdoc

@@ -80,7 +80,7 @@ https://github.com/djberg96/sys-uname
 Apache-2.0
 
 == Copyright
-(C) 2002-2024 Daniel J. Berger
+(C) 2002-2025 Daniel J. Berger
 All Rights Reserved
 
 == Warranty

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/lib/sys/uname.rb

@@ -3,7 +3,7 @@
 module Sys
   class Uname
     # The version of the sys-uname gem.
-    VERSION = '1.3.1'
+    VERSION = '1.4.0'
   end
 
   class Platform

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/lib/sys/unix/uname.rb

@@ -2,6 +2,7 @@
 
 require 'ffi'
 require 'rbconfig'
+require 'memoist'
 
 # The Sys module serves as a namespace only.
 module Sys
@@ -246,6 +247,15 @@ module Sys
       end
     end
 
+    class << self
+      extend Memoist
+      memoize :sysname
+      memoize :nodename
+      memoize :release
+      memoize :version
+      memoize :machine
+    end
+
     private
 
     # Returns the model for systems that define sysctl().

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/lib/sys/windows/uname.rb

@@ -3,6 +3,7 @@
 require 'socket'
 require 'time'
 require 'win32ole'
+require 'memoist'
 
 # The Sys module provides a namespace only.
 module Sys
@@ -476,6 +477,15 @@ module Sys
       end
     end
 
+    class << self
+      extend Memoist
+      memoize :sysname
+      memoize :nodename
+      memoize :release
+      memoize :version
+      memoize :machine
+    end
+
     # Converts a string in the format '20040703074625.015625-360' into a
     # Ruby Time object.
     #

data/vendor/bundle/ruby/2.6.0/gems/{sys-uname-1.3.1 → sys-uname-1.4.0}/spec/sys_platform_spec.rb

@@ -9,7 +9,7 @@ require 'spec_helper'
 
 RSpec.describe Sys::Platform do
   example 'the VERSION constant is set to the expected value' do
-    expect(Sys::Platform::VERSION).to eql('1.3.1')
+    expect(Sys::Platform::VERSION).to eql('1.4.0')
     expect(Sys::Platform::VERSION).to be_frozen
   end