{name: "rootfile", size: 10000},
		{name: "rootfile2", size: 10000},
		{name: "dir1/d1file", size: 2000},
		{name: "dir2/d2file", size: 300},
		{name: "dir2/d2file2", size: 300},
		{name: "dir2/d2file3/", size: 300},
		{name: "dir2/d2file4/", size: 300},
		{name: "dir2/d2file5", size: 300},
		{name: "dir1/dira/dafile", size: 100000},
		{name: "dir1/dira/dbfile", size: 200000},

            return Stream.of(Arguments.of(null, 4), // size() returns 4 even with null
                    Arguments.of(new int[0], 4), // size() returns 4 for empty array
                    Arguments.of(new int[] { 1 }, 4 + 2), // size() returns 4 + 2*1
                    Arguments.of(new int[] { 1, 2 }, 4 + 4), // size() returns 4 + 2*2
                    Arguments.of(new int[] { 1, 2, 3, 4, 5 }, 4 + 10) // size() returns 4 + 2*5
            );
        }

    }

    @Test
    public void test_append_nonExcludedLogger() {
        final LogEvent event = createLogEvent(Level.ERROR, "org.codelibs.fess.helper.SystemHelper", "not excluded");
        appender.append(event);

        final List<LogNotificationEvent> events = ComponentUtil.getLogNotificationHelper().drainAll();
        assertEquals(1, events.size());

   */
  public static <E> Set<Set<E>> combinations(Set<E> set, int size) {
    ImmutableMap<E, Integer> index = Maps.indexMap(set);
    checkNonnegative(size, "size");
    checkArgument(size <= index.size(), "size (%s) must be <= set.size() (%s)", size, index.size());
    if (size == 0) {
      return ImmutableSet.of(ImmutableSet.of());
    } else if (size == index.size()) {
      return ImmutableSet.of(index.keySet());
    }

     * Converts byte count to human-readable size format.
     *
     * @param size the size in bytes
     * @return formatted size string
     */
    public static String byteCountToDisplaySize(final long size) {
        return byteCountToDisplaySize(BigInteger.valueOf(size));
    }

    private static String byteCountToDisplaySize(final BigInteger size) {
        Objects.requireNonNull(size, "size");
        final String displaySize;

      return null;
    }
    return entry.getValue();
  }

  @SuppressWarnings("unchecked")
  final Segment<K, V, E, S>[] newSegmentArray(int ssize) {
    return (Segment<K, V, E, S>[]) new Segment<?, ?, ?, ?>[ssize];
  }

  // Inner Classes

  /**
   * Segments are specialized versions of hash tables. This subclass inherits from ReentrantLock

        assertTrue(docMap.isEmpty());
        assertEquals(0, docMap.size());

        docMap.put("key1", "value1");
        assertFalse(docMap.isEmpty());
        assertEquals(1, docMap.size());

        docMap.put("key2", "value2");
        assertFalse(docMap.isEmpty());
        assertEquals(2, docMap.size());

        docMap.clear();
        assertTrue(docMap.isEmpty());

        format(builder, size, null, false);
    }

    public void format(StringBuilder builder, long size, ScaleUnit unit) {
        format(builder, size, unit, false);
    }

    private void format(StringBuilder builder, long size, ScaleUnit unit, boolean omitSymbol) {
        if (size < 0L) {
            throw new IllegalArgumentException("file size cannot be negative: " + size);
        }

    @Size(max = 1000)
    public String entraidTenant;

    /** Entra ID authority URL. */
    @Size(max = 1000)
    public String entraidAuthority;

    /** Entra ID OAuth2 reply URL. */
    @Size(max = 1000)
    public String entraidReplyUrl;

    /** Entra ID state parameter TTL in seconds. */
    @Size(max = 100)
    public String entraidStateTtl;

    /** Entra ID default groups. */
    @Size(max = 1000)

    // targets.size() < size() / log(size())
    // TODO(kevinb): see if we can share code with OrderedIterator after it
    // graduates from labs.
    if (targets instanceof Multiset) {
      targets = ((Multiset<?>) targets).elementSet();
    }
    if (!SortedIterables.hasSameComparator(comparator(), targets) || (targets.size() <= 1)) {
      return super.containsAll(targets);
    }