class
ReactiveRoot extends ReactiveNode with Root[ReactiveNode, Element, Node]
Instance Constructors
-
new
ReactiveRoot(container: Element, child: ReactiveChildNode[Element])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
var
_maybeChildren: Option[Buffer[BaseChildNode]]
-
def
appendChild(child: BaseChildNode)(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
val
container: Element
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
indexOfChild(child: BaseChildNode): Int
-
def
insertChild(child: BaseChildNode, atIndex: Int)(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
maybeChildren: Option[Buffer[BaseChildNode]]
-
var
maybeSubscriptions: Option[Buffer[Subscription[_]]]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
ref: Element
-
def
removeChild(child: BaseChildNode)(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
def
replaceAllChildren(newChildren: Iterable[BaseChildNode])(implicit treeApi: TreeApi[ReactiveNode, Node]): Unit
-
def
replaceChild(oldChild: BaseChildNode, newChild: BaseChildNode)(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
def
replaceChildren(fromIndex: Int, toIndex: Int, newChildren: Iterable[BaseChildNode])(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
def
subscribe[V](arg0: XStream[V], onNext: (V) ⇒ Unit): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
unmount()(implicit treeApi: TreeApi[ReactiveNode, Node]): Boolean
-
def
unsubscribeFromAll(): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Node
Inherited from AnyRef
Inherited from Any