BICS R19->12, R1, R23                      // 3730b3ea
	BICS R19, R1, R23                          // 370033ea
	BICS R19>>0, R1, R23                       // 370073ea
	CALL -1(PC)                                // ffffff97
	CALL (R15)                                 // e0013fd6
	JMP  (R29)                                 // a0031fd6
	BRK $35943                                 // e08c31d4

        // Call getNotifyInformation multiple times
        List<FileNotifyInformation> result1 = response.getNotifyInformation();
        List<FileNotifyInformation> result2 = response.getNotifyInformation();
        List<FileNotifyInformation> result3 = response.getNotifyInformation();

        // Verify all calls return the same content

	defer l.getMutex()()
	if ctx.Err() != nil {
		return false, ctx.Err()
	}
	if !l.canTakeLock(args.Resources...) {
		// Not all locks can be taken on resources,
		// reject it completely.
		return false, nil
	}

	// No locks held on the all resources, so claim write
	// lock on all resources at once.
	now := UTCNow()
	for i, resource := range args.Resources {
		l.lockMap[resource] = []lockRequesterInfo{
			{

   *       </ul>
   *   <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash
   *       collections intelligently fall back to a binary search tree if hash table collisions are
   *       detected. Rather than going to all the trouble of reimplementing this ourselves, we
   *       simply switch over to use the JDK implementation wholesale if probable hash flooding is

   * list must be sorted into ascending order according to the specified comparator (as by the
   * {@link Collections#sort(List, Comparator) Collections.sort(List, Comparator)} method), prior to
   * making this call. If it is not sorted, the results are undefined.
   *
   * <p>If there are elements in the list which compare as equal to the key, the choice of {@link

    } catch (AssertionFailedError expected) {
      return;
    }
    fail("Should have failed");
  }

  /** An interface for the 2 ways that a chaining call might be defined. */
  private interface ChainingCalls {
    // A method that is defined to 'return this'
    @CanIgnoreReturnValue
    ChainingCalls chainingCall();

    // JCE methods
    //...........................................................................

    /**
     * Resets this object disregarding any temporary data present at the
     * time of the invocation of this call.
     */
    @Override
    public void engineReset() {
        // initial values of MD4 i.e. A, B, C, D
        // as per rfc-1320; they are low-order byte first
        context[0] = 0x67452301;

        DirFileEntryEnumIterator2 it = new DirFileEntryEnumIterator2(tree, parent, "*", null, 0);

        // Assert: enumeration is empty and close produced no extra close call (no fileId opened)
        assertFalse(it.hasNext(), "Empty listing should produce no elements");
        it.close();
        // No close should be sent because directory was never successfully opened

        SmbTreeHandleImpl t2 = h.getTree();

        assertSame(tree, t1, "Expected same mocked tree");
        assertSame(tree, t2, "Expected same mocked tree");

        // acquire is called once in ctor + once per getTree() call
        verify(tree, times(3)).acquire();
    }

    @Test
    @DisplayName("isValid() true when open, same tree id, connected")
    void isValid_true_whenOpenSameTreeConnected() {

            Arrays.fill(dataBuffer, (byte) 0xAB);

            TestCreateContextResponse contextResponse = new TestCreateContextResponse(nameBytes);

            // Simulate decode call
            int dataOffset = 100;
            int dataLength = 200;
            contextResponse.decode(dataBuffer, dataOffset, dataLength);

            // Verify