* set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput
 * but reduces variability and avoids starvation.
 *
 * <p>This class and its iterator implement all of the optional methods of the {@link
 * Collection} and {@link Iterator} interfaces.
 *
 * @author Doug Lea
 * @author Justin T. Sampson
 * @param <E> the type of elements held in this collection
 */

            assertTrue(bind instanceof jcifs.dcerpc.ndr.NdrObject, "Should extend NdrObject");
            assertTrue(bind instanceof DcerpcConstants, "Should implement DcerpcConstants");
        }

        @Test
        @DisplayName("DcerpcBind should have access to parent class methods")
        void testParentClassMethods() {
            // When/Then

    return accessibleObject.getAnnotations();
  }

  @Override
  public final Annotation[] getDeclaredAnnotations() {
    return accessibleObject.getDeclaredAnnotations();
  }

  // We ought to be able to implement GenericDeclaration instead its parent AnnotatedElement.
  // That would give us this method declaration. But for some reason, implementing
  // GenericDeclaration leads to weird errors in Android tests:

    assertEquals(asList(1, 2), partitions.get(0));
    assertEquals(asList(3), partitions.get(1));
  }

  @J2ktIncompatible // Arrays.asList(...).subList() doesn't implement RandomAccess in J2KT.
  @GwtIncompatible // ArrayList.subList doesn't implement RandomAccess in GWT.
  public void testPartitionRandomAccessTrue() {
    List<Integer> source = asList(1, 2, 3);
    List<List<Integer>> partitions = partition(source, 2);

        return ByteBuffer.allocateDirect(size);
    }
    
    public void releaseBuffer(ByteBuffer buffer) {
        // For direct buffers, we rely on GC
        // Could implement a more sophisticated buffer pool here
    }
    
    public void cleanup() {
        // Clean up all pooled regions
        RdmaMemoryRegion region;
        

    buffer[i] = buffer[j];
    buffer[j] = tmp;
  }

  /*
   * While the current implementation returns `this`, that's not something we mean to guarantee.
   * Anyway, the purpose of this method is to implement a BinaryOperator combiner for a Collector,
   * so its return value will get used naturally.
   */
  @SuppressWarnings("CanIgnoreReturnValueSuggester")
  TopKSelector<T> combine(TopKSelector<T> other) {

      int i = 0;
      for (Object e : elements) {
        array[i++] = (Double) e;
      }
      return create(array);
    }

    /**
     * Creates a new collection containing the given elements; implement this method instead of
     * {@link #create(Object...)}.
     */
    protected abstract List<Double> create(Double[] elements);

    @Override
    public Double[] createArray(int length) {

            .add("field40", new Object[0])
            .toString();
    assertEquals("TestClass{field11=[Hello], field26=Optional.of(World), field31=[!!!]}", toTest);
  }

  @J2ktIncompatible // J2kt CharBuffer does not implement CharSequence so not recognized as empty
  @GwtIncompatible // CharBuffer not available
  public void testToStringOmitEmptyValues_charBuffer() {
    String toTest =
        MoreObjects.toStringHelper(new TestClass())

  /*
   * Order is maintained using a linked list containing all key-value pairs. In
   * addition, a series of disjoint linked lists of "siblings", each containing
   * the values for a specific key, is used to implement {@link
   * ValueForKeyIterator} in constant time.
   */

  static final class Node<K extends @Nullable Object, V extends @Nullable Object>
      extends SimpleEntry<K, V> {

   * Reader#skip(long) skip} to the end of the stream, and return the total number of chars that
   * were skipped.
   *
   * <p>Note that for sources that implement {@link #lengthIfKnown} to provide a more efficient
   * implementation, it is <i>possible</i> that this method will return a different number of chars
   * than would be returned by reading all of the chars.
   *