}

    /**
     * Returns the SMB server port.
     * @return the server port
     */
    public int getPort() {
        return port;
    }

    /**
     * Sets the SMB server port.
     * @param port the server port to set
     */
    public void setPort(final int port) {
        this.port = port;
    }

    /**
     * Returns the username for SMB authentication.

    /**
     * Returns the identifier of the access result.
     *
     * @return the identifier
     */
    IDTYPE getId();

    /**
     * Sets the identifier of the access result.
     *
     * @param id the identifier
     */
    void setId(IDTYPE id);

    /**
     * Returns the session identifier.
     *
     * @return the session identifier
     */

    }

    /**
     * Returns the target class.
     *
     * @return the target class
     */
    public Class<?> getTargetClass() {
        return targetClass;
    }

    /**
     * Returns the property name.
     *
     * @return the property name
     */
    public String getPropertyName() {
        return propertyName;
    }

 *
 * <ul>
 *   <li>comparing each object against itself returns true
 *   <li>comparing each object against null returns false
 *   <li>comparing each object against an instance of an incompatible class returns false
 *   <li>comparing each pair of objects within the same equality group returns true
 *   <li>comparing each pair of objects from different equality groups returns false
 *   <li>the hash codes of any two equal objects are equal

  //
  // Graph-level accessors
  //

  /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */
  @Override
  Set<N> nodes();

  /** Returns all edges in this graph. */
  @Override
  Set<EndpointPair<N>> edges();

  //
  // Graph properties
  //

  /**
   * Returns true if the edges in this graph are directed. Directed edges connect a {@link

  //
  // Graph-level accessors
  //

  /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */
  @Override
  Set<N> nodes();

  /** Returns all edges in this graph. */
  @Override
  Set<EndpointPair<N>> edges();

  //
  // Graph properties
  //

  /**
   * Returns true if the edges in this graph are directed. Directed edges connect a {@link

    if ((iterable instanceof Multiset)) {
      return ((Multiset<?>) iterable).count(element);
    } else if ((iterable instanceof Set)) {
      return ((Set<?>) iterable).contains(element) ? 1 : 0;
    }
    return Iterators.frequency(iterable.iterator(), element);
  }

  /**
   * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}.
   *

        assertTrue(result >= 0, "writeBytesWireFormat should return non-negative value");
    }

    @Test
    void testReadParameterWordsWireFormat() {
        byte[] buffer = new byte[1024];

        int result = setupAndX.readParameterWordsWireFormat(buffer, 0);

        // The implementation always returns 0
        assertEquals(0, result, "readParameterWordsWireFormat returns 0");
    }

    @Test

  /**
   * Returns {@code true} if there are no differences between the two maps; that is, if the maps are
   * equal.
   */
  boolean areEqual();

  /**
   * Returns an unmodifiable map containing the entries from the left map whose keys are not present
   * in the right map.
   */
  Map<K, V> entriesOnlyOnLeft();

  /**

  public @Nullable E peekFirst() {
    return peek();
  }

  /**
   * Removes and returns the greatest element of this queue, or returns {@code null} if the queue is
   * empty.
   */
  @CanIgnoreReturnValue
  public @Nullable E pollLast() {
    return isEmpty() ? null : removeAndGet(getMaxElementIndex());
  }

  /**
   * Removes and returns the greatest element of this queue.
   *