}
    }
    return new ValuesImpl();
  }

  @Override
  public void clear() {
    if (needsAllocArrays()) {
      return;
    }
    this.firstEntry = ENDPOINT;
    this.lastEntry = ENDPOINT;
    if (links != null) {
      Arrays.fill(links, 0, size(), 0);
    }
    super.clear();
  }

  /*

        SettingsSecurity config = secDispatcher.readConfiguration(true);
        // reset config
        config.setDefaultDispatcher(null);
        config.getConfigurations().clear();

        Map<String, PromptResultItemIF> dispatcherResult;
        Map<String, PromptResultItemIF> dispatcherConfigResult;
        Map<String, PromptResultItemIF> confirmChoice;

}

.filter-dropdown-footer {
    padding: 0.25rem 0.5rem;
    border-top: 1px solid #ebecf0;
    text-align: right;
}

.filter-clear-group {
    font-size: 0.75rem;
    color: #6b778c;
    text-decoration: none;
    padding: 0.125rem 0.375rem;
}

.filter-clear-group:hover {
    color: #de350b;
}

#filterBadge {
    font-size: 0.6875rem;
    margin-left: 0.25rem;
}

    if (oldCount == 0 && count > 0) {
      distinctElements++;
    } else if (oldCount > 0 && count == 0) {
      distinctElements--;
    }
    return oldCount;
  }

  @Override
  public void clear() {
    Arrays.fill(counts, 0);
    size = 0;
    distinctElements = 0;
  }

  abstract class Itr<T> implements Iterator<T> {
    int index = 0;
    int toRemove = -1;

      /*
       * If we're about to complete the TimeoutFuture, we want to release our reference to it.
       * Otherwise, we'll pin it (and its result) in memory until the timeout task is GCed. (The
       * need to clear our reference to the TimeoutFuture is the reason we use a *static* nested
       * class with a manual reference back to the "containing" class.)
       *

 *       CheckedRunnable} and {@link CheckedCallable}).
 *   <li>If you override {@link #tearDown}, make sure to invoke {@code super.tearDown} within it.
 *       This method is used to clear and check for thread assertion failures.
 *   <li>All threads generated must be joined inside each test case method (or {@code fail} to do
 *       so) before returning from the method. The {@code joinPool} method can be used to do this

        restart.style.visibility = 'hidden'
        this.container.appendChild(restart)
        this.container.setAttribute('data-termynal', '');
    }

    /**
     * Initialise the widget, get lines, clear container and start animation.
     */
    init() {
        /**
         * Calculates width and height of Termynal container.

      }
    });

    // Input event handler with debouncing
    $(this).on("input", function () {
      if ($textArea.val() !== inputText) {
        if (!isFocusList && started && !suggestingSts) {
          // Clear existing timer and set new one to debounce rapid inputs
          clearTimeout(debounceTimer);
          debounceTimer = setTimeout(function () {
            suggestor.suggest();

    return (SortedSet<E>) super.elementSet();
  }

  /**
   * A sensible implementation of {@link SortedMultiset#elementSet} in terms of the following
   * methods: {@link SortedMultiset#clear}, {@link SortedMultiset#comparator}, {@link
   * SortedMultiset#contains}, {@link SortedMultiset#containsAll}, {@link SortedMultiset#count},
   * {@link SortedMultiset#firstEntry} {@link SortedMultiset#headMultiset}, {@link

        info.setCapability(capability);

        return info;
    }

    private void encodeSockaddr(byte[] buffer, int offset) {
        // MS-SMB2: SockAddr_Storage field is 128 bytes
        // Clear the entire field first
        for (int i = 0; i < 128; i++) {
            buffer[offset + i] = 0;
        }

        if (ipv6) {
            // IPv6 sockaddr_in6 structure (Windows AF_INET6 = 23)