}

  /**
   * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
   * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
   */
  @Test
  public void forGraph_breadthFirstIterable_emptyGraph() {
    assertEqualCharNodes(
        Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), "");

  }

  /**
   * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
   * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
   */
  @Test
  public void forGraph_breadthFirstIterable_emptyGraph() {
    assertEqualCharNodes(
        Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), "");

@SuppressWarnings("RedundancyRemover")
@GwtCompatible
public final class ArrayTable<R, C, V> extends AbstractTable<R, C, @Nullable V>
    implements Table<R, C, @Nullable V>, Serializable {

  /**
   * Creates an {@code ArrayTable} filled with {@code null}.
   *
   * @param rowKeys row keys that may be stored in the generated table
   * @param columnKeys column keys that may be stored in the generated table

            public void onDestroy(PooledObject<TestComponent> p) {
                listenerCalled.set(true);
            }
        });

        factory.destroyObject(null);

        // Listener should be called even with null
        assertTrue(listenerCalled.get());
    }

    /**
     * Test destroyObject with exception in listener
     */
    public void test_destroyObject_listenerException() {

  /**
   * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}.
   *
   * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
   * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code
   * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable}
   * is empty.
   *

/// tip

You could use any other SQL or NoSQL database library you want (in some cases called <abbr title="Object Relational Mapper, a fancy term for a library where some classes represent SQL tables and instances represent rows in those tables">"ORMs"</abbr>), FastAPI doesn't force you to use anything. 😎

///

import java.util.Collection;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A collection that associates an ordered pair of keys, called a row key and a column key, with a
 * single value. A table may be sparse, with only a small fraction of row key / column key pairs
 * possessing a corresponding value.
 *

        // Then
        assertNotNull(smbComTreeDisconnect);
        assertEquals(ServerMessageBlock.SMB_COM_TREE_DISCONNECT, smbComTreeDisconnect.getCommand());
        verify(mockConfig).getPid(); // Verify getPid was called
    }

    /**
     * Test writeParameterWordsWireFormat returns 0
     */
    @Test
    @DisplayName("Test writeParameterWordsWireFormat always returns 0")
    public void testWriteParameterWordsWireFormat() {

            return null;
        }).when(cache).resolveSids0(any(), any(), any());

        // Resolve first two entries
        cache.resolveSids(ctx, null, arr, 0, 2);

        // Verify resolveSids0 called exactly once with the two SIDs needing resolution
        ArgumentCaptor<SID[]> captor = ArgumentCaptor.forClass(SID[].class);
        verify(cache, times(1)).resolveSids0(isNull(), same(ctx), captor.capture());

  //
  // Essentially, then, `table[h]` gives us the start of a linked list in `entries`, where every
  // element of the list has the short hash value h.
  //
  // A wrinkle here is that the value 0 (called UNSET in the code) is used as the equivalent of a
  // null pointer. If `table[h] == 0` that means there are no keys in the map whose short hash is h.