abstract
class
_Node extends _Resource[Node] with Node
Instance Constructors
-
new
_Node()
Abstract Value Members
-
abstract
def
addLabel(ontology: Ontology): Task[Unit]
-
abstract
val
graph: Graph
-
abstract
def
id: Long
-
abstract
def
in(key: Property*): List[Any]
-
abstract
def
inE(key: Property*): List[Edge[Any, Node]]
-
abstract
def
inEMap(key: Property*): Map[Property, List[Edge[Any, Node]]]
-
abstract
def
inMap(key: Property*): Map[Property, List[Any]]
-
abstract
def
keys: Set[Property]
-
abstract
def
labels: List[Ontology]
-
abstract
def
out(key: Property*): List[Any]
-
abstract
def
outE(key: Property*): List[Edge[Node, Any]]
-
abstract
def
outEMap(key: Property*): Map[Property, List[Edge[Node, Any]]]
-
abstract
def
outMap(key: Property*): Map[Property, List[Any]]
-
abstract
def
removeIn(key: Property): Task[Unit]
-
abstract
def
removeIn[V >: Node](edge: Edge[_, V]): Task[Unit]
-
abstract
def
removeLabel(classType: Ontology): Unit
-
abstract
def
removeOut(key: Property): Task[Unit]
-
abstract
def
removeOut[V >: Node](edge: Edge[V, _]): Task[Unit]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
-
-
final
def
==(arg0: Any): Boolean
-
def
===(o: Any): Boolean
-
def
@id: String
-
def
@ids: Set[String]
-
def
@type: List[ClassType[_]]
-
def
_addLabel(ontology: Ontology): Task[Unit]
-
def
addBoth[V, R[T] <: Resource[T]](key: Property, value: R[V]): Task[(Edge[Node, V], Edge[V, Node])]
-
-
def
addIn[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Task[Edge[V, Node]]
-
def
addIn[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Task[Edge[V0, Node]]
-
def
addIn[V <: ClassType[_]](key: String, value: V): Task[Edge[Node, Node]]
-
def
addIn[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Task[Edge[V0, Node]]
-
def
addOut[V](key: TypedProperty[V], value: V): Task[Edge[Node, V]]
-
-
def
addOut[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Task[Edge[Node, V]]
-
def
addOut[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Task[Edge[Node, V0]]
-
def
addOut[V <: ClassType[_]](key: String, value: V): Task[Edge[Node, Node]]
-
def
addOut[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Task[Edge[Node, V0]]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equalValues(o: Any): Boolean
-
def
equals(o: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hasLabel[L](label: ClassType[L]*): Option[Resource[L]]
-
lazy val
hashCode: Int
-
-
def
in(key: String, keys: String*): List[Any]
-
-
def
inE(key: String, keys: String*): List[Edge[Any, Node]]
-
-
def
inEMap(key: String, keys: String*): Map[Property, List[Edge[Any, Node]]]
-
-
def
inMap(key: String, keys: String*): Map[Property, List[Any]]
-
def
iri: String
-
def
iris: Set[String]
-
final
def
isInstanceOf[T0]: Boolean
-
var
memento: Long
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
def
out(key: String, keys: String*): List[Any]
-
-
-
def
outE(key: String, keys: String*): List[Edge[Node, Any]]
-
-
def
outEMap(key: String, keys: String*): Map[Property, List[Edge[Node, Any]]]
-
-
def
outMap(key: String, keys: String*): Map[Property, List[Any]]
-
def
prettyPrint: String
-
def
remove(): Task[Unit]
-
def
sameResource(resource: Resource[_]): Boolean
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
val
value: Node
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any