SuggestItem firstItem = items.get(0);
        assertTrue(firstItem.getTags().length >= 2);
    }

    @Test
    public void test_parseDocumentWithLargeText() throws Exception {
        // Test with text larger than maxAnalyzedContentLength
        StringBuilder largeText = new StringBuilder();
        for (int i = 0; i < 2000; i++) {
            largeText.append("テスト ");
        }

        assertEquals("0xFFFFFFFF", message, "Should return hex string for code smaller than any known.");
    }

    /**
     * Test getMessageByDcerpcError() with an error code larger than any known.
     * The binary search implementation has a bug where it accesses array out of bounds.
     */
    @Test
    void testGetMessageByDcerpcError_largerThanAny() {

* `compresslevel` - Used during GZip compression. It is an integer ranging from 1 to 9. Defaults to `9`. Lower value results in faster compression but larger file sizes, while higher value results in slower compression but smaller file sizes.

## Other middlewares { #other-middlewares }

There are many other ASGI middlewares.

For example:

   *
   * @param element the element to prepend to the front of {@code array}
   * @param array the array of elements to append
   * @return an array whose size is one larger than {@code array}, with {@code element} occupying
   *     the first position, and the elements of {@code array} occupying the remaining elements.
   */

  internal const val OPCODE_CONTROL_CLOSE = 0x8
  internal const val OPCODE_CONTROL_PING = 0x9
  internal const val OPCODE_CONTROL_PONG = 0xa

  /**
   * Maximum length of frame payload. Larger payloads, if supported by the frame type, can use the
   * special values [PAYLOAD_SHORT] or [PAYLOAD_LONG].
   */
  internal const val PAYLOAD_BYTE_MAX = 125L

  /** Maximum length of close message in bytes. */

        indexDocuments(5);
        runner.refresh();

        List<String> results =
                ScrollOperationHelper.scrollSearch(client, suggester.settings(), INDEX_NAME, QueryBuilders.matchAllQuery(), 10, // page size larger than document count
                        (hit, accumulator) -> accumulator.add(hit.getId()));

        assertNotNull(results);
        assertEquals(5, results.size());
    }

    @Test

        long initialAllocated = bufferManager.getTotalAllocated();

        // Allocate regions larger than pool buffer size to force new allocations
        RdmaMemoryRegion region1 = bufferManager.getSendRegion(131072); // 128KB > 64KB pool size
        RdmaMemoryRegion region2 = bufferManager.getSendRegion(131072); // Another large allocation

        };

        String result = Hexdump.toHexString(data);
        assertEquals("00FF7F80", result);
    }

    @Test
    @DisplayName("Should handle large byte arrays efficiently")
    void testLargeByteArray() {
        // Create a larger test array
        byte[] data = createTestData(1024);

        // Test full array conversion
        String result = Hexdump.toHexString(data);

        while (true) {
          // Skip the elements smaller than the partition.
          do {
            low++;
          } while (array[low] < partition);

          // Skip the elements larger than the partition.
          do {
            high--;
          } while (array[high] > partition);
          if (high < low) {
            break; // Pointers crossed. Partitioning complete.
          }

            final Map<String, Object> doc = new HashMap<>();
            doc.put("title", NAME_PREFIX + "large_" + i);
            doc.put("url", "http://example.com/bulk/large/" + i);
            doc.put("content", "This is test content for large bulk document " + i);
            doc.put("boost", 1.0f);
            doc.put("role", "Rguest");
            documents.add(doc);
        }