net.sourceforge.pmd.lang.ast.Node.jjtSetParent()方法的使用及代码示例

x33g5p2x  于2022-01-25 转载在 其他  
字(4.0k)|赞(0)|评价(0)|浏览(262)

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

Node.jjtSetParent介绍

[英]Sets the parent of this node.
[中]设置此节点的父节点。

代码示例

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: pmd/pmd

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: net.sourceforge.pmd/pmd-visualforce

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: net.sourceforge.pmd/pmd-java

  1. public void closeNodeScope(Node n, int num) {
  2. mk = marks.remove(marks.size()-1);
  3. while (num-- > 0) {
  4. Node c = popNode();
  5. c.jjtSetParent(n);
  6. n.jjtAddChild(c, num);
  7. }
  8. n.jjtClose();
  9. pushNode(n);
  10. node_created = true;
  11. }

代码示例来源:origin: net.sourceforge.pmd/pmd-java

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

代码示例来源:origin: net.sourceforge.pmd/pmd-visualforce

  1. public void closeNodeScope(Node n, boolean condition) {
  2. if (condition) {
  3. int a = nodeArity();
  4. mk = marks.remove(marks.size()-1);
  5. while (a-- > 0) {
  6. Node c = popNode();
  7. c.jjtSetParent(n);
  8. n.jjtAddChild(c, a);
  9. }
  10. n.jjtClose();
  11. pushNode(n);
  12. node_created = true;
  13. } else {
  14. mk = marks.remove(marks.size()-1);
  15. node_created = false;
  16. }
  17. }
  18. }

相关文章