asami.multi-graph — org.clojars.quoll/asami 2.2.1

A multi-graph implementation. Resolution counting ignores multiple edges connecting nodes, so as to allow rules to successfully use this graph type.

*insert-op* clj/s

count-transitive-from-index clj/s multimethod

Lookup an index in the graph for the requested data and count the results based on a transitive index.

empty-multi-graph clj/s

get-from-multi-index clj/s multimethod

Lookup an index in the graph for the requested data. Returns a sequence of unlabelled bindings. Each binding is a vector of binding values.

IndexStructure clj/s

multi-add clj/s

(multi-add idx a b c tx id)

Inputs: [idx :- IndexStructure a :- s/Any b :- s/Any c :- s/Any tx :- s/Int id :- s/Int] Returns: IndexStructure

Add elements to a 4-level index

multi-delete clj/s

(multi-delete idx a b c)

Inputs: [idx :- IndexStructure a :- s/Any b :- s/Any c :- s/Any] Returns: (s/maybe IndexStructure)

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

multi-graph-add clj/s

(multi-graph-add graph subj pred obj tx)

(multi-graph-add graph subj pred obj tx n)

MultiGraph clj/s