assertTrue(result.contains("searchStorageType=0"));
        assertTrue(result.contains("filename=\\test\\path\\"));
    }

    @Test
    @DisplayName("Test constants values")
    void testConstants() {
        // Test flag constants
        assertEquals(0x01, Trans2FindFirst2.FLAGS_CLOSE_AFTER_THIS_REQUEST);
        assertEquals(0x02, Trans2FindFirst2.FLAGS_CLOSE_IF_END_REACHED);

        for (CompletableFuture<Void> task : taskFutures) {
            task.cancel(true);
        }
        asyncNotifyTasks.clear();

        // Unregister all active registrations
        List<CompletableFuture<Void>> unregisterFutures = new ArrayList<>();

        for (WitnessRegistration registration : registrations.values()) {

    assertEmpty(multimap().entries());
    assertEmpty(multimap().asMap());
    assertEmpty(multimap().keySet());
    assertEmpty(multimap().keys());
    assertEmpty(multimap().values());
    for (K key : sampleKeys()) {
      assertGet(key);
    }
  }

  @MapFeature.Require(SUPPORTS_REMOVE)
  public void testClear() {
    multimap().clear();
    assertCleared();
  }

 * (i.e. the <i>main</i> artifact) or the ones that will be used when building <i>tests</i>).
 * <p>
 * This extensible enum has two defined values, {@link #MAIN} and {@link #TEST},
 * but can be extended by registering a {@code org.apache.maven.api.spi.ProjectScopeProvider}.
 * <p>

  }

  private Multiset<N> predecessorsMultiset() {
    Multiset<N> predecessors = getReference(predecessorsReference);
    if (predecessors == null) {
      predecessors = HashMultiset.create(inEdgeMap.values());
      predecessorsReference = new SoftReference<>(predecessors);
    }
    return predecessors;
  }

  @LazyInit private transient @Nullable Reference<Multiset<N>> successorsReference;

  @Override

  }

  private Multiset<N> predecessorsMultiset() {
    Multiset<N> predecessors = getReference(predecessorsReference);
    if (predecessors == null) {
      predecessors = HashMultiset.create(inEdgeMap.values());
      predecessorsReference = new SoftReference<>(predecessors);
    }
    return predecessors;
  }

  @LazyInit private transient @Nullable Reference<Multiset<N>> successorsReference;

  @Override

					_, primaryValues := schema.GetIdentityFieldValuesMap(stmt.Context, stmt.ReflectValue, stmt.Schema.PrimaryFields)
					column, values := schema.ToQueryValues("", stmt.Schema.PrimaryFieldDBNames, primaryValues)
					stmt.AddClause(clause.Where{Exprs: []clause.Expression{clause.IN{Column: column, Values: values}}})
				}
			}
		case reflect.Struct:
			for _, field := range stmt.Schema.PrimaryFields {

 * {@link NdrBuffer#enc_ndr_hyper(long)} and {@link NdrBuffer#dec_ndr_hyper()}.
 * The tests verify that:
 * <ul>
 *   <li>encoding and decoding round‑trip correctly handle typical, zero,
 *       and extreme {@code long} values.</li>
 *   <li>encode/decode methods interact correctly with a mocked
 *       {@link NdrBuffer} so that the correct method is called with
 *       the correct argument.</li>

   * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] successor;

import java.math.BigInteger;
import org.jspecify.annotations.Nullable;

/**
 * A wrapper class for unsigned {@code long} values, supporting arithmetic operations.
 *
 * <p>In some cases, when speed is more important than code readability, it may be faster simply to
 * treat primitive {@code long} values as unsigned, using the methods from {@link UnsignedLongs}.
 *
 * <p>See the Guava User Guide article on <a