The implements the Graph over durable storage
The implements the Graph over durable storage
Lookup an index in the graph for the requested data. Returns a sequence of unlabelled bindings. Each binding is a vector of binding values.
Lookup an index in the graph for the requested data. Returns a sequence of unlabelled bindings. Each binding is a vector of binding values.
(graph-at {:keys [spot post ospt tspo pool node-allocator] :as graph}
{:keys [r-spot r-post r-ospt r-pool] :as new-tx})
Returns a graph based on another graph, but with different set of index roots. This returns a historical graph. graph: The graph to base this on. The same index references will be used. new-tx: An unpacked transaction, containing each of the tree roots for the indices.
Returns a graph based on another graph, but with different set of index roots. This returns a historical graph. graph: The graph to base this on. The same index references will be used. new-tx: An unpacked transaction, containing each of the tree roots for the indices.
(new-block-graph name {:keys [r-spot r-post r-ospt r-pool]} node-allocator)
Creates a new BlockGraph object, under a given name. If the resources for that name exist, then they are opened. If the resources do not exist, then they are created. name: the label of the location for the graph resources. tx: The transaction record for this graph.
Creates a new BlockGraph object, under a given name. If the resources for that name exist, then they are opened. If the resources do not exist, then they are created. name: the label of the location for the graph resources. tx: The transaction record for this graph.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close