ParentNode

abstract val ref: Ref

Reference to the real DOM node which this Node represents.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def appendChild(child: (ParentNode.this)#BaseChildNode)(implicit treeApi: TreeApi[N, BaseRef]): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def indexOfChild(child: (ParentNode.this)#BaseChildNode): Int

def insertChild(child: (ParentNode.this)#BaseChildNode, atIndex: Int)(implicit treeApi: TreeApi[N, BaseRef]): Boolean

final def isInstanceOf[T0]: Boolean

def maybeChildren: Option[Buffer[(ParentNode.this)#BaseChildNode]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def removeChild(child: (ParentNode.this)#BaseChildNode)(implicit treeApi: TreeApi[N, BaseRef]): Boolean

def replaceAllChildren(newChildren: Iterable[(ParentNode.this)#BaseChildNode])(implicit treeApi: TreeApi[N, BaseRef]): Unit

def replaceChild(oldChild: (ParentNode.this)#BaseChildNode, newChild: (ParentNode.this)#BaseChildNode)(implicit treeApi: TreeApi[N, BaseRef]): Boolean

Note: Does nothing if oldChild was not found in parent's children, or if oldChild==newChild

def replaceChildren(fromIndex: Int, toIndex: Int, newChildren: Iterable[(ParentNode.this)#BaseChildNode])(implicit treeApi: TreeApi[N, BaseRef]): Boolean

Note: Does nothing if fromIndex or toIndex are out of bounds or if fromIndex>toIndex

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit