// Single node on list
          if (next == null) {
            newTable.set(headIndex, head);
          } else {
            // Reuse the consecutive sequence of nodes with the same target
            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            E tail = head;
            int tailIndex = headIndex;

# Field name for document ID in the index.
index.field.doc_id=doc_id
# Field name for internal ID in the index.
index.field.id=_id
# Field name for version in the index.
index.field.version=_version
# Field name for sequence number in the index.
index.field.seq_no=_seq_no
# Field name for primary term in the index.
index.field.primary_term=_primary_term
# Field name for language in the index.
index.field.lang=lang

    /**
     * Deletes a document from the specified index with optimistic concurrency control.
     *
     * @param index       the index name
     * @param id          the document ID
     * @param seqNo       the sequence number for optimistic concurrency control
     * @param primaryTerm the primary term for optimistic concurrency control
     * @return true if the document was deleted successfully, false otherwise

    // Check that a fresh connection was created, either immediately or after attempting reuse.
    // We know that a fresh connection was created if the server recorded a request with sequence
    // number 0. Since the client may have attempted to reuse the broken connection just before
    // creating a fresh connection, the server may have recorded 2 requests at this point. The order

          // Single node on list
          if (next == null) {
            newTable.set(headIndex, head);
          } else {
            // Reuse the consecutive sequence of nodes with the same target
            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            ReferenceEntry<K, V> tail = head;

CMAC-AES, // according to NIST SP 800-108 Revision 1 Update 1, Section 4.1. // // It produces a 256-bit output, and accepts a 8-bit Label and a 96-bit Context. // It uses a counter of 16 bits placed before the fixed data. The fixed data is // the sequence Label || 0x00 || Context. The L field is omitted, since the // output key length is fixed. // // It's optimized for use in XAES-256-GCM (https://c2sp.org/XAES-256-GCM), // rather than for exposing it to applications as a stand-alone KDF. type CounterKDF...

- Ensure Job status updates are batched by 1s. This fixes an unlikely scenario when a sequence of immediately 
  completing pods could trigger a sequence of non-batched Job status updates. ([#118470](https://github.com/kubernetes/kubernetes/pull/118470), [@mimowo](https://github.com/mimowo)) [SIG Apps]

CMAC-AES, // according to NIST SP 800-108 Revision 1 Update 1, Section 4.1. // // It produces a 256-bit output, and accepts a 8-bit Label and a 96-bit Context. // It uses a counter of 16 bits placed before the fixed data. The fixed data is // the sequence Label || 0x00 || Context. The L field is omitted, since the // output key length is fixed. // // It's optimized for use in XAES-256-GCM (https://c2sp.org/XAES-256-GCM), // rather than for exposing it to applications as a stand-alone KDF. type CounterKDF...

          // Single node on list
          if (next == null) {
            newTable.set(headIndex, head);
          } else {
            // Reuse the consecutive sequence of nodes with the same target
            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            ReferenceEntry<K, V> tail = head;

### Fixes

* 🐛 Fix Query\Header\Cookie parameter model alias. PR [#14360](https://github.com/fastapi/fastapi/pull/14360) by [@YuriiMotov](https://github.com/YuriiMotov).
* 🐛 Fix optional sequence handling in `serialize sequence value` with Pydantic V2. PR [#14297](https://github.com/fastapi/fastapi/pull/14297) by [@YuriiMotov](https://github.com/YuriiMotov).

## 0.123.2 (2025-12-02)

### Fixes