Expand description
IndraDB
- a graph datastore.
IndraDB
is broken up into a library and an application. This is the
library, which you would use if you want to create new datastore
implementations, or plug into the low-level details of IndraDB
. For most
use cases, you can use the application, which exposes an API and scripting
layer.
Modules
Utility functions.
Structs
An edge.
Represents a uniquely identifiable key to an edge.
Represents edge metadata.
The Error type.
An in-memory-only datastore.
A transaction for manipulating in-memory-only datastores.
An edge or vertex type.
The Error type.
A vertex.
Represents vertex metadata.
Enums
Specifies what kind of items should be piped from one type of query to
another.
A query for edges.
The kind of an error.
The kind of an error.
A query for vertices.
Traits
Specifies a datastore implementation.
Additional methods for
Result
, for easy interaction with this crate.Specifies a transaction implementation, which are returned by datastores.
All datastore manipulations are done through transactions. Despite the
name, different datastore implementations carry different guarantees.
Depending on the implementation, it may not be possible to rollback the
changes on error. See the documentation of individual implementations for
details. Transactions are automatically committed on drop. Transactions
should be designed to not fail on commit; i.e. errors should occur when a
method is actually called instead.
Additional methods for
Result
, for easy interaction with this crate.Type Definitions
Convenient wrapper around
std::Result
.Convenient wrapper around
std::Result
.