nextInBucketKToV = createFilledWithAbsent(expectedSize);
    nextInBucketVToK = createFilledWithAbsent(expectedSize);

    firstInInsertionOrder = ENDPOINT;
    lastInInsertionOrder = ENDPOINT;

    prevInInsertionOrder = createFilledWithAbsent(expectedSize);
    nextInInsertionOrder = createFilledWithAbsent(expectedSize);
  }

            }
            throw new DcerpcException("Bad endpoint: " + this.endpoint);
        }
        if (this.options == null) {
            this.options = new HashMap<>();
        }
        this.options.put(key, val);
    }

    Object getOption(final String key) {
        if (key.equals("endpoint")) {
            return this.endpoint;
        }
        if (this.options != null) {

  /**
   * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
   * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last

  /**
   * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
   * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last

   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long @Nullable [] links;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

 * Extract a text by using external http server.
 */
public class ApiExtractor extends AbstractExtractor {

    private static final Logger logger = LogManager.getLogger(ApiExtractor.class);

    /** The URL of the API endpoint. */
    protected String url;

    /** The access timeout in seconds. */
    protected Integer accessTimeout; // sec

    /** The HTTP client used for API calls. */
    protected CloseableHttpClient httpClient;

    private final RdmaActiveEndpoint endpoint;
    private final RdmaActiveEndpointGroup<DisniRdmaEndpoint> group;
    
    public DisniRdmaConnection(InetSocketAddress remote, InetSocketAddress local,
                              RdmaActiveEndpointGroup<DisniRdmaEndpoint> group) throws IOException {
        super(remote, local);
        this.group = group;
        this.endpoint = group.createEndpoint();
    }
    

   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long @Nullable [] links;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

import com.google.common.annotations.GwtCompatible;

/**
 * Indicates whether an endpoint of some range is contained in the range itself ("closed") or not
 * ("open"). If a range is unbounded on a side, it is neither open nor closed on that side; the
 * bound simply does not exist.
 *
 * @since 10.0
 */
@GwtCompatible
public enum BoundType {
  /** The endpoint value <i>is not</i> considered part of the set ("exclusive"). */
  OPEN(false),

        super(buffer, access);
        this.endpoint = endpoint;

        // In real implementation, this would register the memory:
        // try {
        //     int accessFlags = convertAccessFlags(access);
        //     memoryRegister = endpoint.registerMemory(buffer, accessFlags).execute().free();
        // } catch (Exception e) {
        //     throw new RuntimeException("Failed to register memory region", e);