Common elements for the standard indexed graph, and multigraph implementations.
Common elements for the standard indexed graph, and multigraph implementations.
(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 plan predicate, or else is a keyword to indicate the kind of transitivity.
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 plan predicate, or else is a keyword to indicate the kind of transitivity.
(count-embedded-index edx)
Adds up the counts of embedded indexes
Adds up the counts of embedded indexes
Lookup an index in the graph for the requested data and count the results.
Lookup an index in the graph for the requested data and count the results.
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.
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.
(lowest-level-fn this)
Returns a function for handling the lowest index level retrieval
Returns a function for handling the lowest index level retrieval
(lowest-level-set-fn this)
Returns a function retrieving a lowest level value as a set
Returns a function retrieving a lowest level value as a set
(lowest-level-sets-fn this)
Returns a function retrieving all lowest level values as sets
Returns a function retrieving all lowest level values as sets
(mid-level-map-fn this)
Returns a function that converts the mid->lowest in a simple map
Returns a function that converts the mid->lowest in a simple map
(plain pred)
Inputs: [pred :- Predicate] Returns: Predicate
Converts a transitive-structured predicate into a plain one
Inputs: [pred :- Predicate] Returns: Predicate Converts a transitive-structured predicate into a plain one
(second-last s)
Returns the second-last character in a string.
Returns the second-last character in a string.
(step-by-predicate resolution)
Function to add an extra step to a current resolution. Takes a map of nodes to sets of nodes that they are connected to
Function to add an extra step to a current resolution. Takes a map of nodes to sets of nodes that they are connected to
(zero-step tag zero result)
Prepend a zero step value if the tag requests it
Prepend a zero step value if the tag requests it
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close