void largeMessageIsReadCorrectly() throws IOException {
        // Create a message with 1000 bytes
        int size = 1000;
        byte[] data = new byte[size];
        for (int i = 0; i < size; i++) {
            data[i] = (byte) (i % 256);
        }

        byte[] fullData = concat(messageHeader(size), data);
        InputStream in = new ByteArrayInputStream(fullData);

  public void testRemovePropagatesToMultimap() {
    assertTrue(multimap().entries().remove(mapEntry(k0(), v0())));
    expectMissing(mapEntry(k0(), v0()));
    assertEquals(getNumElements() - 1, multimap().size());
    assertFalse(multimap().containsEntry(k0(), v0()));
  }

  @CollectionSize.Require(absent = ZERO)
  @MapFeature.Require(SUPPORTS_REMOVE)
  public void testRemoveAllPropagatesToMultimap() {

      assertThat(cache.getUnchecked(key)).isSameInstanceAs(value);
      assertThat(cache.asMap().containsKey(key)).isTrue();
      assertThat(cache.asMap().containsValue(value)).isTrue();
      assertThat(cache.size()).isEqualTo(1);
    }
  }

  public void testClear() {
    for (LoadingCache<Key, String> cache : caches()) {
      Key key = new Key(1);
      String value = key.toString();

            assertTrue(result.startsWith("NtlmChallenge[challenge=0x"));
            assertTrue(result.endsWith(",dc=SERVER123]"));

            // Hexdump.toHexString with size = length * 2 produces 8 uppercase hex chars
            // The hex should be "010203FF"
            assertTrue(result.contains("010203FF"));
        }

        @Test

										</div>
									</div>
									</c:forEach>
									<c:set var="nameKey">name${Double.valueOf(savedTags.size()/2).intValue()+1}</c:set>
									<c:set var="valueKey">value${Double.valueOf(savedTags.size()/2).intValue()+1}</c:set>
									<div class="form-group row">
										<div class="col-sm-6">

  // NotApplicableException in the expensive comparator case.
  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

  private final Random random = new Random();

  @BeforeExperiment
  void setUp() {
    queue = heap.create(comparator.get());
    for (int i = 0; i < size; i++) {
      queue.add(random.nextInt());
    }
  }

  @Benchmark

  // NotApplicableException in the expensive comparator case.
  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

  private final Random random = new Random();

  @BeforeExperiment
  void setUp() {
    queue = heap.create(comparator.get());
    for (int i = 0; i < size; i++) {
      queue.add(random.nextInt());
    }
  }

  @Benchmark

import java.util.Map;

import org.codelibs.fess.app.web.CrudMode;
import org.lastaflute.web.validation.Required;
import org.lastaflute.web.validation.theme.conversion.ValidateTypeFailure;

import jakarta.validation.constraints.Size;

/**
 * The create form for Group.
 *
 */
public class CreateForm {

    /**
     * Creates a new CreateForm instance.
     */
    public CreateForm() {
    }

    /**

	height: 0% !important;
}

#result ol {
	list-style: none !important;
	padding-left: 0;
}

#result ol li {
	margin-bottom: 0;
}

#result .title {
	margin: 1.0em 0 0.5em 0;
	font-size: 120%;
	font-weight: 600;
}

section.content table {
	display: table;
	table-layout: fixed;
	width: 100%;
}

section.content table td {
	display: table-cell;
	word-wrap: break-word;

      return valueIterator();
    }

    @Override
    public Spliterator<V> spliterator() {
      return valueSpliterator();
    }

    @Override
    public int size() {
      return AbstractMultimap.this.size();
    }

    @Override
    public boolean contains(@Nullable Object o) {
      return AbstractMultimap.this.containsValue(o);
    }

    @Override
    public void clear() {