naga.storage.memory.index — naga 0.1.0

A graph implementation with full indexing.

? clj

empty-graph clj

get-from-index clj multimethod

Lookup an index in the graph for the requested data

Graph clj protocol

graph-add clj

(graph-add this subj pred obj)

Adds triples to the graph

graph-delete clj

(graph-delete this subj pred obj)

Removes triples from the graph

resolve-triple clj

(resolve-triple this subj pred obj)

Resolves patterns from the graph, and returns unbound columns only

index-add clj

(index-add idx a b c)

Inputs: [idx :- {s/Any {s/Any s/Any}} a :- s/Any b :- s/Any c :- s/Any] Returns: {s/Any {s/Any #{s/Any}}}

Add elements to a 3-level index

index-delete clj

(index-delete idx a b c)

Inputs: [idx :- {s/Any {s/Any #{s/Any}}} a :- s/Any b :- s/Any c :- s/Any] Returns: {s/Any {s/Any #{s/Any}}}

Remove elements from a 3-level index. Returns the new index, or nil if there is no change.

resolve-pattern clj

(resolve-pattern graph [s p o :as pattern])

Convenience function to extract elements out of a pattern to query for it