lspace
.
lgraph
LDataGraph
Related Doc:
package lgraph
trait
LDataGraph
extends
LGraph
with
DataGraph
Linear Supertypes
DataGraph
,
LGraph
,
structure.Graph
,
GraphUtils
,
IriResource
,
AnyRef
,
Any
Known Subclasses
LHistory
,
LNSGraph
Ordering
Alphabetic
By Inheritance
Inherited
LDataGraph
DataGraph
LGraph
Graph
GraphUtils
IriResource
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Type Members
type
GEdge
[
S
,
E
]
=
_Edge
[
S
,
E
] with
LEdge
[
S
,
E
]
Definition Classes
LGraph
→ Graph
type
GNode
=
_Node
with
LNode
Definition Classes
LGraph
→ Graph
type
GResource
[
T
]
=
_Resource
[
T
] with
LResource
[
T
]
Definition Classes
LGraph
→ Graph
type
GValue
[
T
]
=
_Value
[
T
] with
LValue
[
T
]
Definition Classes
LGraph
→ Graph
abstract
class
_Edge
[
S
,
E
]
extends
_Resource
[
structure.Edge
[
S
,
E
]] with
structure.Edge
[
S
,
E
]
Definition Classes
Graph
abstract
class
_Node
extends
_Resource
[
structure.Node
] with
structure.Node
Definition Classes
Graph
trait
_Resource
[
+T
]
extends
structure.Resource
[
T
]
Definition Classes
Graph
abstract
class
_Value
[
T
]
extends
_Resource
[
T
] with
structure.Value
[
T
]
Definition Classes
Graph
Abstract Value Members
abstract
def
idProvider
:
IdProvider
Attributes
protected[
lspace
]
Definition Classes
Graph
abstract
def
index
:
LIndexGraph
Definition Classes
LDataGraph
→ DataGraph
abstract
def
iri
:
String
Definition Classes
IriResource
abstract
def
ns
:
LNSGraph
Definition Classes
LGraph
→ Graph
abstract
def
storeManager
:
StoreManager
[
LDataGraph
.this.type]
Attributes
protected[
lspace
]
Definition Classes
LGraph
Concrete Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
def
*>
[
ST <:
structure.ClassType
[_]
,
End
,
ET
[
+Z
]
<:
structure.ClassType
[
Z
]
,
Segments <:
HList
,
Steps <:
HList
,
RSteps <:
HList
,
Containers <:
HList
,
F
[
_
]
]
(
traversal:
librarian.traversal.Traversal
[
ST
,
ET
[
End
],
Segments
]
)
(
implicit
flat:
Aux
[
SegmentMapper
.type,
Segments
,
Steps
]
,
reverse:
Aux
[
Steps
,
RSteps
]
,
f:
Aux
[
RSteps
,
ContainerSteps
.type,
Containers
]
,
guide:
Guide
[
F
]
,
mapper:
Mapper
[
F
,
Containers
,
End
]
)
:
FT
Definition Classes
Graph
final
def
+
(
label:
structure.Ontology
)
:
Task
[
structure.Node
]
Definition Classes
Graph
val
++
: (
structure.Graph
) ⇒
Task
[
structure.Graph
]
Definition Classes
Graph
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
@id
:
String
Definition Classes
IriResource
def
add
: (
structure.Graph
) ⇒
Task
[
structure.Graph
]
Definition Classes
Graph
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
implicit
lazy val
assistent
:
Assistent
Definition Classes
Graph
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
close
()
:
Task
[
Unit
]
Definition Classes
LGraph
→ Graph
def
createEdge
[
S
,
E
]
(
id:
Long
,
from:
_Resource
[
S
]
,
key:
structure.Property
,
to:
_Resource
[
E
]
)
:
Task
[
GEdge
[
S
,
E
]]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
def
createValue
[
T
]
(
_id:
Long
,
_value:
T
,
dt:
datatype.DataType
[
T
]
)
:
Task
[
GValue
[
T
]]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
def
deleteEdge
(
edge:
_Edge
[_, _]
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
def
deleteNode
(
node:
_Node
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
def
deleteResource
[
T <:
_Resource
[_]
]
(
resource:
T
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
deleteValue
(
value:
_Value
[_]
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
lazy val
edgeStore
:
LEdgeStore
[
LDataGraph
.this.type]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
edges
:
Edges
Definition Classes
Graph
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
o:
Any
)
:
Boolean
Definition Classes
IriResource → AnyRef → Any
def
executeTraversal
[
F
[
_
]
]
(
traversal:
librarian.traversal.Traversal
[_ <:
structure.ClassType
[
Any
], _ <:
structure.ClassType
[
Any
], _ <:
HList
]
,
guide:
Guide
[
F
]
)
:
F
[
Any
]
Attributes
protected[
lspace
]
Definition Classes
Graph
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getOrCreateNode
(
id:
Long
)
:
Task
[
GNode
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
implicit
lazy val
guide
:
Guide
[
Observable
]
Definition Classes
Graph
lazy val
hashCode
:
Int
Definition Classes
Graph → AnyRef → Any
def
indexEdge
[
S
,
E
]
(
edge:
_Edge
[
S
,
E
]
)
:
Task
[
Unit
]
Attributes
protected
Definition Classes
DataGraph
def
indexNode
(
node:
_Node
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph
lazy val
init
:
Task
[
Unit
]
Definition Classes
DataGraph → Graph
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
mergeNodes
(
nodes:
Set
[
structure.Node
]
)
:
Task
[
structure.Node
]
Definition Classes
GraphUtils
def
mergeValues
[
V
]
(
values:
Set
[
structure.Value
[
V
]]
)
:
Task
[
structure.Value
[
V
]]
Definition Classes
GraphUtils
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
newEdge
[
S
,
E
]
(
id:
Long
,
from:
_Resource
[
S
]
,
key:
structure.Property
,
to:
_Resource
[
E
]
)
:
GEdge
[
S
,
E
]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
newNode
(
id:
Long
)
:
_Node
with
LNode
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
newValue
[
T
]
(
id:
Long
,
value:
T
,
label:
datatype.DataType
[
T
]
)
:
GValue
[
T
]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
lazy val
nodeStore
:
LNodeStore
[
LDataGraph
.this.type]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
nodes
:
Nodes
Definition Classes
Graph
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
persist
:
Task
[
Unit
]
Definition Classes
LDataGraph
→ Graph
def
purge
:
Task
[
Unit
]
Definition Classes
DataGraph → Graph
def
resources
:
Resources
Definition Classes
Graph
def
storeEdge
(
edge:
_Edge
[_, _]
)
:
Task
[
Unit
]
Attributes
protected
Definition Classes
Graph
def
storeNode
(
node:
_Node
)
:
Task
[
Unit
]
Attributes
protected[
lspace
]
Definition Classes
DataGraph → Graph
def
storeValue
(
value:
_Value
[_]
)
:
Task
[
Unit
]
Attributes
protected
Definition Classes
Graph
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
lazy val
thisgraph
:
LDataGraph
.this.type
Definition Classes
Graph
def
toString
()
:
String
Definition Classes
Graph → AnyRef → Any
def
transaction
:
Transaction
Definition Classes
LGraph
→ Graph
lazy val
valueStore
:
LValueStore
[
LDataGraph
.this.type]
Attributes
protected[
lspace
]
Definition Classes
LGraph
→ Graph
def
values
:
Values
Definition Classes
Graph
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
(
...
)
object
writeedge
Definition Classes
LGraph
object
writenode
Definition Classes
LGraph
object
writevalue
Definition Classes
LGraph
Inherited from
DataGraph
Inherited from
LGraph
Inherited from
structure.Graph
Inherited from
GraphUtils
Inherited from
IriResource
Inherited from
AnyRef
Inherited from
Any
Ungrouped