}

// isValidSetSize - checks whether given count is a valid set size for erasure coding.
var isValidSetSize = func(count uint64) bool {
	return (count >= setSizes[0] && count <= setSizes[len(setSizes)-1])
}

func commonSetDriveCount(divisibleSize uint64, setCounts []uint64) (setSize uint64) {
	// prefers setCounts to be sorted for optimal behavior.
	if divisibleSize < setCounts[len(setCounts)-1] {
		return divisibleSize
	}

    assertMinSize(union(setSize(2), setSize(3)), 3);
    assertMinSize(union(setSize(3), setSize(2)), 3);
    assertMinSize(union(setSizeRange(10, 20), setSizeRange(11, 12)), 11);
    assertMinSize(union(setSizeRange(11, 12), setSizeRange(10, 20)), 11);
  }

  public void testUnion_maxSize() {
    assertMaxSize(union(emptySet(), emptySet()), 0);
    assertMaxSize(union(setSize(2), setSize(3)), 5);

                .setSize(0)
                .execute()
                .actionGet()
                .getHits()
                .getTotalHits()
                .value() > 0);
        assertTrue(fesenClient.prepareSearch("fess_crawler.filter")
                .setQuery(QueryBuilders.termQuery("sessionId", sessionId2))
                .setSize(0)
                .execute()

        final SearchRequestBuilder builder = client.prepareSearch(index);

        if (skipDuplicateWords) {
            builder.setSize(size * 2);
        } else {
            builder.setSize(size);
        }

        // set query.
        final QueryBuilder q = buildQuery(query, fields);

        // set function score

            builder.setFrom(0);
            builder.setSize(5);
        });

        assertEquals(5, page1.size());

        // Get second page (5 items)
        final List<OpenSearchAccessResult> page2 = dataService.getAccessResultList(builder -> {
            builder.setQuery(QueryBuilders.termQuery("sessionId", sessionId));
            builder.setFrom(5);
            builder.setSize(5);
        });

```java
import org.codelibs.fess.suggest.request.suggest.SuggestResponse;

// Synchronous suggestion request
SuggestResponse response = suggester.suggest()
    .setQuery("sea")                    // user input
    .setSize(10)                        // max suggestions
    .execute()
    .getResponse();

// Process suggestions
response.getItems().forEach(item -> {
    System.out.println("Suggestion: " + item.getText()[0]);

   * can hold setSize elements with the desired load factor. Always returns at least setSize + 2.
   */
  // TODO(cpovirk): Move to Hashing or something, since it's used elsewhere in the Android version.
  static int chooseTableSize(int setSize) {
    setSize = max(setSize, 2);
    // Correct the size for open addressing to match desired load factor.
    if (setSize < CUTOFF) {

            // Add a valid text entry
            final byte[] content1 = "Valid tar content テスト".getBytes("UTF-8");
            final TarArchiveEntry entry1 = new TarArchiveEntry("valid.txt");
            entry1.setSize(content1.length);
            tos.putArchiveEntry(entry1);
            tos.write(content1);
            tos.closeArchiveEntry();

            // Add another valid entry

  private void verifyTableSize(int inputSize, int setSize, int tableSize) {
    Builder<Integer> builder = ImmutableSet.builder();
    for (int i = 0; i < inputSize; i++) {
      builder.add(i % setSize);
    }
    ImmutableSet<Integer> set = builder.build();
    assertTrue(set instanceof RegularImmutableSet);
    assertEquals(
        "Input size " + inputSize + " and set size " + setSize,
        tableSize,

        SuggestItem[] items = getPopularWordsItemSet2();
        suggester.indexer().index(items);
        suggester.refresh();

        PopularWordsResponse response = suggester.popularWords().setSize(2).execute().getResponse();

        assertEquals(5, response.getTotal());

        for (int i = 0; i < 5; i++) {
            assertEquals(2, response.getNum());
            boolean find = false;