Package dk.brics.xmlgraph

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

992
993
994
995
996
997
998
999
1000
1001
1002
    right.getContents().add(text.getIndex());

    switch (s.getKind()) {
    case APPEND:
    case PREPEND:
      g.merge(xmlsrc);
      left.getContents().addAll(base.getRoots());
      g.getRoots().clear();
      g.getRoots().add(seq.getIndex());
      return g;
View Full Code Here
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
    case PREPENDCONTENT:{
      final StatusMap stm = evaluateXPathOrRoot(s.getXPath(), g);
      boolean empty = checkXPathEmpty(s, g, stm);
      if (empty)
        return g;
      g.merge(xmlsrc);
      g.getRoots().retainAll(base.getRoots());
      // TODO can we append as root here???
      g.processReachableNodes(new NodeProcessor<Object>() {
        @Override
        public Object process(ElementNode n) {
View Full Code Here
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
    case INSERTBEFORE: {
      final StatusMap stm = evaluateXPathOrRoot(s.getXPath(), g);
      boolean empty = checkXPathEmpty(s, g, stm);
      if (empty)
        return g;
      g.merge(xmlsrc);
      g.getRoots().retainAll(base.getRoots());
      g.processReachableNodes(new NodeProcessor<Object>() {
        @Override
        public Object process(ChoiceNode ch) {
          LinkedHashSet<Integer> cs = new LinkedHashSet<Integer>(ch.getContents());
View Full Code Here
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
      return g;
    }
    g.getRoots().clear();
    g.getRoots().add(stm_nodes.getStmNode(s, g).getIndex());
    if (nextnode != null) {
      g.merge(nextnode);
      mergeContents(stm_nodes.getStmNextNode(s, g), nextnode.getRoots(), g);
    }
    if (firstattr != null) {
      g.merge(firstattr);
            mergeContents(stm_nodes.getStmFirstAttribute(s, g), firstattr.getRoots(), g);
View Full Code Here
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
    if (nextnode != null) {
      g.merge(nextnode);
      mergeContents(stm_nodes.getStmNextNode(s, g), nextnode.getRoots(), g);
    }
    if (firstattr != null) {
      g.merge(firstattr);
            mergeContents(stm_nodes.getStmFirstAttribute(s, g), firstattr.getRoots(), g);
    }
    if (firstchild != null) {
      g.merge(firstchild);
            mergeContents(stm_nodes.getStmFirstChild(s, g), firstchild.getRoots(), g);
View Full Code Here
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
    if (firstattr != null) {
      g.merge(firstattr);
            mergeContents(stm_nodes.getStmFirstAttribute(s, g), firstattr.getRoots(), g);
    }
    if (firstchild != null) {
      g.merge(firstchild);
            mergeContents(stm_nodes.getStmFirstChild(s, g), firstchild.getRoots(), g);
    }
    g.getRoots().clear();
    g.getRoots().add(stm_nodes.getStmNode(s, g).getIndex());
    switch (s.getKind()) {
View Full Code Here
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
        ArrayList<Automaton> ss = new ArrayList<Automaton>();
        ss.add(s.getStringSource());
        ss.add(tn.getText());
        tn.replaceText(Automaton.union(ss), g);
      }
      g.merge(xmlsrc);
      if (s.getKind() == PlugStm.Kind.PLUGWRAP) {
        g.getRoots().clear();
        g.getRoots().add(stm_nodes.getPlugWrapTopNode(s, g).getIndex());
        restoreEdges(stm_nodes.getPlugWrapTopNode(s, g), g);
        stm_nodes.getPlugWrapContentNode(s, g).setContent(base.getRoots(), g);
View Full Code Here
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
    boolean empty = checkXPathEmpty(s, g, stm);
    if (empty)
      return g;

    g.merge(xmlsrc);
    g.getRoots().retainAll(base.getRoots());

    final TextNode text = stm_nodes.getSetTextNode(s, g);
    text.replaceText(s.getStringSource(), g);
View Full Code Here
432
433
434
435
436
437
438
439
440
441
442
    switch (s.getKind()) {
    case ELEMENT:
      stm_nodes.getCopyElementNode(s, g).setName(getFirstElementNames(base), g);
      restoreEdges(stm_nodes.getCopyElementNode(s, g).getContent(), g);
      if (firstattr != null) {
        g.merge(firstattr);
        stm_nodes.getCopyFirstAttribute(s, g).setContent(firstattr.getRoots(), g);
      }
      if (firstchild != null) {
        g.merge(firstchild);
        stm_nodes.getCopyFirstChild(s, g).setContent(firstchild.getRoots(), g);
View Full Code Here
436
437
438
439
440
441
442
443
444
445
446
      if (firstattr != null) {
        g.merge(firstattr);
        stm_nodes.getCopyFirstAttribute(s, g).setContent(firstattr.getRoots(), g);
      }
      if (firstchild != null) {
        g.merge(firstchild);
        stm_nodes.getCopyFirstChild(s, g).setContent(firstchild.getRoots(), g);
      }
      if (nextnode != null) {
        g.merge(nextnode);
        stm_nodes.getCopyNextNode(s, g).setContent(nextnode.getRoots(), g);
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.