Exceptions indicated.
clara.tools.fact-graph
map->AccumulationNodeclj
(map->AccumulationNode m11111)Factory function for class AccumulationNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
Factory function for class AccumulationNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
map->AccumulationResultNodeclj
(map->AccumulationResultNode m11157)Factory function for class AccumulationResultNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
Factory function for class AccumulationResultNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
map->RuleActivationNodeclj
(map->RuleActivationNode m11058)Factory function for class RuleActivationNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
Factory function for class RuleActivationNode, taking a map of keywords to field values, but not much slower than ->x like the clojure.core version. (performance is fixed in Clojure 1.7, so this should eventually be removed.)
session->fact-graphclj/s
(session->fact-graph session)Given a session, return a graph structure connecting all facts to the facts that they caused to be logically inserted. Note that such connections will not be made for unconditionally inserted facts.
Given a session, return a graph structure connecting all facts to the facts that they caused to be logically inserted. Note that such connections will not be made for unconditionally inserted facts.
strict-map->AccumulationNodeclj/s≠
(strict-map->AccumulationNode m11112 & [drop-extra-keys?__1996__auto__])(strict-map->AccumulationNode m15450 & [drop-extra-keys?__1996__auto__])Factory function for class AccumulationNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
Factory function for class AccumulationNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
strict-map->AccumulationResultNodeclj/s≠
(strict-map->AccumulationResultNode m11158 & [drop-extra-keys?__1996__auto__])(strict-map->AccumulationResultNode m15473 & [drop-extra-keys?__1996__auto__])Factory function for class AccumulationResultNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
Factory function for class AccumulationResultNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
strict-map->RuleActivationNodeclj/s≠
(strict-map->RuleActivationNode m11059 & [drop-extra-keys?__1996__auto__])(strict-map->RuleActivationNode m15427 & [drop-extra-keys?__1996__auto__])Factory function for class RuleActivationNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
Factory function for class RuleActivationNode, taking a map of keywords to field values. All keys are required, and no extra keys are allowed. Even faster than map->
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close