}
            int start = startPosition - offset;
            if (start < 0) {
                start = 0;
            }
            if (logger.isDebugEnabled()) {
                logger.debug("start:{} -> start:{} with offset:{}.", startPosition, start, offset);
            }
            final SearchRequestParams reqParams = new SearchRequestParamsWrapper(params, start, pageSize);

        // However, we'll try to read it safely for compatibility
        if (this.byteCount > bufferIndex - start) {
            try {
                // Attempt to read nativeFileSystem, but don't fail if there are issues
                final int fsLen = this.byteCount - (bufferIndex - start);
                if (fsLen > 0 && fsLen < 256) { // Sanity check on length

    return requireNonNull(rowKeySet().comparator());
  }

  /**
   * Returns the comparator that orders the columns. With natural ordering, {@link
   * Ordering#natural()} is returned.
   *
   * @deprecated Store the {@link Comparator} alongside the {@link Table}. Or, if you know that the
   *     {@link Table} contains at least one value, you can retrieve the {@link Comparator} with:

        assertEquals(0, ndrBuffer.start);
        assertEquals(0, ndrBuffer.index);
        assertEquals(0, ndrBuffer.length);
        assertSame(ndrBuffer, ndrBuffer.deferred);
        assertSame(buffer, ndrBuffer.buf);

        // Test with a different start offset
        NdrBuffer offsetBuffer = new NdrBuffer(buffer, 10);
        assertEquals(10, offsetBuffer.start);
        assertEquals(10, offsetBuffer.index);

    /** Uses an {@link ArrayList} to store value collections. */
    public ListMultimapBuilder<K0, @Nullable Object> arrayListValues() {
      return arrayListValues(DEFAULT_EXPECTED_VALUES_PER_KEY);
    }

    /**
     * Uses an {@link ArrayList} to store value collections, initialized to expect the specified
     * number of values per key.
     *

    /** Uses an {@link ArrayList} to store value collections. */
    public ListMultimapBuilder<K0, @Nullable Object> arrayListValues() {
      return arrayListValues(DEFAULT_EXPECTED_VALUES_PER_KEY);
    }

    /**
     * Uses an {@link ArrayList} to store value collections, initialized to expect the specified
     * number of values per key.
     *

					Where:   settings["WHERE"],
					Comment: settings["COMMENT"],
					Option:  settings["OPTION"],
					Fields: []IndexOption{{
						Field:      field,
						Expression: settings["EXPRESSION"],
						Sort:       settings["SORT"],
						Collate:    settings["COLLATE"],
						Length:     length,
						Priority:   priority,
					}},
				})
			}
		}
	}

	err = nil
	return

    hasher.putLong(0x0000000001000101L);
    assertEquals(hashCode, hasher.hash().asLong());

    hasher = HASH_FN.newHasher();
    hasher
        .putShort((short) 0x0101)
        .putShort((short) 0x0100)
        .putShort((short) 0x0000)
        .putShort((short) 0x0000);
    assertEquals(hashCode, hasher.hash().asLong());
  }

  public void testHashFloatIsStable() {
    // Just a spot check.  Better than nothing.

        for (int i = 0; i < 8; i++) {
            dst[dstIndex] = 0x00;
            dstIndex++;
        }

        return dstIndex - start;
    }

    @Override
    protected int writeBytesWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;

        if (this.isUseUnicode()) {
            dst[dstIndex] = (byte) '\0';
            dstIndex++;
        }

        dstIndex += 2;
        SMBUtil.writeInt4(this.offset >> 32, dst, dstIndex);
        dstIndex += 4;

        return dstIndex - start;
    }

    @Override
    protected int writeBytesWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;

        while (this.pad-- > 0) {
            dst[dstIndex] = (byte) 0xEE;
            dstIndex++;
        }