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

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

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

Node.replaceChildAfter介绍

暂无

代码示例

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

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

private static Node replaceCurrent(Node parent, Node previous,
                  Node current, Node replacement)
{
  if (previous == null) {
    if (!(current == parent.getFirstChild())) Kit.codeBug();
    parent.replaceChild(current, replacement);
  } else if (previous.next == current) {
    // Check cachedPrev.next == current is necessary due to possible
    // tree mutations
    parent.replaceChildAfter(previous, replacement);
  } else {
    parent.replaceChild(current, replacement);
  }
  return replacement;
}

相关文章

微信公众号