httpx 0.9.0 → 0.10.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e15b3e81842118829ecc251093ce5e80ad0c82dada2c7b2588004b2bf7313f63
-  data.tar.gz: 9d4efcb47f0c269f2c5b9a3c950fe8069c3b76ffb2f9624b557d29a702704712
+  metadata.gz: 3e3727a5374ad3c2d6d7c5dbfd61040e3aa3ea6c74aa6ad12d662a5bd0b9a7af
+  data.tar.gz: 7b1a2aa15418b03fc276b81cfaf0565bbce59dd531c2bfc10f19ddc60506213b
 SHA512:
-  metadata.gz: 9fbd146e351da8f603c8b00c236d92c7a2a3c383296736f271c88b0ac310086adf0127af7b630e9087ec45c4a22494128b2efafdb2592de43df4aae4a68ef1f3
-  data.tar.gz: eecb817b76bc0f217b728c7e862f73758e4b2db9c6a943311e0c7d10d8e7fe6bfa8e56a7c0d4593158fb605927813a1e720ec85a9d7e70aae8ecce015f5da647
+  metadata.gz: cda3ab9929396bdbad4ff38472dea4d7af34946e34cf995228ad5d52d05e37664b53f66e0a0ac8dd10193e55de52b4f7575f203bea8202b5474f0c3cca450d24
+  data.tar.gz: 025a985fc7c05abbb1bd66d23356d5165f7536d6565464e0729c618da624fc9f428e1046bba7c09dc5d7c23ada0587f73fb23e42128c96847857bcc1ccd6d408

data/LICENSE.txt

@@ -189,3 +189,51 @@
    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.
+
+
+* lib/httpx/domain_name.rb
+
+This file is derived from the implementation of punycode available at
+here:
+
+https://www.verisign.com/en_US/channel-resources/domain-registry-products/idn-sdks/index.xhtml
+
+Copyright (C) 2000-2002 Verisign Inc., All rights reserved.
+
+Redistribution and use in source and binary forms, with or
+without modification, are permitted provided that the following
+conditions are met:
+
+ 1) Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+ 2) Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.
+
+ 3) Neither the name of the VeriSign Inc. nor the names of its
+    contributors may be used to endorse or promote products derived
+    from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
+OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
+AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+This software is licensed under the BSD open source license. For more
+information visit www.opensource.org.
+
+Authors:
+ John Colosi (VeriSign)
+ Srikanth Veeramachaneni (VeriSign)
+ Nagesh Chigurupati (Verisign)
+ Praveen Srinivasan(Verisign)

data/README.md

@@ -18,6 +18,7 @@ Among its features, it supports:
 And also:
 
 * Compression (gzip, deflate, brotli)
+* Streaming Requests
 * Authentication (Basic Auth, Digest Auth)
 * Expect 100-continue
 * Multipart Requests
@@ -25,6 +26,7 @@ And also:
 * HTTP/2 Server Push
 * H2C Upgrade
 * Automatic follow redirects
+* International Domain Names
 
 ## How
 

data/doc/release_notes/0_10_0.md

