CronExpression.class.isAnnotation();
        assertTrue(CronExpression.class.isAnnotation());

        // Check that annotation can be applied to METHOD, FIELD, ANNOTATION_TYPE, CONSTRUCTOR, PARAMETER
        java.lang.annotation.Target target = CronExpression.class.getAnnotation(java.lang.annotation.Target.class);
        assertNotNull(target);

        java.lang.annotation.ElementType[] types = target.value();

            digest.sign(dst, headerStart, length, this, response);
        }

        return length;
    }

    /*
     * We overload this because we want readAndXWireFormat to
     * read the parameter words and bytes. This is so when
     * commands are batched together we can recursivly call
     * readAndXWireFormat without reading the non-existent header.
     */

    @Override

        assertEquals(8, next.maxParameterCount, "Max parameter count should be 8");
        assertEquals(Trans2FindFirst2.LIST_SIZE, next.maxDataCount, "Max data count should use LIST_SIZE");
        assertEquals((byte) 0x00, next.maxSetupCount, "Max setup count must be 0");

        // Information level defaults to BOTH_DIRECTORY_INFO (0x104) — check via parameters encoding

/**
 * An interface for representing and manipulating an origin node's adjacent nodes and incident edges
 * in a {@link Network}.
 *
 * @author James Sexton
 * @param <N> Node parameter type
 * @param <E> Edge parameter type
 */
interface NetworkConnections<N, E> {

  Set<N> adjacentNodes();

  Set<N> predecessors();

  Set<N> successors();

  Set<E> incidentEdges();

  Set<E> inEdges();

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A base implementation of {@link NetworkConnections} for undirected networks.
 *
 * @author James Sexton
 * @param <N> Node parameter type
 * @param <E> Edge parameter type
 */
abstract class AbstractUndirectedNetworkConnections<N, E> implements NetworkConnections<N, E> {
  /** Keys are edges incident to the origin node, values are the node at the other end. */

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A base implementation of {@link NetworkConnections} for directed networks.
 *
 * @author James Sexton
 * @param <N> Node parameter type
 * @param <E> Edge parameter type
 */
abstract class AbstractDirectedNetworkConnections<N, E> implements NetworkConnections<N, E> {
  /** Keys are edges incoming to the origin node, values are the source node. */

/**
 * A functional interface for <a
 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * breadth first traversal) that only need a way of accessing the successors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

     *             installation has failed
     * @throws IllegalArgumentException if {@code request} is {@code null} or parameter
     *             {@code localRepository} is {@code null} or {@code localRepository} is not a directory
     *             or parameter {@code mavenArtifacts} is {@code null} or
     *             {@code mavenArtifacts.isEmpty()} is {@code true}.
     */

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * An implementation of {@link GraphConnections} for undirected graphs.
 *
 * @author James Sexton
 * @param <N> Node parameter type
 * @param <V> Value parameter type
 */
final class UndirectedGraphConnections<N, V> implements GraphConnections<N, V> {
  private final Map<N, V> adjacentNodeValues;

        // The method should write parameter words
        assertTrue(result >= 0, "writeParameterWordsWireFormat should return non-negative value");
    }

    @Test
    void testReadParameterWordsWireFormat() {
        byte[] buffer = new byte[1024];
        int result = response.readParameterWordsWireFormat(buffer, 0);

        // The method should read parameter words