text: """
  The MIT License (MIT)
  
  Copyright (c) 2015-2021 Rapptz
  Copyright (c) 2021-present Disnake Development
  
  Permission is hereby granted, free of charge, to any person obtaining a
  copy of this software and associated documentation files (the "Software"),
  to deal in the Software without restriction, including without limitation
  the rights to use, copy, modify, merge, publish, distribute, sublicense,
  and/or sell copies of the Software, and to permit persons to whom the
  Software is furnished to do so, subject to the following conditions:
  
  The above copyright notice and this permission notice shall be included in
  all copies or substantial portions of the Software.
  
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  DEALINGS IN THE SOFTWARE.
  """
  
  from __future__ import annotations
  
  
  import time
  import random
  from typing import Callable, Generic, Literal, TypeVar, overload, Union
  
  T = TypeVar("T", bool, Literal[True], Literal[False])
  
  __all__ = ("ExponentialBackoff",)
  
  
  class ExponentialBackoff(Generic[T]):
      """An implementation of the exponential backoff algorithm
  
      Provides a convenient interface to implement an exponential backoff
      for reconnecting or retrying transmissions in a distributed network.
  
      Once instantiated, the delay method will return the next interval to
      wait for when retrying a connection or transmission.  The maximum
      delay increases exponentially with each retry up to a maximum of
      2^10 * base, and is reset if no more attempts are needed in a period
      of 2^11 * base seconds.
  
      Parameters
      ----------
      base: :class:`int`
          The base delay in seconds. The first retry-delay will be up to
          this many seconds.
      integral: :class:`bool`
          Set to ``True`` if whole periods of base is desirable, otherwise any
          number in between may be returned.
      """
  
      def __init__(self, base: int = 1, *, integral: T = False):
          self._base: int = base
  
          self._exp: int = 0
          self._max: int = 10
          self._reset_time: int = base * 2 ** 11
          self._last_invocation: float = time.monotonic()
  
          # Use our own random instance to avoid messing with global one
          rand = random.Random()
          rand.seed()
  
          self._randfunc: Callable[..., Union[int, float]] = rand.randrange if integral else rand.uniform  # type: ignore
  
      @overload
      def delay(self: ExponentialBackoff[Literal[False]]) -> float:
          ...
  
      @overload
      def delay(self: ExponentialBackoff[Literal[True]]) -> int:
          ...
  
      @overload
      def delay(self: ExponentialBackoff[bool]) -> Union[int, float]:
          ...
  
      def delay(self) -> Union[int, float]:
          """Compute the next delay
  
          Returns the next delay to wait according to the exponential
          backoff algorithm.  This is a value between 0 and base * 2^exp
          where exponent starts off at 1 and is incremented at every
          invocation of this method up to a maximum of 10.
  
          If a period of more than base * 2^11 has passed since the last
          retry, the exponent is reset to 1.
          """
          invocation = time.monotonic()
          interval = invocation - self._last_invocation
          self._last_invocation = invocation
  
          if interval > self._reset_time:
              self._exp = 0
  
          self._exp = min(self._exp + 1, self._max)
          return self._randfunc(0, self._base * 2 ** self._exp)
  