dr.domain = n.getDomain();
        return dr;
    }

    /*
     * Split DFS path like \fs1.example.com\root5\link2\foo\bar.txt into at
     * most 3 components (not including the first index which is always empty):
     * result[0] = ""
     * result[1] = "fs1.example.com"
     * result[2] = "root5"
     * result[3] = "link2\foo\bar.txt"
     */

    }

    /* DFS */

    /* Split DFS path like \fs1.example.com\root5\link2\foo\bar.txt into at
     * most 3 components (not including the first index which is always empty):
     * result[0] = ""
     * result[1] = "fs1.example.com"
     * result[2] = "root5"
     * result[3] = "link2\foo\bar.txt"
     */
    void dfsPathSplit(final String path, final String[] result) {

            if (roots != null) {
                SmbTransport trans = null;

                root = root.toLowerCase();

                /* The link entries contain maps of referrals by path representing DFS links.
                 * Note that paths are relative to the root like "\" and not "\example.com\root".
                 */
                CacheEntry links = (CacheEntry) roots.get(root);

                }

                root = root.toLowerCase();
                /*
                 * domain-based DFS root shares to links for each
                 */
                final Map<String, CacheEntry<DfsReferralDataInternal>> roots = domains.get(domain);
                if (roots != null) {
                    dr = getLinkReferral(tf, domain, root, path, now, roots);
                }

    @Test
    @DisplayName("getEntries should return SmbShareInfo array for DFS roots")
    void testGetEntries_populatedArray() throws Exception {
        // Create populated DfsEnumArray200
        netdfs.DfsEnumArray200 populatedArray = new netdfs.DfsEnumArray200();
        populatedArray.count = 3;
        populatedArray.s = new netdfs.DfsInfo200[3];

        // Create DFS root entries
        String[] rootNames = { "share1", "share2", "share3" };

     * An arbitrary number of source roots may exist for the same scope and language.
     * It may be, for example, the case of a multi-versions project.
     * The iteration order is the order in which the sources are declared in the POM file.
     *
     * @param project the project for which to get the enabled source roots
     * @param scope the scope of the sources to return, or {@code null} for all scopes

            }
        }
        return null;
    }

    static String[] list(final SmbFile root, final String wildcard, final int searchAttributes, final SmbFilenameFilter fnf,
            final SmbFileFilter ff) throws SmbException {
        try (CloseableIterator<SmbResource> it = doEnum(root, wildcard, searchAttributes, fnf == null ? null : (parent, name) -> {
            if (!(parent instanceof SmbFile)) {

        /**
         * @param root The root dependency
         * @return this request for chaining, never {@code null}
         */
        @Nonnull
        public DependencyResolverRequestBuilder root(@Nonnull DependencyCoordinates root) {
            this.root = root;
            return this;
        }

        /**

                    request.setPath(dunc);
                }

                if (!t.getShare().equals(dr.getShare())) {
                    // this should only happen for standalone roots or if the DC/domain root lookup failed
                    IOException last;
                    final DfsReferralData start = dr;
                    do {
                        if (log.isDebugEnabled()) {

      @Override
      long treeAggregate(@Nullable AvlNode<?> root) {
        return (root == null) ? 0 : root.totalCount;
      }
    },
    DISTINCT {
      @Override
      int nodeAggregate(AvlNode<?> node) {
        return 1;
      }

      @Override
      long treeAggregate(@Nullable AvlNode<?> root) {
        return (root == null) ? 0 : root.distinctElements;
      }
    };