*   setFuture called on it: Neither of those can happen until we've finished processing all
       *   the completed inputs. And we're still processing at least one input, the one that
       *   triggered handleException.)
       *
       * TODO(cpovirk): Think about whether we could/should use Verify to check the return value of
       * addCausalChain.
       */

   * that accepts zero or more arguments, all of type {@code String} or {@code Throwable}
   * (preferring constructors with at least one {@code String}, then preferring constructors with at
   * least one {@code Throwable}) and calling the constructor via reflection. If the exception did
   * not already have a cause, one is set by calling {@link Throwable#initCause(Throwable)} on it.

   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor. Always returns at least setSize + 2.
   */
  // TODO(cpovirk): Move to Hashing or something, since it's used elsewhere in the Android version.
  static int chooseTableSize(int setSize) {
    setSize = max(setSize, 2);

        setField(cmd, "locks", new LockingAndXRange[0]);
        setField(cmd, "unlocks", new LockingAndXRange[0]);
        setField(cmd, "largeFile", false);
        byte[] buf = new byte[12]; // Buffer needs to be at least 12 bytes for the parameter words
        cmd.writeParameterWordsWireFormat(buf, 0);
        // The flag must be present so the command recognises largeFile
        SmbComLockingAndX copy = new SmbComLockingAndX(cfg);

            }

            length = (length << 8) + octet;
        } while (++octetsPos < octetsCount);

        if (length >= limit && !isParsing) // after all we must have read at least 1 byte
        {
            throw new IOException("corrupted stream - out of bounds length found: " + length + " >= " + limit);
        }

        return length;
    }

            thread.join(testDurationMs + 1000);
        }

        // Verify that alive was changed to false
        assertFalse("alive should be false after writer thread", dataStore.alive);

        // At least some observations from reader threads should have seen false
        // due to volatile ensuring visibility
        int falseCount = 0;
        for (int i = 0; i < readerThreadCount; i++) {

        Smb2LeaseKey key2 = leaseManager.requestLease(path2, Smb2LeaseState.SMB2_LEASE_WRITE_CACHING);

        // Clean up leases older than 5ms
        int cleaned = leaseManager.cleanupExpiredLeases(5);

        // At least the first lease should be cleaned
        assertTrue(cleaned >= 1);

        // Check if old lease was removed
        LeaseEntry entry1 = leaseManager.getLease(key1);
        if (cleaned == 2) {

        // Act + Assert (no exception expected)
        assertDoesNotThrow(() -> SmbCopyUtil.copyFile(src, dest, buffers, 1, new WriterThread(), sh, dh));

        // Verify that server-side path engaged at least the initial opens
        verify(src, times(1)).openUnshared(anyInt(), anyInt(), anyInt(), anyInt(), anyInt());
        verify(dest, times(1)).openUnshared(anyInt(), anyInt(), anyInt(), anyInt(), anyInt());
    }

		if exprA.isAggregation {
			return qProp{err: errNestedAggregation}
		}
		return qProp{isAggregation: true}

	case sqlFnCoalesce:
		if len(e.SFunc.ArgsList) == 0 {
			return qProp{err: fmt.Errorf("%s needs at least one argument", string(funcName))}
		}
		for _, arg := range e.SFunc.ArgsList {
			result.combine(arg.analyze(s))
		}
		return result

	case sqlFnNullIf:
		if len(e.SFunc.ArgsList) != 2 {

   * that this always returns {@code -1} when {@code target} is {@code NaN}.
   *
   * @param array an array of {@code float} values, possibly empty
   * @param target a primitive {@code float} value
   * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no
   *     such index exists.
   */
  public static int indexOf(float[] array, float target) {
    return indexOf(array, target, 0, array.length);