this.length = 0;
        this.deferred = this;
    }

    /**
     * Returns the current index position in the buffer.
     *
     * @return the current index
     */
    public int getIndex() {
        return this.index;
    }

    /**
     * Sets the current index position in the buffer.
     *
     * @param index the new index position
     */

     * environment.
     *
     * @param tc
     *            context to use
     */
    public Type2Message(final CIFSContext tc) {
        this(tc, getDefaultFlags(tc), null, null);
    }

    /**
     * Creates a Type-2 message in response to the given Type-1 message
     * using default values from the current environment.
     *
     * @param tc

                CommonServerMessageBlockRequest curReq = thisReq;
                int grantedCredits = 0;
                // if
                while (curReq != null) {
                    if (curReq.isResponseAsync()) {
                        log.trace("Async");
                        break;
                    }

                    final CommonServerMessageBlockResponse resp = curReq.getResponse();

				hasErr++
				errs[i] = fmt.Errorf("drive: %s returned err: %v", disks[i], err)
				continue
			}
			// If no current, add it.
			if current.name == "" {
				topEntries[i] = entry
				current = entry
				agree++
				continue
			}
			// If exact match, we agree.
			if _, ok := current.matches(&entry, true); ok {
				topEntries[i] = entry
				agree++
				continue
			}

      return false;
    }

    Object target = thatIterator.next();
    E current = thisIterator.next();
    try {
      while (true) {
        int cmp = unsafeCompare(current, target);

        if (cmp < 0) {
          if (!thisIterator.hasNext()) {
            return false;
          }
          current = thisIterator.next();
        } else if (cmp == 0) {
          if (!thatIterator.hasNext()) {

    }
  }

  /**
   * Returns a larger power of 2 hashtable size given the current mask.
   *
   * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current
   * hashtable size to reduce expensive rehashing. Otherwise the returned power of 2 is 2x the
   * current hashtable size.
   */
  static int newCapacity(int mask) {
    return ((mask < 32) ? 4 : 2) * (mask + 1);

    /**
     * We use a time based approach to make the bwc versions built deterministic and compatible with the current hash.
     * Most of the time we want to test against latest, but when running delayed exhaustive tests or wanting
     * reproducible builds we want this to be deterministic by using a hash that was the latest when the current
     * commit was made.
     * <p>

## Build logic organisation

The Elasticsearch project contains 3 build-related projects that are included into the Elasticsearch build as a [composite build](https://docs.gradle.org/current/userguide/composite_builds.html).

### `build-conventions`

This project contains build conventions that are applied to all elasticsearch projects.

### `build-tools`

     * Gets the lease key that is being broken
     * @return the lease key
     */
    public Smb2LeaseKey getLeaseKey() {
        return leaseKey;
    }

    /**
     * Gets the current lease state before the break
     * @return the current lease state
     */
    public int getCurrentLeaseState() {
        return currentLeaseState;
    }

    /**
     * Gets the new lease state after the break

targetCompatibility = minCompilerJava
sourceCompatibility = minCompilerJava

if (JavaVersion.current() < JavaVersion.toVersion(minCompilerJava)) {
  throw new GradleException("Java ${minCompilerJava} is required to build Elasticsearch but current Java is version ${JavaVersion.current()}.")
}

sourceSets {
  integTest {