trait Resource[+T] extends IriResource
- Alphabetic
- By Inheritance
- Resource
- IriResource
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
equalValues(o: Any): Boolean
Compares resources by their data-value
-
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, T]]
Filters in-coming resources by the provided Property
-
abstract
def
inEMap(key: Property*): Map[Property, List[Edge[Any, T]]]
Filters and groups in-coming edges by the provided labels
Filters and groups in-coming edges by the provided labels
- key
the lspace.structure.Edge's labels
- returns
Map[Property, List[Edge[Any, T]]]
-
abstract
def
inMap(key: Property*): Map[Property, List[Any]]
Filters and groups in-coming resources by the provided property-keys
Filters and groups in-coming resources by the provided property-keys
- key
the Edge's labels to filter and group by
- returns
Map[Property, List[Any]]
-
abstract
def
keys: Set[Property]
- returns
set of all available edge-labels (keys)
-
abstract
def
labels: List[ClassType[_]]
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[T, Any]]
Filters out-going resources by the provided Property
-
abstract
def
outEMap(key: Property*): Map[Property, List[Edge[T, Any]]]
Filters and groups out-going edges by the provided labels
Filters and groups out-going edges by the provided labels
- key
the Edge's labels
- returns
Map[Property, List[Edge[T, Any]]]
-
abstract
def
outMap(key: Property*): Map[Property, List[Any]]
Filters and groups out-going resources by the provided property-keys
Filters and groups out-going resources by the provided property-keys
- key
the Edge's labels to filter and group by
- returns
Map[Property, List[Any]]
- abstract def prettyPrint: String
- abstract def remove(): Task[Unit]
- abstract def removeIn(key: Property): Task[Unit]
- abstract def removeIn[V >: T](edge: Edge[_, V]): Task[Unit]
- abstract def removeOut(key: Property): Task[Unit]
- abstract def removeOut[V >: T](edge: Edge[V, _]): Task[Unit]
-
abstract
def
value: T
The unboxed value
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def ---(f: (default.type) ⇒ Property): PartialOutEdge[T]
-
def
---(key: Property): PartialOutEdge[T]
Creates a partial edge
Creates a partial edge
- key
the Edge's label
- returns
an labeled-edge-builder PartialOutEdge
- def ---(key: String): PartialOutEdge[T]
-
def
-|-(key: Property): PartialOutEdge[T]
Edge with Cardinality single
- def <--(key: Property): PartialInEdge[T]
- def <--(key: String): PartialInEdge[T]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ===(o: Any): Boolean
-
def
@id: String
The @id is a IRI/URI identifier
The @id is a IRI/URI identifier
- returns
a String which is empty if no @id is assigned, TODO: should this be an Option[String]?
- Definition Classes
- IriResource
-
def
@ids: Set[String]
The @ids are alternative (same-as) IRI/URI identifiers
The @ids are alternative (same-as) IRI/URI identifiers
- returns
a Set[String] which has one or more values (it always includes
@id
)
-
def
@type: List[ClassType[_]]
- returns
list of labels assigned to the resource
- def addBoth[V, R[T] <: Resource[T]](key: Property, value: R[V]): Task[(Edge[T, V], Edge[V, T])]
- def addIn[V <: ClassType[_]](key: Property, value: V): Task[Edge[Node, T]]
- def addIn[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Task[Edge[V, T]]
- def addIn[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Task[Edge[V0, T]]
- def addIn[V <: ClassType[_]](key: String, value: V): Task[Edge[Node, T]]
- def addIn[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Task[Edge[V0, T]]
- def addOut[V](key: TypedProperty[V], value: V): Task[Edge[T, V]]
- def addOut[V <: ClassType[_]](key: Property, value: V): Task[Edge[T, Node]]
- def addOut[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Task[Edge[T, V]]
- def addOut[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Task[Edge[T, V0]]
- def addOut[V <: ClassType[_]](key: String, value: V): Task[Edge[T, Node]]
- def addOut[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Task[Edge[T, V0]]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- IriResource → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
The hashcode is composed by the id-hash and the graph-iri-hash
- Definition Classes
- Resource → AnyRef → Any
- 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, T]]
- def inE(key: String, keys: String*): List[Edge[Any, T]]
- def inEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Edge[Any, T]]]
- def inEMap(key: String, keys: String*): Map[Property, List[Edge[Any, T]]]
- 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
alias for
@id
- Definition Classes
- Resource → IriResource
-
def
iris: Set[String]
alias for
@ids
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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[T, V]]
- def outE(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): List[Edge[T, Any]]
- def outE(key: String, keys: String*): List[Edge[T, Any]]
- def outEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Map[Property, List[Edge[T, Any]]]
- def outEMap(key: String, keys: String*): Map[Property, List[Edge[T, 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
sameResource(resource: Resource[_]): Boolean
- Attributes
- protected
- def self: Resource[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()