final FileEntry fe = this.delegate.next();
            if (this.filter == null) {
                try {
                    return adapt(fe);
                } catch (final MalformedURLException e) {
                    log.error("Failed to create child URL", e);
                    continue;
                }
            }

            try (SmbResource r = adapt(fe)) {
                if (this.filter.accept(r)) {

            Trans2FindFirst2Response resp = inv.getArgument(1);
            // First response content
            FE[] res = java.util.Arrays.stream(batches.get(0)).map(FE::new).toArray(FE[]::new);
            setField(resp, jcifs.internal.smb1.trans.SmbComTransactionResponse.class, "results", res);
            setField(resp, Trans2FindFirst2Response.class, "sid", 42);

     */
    public DirFileEntryAdapterIterator(final SmbResource parent, final CloseableIterator<FileEntry> delegate, final ResourceFilter filter) {
        super(parent, delegate, filter);
    }

    /**
     * @param fe
     * @return
     * @throws MalformedURLException
     */
    @Override
    protected SmbResource adapt(final FileEntry e) throws MalformedURLException {

     */
    public NetServerFileEntryAdapterIterator(final SmbResource parent, final NetServerEnumIterator delegate, final ResourceFilter filter) {
        super(parent, delegate, filter);
    }

    /**
     * @param fe
     * @return
     * @throws MalformedURLException
     */
    @Override
    protected SmbResource adapt(final FileEntry e) throws MalformedURLException {

        assertEquals(PrefixQuery.class, query.getClass());
        assertEquals("_default:fess", ((PrefixQuery) query).getPrefix().toString());

        query = queryParser.createDefaultFilterChain().parse("fe?s");
        assertEquals(WildcardQuery.class, query.getClass());
        assertEquals("_default:fe?s", ((WildcardQuery) query).getTerm().toString());

        query = queryParser.createDefaultFilterChain().parse("fess~");

else l=n;return(Re.shadowroot||Re.shadowrootmode)&&(l=fe.call(a,l,!0)),l}let m=Pe?n.outerHTML:n.innerHTML;return Pe&&Ne["!doctype"]&&n.ownerDocument&&n.ownerDocument.doctype&&n.ownerDocument.doctype.name&&b(K,n.ownerDocument.doctype.name)&&(m="<!DOCTYPE "+n.ownerDocument.doctype.name+">\n"+m),Ue&&u([he,ge,Te],(e=>{m=y(m,e," ")})),le&&We?le.createHTML(m):m},o.setConfig=function(){Tt(arguments.length>0&&void 0!==arguments[0]?arguments[0]:{}),Fe=!0},o.clearConfig=function(){dt=null,Fe=!1},o.isValid...

            checkStatus();
            this.ridx = 0;
            return advance();
        }
        return null;
    }

    private final boolean filter(final FileEntry fe) {
        final String name = fe.getName();
        if (this.nameFilter == null) {
            return true;
        }
        try {
            if (!this.nameFilter.accept(this.parent, name)) {
                return false;

     *
     * @return the parent
     */
    public final SmbResource getParent() {
        return this.parent;
    }

    private final boolean filter(final FileEntry fe) {
        final String name = fe.getName();
        if (name.length() < 3) {
            final int h = name.hashCode();
            if ((h == SmbFile.HASH_DOT || h == SmbFile.HASH_DOT_DOT) && (name.equals(".") || name.equals(".."))) {

](?= {2,}\n)))/,v=/[\p{P}\p{S}]/u,W=/[\s\p{P}\p{S}]/u,le=/[^\s\p{P}\p{S}]/u,Ne=k(/^((?![*_])punctSpace)/,"u").replace(/punctSpace/g,W).getRegex(),ue=/(?!~)[\p{P}\p{S}]/u,Qe=/(?!~)[\s\p{P}\p{S}]/u,je=/(?:[^\s\p{P}\p{S}]|~)/u,pe=/(?![*_])[\p{P}\p{S}]/u,Fe=/(?![*_])[\s\p{P}\p{S}]/u,Ue=/(?:[^\s\p{P}\p{S}]|[*_])/u,Ke=k(/link|precode-code|html/,"g").replace("link",/\[(?:[^\[\]`]|(?<a>`+)[^`]+\k<a>(?!`))*?\]\((?:\\[\s\S]|[^\\\(\)]|\((?:\\[\s\S]|[^\\\(\)])*\))*\)/).replace("precode-",$e?"(?<!`)()":"(^^|[^...

   *    /
   *   b   e <----> f
   *  / \ /
   * c   d
   * }
   */
  private static final SuccessorsFunction<Character> CYCLIC_GRAPH_CONTAINING_TREE =
      createDirectedGraph("ab", "bc", "bd", "ed", "ef", "fe");

  /**
   * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code
   * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node