/**
 * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011}
 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *
 * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent

        notification.addNewIPAddress(InetAddress.getByName("192.168.1.101"));

        client.processNotification(notification);

        // Verify notification was delivered
        assertTrue(listener.waitForNotification(1000));
        assertNotNull(listener.getLastNotification());
        assertEquals(WitnessEventType.CLIENT_MOVE, listener.getLastNotification().getEventType());

        client.close();
    }

    @Test

        byte[] dst = new byte[100];
        int result = response.writeDataWireFormat(dst, 30);
        assertEquals(0, result);
    }

    @Test
    void testReadSetupWireFormat() {
        // Test that readSetupWireFormat returns 0
        byte[] buffer = new byte[100];
        int result = response.readSetupWireFormat(buffer, 10, 50);
        assertEquals(0, result);
    }

    @Test

 *
 * @author mike nonemacher
 */
@NullUnmarked
public class CacheEvictionTest extends TestCase {
  static final int MAX_SIZE = 100;

  public void testEviction_setMaxSegmentSize() {
    IdentityLoader<Object> loader = identityLoader();
    for (int i = 1; i < 1000; i++) {
      LoadingCache<Object, Object> cache = CacheBuilder.newBuilder().maximumSize(i).build(loader);

    int range = 10_000; // range should be small enough that equal elements occur semi-frequently
    for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) {
      for (int i = 0; i < 100; i++) {
        Integer element = random.nextInt(range);
        elements.add(element);
        queue.add(element);
      }
      Iterator<Integer> queueIterator = queue.iterator();

type ScanToken rune

const (
	// Asm defines some two-character lexemes. We make up
	// a rune/ScanToken value for them - ugly but simple.
	LSH          ScanToken = -1000 - iota // << Left shift.
	RSH                                   // >> Logical right shift.
	ARR                                   // -> Used on ARM for shift type 3, arithmetic right shift.

        }

        final MimeTypeHelper mimeTypeHelper = getMimeTypeHelper();
        final ExtractorFactory extractorFactory = getExtractorFactory();
        final StringBuilder buf = new StringBuilder(1000);

        File tempFile = null;
        LhaFile lhaFile = null;
        try {
            tempFile = createTempFile("crawler-", ".lzh", null);
            try (FileOutputStream fos = new FileOutputStream(tempFile)) {

            writeJsonResponse(HttpServletResponse.SC_BAD_REQUEST, escapeJsonKeyValue(MESSAGE_FIELD, "Scroll Search is not available."));
            return;
        }

        final StringBuilder buf = new StringBuilder(1000);
        request.setAttribute(Constants.SEARCH_LOG_ACCESS_TYPE, Constants.SEARCH_LOG_ACCESS_TYPE_JSON);
        final JsonRequestParams params = new JsonRequestParams(request, fessConfig);
        try {

     */
    public static String getCacheStatistics() {
        return String.format("BufferCache: queued=%d, max=%d, utilization=%.1f%%", queueSize.get(), MAX_BUFFERS,
                (queueSize.get() * 100.0 / MAX_BUFFERS));
    }

    /**
     * Clear all cached buffers (for testing or cleanup)
     */
    public static void clearCache() {
        bufferQueue.clear();
        queueSize.set(0);
    }

        assertEquals(new BigDecimal("10"), BigDecimalConversionUtil.toBigDecimal(Short.valueOf((short) 10)));
        assertEquals(new BigDecimal("100"), BigDecimalConversionUtil.toBigDecimal(Integer.valueOf(100)));
        assertEquals(new BigDecimal("1000"), BigDecimalConversionUtil.toBigDecimal(Long.valueOf(1000L)));

        assertEquals(0, new BigDecimal("0.1").compareTo(BigDecimalConversionUtil.toBigDecimal(Float.valueOf(0.1F))));