throw new TimeoutException(
          "Timed out waiting for "
              + this
              + " to reach a terminal state. "
              + "Current state: "
              + state());
    }
  }

  /** Checks that the current state is equal to the expected state. */
  @GuardedBy("monitor")
  private void checkCurrentState(State expected) {
    State actual = state();
    if (actual != expected) {

    cache.put(20, 22);
    cache.put(5, 10);

    fakeTicker.advance(501, MILLISECONDS);

    int sum = 0;
    for (Entry<Integer, Integer> current : cache.asMap().entrySet()) {
      sum += current.getKey() + current.getValue();
    }
    assertThat(sum).isEqualTo(57);
  }

  @Test
  public void asMapValues_iteratorRemove() {
    Cache<Integer, Integer> cache =

            searchPaging(data, form);
        });
    }

    /**
     * Returns to the search log list from a detail view.
     *
     * @param form the search form containing current state
     * @return HTML response for the search log list page
     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse back(final SearchForm form) {
        saveToken();

  internal var closed: Boolean = false
  private var mostRecentTrimFailed: Boolean = false
  private var mostRecentRebuildFailed: Boolean = false

  /**
   * To differentiate between old and current snapshots, each entry is given a sequence number each
   * time an edit is committed. A snapshot is stale if its sequence number is not equal to its
   * entry's sequence number.
   */

      }

      override fun timeout(): Timeout = timeout
    }

    /**
     * Returns a value in [0..maxByteCount] with the number of bytes that can be read from [source]
     * in the current part. If this returns 0 the current part is exhausted; otherwise it has at
     * least one byte left to read.
     */
    private fun currentPartBytesRemaining(maxByteCount: Long): Long {

    if (delegate != null) {
      return delegate.add(object);
    }
    int[] entries = requireEntries();
    @Nullable Object[] elements = requireElements();

    int newEntryIndex = this.size; // current size, and pointer to the entry to be appended
    int newSize = newEntryIndex + 1;
    int hash = smearedHash(object);
    int mask = hashTableMask();
    int tableIndex = hash & mask;

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

// https://www.eclipse.org/jetty/documentation/current/alpn-chapter.html#alpn-versions
private fun alpnBootVersionForPatchVersion(patchVersion: Int): String? =
  when (patchVersion) {
    in 0..24 -> "8.1.0.v20141016"
    in 25..30 -> "8.1.2.v20141202"

     * Constructs a seek response.
     *
     * @param config the configuration
     */
    public SmbComSeekResponse(final Configuration config) {
        super(config);
    }

    /**
     * Gets the current file offset after the seek operation.
     *
     * @return the offset
     */
    public long getOffset() {
        return this.offset;
    }

    /**
     * {@inheritDoc}
     *

        // For 100% coverage, we'd need to ensure the superclass constructor is indeed called with these values.
        // However, given the current structure, testing the fields set by MsrpcEnumerateAliasesInDomain itself is the primary focus.
    }

  //
  // The `table` array always has a size that is a power of 2. The hashcode of a key in the map
  // is masked in order to correspond to the current table size. For example, if the table size
  // is 128 then the mask is 127 == 0x7f, keeping the bottom 7 bits of the hash value.
  // If a key hashes to 0x89abcdef the mask reduces it to 0x89abcdef & 0x7f == 0x6f. We'll call this