* objects per entry.  Instead we use an open-addressed hash table.  This design is basically
   * equivalent to RegularImmutableSet, save that instead of having a hash table containing the
   * elements directly and null for empty positions, we store indices of the keys in the hash table,
   * and ABSENT for empty positions.  We then look up the keys in alternatingKeysAndValues.
   *

      int i = 0;
      for (Object e : elements) {
        array[i++] = (Integer) e;
      }
      return create(array);
    }

    /**
     * Creates a new collection containing the given elements; implement this method instead of
     * {@link #create(Object...)}.
     */
    protected abstract List<Integer> create(Integer[] elements);

    @Override

     * Processes a document through the ingest pipeline if an ingest factory is available.
     * Applies all configured ingesters to transform and enrich the document data.
     *
     * @param accessResult the access result containing document metadata
     * @param map the document data map to process
     * @return the processed document map after applying all ingesters
     */

    private Name unknownName;
    private NbtAddress unknownAddress;

    /**
     * Constructs a name service client with the given context.
     *
     * @param tc the CIFS context containing configuration
     */
    public NameServiceClientImpl(final CIFSContext tc) {
        this(tc.getConfig().getNetbiosLocalPort(), tc.getConfig().getNetbiosLocalAddress(), tc);
    }

    }

    /**
     * Get key rotation metrics
     *
     * @return metrics map containing rotation statistics
     */
    public java.util.Map<String, Long> getKeyRotationMetrics() {
        java.util.Map<String, Long> metrics = new java.util.HashMap<>();

      int i = 0;
      for (Object e : elements) {
        array[i++] = (Double) e;
      }
      return create(array);
    }

    /**
     * Creates a new collection containing the given elements; implement this method instead of
     * {@link #create(Object...)}.
     */
    protected abstract List<Double> create(Double[] elements);

    @Override

 * </p>
 *
 * <p>
 * The class uses a cache for XPathAPI objects to improve performance. The cache duration is configurable.
 * </p>
 *
 * <p>
 * The transform method takes a ResponseData object containing the XML content and returns a ResultData object with the extracted and formatted data.
 * </p>
 *
 * <p>

   * href="http://www.ietf.org/rfc/rfc1035.txt">RFC 1035</a> is relaxed in the following ways:
   *
   * <ul>
   *   <li>Any part containing non-ASCII characters is considered valid.
   *   <li>Underscores ('_') are permitted wherever dashes ('-') are permitted.
   *   <li>Parts other than the final part may start with a digit, as mandated by <a

 * provide two {@code static} creation methods: {@code create()}, returning an empty multiset, and
 * {@code create(Iterable<? extends E>)}, returning a multiset containing the given initial
 * elements. This is simply a refinement of {@code Collection}'s constructor recommendations.
 *
 * <p>As with other collection types, the modification operations are optional, and should throw

        }
        return null;
    }

    /**
     * Returns the effective user session key.
     *
     * @param challenge The server challenge.
     * @return A <code>byte[]</code> containing the effective user session key,
     * used in SMB MAC signing and NTLMSSP signing and sealing.
     */
    public byte[] getUserSessionKey(final byte[] challenge) {
        if (hashesExternal) {