A multi-graph implementation. Resolution counting ignores multiple edges connecting nodes, so as to allow rules to successfully use this graph type.
A multi-graph implementation. Resolution counting ignores multiple edges connecting nodes, so as to allow rules to successfully use this graph type.
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.
(multi-add idx a b c)
Inputs: [idx :- #:s{Any #:s{Any #:s{Any s/Num}}} a :- s/Any b :- s/Any c :- s/Any] Returns: #:s{Any #:s{Any #:s{Any s/Num}}}
Add elements to a 4-level index
Inputs: [idx :- #:s{Any #:s{Any #:s{Any s/Num}}} a :- s/Any b :- s/Any c :- s/Any] Returns: #:s{Any #:s{Any #:s{Any s/Num}}} Add elements to a 4-level index
(multi-delete idx a b c)
Inputs: [idx :- #:s{Any #:s{Any #:s{Any s/Num}}} a :- s/Any b :- s/Any c :- s/Any] Returns: #:s{Any #:s{Any #:s{Any s/Num}}}
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 s/Num}}} a :- s/Any b :- s/Any c :- s/Any] Returns: #:s{Any #:s{Any #:s{Any s/Num}}} Remove elements from a 3-level index. Returns the new index, or nil if there is no change.
(multi-graph-add graph subj pred obj)
(multi-graph-add graph subj pred obj n)
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close