*
   * {@snippet :
   * List<Class<?>> classes = Arrays.asList(
   *     Object.class, String.class, Number.class, Long.class);
   * return Iterables.filter(classes, subtypeOf(Number.class));
   * }
   *
   * The code above returns an iterable containing {@code Number.class} and {@code Long.class}.
   *
   * <p><b>Discouraged:</b> Prefer using {@code clazz::isAssignableFrom} or {@code x ->

      for (int i = n1 + 1; i <= n2; i++) {
        result *= i;
      }
      return BigInteger.valueOf(result);
    }

    /*
     * We want each multiplication to have both sides with approximately the same number of digits.
     * Currently, we just divide the range in half.
     */
    int mid = (n1 + n2) >>> 1;
    return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
  }

  @Benchmark

    public static final String CONSTRAINTS_DecimalMin_MESSAGE = "{constraints.DecimalMin.message}";

    /** The key of the message: {item} must be a number. (expected: <number>.<number>) */
    public static final String CONSTRAINTS_Digits_MESSAGE = "{constraints.Digits.message}";

    /** The key of the message: {item} must be a future value. */

     * offset off to this file output stream.
     *
     * @param b
     *            The array
     * @param off the start offset in the data
     * @param len the number of bytes to write
     * @throws IOException
     *             if a network error occurs
     */

    @Override
    public void write(final byte[] b, final int off, final int len) throws IOException {

 *    match additional prefixes (`us-west.www.publicobject.com`) or suffixes (`publicobject.com`).
 *
 *  * **Any number of subdomains**: Use two asterisks to like `**.publicobject.com` to match any
 *    number of prefixes (`us-west.www.publicobject.com`, `www.publicobject.com`) including no
 *    prefix at all (`publicobject.com`). For most applications this is the best way to configure

urn!0;return!1},e._getConfig=function(t){var e=o.default(this.element).data();return Object.keys(e).forEach((function(t){-1!==Pt.indexOf(t)&&delete e[t]})),"number"==typeof(t=r({},this.constructor.Default,e,"object"==typeof t&&t?t:{})).delay&&(t.delay={show:t.delay,hide:t.delay}),"number"==typeof t.title&&(t.title=t.title.toString()),"number"==typeof t.content&&(t.content=t.content.toString()),d.typeCheckConfig(It,t,this.constructor.DefaultType),t.sanitize&&(t.template=At(t.template,t.whiteList,...

    - If users want all of Guava, they depend on guava, which, as of Guava
    27.0, depends on
    listenablefuture-9999.0-empty-to-avoid-conflict-with-guava. The 9999.0-...
    version number is enough for some build systems (notably, Gradle) to select
    that empty artifact over the "real" listenablefuture-1.0 -- avoiding a
    conflict with the copy of ListenableFuture in guava itself. If users are

/**
 * Represents the FILE_STANDARD_INFORMATION structure used in SMB2/3 file system control code (FSCC) operations.
 * This structure provides standard file information including allocation size, end-of-file position,
 * number of links, deletion status, and directory flag.
 */
public class FileStandardInfo implements BasicFileInformation {

    private long allocationSize;
    private long endOfFile;
    private int numberOfLinks;

        // When
        FileEntry[] entries = dfsRootEnum.getEntries();

        // Then
        assertNotNull(entries, "The returned entries array should not be null.");
        assertEquals(2, entries.length, "The number of entries should be correct.");

        // The getEntries method returns FileEntry objects. We can check their names.
        assertEquals("\\domain\share1", entries[0].getName(), "The name of the first share should be correct.");

     * @param dataMap the document data to be indexed as key-value pairs
     */
    void store(DataStoreParams paramMap, Map<String, Object> dataMap);

    /**
     * Returns the total number of documents processed by this callback.
     *
     * @return the document count
     */
    long getDocumentSize();

    /**
     * Returns the total execution time for index update operations.
     *