org.mozilla.javascript.Node.addChildAfter()方法的使用及代码示例

x33g5p2x  于2022-01-25 转载在 JavaScript  
字(7.8k)|赞(0)|评价(0)|浏览(326)

本文整理了Java中org.mozilla.javascript.Node.addChildAfter()方法的一些代码示例，展示了Node.addChildAfter()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Node.addChildAfter()方法的具体详情如下：
包路径：org.mozilla.javascript.Node
类名称：Node
方法名：addChildAfter

Node.addChildAfter介绍

[英]Add 'child' after 'node'.
[中]在“节点”之后添加“子节点”。

代码示例

代码示例来源：origin: rhino/js

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: geogebra/geogebra

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: com.github.tntim96/rhino

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: io.apigee/rhino

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: ro.isdc.wro4j/rhino

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: com.sun.phobos/phobos-rhino

  1. /**
  2.  * Add 'child' before 'node'.
  3.  */
  4. public void addChildBefore(Node newChild, Node node) {
  5.   if (newChild.next != null)
  6.     throw new RuntimeException(
  7.          "newChild had siblings in addChildBefore");
  8.   if (first == node) {
  9.     newChild.next = first;
  10.     first = newChild;
  11.     return;
  12.   }
  13.   Node prev = getChildBefore(node);
  14.   addChildAfter(newChild, prev);
  15. }

代码示例来源：origin: rhino/js

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: geogebra/geogebra

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: com.sun.phobos/phobos-rhino

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: ro.isdc.wro4j/rhino

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: io.apigee/rhino

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: com.github.tntim96/rhino

  1. private static Node addBeforeCurrent(Node parent, Node previous,
  2.                    Node current, Node toAdd)
  3. {
  4.   if (previous == null) {
  5.     if (!(current == parent.getFirstChild())) Kit.codeBug();
  6.     parent.addChildToFront(toAdd);
  7.   } else {
  8.     if (!(current == previous.getNext())) Kit.codeBug();
  9.     parent.addChildAfter(toAdd, previous);
  10.   }
  11.   return toAdd;
  12. }

代码示例来源：origin: ro.isdc.wro4j/rhino

  1. private void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Jump switchNode = (Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

代码示例来源：origin: geogebra/geogebra

  1. private void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Jump switchNode = (Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

代码示例来源：origin: rhino/js

  1. void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Node.Jump switchNode = (Node.Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

代码示例来源：origin: io.apigee/rhino

  1. private void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Jump switchNode = (Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

代码示例来源：origin: com.github.tntim96/rhino

  1. private void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Jump switchNode = (Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

代码示例来源：origin: com.sun.phobos/phobos-rhino

  1. void closeSwitch(Node switchBlock)
  2. {
  3.   if (switchBlock.getType() != Token.BLOCK) throw Kit.codeBug();
  4.   Node.Jump switchNode = (Node.Jump)switchBlock.getFirstChild();
  5.   if (switchNode.getType() != Token.SWITCH) throw Kit.codeBug();
  6.   Node switchBreakTarget = Node.newTarget();
  7.   // switchNode.target is only used by NodeTransformer
  8.   // to detect switch end
  9.   switchNode.target = switchBreakTarget;
  10.   Node defaultTarget = switchNode.getDefault();
  11.   if (defaultTarget == null) {
  12.     defaultTarget = switchBreakTarget;
  13.   }
  14.   switchBlock.addChildAfter(makeJump(Token.GOTO, defaultTarget),
  15.                switchNode);
  16.   switchBlock.addChildToBack(switchBreakTarget);
  17. }

内容来源于网络，如有侵权，请联系作者删除！

Node

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多

    Node类方法

    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com