An in-memory graph implementation with full indexing.
An in-memory graph implementation with full indexing.
Lookup an index in the graph for the requested data and count the results based on a transitive index.
Lookup an index in the graph for the requested data and count the results based on a transitive index.
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.
(index-add idx a b c id t)
Inputs: [idx :- Index a :- s/Any b :- s/Any c :- s/Any id :- s/Int t :- s/Int] Returns: Index
Add elements to a 4-level index. If triple already exists, returns given index unchanged.
Inputs: [idx :- Index a :- s/Any b :- s/Any c :- s/Any id :- s/Int t :- s/Int] Returns: Index Add elements to a 4-level index. If triple already exists, returns given index unchanged.
(index-delete idx a b c)
Inputs: [idx :- Index a :- s/Any b :- s/Any c :- s/Any] Returns: (s/maybe Index)
Remove elements from a 4-level index. Returns the new index, or nil if there is no change.
Inputs: [idx :- Index a :- s/Any b :- s/Any c :- s/Any] Returns: (s/maybe Index) Remove elements from a 4-level index. Returns the new index, or nil if there is no change.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close