asami.common-index — org.clojars.quoll/asami 2.3.4

Common elements for the standard indexed graph, and multigraph implementations.

*stream-from clj/s

(*stream-from selector all-knowns initial-node)

? clj/s

add-zero-step clj/s

(add-zero-step os-map index)

Uses the initial object->subject map to add reflexive connections to all nodes

check-for-transitive clj/s

(check-for-transitive pred)

Tests if a predicate is transitive. Returns a plain version of the predicate, along with a value to indicate if the predicate is transitive. This value is nil for a plain predicate, or else is a keyword to indicate the kind of transitivity.

count-embedded-index clj/s

(count-embedded-index edx)

Adds up the counts of embedded indexes

count-from-index clj/s multimethod

Lookup an index in the graph for the requested data and count the results.

counter clj/s

create-o->smap clj/s

(create-o->smap {idx :pos :as graph} p)

Produces a map from objects to subjects for existing edges in the graph for a given predicate.

downstream-from clj/s

(downstream-from idx get-object-sets-fn all-knowns node)

get-path-between clj/s

(get-path-between idx edges-from node? tag s o)

get-transitive-edges clj/s

get-transitive-edges* clj/s

(get-transitive-edges* os-map)

Retrieves a mapping of all objects to subjects that can be transitively connected by a predicate that was used to retrieve the os-map. os-map: map of objects to subject for existing edges in the graph for a given predicate.

get-transitive-from-index clj/s multimethod

Lookup an index in the graph for the requested data, and returns all data where the required predicate is a transitive relationship. Unspecified predicates extend across the graph. Returns a sequence of unlabelled bindings. Each binding is a vector of binding values.

graph-transact clj/s

(graph-transact graph tx-id assertions retractions generated-data)

Common graph transaction operation

NestedIndex clj/s protocol

lowest-level-fn clj/s

(lowest-level-fn this)

Returns a function for handling the lowest index level retrieval

lowest-level-set-fn clj/s

(lowest-level-set-fn this)

Returns a function retrieving a lowest level value as a set

lowest-level-sets-fn clj/s

(lowest-level-sets-fn this)

Returns a function retrieving all lowest level values as sets

mid-level-map-fn clj/s

(mid-level-map-fn this)

Returns a function that converts the mid->lowest in a simple map

plain clj/s

(plain pred)

Inputs: [pred :- Predicate] Returns: Predicate

Converts a transitive-structured predicate into a plain one

Predicate clj/s

sconj clj/s

second-last clj/s

(second-last s)

Returns the second-last character in a string.

simplify clj/s

(simplify g & ks)

sinto clj/s

step-by-predicate clj/s

(step-by-predicate resolution)

Function to add an extra step to a current resolution. Steps to the 'left' where it finds a new edge where the object is the subject of an existing edge. A single 'step' may traverse multiple edges, if new edges are added during iteration which contain objects that have yet to be processed. resolution: a map of object nodes to sets of subject nodes that they are connected to by the desired predicate

subvseq clj/s

(subvseq v a b)

A subvec wrapper that drops back to sequences when the seq is not a vector

trans-simplify clj/s

(trans-simplify g tag & ks)

transitive-cache-depth clj/s

Defines how many elements to keep in the transitive cache

upstream-from clj/s

(upstream-from pos all-knowns node)

zero-step clj/s

(zero-step tag zero result)

Prepend a zero step value if the tag requests it