assertEquals("FFFF", Hexdump.toHexString(-1, 4));
        assertEquals("FF", Hexdump.toHexString(-1, 2));
    }

    @Test
    @DisplayName("Should convert long to hex string with specified size")
    void testToHexStringLong() {
        // Test zero
        assertEquals("0000000000000000", Hexdump.toHexString(0L, 16));
        assertEquals("00000000", Hexdump.toHexString(0L, 8));

   * with a differently behaving {@code loader}. For example, a call that requests a short timeout
   * for an RPC may wait for a similar call that requests a long timeout, or a call by an
   * unprivileged user may return a resource accessible only to a privileged user making a similar
   * call. To prevent this problem, create a key object that includes all values that affect the

      }
      return ImmutableMultiset.copyOf(multiset);
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  @GwtIncompatible @J2ktIncompatible   private static final long serialVersionUID = 0xcafebabe;

	case m.outBlock <- struct{}{}:
	default:
		gridLogIf(m.ctx, errors.New("output unblocked overflow"))
	}
}

func (m *muxClient) pong(msg pongMsg) {
	if msg.NotFound || msg.Err != nil {
		err := errors.New("remote terminated call")
		if msg.Err != nil {
			err = fmt.Errorf("remove pong failed: %v", &msg.Err)
		}
		m.addResponse(Response{Err: err})
		return
	}
	atomic.StoreInt64(&m.LastPong, time.Now().UnixNano())

        ByteBuffer buffer1 = ByteBuffer.wrap(nonce1, 0, 8).order(java.nio.ByteOrder.LITTLE_ENDIAN);
        ByteBuffer buffer2 = ByteBuffer.wrap(nonce2, 0, 8).order(java.nio.ByteOrder.LITTLE_ENDIAN);
        long counter1 = buffer1.getLong();
        long counter2 = buffer2.getLong();

        assertEquals(counter1 + 1, counter2, "CCM counter should increment between nonces");
    }

    @Test

    if (entries.isEmpty()) {
      return emptyMultiset(comparator);
    }
    ImmutableList.Builder<E> elementsBuilder = new ImmutableList.Builder<>(entries.size());
    long[] cumulativeCounts = new long[entries.size() + 1];
    int i = 0;
    for (Entry<E> entry : entries) {
      elementsBuilder.add(entry.getElement());
      cumulativeCounts[i + 1] = cumulativeCounts[i] + entry.getCount();
      i++;

        fileNameField.setAccessible(true);
        assertEquals("", fileNameField.get(emptyNameRequest));

        // Test with long fileName
        String longFileName = "very-long-file-name-with-many-characters-that-could-potentially-cause-issues.txt";
        Smb2CloseRequest longNameRequest = new Smb2CloseRequest(mockConfig, testFileId, longFileName);

     * @return optional entity containing the scheduled job data, or empty if creation fails
     */
    private static OptionalEntity<ScheduledJob> getEntity(final CreateForm form, final String username, final long currentTime) {
        switch (form.crudMode) {
        case CrudMode.CREATE:
            return OptionalEntity.of(new ScheduledJob()).map(entity -> {
                entity.setCreatedBy(username);

        boolean fixed = false;
        Element root = pomDocument.root();

        // Find all elements with combine.children="override" and change to "merge"
        long fixedCombineChildrenCount = findElementsWithAttribute(root, COMBINE_CHILDREN, COMBINE_OVERRIDE)
                .peek(element -> {
                    element.attributeObject(COMBINE_CHILDREN).value(COMBINE_MERGE);

  @BeforeExperiment
  void setUp() {
    // random integers will be generated in this range, then raised to the
    // power of (1/concentration) and floor()ed
    max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration));

    cache =
        CacheBuilder.newBuilder()
            .concurrencyLevel(segments)
            .maximumSize(maximumSize)
            .build(