Examples of processRoots()


Examples of dk.brics.xmlgraph.XMLGraph.processRoots()

    case PLUGWRAP:
      final String gapname = s.getGapName();
      // plug roots into the relevant gaps and merge the XML graphs
      final boolean skip_str = s.getStringSource().isEmpty();
      if (g.getOpenAttributeGaps().contains(gapname) || g.getOpenTemplateGaps().contains(gapname)) {
        g.processRoots(new ReachableNodesProcessor(g) { 
          @Override
          public Object process(ChoiceNode n) {
            if (n.isGap() && n.isOpen() && n.getName().equals(gapname)) {
              Collection<Integer> c = new LinkedHashSet<Integer>();
              c.addAll(n.getContents());
View Full Code Here

Examples of dk.brics.xmlgraph.XMLGraph.processRoots()

          g.getGapTypeMap().put(gapname, gaptype);
     
//      XMLGraphDebug.dumpXMLGraph(g, s);
      break;
    case CLOSE:
      g.processRoots(new ReachableNodesProcessor(g) { 
        @Override
        public Object process(ChoiceNode n) {
          if (n.isGap() && n.isOpen()) {
            Collection<Integer> c = new LinkedHashSet<Integer>();
            c.addAll(n.getContents());
View Full Code Here

Examples of dk.brics.xmlgraph.XMLGraph.processRoots()

    }
    StatusMap smt;
    smt = evaluateXPathOrRoot(s.getXPath(), base); //evaluator.evaluate(base, s.getXPath(), dummy_root, dummy_root_content);
    final StatusMap sm = smt;
    checkXPathEmpty(s, base, sm);
    g.processRoots(new ReachableNodesProcessor(g) { 
      @Override
      public Object process(ChoiceNode n) { // all concrete nodes have a choice node parent
        Collection<Integer> cs = new LinkedHashSet<Integer>();
        boolean modified = false;
        boolean add_emptyseq = false;
View Full Code Here

Examples of dk.brics.xmlgraph.XMLGraph.processRoots()

    //} catch (XPathException e) {
    //  throw new XMLXPathException(e);
    //}
    final StatusMap sm = smt;
    checkXPathEmpty(s, base, sm);
    g.processRoots(new ReachableNodesProcessor(g) { 
      @Override
      public Object process(ChoiceNode n) { // all concrete nodes have a choice node parent
        Collection<Integer> cs = new LinkedHashSet<Integer>();
        boolean modified = false;
        boolean add_gap = false;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.