trait MemEdge[S, E] extends MemResource[structure.Edge[S, E]] with structure.Edge[S, E]
- Alphabetic
- By Inheritance
- MemEdge
- Edge
- MemResource
- Resource
- IriResource
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
from: structure.Resource[S]
Origin of the edge
-
abstract
val
graph: MemGraph
Get the graph that this resource is within.
Get the graph that this resource is within.
- Definition Classes
- MemResource → Resource
-
abstract
def
id: Long
id is a unique identifier of a resource in a graph
id is a unique identifier of a resource in a graph
- Definition Classes
- Resource
-
abstract
def
key: structure.Property
- Definition Classes
- Edge
-
abstract
def
to: structure.Resource[E]
Destination of the edge
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
---(f: (default.type) ⇒ structure.Property): PartialOutEdge[structure.Edge[S, E]]
- Definition Classes
- Resource
-
def
---(key: structure.Property): PartialOutEdge[structure.Edge[S, E]]
Creates a partial edge
Creates a partial edge
- key
the Edge's label
- returns
an labeled-edge-builder PartialOutEdge
- Definition Classes
- Resource
-
def
---(key: String): PartialOutEdge[structure.Edge[S, E]]
- Definition Classes
- Resource
-
def
-|-(key: structure.Property): PartialOutEdge[structure.Edge[S, E]]
Edge with Cardinality single
Edge with Cardinality single
- Definition Classes
- Resource
-
def
<--(key: structure.Property): PartialInEdge[structure.Edge[S, E]]
- Definition Classes
- Resource
-
def
<--(key: String): PartialInEdge[structure.Edge[S, E]]
- Definition Classes
- Resource
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
===(o: Any): Boolean
- Definition Classes
- Resource
-
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
)
- Definition Classes
- Resource
-
def
@type: List[structure.ClassType[_]]
- returns
list of labels assigned to the resource
- Definition Classes
- Resource
-
def
_addIn(edge: structure.Edge[_, structure.Edge[S, E]]): Unit
- Attributes
- protected[lspace]
- Definition Classes
- MemResource
-
def
_addOut(edge: structure.Edge[structure.Edge[S, E], _]): Unit
- Attributes
- protected[lspace]
- Definition Classes
- MemResource
-
def
addBoth[V, R[T] <: structure.Resource[T]](key: structure.Property, value: R[V]): Task[(structure.Edge[structure.Edge[S, E], V], structure.Edge[V, structure.Edge[S, E]])]
- Definition Classes
- Resource
-
def
addIn[V <: structure.ClassType[_]](key: structure.Property, value: V): Task[structure.Edge[structure.Node, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
addIn[V, R[Z] <: structure.ClassType[Z]](key: structure.Property, dt: R[V], value: V)(implicit ev1: <:!<[V, structure.ClassType[_]]): Task[structure.Edge[V, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
addIn[V, V0, VT0 <: structure.ClassType[_]](key: structure.Property, value: V)(implicit ev1: <:!<[V, structure.ClassType[_]], ct: Aux[V, V0, VT0]): Task[structure.Edge[V0, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
addIn[V <: structure.ClassType[_]](key: String, value: V): Task[structure.Edge[structure.Node, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
addIn[V, V0, VT0 <: structure.ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, structure.ClassType[_]], dt: Aux[V, V0, VT0]): Task[structure.Edge[V0, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
addOut[V](key: structure.TypedProperty[V], value: V): Task[structure.Edge[structure.Edge[S, E], V]]
- Definition Classes
- Resource
-
def
addOut[V <: structure.ClassType[_]](key: structure.Property, value: V): Task[structure.Edge[structure.Edge[S, E], structure.Node]]
- Definition Classes
- Resource
-
def
addOut[V, R[Z] <: structure.ClassType[Z]](key: structure.Property, dt: R[V], value: V)(implicit ev1: <:!<[V, structure.ClassType[_]]): Task[structure.Edge[structure.Edge[S, E], V]]
- Definition Classes
- Resource
-
def
addOut[V, V0, VT0 <: structure.ClassType[_]](key: structure.Property, value: V)(implicit ev1: <:!<[V, structure.ClassType[_]], ct: Aux[V, V0, VT0]): Task[structure.Edge[structure.Edge[S, E], V0]]
- Definition Classes
- Resource
-
def
addOut[V <: structure.ClassType[_]](key: String, value: V): Task[structure.Edge[structure.Edge[S, E], structure.Node]]
- Definition Classes
- Resource
-
def
addOut[V, V0, VT0 <: structure.ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, structure.ClassType[_]], dt: Aux[V, V0, VT0]): Task[structure.Edge[structure.Edge[S, E], V0]]
- Definition Classes
- Resource
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equalValues(o: Any): Boolean
Compares if the edges the same origin, label and destination
-
def
equals(o: Any): Boolean
- Definition Classes
- Edge → IriResource → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hasLabel[L](label: structure.ClassType[L]*): Option[structure.Resource[L]]
filters the resource if it is labeled (including inherited/parent labels) with one or more of the provided labels
filters the resource if it is labeled (including inherited/parent labels) with one or more of the provided labels
- Definition Classes
- Resource
-
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(key: structure.Property*): List[Any]
Filters in-coming resources by the provided Property
Filters in-coming resources by the provided Property
- key
the Edge's labels
- returns
List of unboxed values
- Definition Classes
- MemResource → Resource
-
def
in(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): List[Any]
- Definition Classes
- Resource
-
def
in(key: String, keys: String*): List[Any]
- Definition Classes
- Resource
-
def
inE(key: structure.Property*): List[structure.Edge[Any, structure.Edge[S, E]]]
Filters in-coming resources by the provided Property
Filters in-coming resources by the provided Property
- key
the Edge's labels
- returns
List[Edge[Any, T]]
- Definition Classes
- MemResource → Resource
-
def
inE(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): List[structure.Edge[Any, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
inE(key: String, keys: String*): List[structure.Edge[Any, structure.Edge[S, E]]]
- Definition Classes
- Resource
-
def
inEMap(key: structure.Property*): Map[structure.Property, List[structure.Edge[Any, structure.Edge[S, E]]]]
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]]]
- Definition Classes
- MemResource → Resource
-
def
inEMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Map[structure.Property, List[structure.Edge[Any, structure.Edge[S, E]]]]
- Definition Classes
- Resource
-
def
inEMap(key: String, keys: String*): Map[structure.Property, List[structure.Edge[Any, structure.Edge[S, E]]]]
- Definition Classes
- Resource
-
def
inMap(key: structure.Property*): Map[structure.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]]
- Definition Classes
- MemResource → Resource
-
def
inMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Map[structure.Property, List[Any]]
- Definition Classes
- Resource
-
def
inMap(key: String, keys: String*): Map[structure.Property, List[Any]]
- Definition Classes
- Resource
-
def
inV: structure.Resource[E]
- Definition Classes
- Edge
-
def
iri: String
alias for
@id
alias for
@id
- Definition Classes
- MemResource → Resource → IriResource
-
def
iris: Set[String]
alias for
@ids
alias for
@ids
- Definition Classes
- MemResource → Resource
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
keys: Set[structure.Property]
- returns
set of all available edge-labels (keys)
- Definition Classes
- MemResource → Resource
-
def
labels: List[structure.Property]
alias for
@type
-
val
memento: Long
- Definition Classes
- Resource
- Annotations
- @transient()
-
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(key: structure.Property*): List[Any]
Filters out-going resources by the provided Property
Filters out-going resources by the provided Property
- key
the Edge's labels
- returns
List of unboxed values
- Definition Classes
- MemResource → Resource
-
def
out[V](key: structure.TypedProperty[V], keys: structure.TypedProperty[V]*): List[V]
- Definition Classes
- Resource
-
def
out(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): List[Any]
- Definition Classes
- Resource
-
def
out(key: String, keys: String*): List[Any]
- Definition Classes
- Resource
-
def
outE(key: structure.Property*): List[structure.Edge[structure.Edge[S, E], Any]]
Filters out-going resources by the provided Property
Filters out-going resources by the provided Property
- key
the Edge's labels
- returns
List[Edge[T, Any]]
- Definition Classes
- MemResource → Resource
-
def
outE[V](key: structure.TypedProperty[V], keys: structure.TypedProperty[V]*): List[structure.Edge[structure.Edge[S, E], V]]
- Definition Classes
- Resource
-
def
outE(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): List[structure.Edge[structure.Edge[S, E], Any]]
- Definition Classes
- Resource
-
def
outE(key: String, keys: String*): List[structure.Edge[structure.Edge[S, E], Any]]
- Definition Classes
- Resource
-
def
outEMap(key: structure.Property*): Map[structure.Property, List[structure.Edge[structure.Edge[S, E], 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]]]
- Definition Classes
- MemResource → Resource
-
def
outEMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Map[structure.Property, List[structure.Edge[structure.Edge[S, E], Any]]]
- Definition Classes
- Resource
-
def
outEMap(key: String, keys: String*): Map[structure.Property, List[structure.Edge[structure.Edge[S, E], Any]]]
- Definition Classes
- Resource
-
def
outMap(key: structure.Property*): Map[structure.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]]
- Definition Classes
- MemResource → Resource
-
def
outMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Map[structure.Property, List[Any]]
- Definition Classes
- Resource
-
def
outMap(key: String, keys: String*): Map[structure.Property, List[Any]]
- Definition Classes
- Resource
-
def
outV: structure.Resource[S]
- Definition Classes
- Edge
- def prettyPrint: String
- def remove(): Task[Unit]
-
def
removeIn(key: structure.Property): Task[Unit]
- Definition Classes
- MemResource → Resource
-
def
removeIn[V >: structure.Edge[S, E]](edge: structure.Edge[_, V]): Task[Unit]
- Definition Classes
- MemResource → Resource
-
def
removeOut(key: structure.Property): Task[Unit]
- Definition Classes
- MemResource → Resource
-
def
removeOut[V >: structure.Edge[S, E]](edge: structure.Edge[V, _]): Task[Unit]
- Definition Classes
- MemResource → Resource
-
def
sameResource(resource: structure.Resource[_]): Boolean
- Definition Classes
- Resource
-
def
self: structure.Resource[structure.Edge[S, E]]
- Definition Classes
- Resource
-
val
status: CacheStatus
- Definition Classes
- Resource
- Annotations
- @transient()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
val
value: structure.Edge[S, E]
The unboxed value
-
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
- @native() @throws( ... )
-
object
Lock
- Definition Classes
- MemResource