then <i>A</i> is synchronized before <i>B</i>.
All the atomic operations executed in a program behave as though executed
in some sequentially consistent order.
</p>

<p>
The preceding definition has the same semantics as C++’s sequentially consistent atomics
and Java’s <code>volatile</code> variables.
</p>

<h3 id="finalizer">Finalizers</h3>

<p>

            assertEquals(24, encoded);
            assertEquals(flags, SMBUtil.readInt4(buffer, 16));
        }

        @Test
        @DisplayName("Should encode multiple locks sequentially")
        void testSequentialEncoding() {
            Smb2Lock lock1 = new Smb2Lock(100L, 200L, 1);
            Smb2Lock lock2 = new Smb2Lock(300L, 400L, 2);
            Smb2Lock lock3 = new Smb2Lock(500L, 600L, 4);

import java.util.logging.Level;
import org.jspecify.annotations.Nullable;

/**
 * Executor ensuring that all Runnables submitted are executed in order, using the provided
 * Executor, and sequentially such that no two will ever be running at the same time.
 *
 * <p>Tasks submitted to {@link #execute(Runnable)} are executed in FIFO order.
 *

  // Refined Collection Methods

  /**
   * {@inheritDoc}
   *
   * <p>Elements that occur multiple times in the multiset will appear multiple times in this
   * iterator, though not necessarily sequentially.
   */
  @Override
  Iterator<E> iterator();

  /**
   * Determines whether this multiset contains the specified element.
   *

            chain.id = i;
            chains.add(chain);
            authenticationManager.addChain(chain);
        }

        // Test order by using load which processes chains sequentially
        User user = createTestUser("testuser");
        for (int i = 0; i < chains.size(); i++) {
            User nextUser = createTestUser("user" + (i + 1));
            chains.get(i).loadResult = nextUser;

        // Read another byte
        assertEquals(2, sis.read());

        // 2 bytes should remain
        assertEquals(2, sis.available());
    }

    @Test
    @DisplayName("Multiple messages are read sequentially")
    void multipleMessagesAreReadSequentially() throws IOException {
        // Create two messages
        byte[] data1 = new byte[] { 1, 2 };
        byte[] data2 = new byte[] { 3, 4, 5 };

     *
     * <p>For example, if horizon is {@code [[a, b], [c, d], [e]]}, {@code visitNext()} will return
     * {@code [a, b, null, c, d, null, e, null]} sequentially, encoding the topological structure.
     * (Note, however, that the callers of {@code visitNext()} often insert additional iterators
     * into {@code horizon} between calls to {@code visitNext()}. This causes them to receive

  ) {
  }

  /**
   * Invoked when a call is canceled.
   *
   * Like all methods in this interface, this is invoked on the thread that triggered the event. But
   * while other events occur sequentially; cancels may occur concurrently with other events. For
   * example, thread A may be executing [responseBodyStart] while thread B executes [canceled].
   * Implementations must support such concurrent calls.
   *

  // Refined Collection Methods

  /**
   * {@inheritDoc}
   *
   * <p>Elements that occur multiple times in the multiset will appear multiple times in this
   * iterator, though not necessarily sequentially.
   */
  @Override
  Iterator<E> iterator();

  /**
   * Determines whether this multiset contains the specified element.
   *

  // putting them in `table` or in `next` bits, and subtract 1 again when we need an index value.
  //
  // The elements of `keys`, `values`, and `entries` are added sequentially, so that elements 0 to
  // `size() - 1` are used and remaining elements are not. This makes iteration straightforward.
  // Removing an entry generally involves moving the last element of each array to where the removed