lspace
.
lgraph
LTransaction
Related Docs:
object LTransaction
|
package lgraph
class
LTransaction
extends
Transaction
Linear Supertypes
Transaction
,
MemDataGraph
,
DataGraph
,
MemGraph
,
Graph
,
GraphUtils
,
IriResource
,
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
LTransaction
Transaction
MemDataGraph
DataGraph
MemGraph
Graph
GraphUtils
IriResource
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Instance Constructors
new
LTransaction
(
parent:
LGraph
)
Type Members
trait
Edges
extends
librarian.provider.transaction.Transaction.Edges
Definition Classes
Transaction
type
GEdge
[
S
,
E
]
=
_Edge
[
S
,
E
] with
MemEdge
[
S
,
E
]
Definition Classes
MemGraph → Graph
type
GNode
=
_Node
with
MemNode
Definition Classes
MemGraph → Graph
type
GResource
[
T
]
=
_Resource
[
T
] with
MemResource
[
T
]
Definition Classes
MemGraph → Graph
type
GValue
[
T
]
=
_Value
[
T
] with
MemValue
[
T
]
Definition Classes
MemGraph → Graph
trait
Nodes
extends
librarian.provider.transaction.Transaction.Nodes
Definition Classes
Transaction
sealed
trait
RApi
[
T <:
Resource
[_]
]
extends
AnyRef
Definition Classes
Graph
trait
Resources
extends
librarian.provider.transaction.Transaction.Resources
Definition Classes
Transaction
trait
Values
extends
librarian.provider.transaction.Transaction.Values
Definition Classes
Transaction
abstract
class
_Edge
[
S
,
E
]
extends
_Resource
[
Edge
[
S
,
E
]] with
Edge
[
S
,
E
]
Definition Classes
Graph
abstract
class
_Node
extends
_Resource
[
Node
] with
Node
Definition Classes
Graph
trait
_Resource
[
+T
]
extends
Resource
[
T
]
Definition Classes
Graph
case class
_TEdge
[
S
,
E
]
extends
librarian.provider.transaction.Transaction._Edge
[
S
,
E
] with
TEdge
[
S
,
E
] with
Product
with
Serializable
Definition Classes
Transaction
case class
_TNode
extends
librarian.provider.transaction.Transaction._Node
with
TNode
with
Product
with
Serializable
Definition Classes
Transaction
trait
_TResource
[
T
]
extends
librarian.provider.transaction.Transaction._Resource
[
T
] with
TResource
[
T
]
Definition Classes
Transaction
case class
_TValue
[
T
]
extends
librarian.provider.transaction.Transaction._Value
[
T
] with
TValue
[
T
] with
Product
with
Serializable
Definition Classes
Transaction
abstract
class
_Value
[
T
]
extends
_Resource
[
T
] with
Value
[
T
]
Definition Classes
Graph
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
+
(
label:
Ontology
)
:
Node
Definition Classes
Graph
val
++
: (
Graph
) ⇒
Graph
Definition Classes
Graph
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
lazy val
@idIndex
:
Index
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemDataGraph → DataGraph
val
@idStore
:
ValueStore
[
LTransaction
.this.type]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph
lazy val
@typeIndex
:
Index
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemDataGraph → DataGraph
def
__
[
Start
,
End
]
(
implicit
cltblStart:
ClassTypeable
[
Start
]
,
cltblEnd:
ClassTypeable
[
End
]
)
:
Traversal
[
CT
,
CT
,
HNil
]
Definition Classes
Graph
def
_indexEdge
[
S
,
E
]
(
edge:
GEdge
[
S
,
E
]
)
:
Unit
Attributes
protected
Definition Classes
DataGraph
def
_indexNode
(
node:
GNode
)
:
Unit
Attributes
protected
Definition Classes
DataGraph
def
add
: (
Graph
) ⇒
Graph
Definition Classes
Graph
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
buildAsyncTraversersStream
[
Start <:
ClassType
[_]
,
End <:
ClassType
[_]
,
Steps <:
HList
,
Out
]
(
traversal:
Traversal
[
Start
,
End
,
Steps
]
)
:
Task
[
Stream
[
Out
]]
Definition Classes
MemGraph → Graph
def
buildTraversersStream
[
Start <:
ClassType
[_]
,
End <:
ClassType
[_]
,
Steps <:
HList
,
Out
]
(
traversal:
Traversal
[
Start
,
End
,
Steps
]
)
:
Stream
[
Out
]
Definition Classes
MemGraph → Graph
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
close
()
:
CancelableFuture
[
Unit
]
Definition Classes
Graph
def
commit
()
:
Unit
Definition Classes
LTransaction
→ Transaction
val
computer
:
TransactionStreamComputer
Definition Classes
Transaction → MemGraph
def
createEdge
[
S
,
E
]
(
id:
Long
,
from:
GResource
[
S
]
,
key:
Property
,
to:
GResource
[
E
]
)
:
GEdge
[
S
,
E
]
Attributes
protected
Definition Classes
Transaction → DataGraph → Graph
def
createEdge
(
id:
Long
,
from:
Long
,
key:
Property
,
to:
Long
)
:
GEdge
[
Any
,
Any
]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
createValue
[
T
]
(
_id:
Long
,
_value:
T
,
dt:
DataType
[
T
]
)
:
GValue
[
T
]
Attributes
protected
Definition Classes
Transaction → DataGraph → Graph
def
deleteEdge
(
edge:
GEdge
[_, _]
)
:
Unit
Definition Classes
LTransaction
→ Transaction → DataGraph → Graph
def
deleteNode
(
node:
GNode
)
:
Unit
Definition Classes
LTransaction
→ Transaction → DataGraph → Graph
def
deleteResource
[
T <:
_Resource
[_]
]
(
resource:
T
)
:
Unit
Attributes
protected
Definition Classes
MemGraph → Graph
def
deleteValue
(
value:
GValue
[_]
)
:
Unit
Definition Classes
LTransaction
→ Transaction → DataGraph → Graph
val
edgeStore
:
MemEdgeStore
[
LTransaction
.this.type]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
edges
:
Edges
Definition Classes
Transaction → Graph
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
o:
Any
)
:
Boolean
Definition Classes
IriResource → AnyRef → Any
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
g
(
graph:
Graph
*
)
:
Traversal
[
DataType
[
Graph
],
DataType
[
Graph
],
HNil
]
Definition Classes
Graph
def
g
:
Traversal
[
DataType
[
Graph
],
DataType
[
Graph
],
HNil
]
Definition Classes
Graph
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getOrCreateNode
(
id:
Long
)
:
GNode
Attributes
protected[
lspace
]
Definition Classes
Transaction → DataGraph → Graph
lazy val
hashCode
:
Int
Definition Classes
Graph → AnyRef → Any
lazy val
idProvider
:
IdProvider
Definition Classes
Transaction → Graph
val
index
:
MemIndexGraph
Definition Classes
LTransaction
→ DataGraph
lazy val
init
:
CancelableFuture
[
Unit
]
Definition Classes
DataGraph → Graph
val
iri
:
String
Definition Classes
LTransaction
→ IriResource
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
isOpen
:
Boolean
Definition Classes
Transaction
def
mergeNodes
(
nodes:
Set
[
Node
]
)
:
Task
[
Node
]
Definition Classes
GraphUtils
def
mergeValues
[
V
]
(
values:
Set
[
Value
[
V
]]
)
:
Task
[
Value
[
V
]]
Definition Classes
GraphUtils
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
newEdge
(
id:
Long
,
from:
Long
,
key:
Property
,
to:
Long
)
:
GEdge
[
Any
,
Any
]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
newEdge
[
S
,
E
]
(
id:
Long
,
from:
GResource
[
S
]
,
key:
Property
,
to:
GResource
[
E
]
)
:
GEdge
[
S
,
E
]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
val
newEdgeLock
:
AnyRef
Attributes
protected[this]
Definition Classes
MemGraph
def
newNode
(
id:
Long
)
:
GNode
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
newValue
[
T
]
(
id:
Long
,
value:
T
,
label:
DataType
[
T
]
)
:
GValue
[
T
]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
val
newValueLock
:
AnyRef
Attributes
protected[this]
Definition Classes
MemGraph
val
nodeStore
:
MemNodeStore
[
LTransaction
.this.type]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
nodes
:
Nodes
Definition Classes
Transaction → Graph
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
lazy val
ns
:
NameSpaceGraph
Definition Classes
Transaction → Graph
var
open
:
Boolean
Attributes
protected
Definition Classes
Transaction
val
parent
:
LGraph
Definition Classes
LTransaction
→ Transaction
def
persist
:
CancelableFuture
[
Unit
]
Definition Classes
Graph
def
resources
:
Resources
Definition Classes
Transaction → Graph
def
rollback
()
:
Unit
clears the transaction's MemGraph
clears the transaction's MemGraph
Definition Classes
LTransaction
→ Transaction
def
storeEdge
(
edge:
GEdge
[_, _]
)
:
Unit
Attributes
protected
Definition Classes
Graph
def
storeNode
(
node:
GNode
)
:
Unit
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
storeValue
(
value:
GValue
[_]
)
:
Unit
Attributes
protected
Definition Classes
Graph
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
lazy val
thisgraph
:
LTransaction
.this.type
Definition Classes
Graph
def
toFile
(
path:
String
,
process: (
Stream
[
Resource
[_]], (
String
) ⇒
Unit
) ⇒
String
)
:
Task
[
Unit
]
Definition Classes
MemGraph
def
toString
()
:
String
Definition Classes
Graph → AnyRef → Any
def
transaction
:
Transaction
Definition Classes
MemGraph → Graph
lazy val
traversal
:
Traversal
[
DataType
[
Graph
],
DataType
[
Graph
],
HNil
]
Definition Classes
Graph
val
valueStore
:
MemValueStore
[
LTransaction
.this.type]
Attributes
protected[
lspace.librarian.provider.mem
]
Definition Classes
MemGraph → Graph
def
values
:
Values
Definition Classes
Transaction → 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
(
...
)
def
wrapTR
[
T <:
LGraph.GResource
[_]
]
(
resource:
T
)
:
_Resource
[_]
Definition Classes
Transaction
Inherited from
Transaction
Inherited from
MemDataGraph
Inherited from
DataGraph
Inherited from
MemGraph
Inherited from
Graph
Inherited from
GraphUtils
Inherited from
IriResource
Inherited from
AnyRef
Inherited from
Any
Ungrouped