updateItem2.setNewInputs(new String[] { "p", "q" });
        updateItem2.setNewOutput("r");

        // First update should succeed
        charMappingFile.update(updateItem1);

        // Second update should fail due to mismatch
        try {
            charMappingFile.update(updateItem2);
            fail("Should throw DictionaryException");
        } catch (DictionaryException e) {

		return nil, nil // No definition for macro
	}
	var args []string
	// The C preprocessor treats
	//	#define A(x)
	// and
	//	#define A (x)
	// distinctly: the first is a macro with arguments, the second without.
	// Distinguish these cases using the column number, since we don't
	// see the space itself. Note that text/scanner reports the position at the
	// end of the token. It's where you are now, and you just read this token.

    void testReadnMultipleCalls() throws IOException {
        when(mockInputStream.read(any(byte[].class), anyInt(), anyInt())).thenReturn(2) // First read returns 2 bytes
                .thenReturn(2) // Second read returns 2 bytes
                .thenReturn(1); // Third read returns 1 byte

        byte[] buffer = new byte[10];
        int bytesRead = SessionServicePacket.readn(mockInputStream, buffer, 0, 5);

            assertEquals(1, response.getChunksWritten());
            assertEquals(1024, response.getChunkBytesWritten());
            assertEquals(1024, response.getTotalBytesWritten());

            // Second decode - should update values
            byte[] buffer2 = createValidCopyChunkResponse(5, 8192, 40960);
            response.decode(buffer2, 0, buffer2.length);
            assertEquals(5, response.getChunksWritten());

   * equivalent {@link Long#compareUnsigned(long, long)} method instead.
   *
   * @param a the first unsigned {@code long} to compare
   * @param b the second unsigned {@code long} to compare
   * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
   *     greater than {@code b}; or zero if they are equal
   */

  ): RecordedRequest? = requestQueue.poll(timeout, unit)

  /**
   * Scripts [response] to be returned to a request made in sequence. The first request is
   * served by the first enqueued response; the second request by the second enqueued response; and
   * so on.
   *
   * @throws ClassCastException if the default dispatcher has been
   * replaced with [setDispatcher][dispatcher].
   */

 *
 * <h2>Dead Events</h2>
 *
 * <p>If an event is posted, but no registered subscribers can accept it, it is considered "dead."
 * To give the system a second chance to handle dead events, they are wrapped in an instance of
 * {@link DeadEvent} and reposted.
 *
 * <p>If a subscriber for a supertype of all events (such as Object) is registered, no event will

				}

				// Wait for a minimum of 100ms and dynamically increase this based on number of attempts.
				if i < retryCount-1 {
					time.Sleep(100*time.Millisecond + time.Duration(r.Float64()*float64(time.Second)))
					continue
				}
			}
			break
		}
	}()
}

// DeletePolicy - deletes policy across all peers.

    CountDownLatch computeSignal = new CountDownLatch(1);
    // tells the main thread when computation is pending
    CountDownLatch secondSignal = new CountDownLatch(1);
    // tells the main thread when the second get has started
    CountDownLatch thirdSignal = new CountDownLatch(1);
    // tells the main thread when the third get has started
    CountDownLatch fourthSignal = new CountDownLatch(1);

            CommonServerMessageBlock response = mock(CommonServerMessageBlock.class);

            // Sign with first digest
            digest1.sign(data, 0, data.length, request, response);

            // Verify with second digest (simulating server verification)
            boolean isValid = digest2.verify(data, 0, data.length, 0, response);

            assertTrue(isValid, "Valid signature should verify correctly");
        }