@@ -0,0 +1,66 @@
+# 0.10.0
+
+## Features
+
+### Streaming Requests
+
+The `stream` plugin adds functionality to handle long-lived stream responses, such as the Twitter Streaming API:
+
+```ruby
+http = HTTPX.plugin(:stream)
+
+http.get(stream_api_endpoint, stream: true).each_line do |line|
+  payload = JSON.parse(line)
+  # do smth with this
+end
+```
+
+https://gitlab.com/honeyryderchuck/httpx/-/wikis/Stream
+
+### Rate Limiter
+
+The `rate_limiter` plugin adds functionality for automatically hooking into rate-limiting responses coming from the server, and waits-and-retries them according to what the server advertises.
+
+```ruby
+HTTPX.plugin(:rate_limiter).get(rate_limited_api_endpoint)
+# => 429 Too Many Requests .... Retry-After: 3
+# waits 3 seconds before retrying
+```
+
+https://gitlab.com/honeyryderchuck/httpx/-/wikis/Rate-Limiter
+
+### Ruby 3
+
+This release is the first testing against and targeting Ruby 3 and some of the new features.
+
+It ships with RBS signatures for all of the client-facing APIs. There's non 100% typinng coverage yet, but I'm gradually (pun intended) working on it.
+
+
+## Improvements
+
+### IDN support
+
+Requests where the domains are formed by non-ASCII characters, are now supported (if you're using ruby 2.3 or more recent).
+
+```ruby
+HTTPX.get("http://bücher.ch") # it works!
+```
+
+### cookies plugin full implementation
+
+
+The `cookies` plugin is now independent of 3rd-party gems. The motivation for this was that `http-cookie` was dependent of both `domain_name` and `unf` gems, which are currently unusable in ruby 3, and haven't received any update in the last 3 years.
+
+The implementation is still compliant with RFC6265, and all of the features provided in earlier versions were ported, exceptwhen loading the cookie jar stored in a Netscape-format file or Mozilla sqlite database, which were not documented for `httpx` anyway, and I considered too niche to backport. If you feel `httpx` should support those, do let me know.
+
+Some code from these gems, including the ruby punycode implementation, is now part of the source tree, along with its licenses and attribution mentions.
+
+## Bugfixes
+
+
+Several edge-case bugs have been fixed solely by the integration of RBS runtime type checking, including some bugs around closing a connection pool that can cause loops.
+
+
+## Regressions
+
+`HTTPX::ErrorResponse`'s methods `#headers` and `#reason` were removed, as they didn't provide much value. Consider calling `#raise_for_status` or checking the API (`is_a?(HTTPX::ErrorResponse)` or `respond_to?(:error)` are strategies for this).

data/lib/httpx.rb

@@ -5,6 +5,8 @@ require "httpx/version"
 require "httpx/extensions"
 
 require "httpx/errors"
+require "httpx/utils"
+require "httpx/domain_name"
 require "httpx/altsvc"
 require "httpx/callbacks"
 require "httpx/loggable"

data/lib/httpx/adapters/faraday.rb

@@ -121,7 +121,7 @@ module Faraday
           end
 
           def respond_to_missing?(meth)
-            @env.respond_to?(meth)
+            @env.respond_to?(meth) || super
           end
 
           def method_missing(meth, *args, &blk)

data/lib/httpx/chainable.rb

@@ -34,11 +34,11 @@ module HTTPX
       branch(default_options).wrap(&blk)
     end
 
-    def plugin(*args, **opts)
+    def plugin(*args, **opts, &blk)
       klass = is_a?(Session) ? self.class : Session
       klass = Class.new(klass)
       klass.instance_variable_set(:@default_options, klass.default_options.merge(default_options))
-      klass.plugin(*args, **opts).new
+      klass.plugin(*args, **opts, &blk).new
     end
 
     # deprecated

data/lib/httpx/connection.rb

@@ -51,7 +51,7 @@ module HTTPX
     def initialize(type, uri, options)
       @type = type
       @origins = [uri.origin]
-      @origin = URI(uri.origin)
+      @origin = Utils.uri(uri.origin)
       @options = Options.new(options)
       @window_size = @options.window_size
       @read_buffer = Buffer.new(BUFFER_SIZE)
@@ -142,7 +142,7 @@ module HTTPX
       end
     end
 
-    def purge_pending
+    def purge_pending(&block)
       pendings = []
       if @parser
         @inflight -= @parser.pending.size
@@ -150,9 +150,7 @@ module HTTPX
       end
       pendings << @pending
       pendings.each do |pending|
-        pending.reject! do |request|
-          yield request
-        end
+        pending.reject!(&block)
       end
     end
 
@@ -293,8 +291,6 @@ module HTTPX
               break
             end
 
-            log { "READ: #{siz} bytes..." }
-
             parser << @read_buffer.to_s
 
             break if @state == :closing || @state == :closed
@@ -317,7 +313,6 @@ module HTTPX
               on_error(ex)
               return
             end
-            log { "WRITE: #{siz} bytes..." }
 
             if siz.zero?
               write_drained = !@write_buffer.empty?
@@ -460,7 +455,6 @@ module HTTPX
       throw(:jump_tick)
     rescue Errno::ECONNREFUSED,
            Errno::EADDRNOTAVAIL,
-           Errno::EHOSTUNREACH,
            OpenSSL::SSL::SSLError => e
       # connect errors, exit gracefully
       handle_error(e)

data/lib/httpx/connection/http1.rb

@@ -181,7 +181,7 @@ module HTTPX
     def manage_connection(response)
       connection = response.headers["connection"]
       case connection
-      when /keep\-alive/i
+      when /keep-alive/i
         keep_alive = response.headers["keep-alive"]
         return unless keep_alive
 

data/lib/httpx/domain_name.rb

@@ -0,0 +1,440 @@
+# frozen_string_literal: true
+
+#
+# domain_name.rb - Domain Name manipulation library for Ruby
+#
+# Copyright (C) 2011-2017 Akinori MUSHA, All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions
+# are met:
+# 1. Redistributions of source code must retain the above copyright
+#    notice, this list of conditions and the following disclaimer.
+# 2. Redistributions in binary form must reproduce the above copyright
+#    notice, this list of conditions and the following disclaimer in the
+#    documentation and/or other materials provided with the distribution.
+#
+# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+# ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+# SUCH DAMAGE.
+
+require "ipaddr"
+
+module HTTPX
+  # Represents a domain name ready for extracting its registered domain
+  # and TLD.
+  class DomainName
+    include Comparable
+
+    # The full host name normalized, ASCII-ized and downcased using the
+    # Unicode NFC rules and the Punycode algorithm.  If initialized with
+    # an IP address, the string representation of the IP address
+    # suitable for opening a connection to.
+    attr_reader :hostname
+
+    # The Unicode representation of the #hostname property.
+    #
+    # :attr_reader: hostname_idn
+
+    # The least "universally original" domain part of this domain name.
+    # For example, "example.co.uk" for "www.sub.example.co.uk".  This
+    # may be nil if the hostname does not have one, like when it is an
+    # IP address, an effective TLD or higher itself, or of a
+    # non-canonical domain.
+    attr_reader :domain
+
+    DOT = "." # :nodoc:
+
+    class << self
+      def new(domain)
+        return domain if domain.is_a?(self)
+
+        super(domain)
+      end
+
+      # Normalizes a _domain_ using the Punycode algorithm as necessary.
+      # The result will be a downcased, ASCII-only string.
+      def normalize(domain)
+        domain = domain.ascii_only? ? domain : domain.chomp(DOT).unicode_normalize(:nfc)
+        Punycode.encode_hostname(domain).downcase
+      end
+    end
+
+    # Parses _hostname_ into a DomainName object.  An IP address is also
+    # accepted.  An IPv6 address may be enclosed in square brackets.
+    def initialize(hostname)
+      hostname = String(hostname)
+
+      raise ArgumentError, "domain name must not start with a dot: #{hostname}" if hostname.start_with?(DOT)
+
+      begin
+        @ipaddr = IPAddr.new(hostname)
+        @hostname = @ipaddr.to_s
+        return
+      rescue IPAddr::Error
+        nil
+      end
+
+      @hostname = DomainName.normalize(hostname)
+      tld = if (last_dot = @hostname.rindex(DOT))
+        @hostname[(last_dot + 1)..-1]
+      else
+        @hostname
+      end
+
+      # unknown/local TLD
+      @domain = if last_dot
+        # fallback - accept cookies down to second level
+        # cf. http://www.dkim-reputation.org/regdom-libs/
+        if (penultimate_dot = @hostname.rindex(DOT, last_dot - 1))
+          @hostname[(penultimate_dot + 1)..-1]
+        else
+          @hostname
+        end
+      else
+        # no domain part - must be a local hostname
+        tld
+      end
+    end
+
+    # Checks if the server represented by this domain is qualified to
+    # send and receive cookies with a domain attribute value of
+    # _domain_.  A true value given as the second argument represents
+    # cookies without a domain attribute value, in which case only
+    # hostname equality is checked.
+    def cookie_domain?(domain, host_only = false)
+      # RFC 6265 #5.3
+      # When the user agent "receives a cookie":
+      return self == @domain if host_only
+
+      domain = DomainName.new(domain)
+
+      # RFC 6265 #5.1.3
+      # Do not perform subdomain matching against IP addresses.
+      @hostname == domain.hostname if @ipaddr
+
+      # RFC 6265 #4.1.1
+      # Domain-value must be a subdomain.
+      @domain && self <= domain && domain <= @domain ? true : false
+    end
+
+    # def ==(other)
+    #   other = DomainName.new(other)
+    #   other.hostname == @hostname
+    # end
+
+    def <=>(other)
+      other = DomainName.new(other)
+      othername = other.hostname
+      if othername == @hostname
+        0
+      elsif @hostname.end_with?(othername) && @hostname[-othername.size - 1, 1] == DOT
+        # The other is higher
+        -1
+      elsif othername.end_with?(@hostname) && othername[-@hostname.size - 1, 1] == DOT
+        # The other is lower
+        1
+      else
+        1
+      end
+    end
+
+    # :nocov:
+    # rubocop:disable all
+    # -*- coding: utf-8 -*-
+    #--
+    # punycode.rb - PunyCode encoder for the Domain Name library
+    #
+    # Copyright (C) 2011-2017 Akinori MUSHA, All rights reserved.
+    #
+    # Ported from puny.c, a part of VeriSign XCode (encode/decode) IDN
+    # Library.
+    #
+    # Copyright (C) 2000-2002 Verisign Inc., All rights reserved.
+    #
+    # Redistribution and use in source and binary forms, with or
+    # without modification, are permitted provided that the following
+    # conditions are met:
+    #
+    #  1) Redistributions of source code must retain the above copyright
+    #     notice, this list of conditions and the following disclaimer.
+    #
+    #  2) Redistributions in binary form must reproduce the above copyright
+    #     notice, this list of conditions and the following disclaimer in
+    #     the documentation and/or other materials provided with the
+    #     distribution.
+    #
+    #  3) Neither the name of the VeriSign Inc. nor the names of its
+    #     contributors may be used to endorse or promote products derived
+    #     from this software without specific prior written permission.
+    #
+    # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+    # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+    # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+    # FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+    # COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+    # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+    # BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
+    # OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
+    # AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    # LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+    # ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+    # POSSIBILITY OF SUCH DAMAGE.
+    #
+    # This software is licensed under the BSD open source license. For more
+    # information visit www.opensource.org.
+    #
+    # Authors:
+    #  John Colosi (VeriSign)
+    #  Srikanth Veeramachaneni (VeriSign)
+    #  Nagesh Chigurupati (Verisign)
+    #  Praveen Srinivasan(Verisign)
+    #++
+    module Punycode
+      BASE = 36
+      TMIN = 1
+      TMAX = 26
+      SKEW = 38
+      DAMP = 700
+      INITIAL_BIAS = 72
+      INITIAL_N = 0x80
+      DELIMITER = "-"
+
+      MAXINT = (1 << 32) - 1
+
+      LOBASE = BASE - TMIN
+      CUTOFF = LOBASE * TMAX / 2
+
+      RE_NONBASIC = /[^\x00-\x7f]/.freeze
+
+      # Returns the numeric value of a basic code point (for use in
+      # representing integers) in the range 0 to base-1, or nil if cp
+      # is does not represent a value.
+      DECODE_DIGIT = {}.tap do |map|
+        # ASCII A..Z map to 0..25
+        # ASCII a..z map to 0..25
+        (0..25).each { |i| map[65 + i] = map[97 + i] = i }
+        # ASCII 0..9 map to 26..35
+        (26..35).each { |i| map[22 + i] = i }
+      end
+
+      # Returns the basic code point whose value (when used for
+      # representing integers) is d, which must be in the range 0 to
+      # BASE-1.  The lowercase form is used unless flag is true, in
+      # which case the uppercase form is used.  The behavior is
+      # undefined if flag is nonzero and digit d has no uppercase
+      # form.
+      ENCODE_DIGIT = proc { |d, flag|
+        (d + 22 + (d < 26 ? 75 : 0) - (flag ? (1 << 5) : 0)).chr
+        #  0..25 map to ASCII a..z or A..Z
+        # 26..35 map to ASCII 0..9
+      }
+
+      DOT = "."
+      PREFIX = "xn--"
+
+      # Most errors we raise are basically kind of ArgumentError.
+      class ArgumentError < ::ArgumentError; end
+      class BufferOverflowError < ArgumentError; end
+
+      class << self
+        # Encode a +string+ in Punycode
+        def encode(string)
+          input = string.unpack("U*")
+          output = +""
+
+          # Initialize the state
+          n = INITIAL_N
+          delta = 0
+          bias = INITIAL_BIAS
+
+          # Handle the basic code points
+          input.each { |cp| output << cp.chr if cp < 0x80 }
+
+          h = b = output.length
+
+          # h is the number of code points that have been handled, b is the
+          # number of basic code points, and out is the number of characters
+          # that have been output.
+
+          output << DELIMITER if b > 0
+
+          # Main encoding loop
+
+          while h < input.length
+            # All non-basic code points < n have been handled already.  Find
+            # the next larger one
+
+            m = MAXINT
+            input.each do |cp|
+              m = cp if (n...m) === cp
+            end
+
+            # Increase delta enough to advance the decoder's <n,i> state to
+            # <m,0>, but guard against overflow
+
+            delta += (m - n) * (h + 1)
+            raise BufferOverflowError if delta > MAXINT
+
+            n = m
+
+            input.each do |cp|
+              # AMC-ACE-Z can use this simplified version instead
+              if cp < n
+                delta += 1
+                raise BufferOverflowError if delta > MAXINT
+              elsif cp == n
+                # Represent delta as a generalized variable-length integer
+                q = delta
+                k = BASE
+                loop do
+                  t = k <= bias ? TMIN : k - bias >= TMAX ? TMAX : k - bias
+                  break if q < t
+
+                  q, r = (q - t).divmod(BASE - t)
+                  output << ENCODE_DIGIT[t + r, false]
+                  k += BASE
+                end
+
+                output << ENCODE_DIGIT[q, false]
+
+                # Adapt the bias
+                delta = h == b ? delta / DAMP : delta >> 1
+                delta += delta / (h + 1)
+                bias = 0
+                while delta > CUTOFF
+                  delta /= LOBASE
+                  bias += BASE
+                end
+                bias += (LOBASE + 1) * delta / (delta + SKEW)
+
+                delta = 0
+                h += 1
+              end
+            end
+
+            delta += 1
+            n += 1
+          end
+
+          output
+        end
+
+        # Encode a hostname using IDN/Punycode algorithms
+        def encode_hostname(hostname)
+          hostname.match(RE_NONBASIC) || (return hostname)
+
+          hostname.split(DOT).map do |name|
+            if name.match(RE_NONBASIC)
+              PREFIX + encode(name)
+            else
+              name
+            end
+          end.join(DOT)
+        end
+
+        # Decode a +string+ encoded in Punycode
+        def decode(string)
+          # Initialize the state
+          n = INITIAL_N
+          i = 0
+          bias = INITIAL_BIAS
+
+          if j = string.rindex(DELIMITER)
+            b = string[0...j]
+
+            b.match(RE_NONBASIC) &&
+              raise(ArgumentError, "Illegal character is found in basic part: #{string.inspect}")
+
+            # Handle the basic code points
+
+            output = b.unpack("U*")
+            u = string[(j + 1)..-1]
+          else
+            output = []
+            u = string
+          end
+
+          # Main decoding loop: Start just after the last delimiter if any
+          # basic code points were copied; start at the beginning
+          # otherwise.
+
+          input = u.unpack("C*")
+          input_length = input.length
+          h = 0
+          out = output.length
+
+          while h < input_length
+            # Decode a generalized variable-length integer into delta,
+            # which gets added to i.  The overflow checking is easier
+            # if we increase i as we go, then subtract off its starting
+            # value at the end to obtain delta.
+
+            oldi = i
+            w = 1
+            k = BASE
+
+            loop do
+              (digit = DECODE_DIGIT[input[h]]) ||
+                raise(ArgumentError, "Illegal character is found in non-basic part: #{string.inspect}")
+              h += 1
+              i += digit * w
+              raise BufferOverflowError if i > MAXINT
+
+              t = k <= bias ? TMIN : k - bias >= TMAX ? TMAX : k - bias
+              break if digit < t
+
+              w *= BASE - t
+              raise BufferOverflowError if w > MAXINT
+
+              k += BASE
+              (h < input_length) || raise(ArgumentError, "Malformed input given: #{string.inspect}")
+            end
+
+            # Adapt the bias
+            delta = oldi == 0 ? i / DAMP : (i - oldi) >> 1
+            delta += delta / (out + 1)
+            bias = 0
+            while delta > CUTOFF
+              delta /= LOBASE
+              bias += BASE
+            end
+            bias += (LOBASE + 1) * delta / (delta + SKEW)
+
+            # i was supposed to wrap around from out+1 to 0, incrementing
+            # n each time, so we'll fix that now:
+
+            q, i = i.divmod(out + 1)
+            n += q
+            raise BufferOverflowError if n > MAXINT
+
+            # Insert n at position i of the output:
+
+            output[i, 0] = n
+
+            out += 1
+            i += 1
+          end
+          output.pack("U*")
+        end
+
+        # Decode a hostname using IDN/Punycode algorithms
+        def decode_hostname(hostname)
+          hostname.gsub(/(\A|#{Regexp.quote(DOT)})#{Regexp.quote(PREFIX)}([^#{Regexp.quote(DOT)}]*)/o) do
+            Regexp.last_match(1) << decode(Regexp.last_match(2))
+          end
+        end
+      end
+      # rubocop:enable all
+      # :nocov:
+    end
+  end
+end