This is the cl-bayesnet Reference Manual, version 0.1.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Jun 15 03:47:01 2025 GMT+0.
cl-bayesnet/cl-bayesnet.asdcl-bayesnet/src/packages.lispcl-bayesnet/src/utils.lispcl-bayesnet/src/tries.lispcl-bayesnet/src/bn-utils.lispcl-bayesnet/src/bn.lispcl-bayesnet/src/parse-network.lispcl-bayesnet/src/clique-tree.lispcl-bayesnet/src/message.lispcl-bayesnet/src/evidence.lispcl-bayesnet/src/compiler.lispcl-bayesnet/src/emit-c.lispcl-bayesnet/src/test.lispThe main system appears first, followed by any subsystem dependency.
cl-bayesnetA Common Lisp Bayesian Network Inference Engine
Lucas Hope <lucas.r.hope@gmail.com>
Lucas Hope <lucas.r.hope@gmail.com>
LLGPL
0.1.0
s-xml (system).
trivial-shell (system).
cffi (system).
src (module).
Modules are listed depth-first from the system components tree.
cl-bayesnet/srccl-bayesnet (system).
packages.lisp (file).
utils.lisp (file).
tries.lisp (file).
bn-utils.lisp (file).
bn.lisp (file).
parse-network.lisp (file).
clique-tree.lisp (file).
message.lisp (file).
evidence.lisp (file).
compiler.lisp (file).
emit-c.lisp (file).
test.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-bayesnet/cl-bayesnet.asdcl-bayesnet/src/packages.lispcl-bayesnet/src/utils.lispcl-bayesnet/src/tries.lispcl-bayesnet/src/bn-utils.lispcl-bayesnet/src/bn.lispcl-bayesnet/src/parse-network.lispcl-bayesnet/src/clique-tree.lispcl-bayesnet/src/message.lispcl-bayesnet/src/evidence.lispcl-bayesnet/src/compiler.lispcl-bayesnet/src/emit-c.lispcl-bayesnet/src/test.lispcl-bayesnet/src/utils.lisppackages.lisp (file).
src (module).
*calculation-context* (special variable).
aif (macro).
awhen (macro).
best (function).
best-in-array (function).
best-in-hash (function).
best-in-list (function).
compose (function).
copy-array (function).
cpt-incf (function).
cpt-index (function).
make-vector (function).
map-int (function).
maparray (function).
multf (macro).
normalize (function).
order-vector (function).
returnit (macro).
shuffle (generic function).
while (macro).
with-calculation (macro).
with-calculation-context (macro).
with-gensyms (macro).
cl-bayesnet/src/tries.lisputils.lisp (file).
src (module).
%trie-map-key-value (function).
%trie-map-trie (function).
+trie-hash-threshold+ (constant).
copy-trie (function).
do-trie-branches (macro).
do-trie-values (macro).
hash-to-trie (function).
make-trie (function).
make-trie-hash (function).
trie (structure).
trie-bottom-p (function).
trie-branch (reader).
(setf trie-branch) (writer).
trie-branch-count (function).
trie-branch-values (function).
trie-clear (function).
trie-count (reader).
(setf trie-count) (writer).
trie-insert (function).
trie-list-bottom (function).
trie-list-depth (function).
trie-list-values (function).
trie-map-b (function).
trie-map-branches (function).
trie-map-key-value (function).
trie-map-trie (function).
trie-map-values (function).
trie-p (function).
trie-prune (function).
trie-search (function).
trie-test (reader).
(setf trie-test) (writer).
trie-value (reader).
(setf trie-value) (writer).
cl-bayesnet/src/bn-utils.lisptries.lisp (file).
src (module).
*temporary-directory* (special variable).
degen-prob (function).
do-upper (macro).
edge< (function).
edge= (function).
find-temporary-file (function).
float-to-fixnums (function).
map-pairs (function).
multiply-floats (macro).
node-combinations (function).
random-choose (function).
reset-potential (macro).
split (function).
split-probs (function).
sum-floats (macro).
symmetric (function).
(setf symmetric) (function).
vecfn (function).
vlength (macro).
cl-bayesnet/src/bn.lispbn-utils.lisp (file).
src (module).
add-evidence (generic function).
clear-evidence (generic function).
evidence (generic function).
(setf evidence) (generic function).
evidence-index (generic function).
name (generic reader).
net (generic reader).
net (class).
node (generic function).
node (class).
node-order (generic reader).
num-nodes (generic reader).
num-states (generic reader).
parents (generic reader).
query (function).
states (generic reader).
with-evidence (macro).
%evidence (reader method).
(setf %evidence) (writer method).
%evidence-1 (function).
%query (generic function).
compiled (reader method).
(setf compiled) (writer method).
evidence-1 (generic function).
gen-parameter (function).
index (reader method).
(setf index) (writer method).
node-vec (reader method).
(setf node-vec) (writer method).
nodes (reader method).
num-arcs (function).
num-nodes-1 (function).
num-states-1 (function).
parent-indices (reader method).
(setf parent-indices) (writer method).
parent-vec (reader method).
(setf parent-vec) (writer method).
preprocess-network (function).
preprocess-node (function).
properties (reader method).
properties (reader method).
save-evidence (macro).
set-name (writer method).
set-name (writer method).
set-net (writer method).
set-node-order (writer method).
set-parents (writer method).
set-states (writer method).
statep (function).
table (reader method).
(setf table) (writer method).
table-lookup (function).
cl-bayesnet/src/parse-network.lispbn.lisp (file).
src (module).
initialize-instance (method).
load-ace (function).
load-dne (function).
load-xmlbif (function).
dimension-list (function).
dimension-list-but-one (function).
keyify (function).
parse-ace-node (function).
parse-ace-potential (function).
parse-ace-stream (function).
parse-netica-net (function).
parse-netica-node (function).
parse-netica-stream (function).
xmlbif-add-definition (function).
xmlbif-add-variable (function).
cl-bayesnet/src/clique-tree.lispparse-network.lisp (file).
src (module).
assign-nodes (function).
best-root (function).
clique-tree (function).
cluster-node (function).
connect (function).
cycle (function).
delete-node (function).
floyd-warshall (function).
gen-cliques (function).
moral (function).
neighbour (function).
neighbours (function).
net-masks (function).
path (function).
roots (function).
sep-cost (function).
sep-mass (function).
sep-sets (function).
traverse (function).
tree-depth (function).
weight-cluster (function).
cl-bayesnet/src/message.lispclique-tree.lisp (file).
src (module).
all-sep-sets (reader method).
assignment (reader method).
assignment (reader method).
clean-potential (reader method).
cluster (class).
clusters (reader method).
collect-evidence (function).
consistent (reader method).
(setf consistent) (writer method).
distribute-evidence (function).
evi (reader method).
evi (reader method).
(setf evi) (writer method).
index (reader method).
join-tree-of (reader method).
(setf join-tree-of) (writer method).
jt-node (class).
jt-obs (function).
jt-prob (function).
jt-propagate (function).
jt-retract (function).
links (reader method).
make-join-tree (function).
make-potential (function).
marginalise (function).
mark (reader method).
(setf mark) (writer method).
mask (reader method).
message-pass (generic function).
nodes (reader method).
obs (reader method).
obs (reader method).
(setf obs) (writer method).
(setf obs) (writer method).
potential (reader method).
(setf potential) (writer method).
potential-container (class).
sep-set (class).
cl-bayesnet/src/evidence.lispmessage.lisp (file).
src (module).
add-evidence (method).
clear-evidence (method).
evidence (method).
evidence (method).
(setf evidence) (method).
(setf evidence) (method).
(setf evidence) (method).
(setf evidence) (method).
evidence-index (method).
evidence-index (method).
node (method).
node (method).
use-join-tree (function).
cl-bayesnet/src/compiler.lispevidence.lisp (file).
src (module).
initialize-instance (method).
instructions (class).
use-interpreted (function).
*-lookup (reader method).
+-lookup (reader method).
add-form (function).
assignment (reader method).
(setf assignment) (writer method).
best-traversal (function).
cliques (reader method).
(setf cliques) (writer method).
form-count (reader method).
(setf form-count) (writer method).
forms (reader method).
(setf forms) (writer method).
gen-clique (function).
gen-evidence (function).
gen-instructions (function).
gen-separator (function).
get-* (function).
get-+ (function).
get-match (function).
interpret (function).
match (function).
match-lookup (reader method).
post-process-plus (function).
post-process-times (function).
push-form (function).
set-* (function).
set-+ (function).
set-match (function).
tree (reader method).
(setf tree) (writer method).
cl-bayesnet/src/emit-c.lispcompiler.lisp (file).
src (module).
use-compiled-c (function).
*gcc-format-string* (special variable).
emit-c-double (function).
emit-c-forms (function).
emit-c-net (function).
emit-c-preamble (function).
cl-bayesnet/src/test.lispemit-c.lisp (file).
src (module).
junction-p (function).
net-graph (function).
random-evidence (function).
random-graph (function).
random-network (function).
random-prob (function).
random-table (function).
test-net-random (function).
Packages are listed by definition order.
cl-bayesnetA Common Lisp Bayesian Network Inference Engine
bn
common-lisp.
add-evidence (generic function).
clear-evidence (generic function).
evidence (generic function).
(setf evidence) (generic function).
evidence-index (generic function).
instructions (class).
join-tree (class).
load-ace (function).
load-dne (function).
load-xmlbif (function).
name (generic reader).
net (generic reader).
net (class).
node (generic function).
node (class).
node-order (generic reader).
num-nodes (generic reader).
num-states (generic reader).
parents (generic reader).
query (function).
states (generic reader).
use-compiled-c (function).
use-interpreted (function).
use-join-tree (function).
with-evidence (macro).
%evidence (generic reader).
(setf %evidence) (generic writer).
%evidence-1 (function).
%query (generic function).
%trie-map-key-value (function).
%trie-map-trie (function).
*-lookup (generic reader).
*calculation-context* (special variable).
*gcc-format-string* (special variable).
*temporary-directory* (special variable).
+-lookup (generic reader).
+trie-hash-threshold+ (constant).
add-form (function).
aif (macro).
all-sep-sets (generic reader).
assign-nodes (function).
assignment (generic reader).
(setf assignment) (generic writer).
awhen (macro).
best (function).
best-in-array (function).
best-in-hash (function).
best-in-list (function).
best-root (function).
best-traversal (function).
clean-potential (generic reader).
clique-tree (function).
cliques (generic reader).
(setf cliques) (generic writer).
cluster (class).
cluster-node (function).
clusters (generic reader).
collect-evidence (function).
compiled (generic reader).
(setf compiled) (generic writer).
compose (function).
connect (function).
consistent (generic reader).
(setf consistent) (generic writer).
copy-array (function).
copy-trie (function).
cpt-incf (function).
cpt-index (function).
cycle (function).
degen-prob (function).
delete-node (function).
dimension-list (function).
dimension-list-but-one (function).
distribute-evidence (function).
do-trie-branches (macro).
do-trie-values (macro).
do-upper (macro).
edge< (function).
edge= (function).
emit-c-double (function).
emit-c-forms (function).
emit-c-net (function).
emit-c-preamble (function).
evi (generic reader).
(setf evi) (generic writer).
evidence-1 (generic function).
find-temporary-file (function).
float-to-fixnums (function).
floyd-warshall (function).
form-count (generic reader).
(setf form-count) (generic writer).
forms (generic reader).
(setf forms) (generic writer).
gen-clique (function).
gen-cliques (function).
gen-evidence (function).
gen-instructions (function).
gen-parameter (function).
gen-separator (function).
get-* (function).
get-+ (function).
get-match (function).
hash-to-trie (function).
index (generic reader).
(setf index) (generic writer).
interpret (function).
join-tree-of (generic reader).
(setf join-tree-of) (generic writer).
jt-node (class).
jt-obs (function).
jt-prob (function).
jt-propagate (function).
jt-retract (function).
junction-p (function).
keyify (function).
links (generic reader).
make-join-tree (function).
make-potential (function).
make-trie (function).
make-trie-hash (function).
make-vector (function).
map-int (function).
map-pairs (function).
maparray (function).
marginalise (function).
mark (generic reader).
(setf mark) (generic writer).
mask (generic reader).
match (function).
match-lookup (generic reader).
message-pass (generic function).
moral (function).
multf (macro).
multiply-floats (macro).
neighbour (function).
neighbours (function).
net-graph (function).
net-masks (function).
node-combinations (function).
node-vec (generic reader).
(setf node-vec) (generic writer).
nodes (generic reader).
normalize (function).
num-arcs (function).
num-nodes-1 (function).
num-states-1 (function).
obs (generic reader).
(setf obs) (generic writer).
order-vector (function).
parent-indices (generic reader).
(setf parent-indices) (generic writer).
parent-vec (generic reader).
(setf parent-vec) (generic writer).
parse-ace-node (function).
parse-ace-potential (function).
parse-ace-stream (function).
parse-netica-net (function).
parse-netica-node (function).
parse-netica-stream (function).
path (function).
post-process-plus (function).
post-process-times (function).
potential (generic reader).
(setf potential) (generic writer).
potential-container (class).
preprocess-network (function).
preprocess-node (function).
properties (generic reader).
push-form (function).
random-choose (function).
random-evidence (function).
random-graph (function).
random-network (function).
random-prob (function).
random-table (function).
reset-potential (macro).
returnit (macro).
roots (function).
save-evidence (macro).
sep-cost (function).
sep-mass (function).
sep-set (class).
sep-sets (function).
set-* (function).
set-+ (function).
set-match (function).
set-name (generic writer).
set-net (generic writer).
set-node-order (generic writer).
set-parents (generic writer).
set-states (generic writer).
shuffle (generic function).
split (function).
split-probs (function).
statep (function).
sum-floats (macro).
symmetric (function).
(setf symmetric) (function).
table (generic reader).
(setf table) (generic writer).
table-lookup (function).
test-net-random (function).
traverse (function).
tree (generic reader).
(setf tree) (generic writer).
tree-depth (function).
trie (structure).
trie-bottom-p (function).
trie-branch (reader).
(setf trie-branch) (writer).
trie-branch-count (function).
trie-branch-values (function).
trie-clear (function).
trie-count (reader).
(setf trie-count) (writer).
trie-insert (function).
trie-list-bottom (function).
trie-list-depth (function).
trie-list-values (function).
trie-map-b (function).
trie-map-branches (function).
trie-map-key-value (function).
trie-map-trie (function).
trie-map-values (function).
trie-p (function).
trie-prune (function).
trie-search (function).
trie-test (reader).
(setf trie-test) (writer).
trie-value (reader).
(setf trie-value) (writer).
vecfn (function).
vlength (macro).
weight-cluster (function).
while (macro).
with-calculation (macro).
with-calculation-context (macro).
with-gensyms (macro).
xmlbif-add-definition (function).
xmlbif-add-variable (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Saves the existing evidence in the net and sets the evidence to evidence. Restores the net to its previous state after leaving the with-evidence block.
Load a file in ace file format. Returns a net.
Load a file in Netica’s dne file format. Returns a net.
Load a file in xmlbif file format. Returns a net.
Queries a net or node object.
node only - A probability vector for the states of node.
node and integer - The probability the node is in that numbered state
(according to (states node)).
node and symbol - The probability the node is in that state.
node and list - A probability vector for the states of node given
list, which is a plist of node-state pairs.
net only - The joint probability for the whole net.
net and vector - The joint probability for the whole net, given the
vector. Vector has the num-nodes length, and
contains either a state number for each node, or -1
if the node state is unknown.
net and symbol - A probability vector for the states of the node
designated by symbol.
net and list - The joint probability for the whole net, given list, which is a plist of node-state pairs.
Writes out arithmetic circuit instructions to a c file, compiles it
with gcc, loads the shared object, and prepares the net to use the
loaded function. If source-location is specified, writes the c file
there. Otherwise uses a temporary file.
Returns the closure used, the raw cffi function pointer, and the number of instructions.
Use interpreted arithmetic circuit instructions for the net. Returns the instructions object.
Use a join-tree to evaluate this net. Returns the join-tree object.
Sets the evidence in a node via state index or symbol. For a net or join-tree, adds the evidence as a plist of node-state pairs.
Clear all evidence from object.
Returns the evidence in a node as its state symbol (nil if no evidence), and for nets and join-trees a plist of node-state pairs. Settable.
Sets the evidence in a node via state index or symbol. For a net or join-tree, sets the evidence as either a plist of node-state pairs, or a vector of state indices (or -1 for unobserved) corresponding to the net’s node-order.
Returns the evidence in a node as a state index and nets as a vector of state indices. -1 indicates no evidence.
For a net, a string identifier and for a node, a keyword identifier.
Returns the containing net for a node or join-tree.
Retrieve the node represented by a keyword name or index from the given net or join-tree.
Returns a list of node-names as keywords. The ordering matches their index order. This is set as part of the network compilation process.
The amount of nodes in the network.
The amount of states for the given node.
A vector of parent names as keywords for the given node.
A vector of state names as keywords for the given node.
instructions) &key net) ¶list
This slot is read-only.
fixnum
0
(simple-array fixnum *)
simple-vector
(setf %evidence).
%evidence.
%query.
%query.
%query.
%query.
clear-evidence.
(setf evidence).
(setf evidence).
(setf evidence).
evidence.
evidence-index.
(setf index).
index.
name.
net.
num-states.
(setf parent-indices).
parent-indices.
(setf parent-vec).
parent-vec.
parents.
properties.
set-name.
set-net.
set-parents.
set-states.
states.
(setf table).
table.
(simple-array fixnum *)
This slot is read-only.
-1
(make-hash-table)
This slot is read-only.
Used by with-calculation(-context) to define a limited caching environment.
String to pass to format. First arg is source, second is target.
Temporary work directory for C-based network compilation
Anaphoric if. (lexically sets ’it’ to the test-form, which can then be referenced in then-form and else-form.
Anaphoric when. See aif.
Loop over the trie’s branches.
do for upper triangular i and j. i from 0 to len, j from i+1 to len.
(setf ref (* ref multiplier)). Like incf.
An anaphorous macro. binds the first val to ‘it’, allows possible modifications in the body, then returns the values. A more general prog1.
Continue performing body until expr is false.
Unless label is nil, caches the calculation performed by body using label. If there is no calculation-context, does not evaluate label, so don’t rely on side effects.
Defines a calculation context within which calculations performed within with-calculation are cached according to their label.
Create a new trie with the same structure as trie, applying fn to the key and the old trie node.
Create a new trie with the same structure as trie, applying fn to each trie-node in turn.
Returns an assignment of a clique node for each net node. Since lookup within a clique is sequential, just uses an array of lists. An array of assignments from the node perspective is returned as a second value.
Returns the best value in seq/hash, along with its position (or key for the hash), according to compare. The comparison value is returned as a third value. key extracts the value to be used for comparison.
return the best value in array, along with its position and its comparison value. See best.
return the best value in hash along with its hash-key and its comparison value. See best.
return the best value in list, along with its position and its comparison value. See best.
Builds a clique-tree for dag. The tree is represented by an upper triangular matrix which has lists of clique-nodes in its diagonal.
Generates a list of added links (node1 . node2) which are necessary to form a cluster around node. Uses an (edge-tree).
Create a function which is the composition of the given functions.
Increments att-state according to att-mask; att-state and att-mask
are vectors. att-mask is nil for non-included attributes and the
number of values for included attributes. It takes (reduce
#’* (remove nil att-mask)) to iterate through att-state. att-state
must be a positive integer below the mask’s value, wherever mask is
non-nil.
Given the mask and att-state, return an index. Used to map attribute values to a single lookup value in a table.
Creates a 0-vector of the given length, with the i’th argument set to 1.
Remove references to the node from graph. Replaces the node with t
Calculates the dimensionality of the list. EG: (make-array (dimension-list list) :initial-contents list)))
Calculates the dimensionality of the list, minus one. EG: (make-array (dimension-list list) :initial-contents list)))
Write out the matching function for state and val. Returns 1.0 if state is negative (missing) or state = val. Returns 0.0 otherwise.
This converts a float to a list of fixnums, useful for hashing floats using fixnum-based schemes.
This finds all shortest paths in graph. I could make it more efficient by using the fact that the paths are symmetric.
Graph is an array of (itree), where each tree contains that node’s neighbours. Returns a list of cliques obtained from triangulating the graph. The triangulation can be recovered by starting with a moral graph and ensuring each clique is completely connected. Each clique is an itree of nodes. Destroys graph.
Generate an arithmetic circuit for the bn represented by a
net (bn.lisp). Note that this version assumes the clique-tree is a
single tree (which is correct at 15/12/2007).
Generate a parameter for the net with the given net-state and node-num.
bn - a net object.
clique-tree - a clique-tree built from the bn’s dag. Symmetric array
with node-num lists on the diagonal and t where connected.
node-assignment - (aref node-assignment node-num) == node’s clique index.
net-state - array of the current node states. Nil means the node hasn’t
been processed.
traversal - the current traversal to operate on: (clique trav1 ... travn)
depth - the current depth of the traversal.
Add the elements of hash to the given trie (if no trie is given, make one with the same test as the hash table. trie-key (default #’identity) is a function to apply to the hash-key. It should convert the hash-key to a list of atoms which are compatible with the trie’s test. trie-value (default #’identity) is a function to extract the value of interest from the actual value (or the key if bagp is non-nil) held in the hash.
Enter the observation that node-num is obs.
Calculates the probability of node-num given junction tree jt.
Test whether the tree is in fact a junction tree, meaning for each pair of cliques, all cliques in between contain their intersection.
Converts a trie alist to a trie-specific hash.
Map fn across integers from 0 below n, returning the results in an (ordered) list.
applies fn to each pair of items and returns a list of the resulting values.
> (map-pairs #’cons ’(1 2 3 4))
=> ((1 . 2) (1 . 3) (1 . 4) (2 . 3) (2 . 4) (3 . 4))
maparray applies fn to all elements in array, returning the result in an array the same dimension as the first array
Return a new potential for sep-set to match cluster.
Matches evidence.
Generates a list of neighbours of the node.
Output the net’s structure in a viewable form.
Shadowing traversal, returns (tree-node node-mask combinations) for each tree-node in traversal.
Returns a vector of all node index combinations built from initial. node-mask is a vector which is nil for non-incremented nodes and numstates for included nodes. DEPRECATED for being horribly slow.
Normalize a vector. Optionally adds smoothing-factor (which should be a number) to each element first. If tot is less than or equal to 0.
Create a vector of length (end - start), filled with numbers from start...(end - 1). Start defaults to 0.
Idea taken from trivial-configuration-parser by Brian Mastenbrook.
Idea taken from trivial-configuration-parser by Brian Mastenbrook.
Puts the form in canonical form for insertion.
Puts the form in canonical form for insertion.
Readies the network for efficient lookup.
Sets a node ordering for the network. Also sets node parent-vec and
parent-indices.
Store information for efficient lookup.
Pushes a form onto instructions, and returns an index into forms. Won’t actually add a form if a matching one exists (acts like pushnew).
Returns the roots of the graph as a list.
Find prod states of x in X + prod states of y in Y. clique1 and clique2 are lists, states is a vector.
Find |intersection| of lists clique1 and clique2
Treat 2D array as a symmetric array. Settable.
Builds a traversal for the undirected tree structure tree. Structure is ;(tree-node subtraversal1 ... subtraversaln)
Returns t if the given trie has no branches.
Count the number of branches of trie.
Return (key . trie-value) for each branch of trie.
Empties the trie, but leaves the test as is.
Insert the value in the trie with the given key. Returns the accessed trie node.
List all values at the bottom of the trie (i.e. values of all tries with no branches).
List all values at the given depth (0 is the top level).
Recursively list all values in the trie.
Apply fn to each branch of trie. Returns the trie.
Apply fn to each branch of trie. Returns a list of the returned values.
Create a new trie with the same structure as trie, applying fn to the key and the old trie node.
Apply fn to the given trie and its children, returning the results as the values of a matching trie.
Apply fn to the given trie’s non-nil values, returning the results as the values of a matching trie.
Recursively remove all branches in to-prune that don’t also appear in example, thus to-prune is guaranteed to be as small as example or smaller.
Recursively search the trie for the given key. If key is nil, We’re at the right node, so we return it. The value (which may be nil) can then be accessed with trie-value.
test.
Build a vector by calling fn num times.
a cluster’s weight is the product of its nodes’ states.
Query a net/node.
jt-node) (query list)) ¶FIXME: should return a single prob for the joint distribution.
join-tree) (query list)) ¶FIXME: should return a single prob for the joint distribution.
instructions)) ¶automatically generated reader method
instructions)) ¶automatically generated reader method
instructions)) ¶automatically generated reader method
jt-node)) ¶automatically generated reader method
instructions)) ¶automatically generated writer method
instructions)) ¶automatically generated reader method
instructions)) ¶automatically generated writer method
instructions)) ¶automatically generated reader method
instructions)) ¶automatically generated writer method
instructions)) ¶automatically generated reader method
instructions)) ¶automatically generated writer method
potential-container)) ¶automatically generated reader method
mask.
instructions)) ¶automatically generated reader method
potential-container)) ¶automatically generated reader method
potential-container)) ¶automatically generated writer method
Randomise the object, which should represent a sequence.
integer)) ¶Create a vector of the given length using order-vector, and shuffle it.
sequence)) ¶shuffle the items in the sequence into a random order. Converts the sequence to a vector.
vector)) ¶shuffle the items in vector into a random order.
instructions)) ¶automatically generated reader method
tree.
instructions)) ¶automatically generated writer method
tree.
A trie node.
:potential
| Jump to: | %
(
*
+
A B C D E F G H I J K L M N O P Q R S T U V W X |
|---|
| Jump to: | %
(
*
+
A B C D E F G H I J K L M N O P Q R S T U V W X |
|---|
| Jump to: | *
+
A B C E F I J L M N O P S T V |
|---|
| Jump to: | *
+
A B C E F I J L M N O P S T V |
|---|
| Jump to: | B C E F I J M N P S T U |
|---|
| Jump to: | B C E F I J M N P S T U |
|---|