Node

abstract def addLabel(ontology: Ontology): Unit

abstract val graph: Graph

Get the graph that this resource is within.

abstract def id: Long

id is a unique identifier of a resource in a graph

abstract def in(key: Property*): List[Any]

Filters in-coming resources by the provided Property*

abstract def inE(key: Property*): List[Edge[Any, Node]]

Filters in-coming resources by the provided Property*

abstract def inEMap(key: Property*): Map[Property, List[Edge[Any, Node]]]

Filters and groups in-coming edges by the provided labels

abstract def inMap(key: Property*): Map[Property, List[Any]]

Filters and groups in-coming resources by the provided property-keys

abstract def keys: Set[Property]

abstract def labels: List[Ontology]

alias for @type

abstract def out(key: Property*): List[Any]

Filters out-going resources by the provided Property*

abstract def outE(key: Property*): List[Edge[Node, Any]]

Filters out-going resources by the provided Property*

abstract def outEMap(key: Property*): Map[Property, List[Edge[Node, Any]]]

Filters and groups out-going edges by the provided labels

abstract def outMap(key: Property*): Map[Property, List[Any]]

Filters and groups out-going resources by the provided property-keys

abstract def removeIn(key: Property): Unit

abstract def removeIn[V >: Node](edge: Edge[_, V]): Unit

abstract def removeLabel(classType: Ontology): Unit

abstract def removeOut(key: Property): Unit

abstract def removeOut[V >: Node](edge: Edge[V, _]): Unit

final def !=(arg0: Any): Boolean

final def ##(): Int

def ---(f: (default.type) ⇒ Property): PartialOutEdge[Node]

def ---(key: Property): PartialOutEdge[Node]

Creates a partial edge

def ---(key: String): PartialOutEdge[Node]

def -|-(key: Property): PartialOutEdge[Node]

Edge with Cardinality single

def <--(key: Property): PartialInEdge[Node]

def <--(key: String): PartialInEdge[Node]

final def ==(arg0: Any): Boolean

def ===(o: Any): Boolean

def @id: String

def @ids: Set[String]

def @type: List[ClassType[_]]

def _addLabel(ontology: Ontology): Unit

def addBoth[V, R[T] <: Resource[T]](key: Property, value: R[V]): (Edge[Node, V], Edge[V, Node])

def addIn[V <: ClassType[_]](key: Property, value: V): Edge[Node, Node]

def addIn[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Edge[V, Node]

def addIn[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Edge[V0, Node]

def addIn[V <: ClassType[_]](key: String, value: V): Edge[Node, Node]

def addIn[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Edge[V0, Node]

def addOut[V](key: TypedProperty[V], value: V): Edge[Node, V]

def addOut[V <: ClassType[_]](key: Property, value: V): Edge[Node, Node]

def addOut[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Edge[Node, V]

def addOut[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Edge[Node, V0]

def addOut[V <: ClassType[_]](key: String, value: V): Edge[Node, Node]

def addOut[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Edge[Node, V0]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equalValues(o: Any): Boolean

Compares resources by their data-value

def equals(o: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hasLabel[L](label: ClassType[L]*): Option[Resource[L]]

filters the resource if it is labeled (including inherited/parent labels) with one or more of the provided labels

lazy val hashCode: Int

The hashcode is composed by the id-hash and the graph-iri-hash

def in(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): List[Any]

def in(key: String, keys: String*): List[Any]

def inE(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): List[Edge[Any, Node]]

def inE(key: String, keys: String*): List[Edge[Any, Node]]

def inEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Edge[Any, Node]]]

def inEMap(key: String, keys: String*): Map[Property, List[Edge[Any, Node]]]

def inMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Any]]

def inMap(key: String, keys: String*): Map[Property, List[Any]]

def iri: String

alias for @id

def iris: Set[String]

alias for @ids

final def isInstanceOf[T0]: Boolean

var memento: Long

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def out[V](key: TypedProperty[V], keys: TypedProperty[V]*): List[V]

def out(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): List[Any]

def out(key: String, keys: String*): List[Any]

def outE[V](key: TypedProperty[V], keys: TypedProperty[V]*): List[Edge[Node, V]]

def outE(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): List[Edge[Node, Any]]

def outE(key: String, keys: String*): List[Edge[Node, Any]]

def outEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Edge[Node, Any]]]

def outEMap(key: String, keys: String*): Map[Property, List[Edge[Node, Any]]]

def outMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Any]]

def outMap(key: String, keys: String*): Map[Property, List[Any]]

def prettyPrint: String

def remove(): Unit

def sameResource(resource: Resource[_]): Boolean

def self: Resource[Node]

var status: CacheStatus

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

def toString(): String

val value: Node

The unboxed value

final def wait(): Unit

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

final def wait(arg0: Long): Unit