}

      if (!top.remainingSuccessors.isEmpty()) {
        N nextNode = top.remainingSuccessors.remove();
        if (canTraverseWithoutReusingEdge(graph, nextNode, previousNode)) {
          stack.addLast(new NodeAndRemainingSuccessors<>(nextNode));
          continue;
        }
      }

      stack.removeLast();

(f)}if(f!==m)try{l?e.setAttributeNS(l,a,f):e.setAttribute(a,f),Nt(e)?At(e):p(o.removed)}catch(t){_t(a,e)}}else _t(a,e)}Rt(de.afterSanitizeAttributes,e,null)},kt=function e(t){let n=null;const o=St(t);for(Rt(de.beforeSanitizeShadowDOM,t,null);n=o.nextNode();)Rt(de.uponSanitizeShadowNode,n,null),wt(n),vt(n),n.content instanceof s&&e(n.content);Rt(de.afterSanitizeShadowDOM,t,null)};return o.sanitize=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},n=null,r=null,i=null,l=n...