this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
     *       increased by a factor of (n choose r).
     * </ul>
     */

        final Map<String, Object> result = coordinatorHelper.parseJson(json);
        assertEquals(true, result.get("found"));
        assertEquals(5, ((Number) result.get("_seq_no")).longValue());
        assertEquals(1, ((Number) result.get("_primary_term")).longValue());

        final Map<String, Object> source = coordinatorHelper.getMapValue(result, "_source");
        assertNotNull(source);

    <example>
      ${fe:formatDate(d, 'yyyy')}
    </example>
  </function>

  <function>
    <description>
      Returns formatted number as a file size from a given value.
    </description>
    <name>formatFileSize</name>
    <function-class>org.codelibs.fess.taglib.FessFunctions</function-class>

    public String toString() {
      return arithmetic.toString();
    }
  }

  private interface ParameterTypesDifferent {
    void foo(
        String s,
        Runnable r,
        Number n,
        Iterable<?> it,
        boolean b,
        Equivalence<String> eq,
        Exception e,
        InputStream in,
        Comparable<?> c,
        Ordering<Integer> ord,
        Charset charset,

   * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
   * the number of times an edge touches {@code node}).
   *
   * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
   *
   * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
   * self-loops incident to {@code node}).
   *

    Map<String, Integer> map = new HashMap<>();
    map.put("One", 1);
    map.put("Three", 3);
    Number number = Double.valueOf(42);
    Function<String, Number> function = Functions.forMap(map, number);

    assertEquals(1, function.apply("One").intValue());
    assertEquals(number, function.apply("Two"));
    assertEquals(3L, function.apply("Three").longValue());
  }

  public void testComposition() {

    connectionListener = ConnectionListener.NONE,
  )

  constructor() : this(5, 5, TimeUnit.MINUTES)

  /** Returns the number of idle connections in the pool. */
  fun idleConnectionCount(): Int = delegate.idleConnectionCount()

  /** Returns total number of connections in the pool. */
  fun connectionCount(): Int = delegate.connectionCount()

  internal val connectionListener: ConnectionListener

    protected Logger statsLogger = null;

    /** Name of the logger used for statistics output. */
    protected String loggerName = "fess.log.crawler.stats";

    /** Maximum number of statistics objects to cache. */
    protected long maxCacheSize = 1000;

    /** Time in milliseconds after which cache entries expire after write. */
    protected long cacheExpireAfterWrite = 10 * 60 * 1000L;

            throw new SQLRuntimeException(ex);
        }
    }

    /**
     * Sets the maximum number of rows.
     *
     * @param statement
     *            {@link Statement}. Must not be {@literal null}.
     * @param maxRows
     *            Maximum number of rows.
     * @see Statement#setMaxRows(int)
     */
    public static void setMaxRows(final Statement statement, final int maxRows) {

            return 100;
        }
        return value;
    }

    /**
     * Gets the maximum number of history messages to retain.
     *
     * @return the maximum number of history messages
     */
    protected int getMaxHistoryMessages() {
        final int value = ComponentUtil.getFessConfig().getRagChatHistoryMaxMessagesAsInteger();