*/
    private SmbResource createMockResource() {
        return mock(SmbResource.class);
    }

    @BeforeEach
    void setUp() {
        // Reset mocks to ensure clean state for each test
        reset(mockResource, mockLocator, mockContext);
    }

    @Nested
    @DisplayName("Interface Contract Tests")
    class InterfaceContractTests {

        @Test

  private static <X extends Throwable, V> AsyncFunction<X, V> unexpectedAsyncFunction() {
    return t -> {
      throw new AssertionError("Unexpected fallback", t);
    };
  }

  // catchingAsync tests cloned from the old withFallback tests:

  public void testCatchingAsync_inputDoesNotRaiseException() throws Exception {
    AsyncFunction<Throwable, Integer> fallback = unexpectedAsyncFunction();

  private static <X extends Throwable, V> AsyncFunction<X, V> unexpectedAsyncFunction() {
    return t -> {
      throw new AssertionError("Unexpected fallback", t);
    };
  }

  // catchingAsync tests cloned from the old withFallback tests:

  public void testCatchingAsync_inputDoesNotRaiseException() throws Exception {
    AsyncFunction<Throwable, Integer> fallback = unexpectedAsyncFunction();

            case LEASE_BREAK:
                // Release handle, create new one
                releaseAndRecreate(handle);
                break;
                
            case EXPLICIT_CLOSE:
                // Clean release
                releaseHandle(handle);
                break;
        }
    }
}
```

## 10. Performance Considerations

### 10.1 Handle Caching Strategy
```java

The process for contributing to any of the [Elastic repositories](https://github.com/elastic/) is similar. Details for individual projects can be found below.

### Fork and clone the repository

You will need to fork the main Elasticsearch code or documentation repository and clone it to your local machine. See
[github help page](https://help.github.com/articles/fork-a-repo) for help.

Further instructions for specific projects are given below.

	diff := c.evictList.Length() - size
	if diff < 0 {
		diff = 0
	}
	for i := 0; i < diff; i++ {
		c.removeOldest()
	}
	c.size = size
	return diff
}

// Close destroys cleanup goroutine. To clean up the cache, run Purge() before Close().
// func (c *LRU[K, V]) Close() {
//	c.mu.Lock()
//	defer c.mu.Unlock()
//	select {
//	case <-c.done:
//		return
//	default:
//	}
//	close(c.done)
// }

  fun processNextFrame(): Boolean =
    try {
      reader!!.processNextFrame()
      receivedCloseCode == -1
    } catch (e: Exception) {
      failWebSocket(e = e)
      false
    }

  /**
   * Clean up and publish necessary close events when the reader is done. Invoked only by the reader
   * thread.
   */
  fun finishReader() {
    val code: Int
    val reason: String?
    val sendOnClosed: Boolean

        response = spy(response);
        when(response.getHeaderStart()).thenReturn(0);

        // Make a copy of the buffer
        byte[] bufferCopy = buffer.clone();

        // Call readBytesWireFormat
        response.readBytesWireFormat(buffer, bufferIndex);

        // Verify buffer wasn't modified except for the decode operations

        void testWriteBytesWireFormatDoesNotModifyBuffer() {
            // Given
            byte[] dst = new byte[100];
            Arrays.fill(dst, (byte) 0xFF);
            byte[] originalDst = dst.clone();

            // When
            response.writeBytesWireFormat(dst, 0);

            // Then
            assertArrayEquals(originalDst, dst);
        }
    }

    @Nested

   * @since 3.0
   */
  public static <E> ImmutableList<E> copyOf(E[] elements) {
    return (elements.length == 0)
        ? ImmutableList.<E>of()
        : ImmutableList.<E>construct(elements.clone());
  }

  /**
   * Returns an immutable list containing the given elements, sorted according to their natural
   * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the