* use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,
 * however, {@code Object.hashCode} almost always falls short -- hence this library.
 *
 * @author Kevin Bourrillion

 * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,
 * however, {@code Object.hashCode} almost always falls short -- hence this library.
 *
 * @author Kevin Bourrillion

   6. Trademarks. This License does not grant permission to use the trade
      names, trademarks, service marks, or product names of the Licensor,
      except as required for reasonable and customary use in describing the
      origin of the Work and reproducing the content of the NOTICE file.

   7. Disclaimer of Warranty. Unless required by applicable law or

   6. Trademarks. This License does not grant permission to use the trade
      names, trademarks, service marks, or product names of the Licensor,
      except as required for reasonable and customary use in describing the
      origin of the Work and reproducing the content of the NOTICE file.

   7. Disclaimer of Warranty. Unless required by applicable law or

   6. Trademarks. This License does not grant permission to use the trade
      names, trademarks, service marks, or product names of the Licensor,
      except as required for reasonable and customary use in describing the
      origin of the Work and reproducing the content of the NOTICE file.

   7. Disclaimer of Warranty. Unless required by applicable law or

	// a listing should continue. It allows paginated
	// listings.
	ContinueAt string

	// Limit limits the number of elements returned by
	// a single list operation. If <= 0, a reasonable
	// limit is selected automatically.
	Limit int
}

// CreateKeyRequest is a structure containing fields
// and options for creating keys.
type CreateKeyRequest struct {

        this.maxReadSize = SMBUtil.readInt4(buffer, bufferIndex + 4);
        this.maxWriteSize = SMBUtil.readInt4(buffer, bufferIndex + 8);

        // Validate reasonable buffer sizes to prevent resource exhaustion
        if (this.maxTransactSize < 0 || this.maxTransactSize > 16777216) { // 16MB max

        NtlmPasswordAuthenticator auth = new NtlmPasswordAuthenticator("user", "TimestampPass123!");

        long afterCreation = System.currentTimeMillis();

        // Set a reasonable TTL
        auth.setAuthenticationTTL(1000); // 1 second

        // Should not be expired immediately
        assertFalse(auth.isExpired());

        // Wait half the TTL
        Thread.sleep(500);

        // Set maximum values
        SMBUtil.writeInt4(Integer.MAX_VALUE, buffer, 0); // nextEntryOffset
        SMBUtil.writeInt4(Integer.MAX_VALUE, buffer, 4); // fileIndex
        // For time values, use a reasonable max time that won't overflow
        long maxTime = System.currentTimeMillis() + 1000000000000L;
        SMBUtil.writeTime(maxTime, buffer, 8); // creationTime
        SMBUtil.writeTime(maxTime, buffer, 16); // lastAccessTime

   6. Trademarks. This License does not grant permission to use the trade
      names, trademarks, service marks, or product names of the Licensor,
      except as required for reasonable and customary use in describing the
      origin of the Work and reproducing the content of the NOTICE file.

   7. Disclaimer of Warranty. Unless required by applicable law or