assertEquals(expectedLow, buffer[offset + 2]);
        assertEquals(expectedHigh, buffer[offset + 3]);
    }

    private static Stream<Arguments> provideFidTestCases() {
        return Stream.of(Arguments.of(0x0000, (byte) 0x00, (byte) 0x00), Arguments.of(0x00FF, (byte) 0xFF, (byte) 0x00),
                Arguments.of(0xFF00, (byte) 0x00, (byte) 0xFF), Arguments.of(0xFFFF, (byte) 0xFF, (byte) 0xFF),

        Map<String, String> infoMap = new HashMap<>();
        infoMap.put(Constants.CRAWLER_STATUS, Constants.TRUE);
        infoMap.put("CrawlerStartTime", "2024-01-01T10:00:00");
        infoMap.put("CrawlerEndTime", "2024-01-01T11:00:00");

        try {
            crawler.sendMail(infoMap);
        } catch (Exception e) {
            fail("Should not throw exception: " + e.getMessage());
        }
    }

  }

  // In a previous implementation this would cause a stack overflow after ~2000 futures chained
  // together.  Now it should only be limited by available memory (and time)
  public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {
      SettableFuture<String> curr = SettableFuture.create();

		expected time.Time
	}{
		{
			time.Date(2020, time.March, 15, 10, 10, 10, 0, time.UTC),
			4,
			time.Date(2020, time.March, 20, 0, 0, 0, 0, time.UTC),
		},
		{
			time.Date(2020, time.March, 15, 0, 0, 0, 0, time.UTC),
			1,
			time.Date(2020, time.March, 17, 0, 0, 0, 0, time.UTC),
		},
	}

	for i, tc := range testCases {
		t.Run(fmt.Sprintf("Test %d", i+1), func(t *testing.T) {

          double z = aa.updateAndGet(i, value -> value - y);
          assertBitEquals(x - y, z);
          assertBitEquals(x - y, aa.get(i));
        }
      }
    }
  }

  static final long COUNTDOWN = 100000;

  class Counter extends CheckedRunnable {
    final AtomicDoubleArray aa;
    volatile long counts;

    Counter(AtomicDoubleArray a) {
      aa = a;
    }

            assertTrue(s1.isEmpty());
            // isBlank will fail if sub_authority is null, so we skip that check for s1

            // All-zero subauthorities
            byte[] ident = new byte[] { 0, 0, 0, 0, 0, 0 };
            rpc.sid_t st = buildSidT((byte) 1, ident, 0, 0);
            SID s2 = new SID(st, jcifs.SID.SID_TYPE_USE_NONE, null, null, false);
            assertFalse(s2.isEmpty());

class LeakingProcessKillPatternTest extends Specification {

    def "matches worker process started in test on Windows"() {

    assertThat(Hashing.adler32().toString()).isEqualTo("Hashing.adler32()");
  }

  public void testMurmur3_128() {
    HashTestUtils.check2BitAvalanche(Hashing.murmur3_128(), 250, 0.20);
    HashTestUtils.checkAvalanche(Hashing.murmur3_128(), 250, 0.17);
    HashTestUtils.checkNo2BitCharacteristics(Hashing.murmur3_128());
    HashTestUtils.checkNoFunnels(Hashing.murmur3_128());

        /**
         * Default constructor for TimeOfDayInfo.
         */
        public TimeOfDayInfo() {
        }

        /**
         * The time elapsed since 00:00:00, January 1, 1970 GMT.
         */
        public int elapsedt;
        /**
         * The number of milliseconds from the start of the current second.
         */
        public int msecs;
        /**

        // Verify O(1) performance - should be reasonably fast (allowing for JVM overhead)
        assertTrue(avgAllocTimeNs < 10000, "Average allocation should be under 10000ns (O(1) performance)");
        assertTrue(avgReleaseTimeNs < 10000, "Average release should be under 10000ns (O(1) performance)");
        assertEquals(threadCount * operationsPerThread, allocations.get());