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)
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
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 idx a b c)
Inputs: [idx :- #:s{Any #:s{Any #{s/Any}}} a :- s/Any b :- s/Any c :- s/Any] Returns: (s/maybe #:s{Any #:s{Any #{s/Any}}})
Remove elements from a 3-level index. Returns the new index, or nil if there is no change.
Inputs: [idx :- #:s{Any #:s{Any #{s/Any}}} a :- s/Any b :- s/Any c :- s/Any] Returns: (s/maybe #:s{Any #:s{Any #{s/Any}}}) Remove elements from a 3-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