*
     * @param <E> the element type of {@link ArrayBlockingQueue}
     * @param capacity the queue capacity
     * @param fair whether the queue is fair
     * @param c the collection of initial elements
     * @return a new instance of {@link ArrayBlockingQueue}
     * @see ArrayBlockingQueue#ArrayBlockingQueue(int, boolean, Collection)
     */

        // Test we can read the initial file that was created
        SmbFile initialFile = new SmbFile(baseUrl + "shared/initial.txt", context);
        assertTrue(initialFile.exists(), "Initial file should exist");
        assertTrue(initialFile.isFile(), "Initial file should be a file");
        assertTrue(initialFile.canRead(), "Should be able to read initial file");

    /** Cache for page paths */
    protected final Map<String, String> pageCacheMap = new ConcurrentHashMap<>();

    /** Initial facet parameter mappings */
    protected final Map<String, String> initFacetParamMap = new HashMap<>();

    /** Initial geographic parameter mappings */
    protected final Map<String, String> initGeoParamMap = new HashMap<>();

    /** List of facet query views */

    assertThat(ping.ack).isTrue()
  }

  @Test fun peerHttp2ServerLowersInitialWindowSize() {
    val initial = Settings()
    initial[Settings.INITIAL_WINDOW_SIZE] = 1684
    val shouldntImpactConnection = Settings()
    shouldntImpactConnection[Settings.INITIAL_WINDOW_SIZE] = 3368
    peer.sendFrame().settings(initial)
    peer.acceptFrame() // ACK
    peer.sendFrame().settings(shouldntImpactConnection)
    peer.acceptFrame() // ACK 2

   * @throws IllegalArgumentException if {@code initialCapacity} is negative
   * @throws IllegalStateException if an initial capacity was already set
   */
  @CanIgnoreReturnValue
  public CacheBuilder<K, V> initialCapacity(int initialCapacity) {
    checkState(
        this.initialCapacity == UNSET_INT,
        "initial capacity was already set to %s",
        this.initialCapacity);
    checkArgument(initialCapacity >= 0);

// If data is not xlv2, it is returned in full.
func readXLMetaNoData(r io.Reader, size int64) ([]byte, error) {
	initial := size
	hasFull := true
	if initial > metaDataReadDefault {
		initial = metaDataReadDefault
		hasFull = false
	}

	buf := metaDataPoolGet()[:initial]
	_, err := io.ReadFull(r, buf)
	if err != nil {
		return nil, fmt.Errorf("readXLMetaNoData(io.ReadFull): %w", err)
	}

                iterator--;
            }
        }

        var start, end, range;

        //if no start/end dates set, check if an input element contains initial values
        if (typeof options.startDate === 'undefined' && typeof options.endDate === 'undefined') {
            if ($(this.element).is(':text')) {
                var val = $(this.element).val(),

    HashSet<E> set = new HashSet<>();
    Iterators.addAll(set, elements);
    return set;
  }

  /**
   * Returns a new hash set using the smallest initial table size that can hold {@code expectedSize}
   * elements without resizing. Note that this is not what {@link HashSet#HashSet(int)} does, but it
   * is what most users want and expect it to do.
   *

   * its capacity threshold.
   *
   * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

        this.preauthIntegrityHash = preauthIntegrity ? trans.getPreauthIntegrityHash() : null;

        if (this.preauthIntegrityHash != null && log.isDebugEnabled()) {
            log.debug("Initial session preauth hash " + Hexdump.toHexString(this.preauthIntegrityHash));
        }

        while (true) {
            Subject s = this.credentials.getSubject();
            if (ctx == null) {