*/
public enum DirectoryCacheScope {
    /**
     * Cache only direct children of the directory
     */
    IMMEDIATE_CHILDREN,

    /**
     * Cache entire subtree recursively (if supported by server)
     */
    RECURSIVE_TREE,

    /**
     * Cache only file attributes but not content
     */
    METADATA_ONLY,

    /**

 *
 * @author mbechler
 */
public class Smb2ChangeNotifyRequest extends ServerMessageBlock2Request<Smb2ChangeNotifyResponse> {

    /**
     * Flag to watch the directory tree recursively
     */
    public static final int SMB2_WATCH_TREE = 0x1;

    /**
     * Notify when a file name changes
     */
    public static final int FILE_NOTIFY_CHANGE_FILE_NAME = 0x1;
    /**

        QueryContext context = new QueryContext("test", false);
        QueryBuilder result = boostQueryCommand.execute(context, outerBoostQuery, 1.0f);

        assertNotNull(result);
        // BoostQueryCommand recursively processes nested BoostQueries
        // The result could be either TermQueryBuilder or DefaultQueryBuilder
        assertTrue(result instanceof TermQueryBuilder || result instanceof DefaultQueryBuilder);

        if (andx instanceof AndXServerMessageBlock) {

            /*
             * A word about communicating header info to andx smbs
             *
             * This is where we recursively invoke the provided andx smb
             * object to write it's parameter words and bytes to our outgoing
             * array. Incedentally when these andx smbs are created they are not

        if (this.andx instanceof AndXServerMessageBlock) {

            /*
             * A word about communicating header info to andx smbs
             *
             * This is where we recursively invoke the provided andx smb
             * object to write it's parameter words and bytes to our outgoing
             * array. Incedentally when these andx smbs are created they are not

      case 3:
        return nums.get(start).multiply(nums.get(start + 1)).multiply(nums.get(start + 2));
      default:
        // Otherwise, split the list in half and recursively do this.
        int m = (end + start) >>> 1;
        return listProduct(nums, start, m).multiply(listProduct(nums, m, end));
    }
  }

  /**

            assertTrue("Classpath should contain target/classes", classpath.contains(targetClassesDir.getAbsolutePath()));
        }
    }

    // Helper method to delete directory recursively
    private void deleteDirectory(File dir) {
        if (dir.isDirectory()) {
            File[] children = dir.listFiles();
            if (children != null) {
                for (File child : children) {

            logger.warn("Could not parse a value of {}", xpath);
        }
        if (buf == null) {
            return null;
        }
        return buf.toString().trim();
    }

    /**
     * Recursively parses text content from a node and its children.
     *
     * @param node the node to parse
     * @param buf the StringBuilder to append content to
     */

                log.debug("delete: " + fileName);
            }

            if ((this.attributes & ATTR_DIRECTORY) != 0) {

                /*
                 * Recursively delete directory contents
                 */

                try (CloseableIterator<SmbResource> it =

         */

        if (LogStream.level >= 3) {
            log.println("delete: " + fileName);
        }

        if ((attributes & ATTR_DIRECTORY) != 0) {

            /* Recursively delete directory contents
             */

            try {
                final SmbFile[] l = listFiles("*", ATTR_DIRECTORY | ATTR_HIDDEN | ATTR_SYSTEM, null, null);