{"3 somelongkey=\n", nil, false},
		{"50 tooshort=\n", nil, false},
		{"13 key1=haha\n13 key2=nana\n13 key3=kaka\n",
			map[string]string{"key1": "haha", "key2": "nana", "key3": "kaka"}, true},
		{"13 key1=val1\n13 key2=val2\n8 key1=\n",
			map[string]string{"key1": "", "key2": "val2"}, true},
		{"22 GNU.sparse.size=10\n26 GNU.sparse.numblocks=2\n" +

            Smb2LeaseKey key3 = limitedManager.requestLease("/share/file3.txt", Smb2LeaseState.SMB2_LEASE_READ_CACHING);

            // key3 should definitely exist (just created)
            assertNotNull(limitedManager.getLease(key3));

            // key1 should have been evicted (oldest)
            assertNull(limitedManager.getLease(key1));

            // key2 should still exist (not the oldest)

        key8[2] = (byte) (((key7[1] & 0x03) << 5 | (key7[2] & 0xff) >> 3 & 0xff) & 0xff);
        key8[3] = (byte) (((key7[2] & 0x07) << 4 | (key7[3] & 0xff) >> 4 & 0xff) & 0xff);
        key8[4] = (byte) (((key7[3] & 0x0F) << 3 | (key7[4] & 0xff) >> 5 & 0xff) & 0xff);
        key8[5] = (byte) (((key7[4] & 0x1F) << 2 | (key7[5] & 0xff) >> 6 & 0xff) & 0xff);
        key8[6] = (byte) (((key7[5] & 0x3F) << 1 | (key7[6] & 0xff) >> 7 & 0xff) & 0xff);

 */
public abstract class DcerpcHandle implements DcerpcConstants, AutoCloseable {

    /*
     * Bindings are in the form:
     * proto:\\server[key1=val1,key2=val2]
     * or
     * proto:server[key1=val1,key2=val2]
     * or
     * proto:[key1=val1,key2=val2]
     *
     * If a key is absent it is assumed to be 'endpoint'. Thus the
     * following are equivalent:
     * proto:\\ts0.win.net[endpoint=\pipe\srvsvc]

            KerberosKey[] keys = credentials.getKeys();
            assertEquals(0, keys.length);
        }
    }

    /**
     * Test getKey method when the requested key type exists.
     *
     * @throws LoginException if login fails.
     */
    @Test
    void testGetKey_KeyExists() throws LoginException {
        when(key1.getKeyType()).thenReturn(KEY_TYPE_1);

  public void testBuildKeepingLast_smallTableSameHash() {
    String key1 = "QED";
    String key2 = "R&D";
    assertThat(key1.hashCode()).isEqualTo(key2.hashCode());
    ImmutableMap<String, Integer> map =
        ImmutableMap.<String, Integer>builder()
            .put(key1, 1)
            .put(key2, 2)
            .put(key1, 3)
            .put(key2, 4)
            .buildKeepingLast();

 * i.e. {@code if (key1.equals(key2))} then {@code striped.get(key1) == striped.get(key2)} (assuming
 * {@link Object#hashCode()} is correctly implemented for the keys). Note that if {@code key1} is
 * <strong>not</strong> equal to {@code key2}, it is <strong>not</strong> guaranteed that {@code

 * {@link #entries()}. Unlike {@link LinkedHashMultimap}, the iteration order is kept consistent
 * between keys, entries and values. For example, calling:
 *
 * {@snippet :
 * multimap.remove(key1, foo);
 * }
 *
 * <p>changes the entries iteration order to {@code [key2=bar, key1=baz]} and the key iteration
 * order to {@code [key2, key1]}. The {@link #entries()} iterator returns mutable map entries, and

Harshavardhana <******@****.***> 1620513629 -0700

    }

    @Test
    void testDifferentKeysProduceDifferentResults() {
        // Test that different keys produce different results
        byte[] key1 = "key1".getBytes();
        byte[] key2 = "key2".getBytes();

        HMACT64 hmac1 = new HMACT64(key1);
        HMACT64 hmac2 = new HMACT64(key2);

        hmac1.engineUpdate(TEST_DATA, 0, TEST_DATA.length);
        hmac2.engineUpdate(TEST_DATA, 0, TEST_DATA.length);