* 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
 * striped.get(key1) != striped.get(key2)}; the elements might nevertheless be mapped to the same

     */
    protected DcerpcHandle() {
        // Default constructor
    }

    /* 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]

        data.putValue("key1", "value1");
        data.putValue("key2", "value2");
        data.putValue("key3", "value3");

        Set<String> keySet = data.getKeySet();
        assertNotNull(keySet);
        assertEquals(3, keySet.size());
        assertTrue(keySet.contains("key1"));
        assertTrue(keySet.contains("key2"));
        assertTrue(keySet.contains("key3"));
    }

        assertEquals(exception.getContext().get("key1"), deserialized.getContext().get("key1"));
        assertEquals(exception.getContext().get("key2"), deserialized.getContext().get("key2"));
    }

    }

    public void test_ofMap() {
        Map<String, String> map = new HashMap<String, String>();
        map.put("key1", "value1");
        map.put("key2", "value2");
        StreamUtil.stream(map).of(s -> s.forEach(m -> assertEquals(map.get(m.getKey()), m.getValue())));
    }

        responseData.addMetaData("key2", 123);

        // Execute - should not throw any exception
        processor.process(responseData);

        // Verify metadata is unchanged
        assertEquals(2, responseData.getMetaDataMap().size());
        assertEquals("value1", responseData.getMetaDataMap().get("key1"));
        assertEquals(123, responseData.getMetaDataMap().get("key2"));
    }

 * for the following multimap definition:
 *
 * {@snippet :
 * Multimap<K, V> multimap = LinkedListMultimap.create();
 * multimap.put(key1, foo);
 * multimap.put(key2, bar);
 * multimap.put(key1, baz);
 * }
 *
 * ... the iteration order for {@link #keys()} is {@code [key1, key2, key1]}, and similarly for
 * {@link #entries()}. Unlike {@link LinkedHashMultimap}, the iteration order is kept consistent

        Smb2LeaseKey key1 = new Smb2LeaseKey();
        Smb2LeaseKey key2 = new Smb2LeaseKey();
        Smb2LeaseKey key3 = new Smb2LeaseKey();

        when(baseLeaseManager.requestLease(dir1, DirectoryLeaseState.DIRECTORY_READ_HANDLE)).thenReturn(key1);
        when(baseLeaseManager.requestLease(dir2, DirectoryLeaseState.DIRECTORY_READ_HANDLE)).thenReturn(key2);

    void testPropertiesClear() {
        // Test for issue #11552: NullPointerException when clearing properties
        Model model = new Model();
        model.addProperty("key1", "value1");
        model.addProperty("key2", "value2");
        assertEquals(2, model.getProperties().size());

        // This should not throw NullPointerException
        model.getProperties().clear();
        assertEquals(0, model.getProperties().size());
    }

 */
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]