public @Nullable E lower(E element) {
    int index = headIndex(element, false) - 1;
    return (index == -1) ? null : elements.get(index);
  }

  @Override
  public @Nullable E floor(E element) {
    int index = headIndex(element, true) - 1;
    return (index == -1) ? null : elements.get(index);
  }

  @Override
  public @Nullable E ceiling(E element) {
    int index = tailIndex(element, true);

        buffer[index++] = (byte) ((testSessionId >> 8) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 16) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 24) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 32) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 40) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 48) & 0xFF);

final class SortedLists {
  private SortedLists() {}

  /**
   * A specification for which index to return if the list contains at least one element that
   * compares as equal to the key.
   */
  enum KeyPresentBehavior {
    /**
     * Return the index of any list element that compares as equal to the key. No guarantees are
     * made as to which index is returned, if more than one element compares as equal to the key.
     */
    ANY_PRESENT {

        this.searchTimeout = timeout;
    }

    /**
     * Gets the index timeout.
     * @return The index timeout.
     */
    public String getIndexTimeout() {
        return indexTimeout;
    }

    /**
     * Sets the index timeout.
     * @param timeout The index timeout.
     */
    public void setIndexTimeout(final String timeout) {
        this.indexTimeout = timeout;

        this.index = index;
        this.tookMs = tookMs;
        this.words = words;
        num = words.size();
        this.total = total;
        this.items = items;
    }

    /**
     * Returns the index name.
     * @return The index name.
     */
    public String getIndex() {
        return index;
    }

    /**
     * Returns the time taken in milliseconds.
     * @return The time taken.

    level = DeprecationLevel.ERROR,
  )
  fun size(): Int = size

  /** Returns the field at `position`. */
  fun name(index: Int): String = commonName(index)

  /** Returns the value at `index`. */
  fun value(index: Int): String = commonValue(index)

  /** Returns an immutable case-insensitive set of header names. */
  fun names(): Set<String> {
    val result = TreeSet(String.CASE_INSENSITIVE_ORDER)

        final String index = fessConfig.getIndexDocumentUpdateIndex();
        return deleteBySessionId(searchEngineClient, index, sessionId);
    }

    /**
     * Deletes all documents associated with the specified session ID from the given index.
     *
     * @param searchEngineClient the search engine client to use for deletion
     * @param index the index name to delete documents from

    }

    /**
     * Writes a 16-bit integer value to a byte array in little-endian format
     * @param val the value to write
     * @param dst the destination byte array
     * @param dstIndex the starting index in the destination array
     */
    public static void writeInt2(final long val, final byte[] dst, int dstIndex) {
        dst[dstIndex] = (byte) val;
        dstIndex++;
        dst[dstIndex] = (byte) (val >> 8);
    }

    public boolean hasNext() {
        for (; index < iterators.length; ++index) {
            if (iterators[index].hasNext()) {
                return true;
            }
        }
        return false;
    }

    @Override
    public E next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        return iterators[index].next();
    }

    @Override

   */
  static void tableSet(Object table, int index, int entry) {
    if (table instanceof byte[]) {
      ((byte[]) table)[index] = (byte) entry; // unsigned write
    } else if (table instanceof short[]) {
      ((short[]) table)[index] = (short) entry; // unsigned write
    } else {
      ((int[]) table)[index] = entry;
    }
  }

  /**