user := User{Name: "TestGenericsCreate", Age: 18}
	err := gorm.G[User](DB).Create(ctx, &user)
	if err != nil {
		t.Fatalf("Create failed: %v", err)
	}
	if user.ID == 0 {
		t.Fatalf("no primary key found for %v", user)
	}

	if u, err := gorm.G[User](DB).Where("name = ?", user.Name).First(ctx); err != nil {
		t.Fatalf("failed to find user, got error: %v", err)
	} else if u.Name != user.Name || u.ID != user.ID {

        return doGetConditionQuery();
    }

    // ===================================================================================
    //                                                                         Primary Key
    //                                                                         ===========
    public WebConfigCB acceptPK(String id) {
        assertObjectNotNull("id", id);
        BsWebConfigCB cb = this;

...es lo que **FastAPI** utilizará realmente para saber cuál es la dependencia.

Es a partir de este que **FastAPI** extraerá los parámetros declarados y es lo que **FastAPI** realmente llamará.

---

En este caso, el primer `CommonQueryParams`, en:

//// tab | Python 3.9+

```Python
commons: Annotated[CommonQueryParams, ...
```

////

//// tab | Python 3.9+ sin `Annotated`

/// tip | Consejo

        return doGetConditionQuery();
    }

    // ===================================================================================
    //                                                                         Primary Key
    //                                                                         ===========
    public UserCB acceptPK(String id) {
        assertObjectNotNull("id", id);
        BsUserCB cb = this;

 * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *
 * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
 * {@link ValueGraph}, and {@link Network}):
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, graph);
 * }
 *

 * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *
 * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
 * {@link ValueGraph}, and {@link Network}):
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, graph);
 * }
 *

    /**
     * Transaction subcommand for transacting with a named pipe
     */
    public static final byte TRANS_TRANSACT_NAMED_PIPE = (byte) 0x26;

    /** Offset to the setup words in the primary request */
    protected int primarySetupOffset;
    /** Offset to the parameters in secondary requests */
    protected int secondaryParameterOffset;
    /** Number of parameter bytes being sent in this request */

        assertTrue(activeScore < baseScore);

        // Failed channel should have zero score
        channelInfo.setState(ChannelState.FAILED);
        assertEquals(0, channelInfo.getScore());

        // Primary channel should have higher score
        channelInfo.setState(ChannelState.ESTABLISHED);
        channelInfo.setPrimary(true);
        int primaryScore = channelInfo.getScore();
        assertTrue(primaryScore > baseScore);

                                        </la:link>
                                        <la:link href="../downloadpage"
                                                 styleClass="btn btn-primary btn-xs">
                                            <i class="fa fa-download" aria-hidden="true"></i>
                                            <la:message key="labels.elevate_word_link_download"/>

    }

    @Test
    @DisplayName("Test nextElement() changes command on second call")
    void testNextElementSecondCall() {
        // First call - primary
        transaction.nextElement();
        byte initialCommand = transaction.command;

        // Second call - secondary
        transaction.nextElement();

        // Verify command changed to secondary