assertEquals(-1, SMBUtil.readInt4(buffer, chunkStart + 16));
        }
    }

    @Nested
    @DisplayName("Mock Tests")
    class MockTests {

        @Test
        @DisplayName("Should call encode on each chunk")
        void testCallsEncodeOnEachChunk() {
            // Given
            byte[] sourceKey = new byte[SOURCE_KEY_SIZE];
            SrvCopychunk mockChunk1 = mock(SrvCopychunk.class);

        // This is actually good security practice - closed authenticators cannot be accessed

        // Verify multiple closes don't cause issues
        auth.close(); // Should be safe to call again
        assertTrue(auth.isClosed());
    }

    /**
     * Test AutoCloseable implementation
     */
    @Test
    @DisplayName("Test AutoCloseable implementation with try-with-resources")

            assertEquals(FileSystemInformation.FS_FULL_SIZE_INFO, fullInfo.getFileSystemInformationClass());
        }

        @Test
        @DisplayName("Should handle decode method call")
        void shouldHandleDecodeMethodCall() throws jcifs.internal.SMBProtocolDecodingException {
            // Given
            TestAllocInfo allocInfo = new TestAllocInfo(1000L, 500L);

        try {
            final NdrBuffer buf = encodeMessage(msg, out);
            final int off = sendFragments(msg, out, buf);

            // last fragment gets written (possibly) using transact/call semantics
            final int have = doSendReceiveFragment(out, off, msg.length, inB);

            if (have != 0) {
                final NdrBuffer hdrBuf = new NdrBuffer(inB, 0);

        List<FileNotifyInformation> notifications = Arrays.asList(mockNotifyInfo1, mockNotifyInfo2);
        MockNotifyResponse response = new MockNotifyResponse(notifications);

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

   * implementation of iterator() to define its contents, and methods like contains() are
   * implemented in terms of that method (though they will likely be overridden by subclasses for
   * performance reasons).) This means that a call to this method have can different behavior in GWT
   * and non-GWT environments UNLESS subclasses are careful to always override all methods
   * implemented in terms of sortedDelegate (except comparator()).
   */

        return new BiMapEntry(entry);
      }

      @Override
      public void remove() {
        if (entry == null) {
          throw new IllegalStateException("no calls to next() since the last call to remove()");
        }
        V value = entry.getValue();
        iterator.remove();
        removeFromInverseMap(value);
        entry = null;
      }
    };
  }

  @WeakOuter

	readers         atomic.Int32
	writers         atomic.Int32
	lastCleanup     atomic.Pointer[time.Time]
	locksOverloaded atomic.Int64
}

// getMutex will lock the mutex.
// Call the returned function to unlock.
func (l *localLocker) getMutex() func() {
	l.waitMutex.Add(1)
	l.mutex.Lock()
	l.waitMutex.Add(-1)
	return l.mutex.Unlock
}

func (l *localLocker) String() string {

// uniq swaps away duplicate elements in data, returning the size of the
// unique set. data is expected to be pre-sorted, and the resulting set in
// the range [0:size] will remain in sorted order. Uniq, following a
// sort.Sort call, can be used to prepare arbitrary inputs for use as sets.
func uniq(data sort.Interface) (size int) {
	p, l := 0, data.Len()
	if l <= 1 {
		return l
	}
	for i := 1; i < l; i++ {
		if !data.Less(p, i) {

  }

  /**
   * Returns an immutable sorted multiset containing the given elements sorted by their natural
   * ordering. To create a copy of a {@code SortedMultiset} that preserves the comparator, call
   * {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once.
   *
   * <p>Note that if {@code s} is a {@code Multiset<String>}, then {@code