import java.util.concurrent.TimeoutException;
import org.jspecify.annotations.NullUnmarked;

/**
 * A {@link Future} implementation which always throws directly from calls to {@code get()} (i.e.
 * not wrapped in {@code ExecutionException}. For just a normal failure, use {@link
 * SettableFuture}).
 *
 * <p>Useful for testing the behavior of Future utilities against odd futures.
 *
 * @author Anthony Zana
 */
@GwtCompatible

    //                                                                           =========
    /**
     * Gets the login manager for this admin action.
     *
     * @return the login manager wrapped in OptionalThing
     */
    @Override
    protected OptionalThing<LoginManager> myLoginManager() {
        return OptionalThing.of(fessLoginAssist);
    }

    }

    private static short S(final int i) {
        return (short) (i & 0xFFFF);
    }

    /**
     * Constructs a UUID from an existing rpc.uuid_t object
     *
     * @param uuid
     *            wrapped uuid object to copy values from
     */
    public UUID(final rpc.uuid_t uuid) {
        this.time_low = uuid.time_low;
        this.time_mid = uuid.time_mid;
        this.time_hi_and_version = uuid.time_hi_and_version;

     */
    public AbstractCIFSContext() {
        Runtime.getRuntime().addShutdownHook(this);
    }

    /**
     * @param creds the credentials to use
     * @return a wrapped context with the given credentials
     */
    @Override
    public CIFSContext withCredentials(final Credentials creds) {
        return new CIFSContextCredentialWrapper(this, creds);
    }

    /**
     *

| xlMetaV2  | msgp object | All versions as single messagepack object
| [EOF] | |

### v1.1+

Version 1.1 added inline data, which will be placed after the metadata.

Therefore, the metadata is wrapped as a binary array for easy skipping.

| Entry          | Encoding       | Content
| ---------------|----------------|----------------------------------------
| xlHeader       | [4]byte        | `'X', 'L', '2', ' '`

    }

    private static short S(final int i) {
        return (short) (i & 0xFFFF);
    }

    /**
     * Constructs a UUID from an existing rpc.uuid_t object
     *
     * @param uuid the wrapped uuid object to copy values from
     */
    public UUID(final rpc.uuid_t uuid) {
        time_low = uuid.time_low;
        time_mid = uuid.time_mid;
        time_hi_and_version = uuid.time_hi_and_version;

 *       divided into segments, each of which does LRU internally)
 *   <li>time-based expiration of entries, measured since last access or last write
 *   <li>keys automatically wrapped in {@code WeakReference}
 *   <li>values automatically wrapped in {@code WeakReference} or {@code SoftReference}
 *   <li>notification of evicted (or otherwise removed) entries
 *   <li>accumulation of cache access statistics
 * </ul>
 *

        writeLittleEndianLong(baos, 1000); // offset way out of bounds
        byte[] pacData = baos.toByteArray();

        // This currently throws ArrayIndexOutOfBoundsException
        // but should be wrapped in PACDecodingException
        assertThrows(Exception.class, () -> new Pac(pacData, keys));
    }

    @Test
    void testZeroBufferCount() throws IOException {

      this.reference = reference;
    }

    /** Returns the (possibly null) reference wrapped by this instance. */
    @ParametricNullness
    public T get() {
      return reference;
    }

    /**
     * Returns {@code true} if {@link Equivalence#equivalent(Object, Object)} applied to the wrapped
     * references is {@code true} and both wrappers use the {@link Object#equals(Object) same}
     * equivalence.

        return false;
      } else if (table[index] == c) { // Check for match.
        return true;
      } else { // Linear probing.
        index = (index + 1) & mask;
      }
      // Check to see if we wrapped around the whole table.
    } while (index != startingIndex);
    return false;
  }

  @Override
  void setBits(BitSet table) {
    if (containsZero) {
      table.set(0);
    }