* k) worst case.
   */
  private void trim() {
    int left = 0;
    int right = 2 * k - 1;

    int minThresholdPosition = 0;
    // The leftmost position at which the greatest of the k lower elements
    // -- the new value of threshold -- might be found.

    int iterations = 0;
    int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;

= $('body')\n      $body.addClass(CLASS_NAME_IFRAME_MODE)\n\n      if (this._config.autoDarkMode) {\n        $body.addClass('dark-mode')\n      }\n    }\n  }\n\n  _navScroll(offset) {\n    const leftPos = $(SELECTOR_TAB_NAVBAR_NAV).scrollLeft()\n    $(SELECTOR_TAB_NAVBAR_NAV).animate({ scrollLeft: (leftPos + offset) }, 250, 'linear')\n  }\n\n  _setupListeners() {\n    $(window).on('resize', () => {\n      setTimeout(() => {\n        this._fixHeight()\n      }, 1)\n    })\n    if ($(SELECTOR_CONTE...