# Path Operation Configuration { #path-operation-configuration }

There are several parameters that you can pass to your *path operation decorator* to configure it.

/// warning

Notice that these parameters are passed directly to the *path operation decorator*, not to your *path operation function*.

///

## Response Status Code { #response-status-code }

You can define the (HTTP) `status_code` to be used in the response of your *path operation*.

        @Test
        @DisplayName("delete operation should work correctly")
        void testDelete() throws CIFSException {
            // When/Then
            assertDoesNotThrow(() -> mockResource.delete(), "Delete operation should not throw exception");
            verify(mockResource).delete();
        }

        @Test
        @DisplayName("copy operation should work correctly")

## Dependencies for groups of *path operations* { #dependencies-for-groups-of-path-operations }

# Dependencies in path operation decorators { #dependencies-in-path-operation-decorators }

In some cases you don't really need the return value of a dependency inside your *path operation function*.

Or the dependency doesn't return a value.

But you still need it to be executed/solved.

For those cases, instead of declaring a *path operation function* parameter with `Depends`, you can add a `list` of `dependencies` to the *path operation decorator*.

And we can add a list of `dependencies` that will be added to all the *path operations* in the router and will be executed/solved for each request made to them.

/// tip

        executor.shutdown();

        // Then - Verify no exceptions occurred
        if (!exceptions.isEmpty()) {
            fail("Concurrent operations caused exceptions: " + exceptions.get(0));
        }

        assertEquals(threadCount * opsPerThread, successCount.get(), "All operations should succeed");
    }

    /**
     * Test that session release with double-check pattern prevents race conditions.
     */
    @Test

        double avgOpTimeNs = totalTime.get() / (double) operations.get();

        System.out.printf("Encryption Byte Tracking Performance: %d ops in %.2f ms%n", operations.get(), overallTimeMs);
        System.out.printf("  Avg atomic operation time: %.2f ns%n", avgOpTimeNs);

        // Verify lock-free performance (allowing for JVM overhead)
        assertTrue(avgOpTimeNs < 5000, "Atomic operations should be reasonably fast (no lock contention)");

    }

    /**
     * Add a pending operation
     *
     * @param operation operation to add
     */
    public void addPendingOperation(CommonServerMessageBlock operation) {
        pendingOperations.add(operation);
    }

    /**
     * Remove a pending operation
     *
     * @param operation operation to remove
     * @return true if operation was removed
     */

    }

    @Test
    @DisplayName("EmptyIterator should handle remove operations multiple times")
    void testMultipleRemoveOperations() {
        // When & Then
        assertDoesNotThrow(() -> {
            emptyIterator.remove();
            emptyIterator.remove();
            emptyIterator.remove();
        }, "Multiple remove operations should not cause issues");

    public int[] call() throws Exception {
      int iterations = 100000;
      int nKeys = keys.size();
      int[] deltas = new int[nKeys];
      Operation[] operations = Operation.values();
      for (int i = 0; i < iterations; i++) {
        int keyIndex = random.nextInt(nKeys);
        String key = keys.get(keyIndex);
        Operation op = operations[random.nextInt(operations.length)];
        switch (op) {
          case ADD: