* {@snippet :
 * someGraphAlgorithm(startNode, graph);
 * }
 *
 * This works because those types each implement {@code PredecessorsFunction}. It will also work
 * with any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getParents()} that retrieves its predecessors in a graph:
 *
 * {@snippet :

 *
 * {@snippet :
 * someGraphAlgorithm(startNode, graph);
 * }
 *
 * This works because those types each implement {@code SuccessorsFunction}. It will also work with
 * any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getChildren()} that retrieves its successors in a graph:
 *
 * {@snippet :

import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.Spliterator;
import java.util.Spliterators;
import org.jspecify.annotations.Nullable;

/**
 * Skeletal, implementation-agnostic implementation of the {@link Table} interface.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
abstract class AbstractTable<
        R extends @Nullable Object, C extends @Nullable Object, V extends @Nullable Object>

        byte[] reusedBuffer = testCache.getBuffer();

        // Then
        assertSame(originalBuffer, reusedBuffer, "Released buffer should be reused");
    }

    /**
     * Simple test implementation of BufferCache for testing purposes
     */
    private static class TestBufferCacheImpl implements BufferCache {
        private final List<byte[]> cache;
        private final int bufferSize;

import static java.util.Arrays.asList;

import com.google.common.annotations.GwtCompatible;
import java.util.Collection;
import java.util.Iterator;
import org.jspecify.annotations.Nullable;

/**
 * An implementation of {@code Iterable} which throws an exception on all invocations of the {@link
 * #iterator()} method after the first, and whose iterator is always unmodifiable.
 *

 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package jcifs.dcerpc.msrpc;

/**
 * MSRPC implementation for looking up security identifiers (SIDs).
 * This class provides functionality to resolve SIDs to their corresponding
 * account names using the LSA RPC interface.
 */

 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package jcifs.dcerpc.msrpc;

import jcifs.dcerpc.rpc;

/**
 * MSRPC implementation for opening a domain handle.
 * This class provides functionality to open a handle to a SAM domain
 * using the SAMR RPC interface.
 */
public class MsrpcSamrOpenDomain extends samr.SamrOpenDomain {

    /**

import org.codelibs.fess.suggest.settings.SuggestSettings;
import org.opensearch.index.query.QueryBuilder;
import org.opensearch.transport.client.Client;

/**
 * SuggestBulkFileWriter is an implementation of the SuggestWriter interface.
 * This class is responsible for writing and deleting suggest items in bulk.
 *
 * <p>Currently, the methods in this class throw UnsupportedOperationException

  @CollectionFeature.Require(SERIALIZABLE)
  /*
   * As the class docs say, this test only makes sense for collections that define equals().
   * Accordingly, our testing framework adds it only when testing an implementation of List, Set, or
   * Multiset.
   */
  @SuppressWarnings("UndefinedEquals")
  public void testReserialize() {
    assertEquals(SerializableTester.reserialize(actualContents()), actualContents());
  }

  @Override
  public Set<N> nodes() {
    return delegate().nodes();
  }

  /**
   * Defer to {@link AbstractValueGraph#edges()} (based on {@link #successors(Object)}) for full
   * edges() implementation.
   */
  @Override
  protected long edgeCount() {
    return delegate().edges().size();
  }

  @Override
  public boolean isDirected() {
    return delegate().isDirected();
  }

  @Override