}

  /**
   * Returns a linear transformation giving the best fit to the data according to <a
   * href="http://mathworld.wolfram.com/LeastSquaresFitting.html">Ordinary Least Squares linear
   * regression</a> of {@code y} as a function of {@code x}. The count must be greater than one, and
   * either the {@code x} or {@code y} data must have a non-zero population variance (i.e. {@code

which in turn are made up of memory operations.
</p>

<p>
A <i>memory operation</i> is modeled by four details:
</p>
<ul>
	<li>its kind, indicating whether it is an ordinary data read, an ordinary data write,
    or a <i>synchronizing operation</i> such as an atomic data access,
	a mutex operation, or a channel operation,</li>
	<li>its location in the program,</li>

     * you don't want). The second <code>GAV</code> is either fully specified, or also can contain <code>*</code>,
     * then it behaves as "ordinary relocation": the coordinate is preserved from relocated artifact.
     * Finally, if right hand <code>GAV</code> is absent (line looks like <code>GAV&gt;</code>), the left hand matching

   *       then sequentially accessing it could result in other processes dying. This is solvable
   *       via madvise(2), but that obviously doesn't exist in java.
   *   <li>Ordinary copy. Kernel copies bytes into a kernel buffer, from a kernel buffer into a
   *       userspace buffer (byte[] or ByteBuffer), then copies them from that buffer into the
   *       destination channel.
   * </ol>
   *

    @Test
    @DisplayName("Should return consistent ordinal values")
    void testOrdinalValues() {
        // Ordinal values should be consistent with enum declaration order
        assertTrue(DialectVersion.SMB1.ordinal() < DialectVersion.SMB202.ordinal());
        assertTrue(DialectVersion.SMB202.ordinal() < DialectVersion.SMB210.ordinal());
        assertTrue(DialectVersion.SMB210.ordinal() < DialectVersion.SMB300.ordinal());

    int dataLength = -1;
    try {
      DataInputStream din = new DataInputStream(in);
      // currently this assumes there is no negative ordinal; will have to be updated if we
      // add non-stateless strategies (for which we've reserved negative ordinals; see
      // Strategy.ordinal()).
      strategyOrdinal = din.readByte();
      numHashFunctions = toUnsignedInt(din.readByte());
      dataLength = din.readInt();

      /*

        // Ordinal is consistent with declaration order
        switch (name) {
        case "NONE":
            assertEquals(0, rp.ordinal());
            break;
        case "NO_TIMEOUT":
            assertEquals(1, rp.ordinal());
            break;
        case "NO_RETRY":
            assertEquals(2, rp.ordinal());
            break;
        case "RETAIN_PAYLOAD":

    }

    /**
     * Tests the ordinal values of the enum constants.
     */
    @Test
    void testEnumOrdinals() {
        // Verify the ordinal values, which can be important if they are used in logic
        assertEquals(0, ResolverType.RESOLVER_WINS.ordinal());
        assertEquals(1, ResolverType.RESOLVER_BCAST.ordinal());
        assertEquals(2, ResolverType.RESOLVER_DNS.ordinal());

        return ordinal() >= v.ordinal();
    }

    /**
     * Check if this dialect version is at most the specified version
     *
     * @param v the version to compare against
     * @return whether this version is a most the given one
     */
    public boolean atMost(final DialectVersion v) {
        return ordinal() <= v.ordinal();
    }

    /**

        assertEquals("LOGOUT", SsoResponseType.LOGOUT.name());
    }

    public void test_ordinal() {
        // Test ordinal() method returns correct position
        assertEquals(0, SsoResponseType.METADATA.ordinal());
        assertEquals(1, SsoResponseType.LOGOUT.ordinal());
    }

    public void test_toString() {
        // Test toString() method (default implementation returns name)