assertEquals(2, resolvedFirst.length);
        assertEquals("user1", ((SID) resolvedFirst[0]).acctName);
        assertEquals("user2", ((SID) resolvedFirst[1]).acctName);

        // Second call with overlap should use cache for s2 and s3, requiring only s3 if not cached
        // Mark s3 unresolved to force resolve of one element
        doAnswer(inv -> {
            SID[] toResolve = inv.getArgument(2);

 *
 * Mappings Data (4,719 bytes)
 * ===========================
 *
 * This is UTF-8 character data. It is indexed into by b2b3 in the ranges dataset.
 *
 * Mappings may overlap.
 *
 * ASCII-Only
 * ==========
 *
 * Neither the section index nor the ranges data use bit 0x80 anywhere. That means the data is

            assertEquals(0x0002, Smb2Constants.SMB2_NEGOTIATE_SIGNING_REQUIRED, "Signing required flag must be 0x0002");
        }

        @Test
        @DisplayName("Signing flags should not overlap")
        void testSigningFlagsNoOverlap() {
            assertNotEquals(Smb2Constants.SMB2_NEGOTIATE_SIGNING_ENABLED, Smb2Constants.SMB2_NEGOTIATE_SIGNING_REQUIRED,
                    "Signing flags must be distinct");

But if you are certain that the content that you are returning is **serializable with JSON**, you can pass it directly to the response class and avoid the extra overhead that FastAPI would have by passing your return content through the `jsonable_encoder` before passing it to the response class.

{* ../../docs_src/custom_response/tutorial001b.py hl[2,7] *}

/// info

            byte[] outputBytes, int ioctlFlags) {
        final int headerLen = 64; // SMB2 header is 64 bytes
        final int bodyFixed = 48; // body size minus 1 for structure size field overlap
        final int payloadStart = headerLen + bodyFixed;
        final int bodyLen = bodyFixed + inputCount + outputCount;

        byte[] buf = new byte[bodyLen];
        int pos = 0;

justify-content: center;\n  z-index: 50;\n}\n\n.card .overlay > .fa,\n.card .overlay > .fas,\n.card .overlay > .far,\n.card .overlay > .fab,\n.card .overlay > .fal,\n.card .overlay > .fad,\n.card .overlay > .svg-inline--fa,\n.card .overlay > .ion,\n.overlay-wrapper .overlay > .fa,\n.overlay-wrapper .overlay > .fas,\n.overlay-wrapper .overlay > .far,\n.overlay-wrapper .overlay > .fab,\n.overlay-wrapper .overlay > .fal,\n.overlay-wrapper .overlay > .fad,\n.overlay-wrapper .overlay > .svg-inline--fa,\n.overlay-wrapper...

- **Memory efficient** - Specialized collections like `LruHashMap` and `ArrayMap` for memory-conscious applications
- **Java 21 features** - Switch expressions and pattern matching for reduced overhead

## 🧪 Building and Testing

### Development Setup
```bash
# Clone the repository
git clone https://github.com/codelibs/corelib.git
cd corelib

# Compile the project
mvn clean compile

 _init() {\n    this.remember()\n    this.autoCollapse()\n\n    $(window).resize(() => {\n      this.autoCollapse(true)\n    })\n  }\n\n  _addOverlay() {\n    const overlay = $('<div />', {\n      id: 'sidebar-overlay'\n    })\n\n    overlay.on('click', () => {\n      this.collapse()\n    })\n\n    $(SELECTOR_WRAPPER).append(overlay)\n  }\n\n  // Static\n\n  static _jQueryInterface(operation) {\n    return this.each(function () {\n      let data = $(this).data(DATA_KEY)\n      const _options = $.extend({},...

.overlay>.fad,.overlay-wrapper .overlay>.fal,.overlay-wrapper .overlay>.far,.overlay-wrapper .overlay>.fas,.overlay-wrapper .overlay>.ion,.overlay-wrapper .overlay>.svg-inline--fa,.small-box .overlay>.fa,.small-box .overlay>.fab,.small-box .overlay>.fad,.small-box .overlay>.fal,.small-box .overlay>.far,.small-box .overlay>.fas,.small-box .overlay>.ion,.small-box .overlay>.svg-inline--fa{color:#343a40}.card .overlay.dark,.info-box .overlay.dark,.overlay-wrapper .overlay.dark,.small-box .overlay.dark{backg...

 * form}), the memory requirement is 8*N bytes for the copy of the dataset plus an overhead which is
 * independent of N (but depends on the quantiles being computed). When calling {@link
 * ScaleAndIndex#computeInPlace computeInPlace} (in {@linkplain ScaleAndIndexes#computeInPlace
 * either form}), only the overhead is required. The number of object allocations is independent of
 * N in both cases.
 *