trait
Edge[+S, +E] extends Resource[Edge[S, E]]
Abstract Value Members
-
abstract
def
from: Resource[S]
-
abstract
val
graph: Graph
-
abstract
def
id: Long
-
abstract
def
in(key: Property*): List[Any]
-
abstract
def
inE(key: Property*): List[Edge[Any, Edge[S, E]]]
-
abstract
def
inEMap(key: Property*): Map[Property, List[Edge[Any, Edge[S, E]]]]
-
abstract
def
inMap(key: Property*): Map[Property, List[Any]]
-
abstract
def
key: Property
-
abstract
def
keys: Set[Property]
-
abstract
def
out(key: Property*): List[Any]
-
abstract
def
outE(key: Property*): List[Edge[Edge[S, E], Any]]
-
abstract
def
outEMap(key: Property*): Map[Property, List[Edge[Edge[S, E], Any]]]
-
abstract
def
outMap(key: Property*): Map[Property, List[Any]]
-
abstract
def
removeIn(key: Property): Unit
-
abstract
def
removeIn[V >: Edge[S, E]](edge: Edge[_, V]): Unit
-
abstract
def
removeOut(key: Property): Unit
-
abstract
def
removeOut[V >: Edge[S, E]](edge: Edge[V, _]): Unit
-
abstract
def
to: Resource[E]
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
addBoth[V, R[T] <: Resource[T]](key: Property, value: R[V]): (Edge[Edge[S, E], V], Edge[V, Edge[S, E]])
-
-
def
addIn[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Edge[V, Edge[S, E]]
-
def
addIn[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Edge[V0, Edge[S, E]]
-
def
addIn[V <: ClassType[_]](key: String, value: V): Edge[Node, Edge[S, E]]
-
def
addIn[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Edge[V0, Edge[S, E]]
-
def
addOut[V](key: TypedProperty[V], value: V): Edge[Edge[S, E], V]
-
-
def
addOut[V, R[Z] <: ClassType[Z]](key: Property, dt: R[V], value: V)(implicit ev1: <:!<[V, ClassType[_]]): Edge[Edge[S, E], V]
-
def
addOut[V, V0, VT0 <: ClassType[_]](key: Property, value: V)(implicit ev1: <:!<[V, ClassType[_]], ct: Aux[V, V0, VT0]): Edge[Edge[S, E], V0]
-
def
addOut[V <: ClassType[_]](key: String, value: V): Edge[Edge[S, E], Node]
-
def
addOut[V, V0, VT0 <: ClassType[_]](key: String, value: V)(implicit ev1: <:!<[V, ClassType[_]], dt: Aux[V, V0, VT0]): Edge[Edge[S, E], 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, Edge[S, E]]]
-
-
def
inEMap(key: String, keys: String*): Map[Property, List[Edge[Any, Edge[S, E]]]]
-
-
def
inMap(key: String, keys: String*): Map[Property, List[Any]]
-
-
def
iri: String
-
def
iris: Set[String]
-
final
def
isInstanceOf[T0]: Boolean
-
def
labels: List[Property]
-
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[Edge[S, E], Any]]
-
-
def
outEMap(key: String, keys: String*): Map[Property, List[Edge[Edge[S, E], Any]]]
-
-
def
outMap(key: String, keys: String*): Map[Property, List[Any]]
-
-
def
prettyPrint: String
-
def
remove(): Unit
-
def
sameResource(resource: Resource[_]): Boolean
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
val
value: Edge[S, E]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
outV-type, edge-start
inV-type, edge-end