}

        // Test boundary values
        assertEquals("1bytes", MemoryUtil.byteCountToDisplaySize(1L));
        assertEquals("999bytes", MemoryUtil.byteCountToDisplaySize(999L));

        // Test very large values close to EB boundary
        assertEquals("1.024EB", MemoryUtil.byteCountToDisplaySize(FileUtils.ONE_EB));

        // Test exact thresholds
        assertEquals("1.024KB", MemoryUtil.byteCountToDisplaySize(1024L));

   *
   * <p><b>Note:</b> coalescing requires calling {@code .equals()} on any connected values, which
   * may be expensive depending on the value type. Using this method on range maps with large values
   * such as {@link Collection} types is discouraged.
   *
   * @since 22.0
   */
  void putCoalescing(Range<K> range, V value);

                return props;
            }
        };
        assertEquals(Long.valueOf(-86400000), negativeEnv.getTimeAdjustTimeMillisAsLong());

        // Test large value (one year as mentioned in comment)
        FessEnv.SimpleImpl yearEnv = new FessEnv.SimpleImpl() {
            protected Properties prepareProperties() {
                Properties props = new Properties();

         * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache.
         * This avoids out-of-control memory consumption, and it keeps the cache from growing so
         * large that doing the lookup is noticeably slower than redoing the work would be.
         *
         * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope

    bytesIn.writeShort(0xff00) // == Indexed - Add idx = 127
    assertFailsWith<IOException> {
      hpackReader!!.readHeaders()
    }.also { expected ->
      assertThat(expected.message).isEqualTo("Header index too large 127")
    }
  }

  // Example taken from twitter/hpack DecoderTest.testInsidiousIndex
  @Test
  fun readIndexedHeaderFieldInsidiousIndex() {
    bytesIn.writeByte(0xff) // == Indexed - Add ==

            // Should not throw when converting to byte array
            assertDoesNotThrow(() -> init.toByteArray());
        }

        @Test
        @DisplayName("Large MIC values are handled correctly")
        void testLargeMicValue() throws Exception {
            byte[] largeMic = new byte[1024];
            Arrays.fill(largeMic, (byte) 0xAB);

        assertTrue(negInfinityOpt.isPresent());
        assertTrue(Float.isInfinite(negInfinityOpt.get()));

        // Test with very large strings
        StringBuilder largeString = new StringBuilder();
        for (int i = 0; i < 10000; i++) {
            largeString.append("x");
        }

 * particular example can be written as just:
 *
 * {@snippet :
 * ContiguousSet.closed(5, 42)
 * }
 *
 * <p><b>Warning:</b> Be extremely careful what you do with conceptually large instances (such as
 * {@code ContiguousSet.create(Range.greaterThan(0), DiscreteDomain.integers()}). Certain operations
 * on such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link

            System.arraycopy(data, offset, result, 0, length);
            return result;
        }
        if (length > MAX_COMPRESSION_SIZE) {
            throw new CIFSException("Data too large for compression: " + length + " bytes");
        }

        switch (algorithm) {
        case COMPRESSION_NONE:
            byte[] uncompressed = new byte[length];

        final IllegalStateException iseCause = new IllegalStateException("Invalid parser state");
        final OutOfMemoryError oomCause = new OutOfMemoryError("Query too large");

        // Execute
        final InvalidQueryException npeException = new InvalidQueryException(messageCode, message, npeCause);