Liking cljdoc? Tell your friends :D

asami.common-index

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

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

*stream-fromclj/s

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

?clj/s

source

check-for-transitiveclj/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 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.
sourceraw docstring

count-embedded-indexclj/s

(count-embedded-index edx)

Adds up the counts of embedded indexes

Adds up the counts of embedded indexes
sourceraw docstring

count-from-indexclj/smultimethod

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.
sourceraw docstring

counterclj/s

source

downstream-fromclj/s

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

get-path-betweenclj/s

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

get-transitive-from-indexclj/smultimethod

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.
sourceraw docstring

NestedIndexclj/sprotocol

lowest-level-fnclj/s

(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-fnclj/s

(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-fnclj/s

(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-fnclj/s

(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
source

plainclj/s

(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
sourceraw docstring

Predicateclj/s

source

second-lastclj/s

(second-last s)

Returns the second-last character in a string.

Returns the second-last character in a string.
sourceraw docstring

simplifyclj/s

(simplify g & ks)
source

step-by-predicateclj/s

(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
sourceraw docstring

trans-simplifyclj/s

(trans-simplify g tag & ks)
source

upstream-fromclj/s

(upstream-from osp all-knowns node)
source

zero-stepclj/s

(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
sourceraw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

× close