_node_realloc_nodelist()
Reallocation of the hash
append_ns()
Appends two lists and returns the result.
append()
Appends two lists and returns the result.
car()
Returns the left branch of a node.
cdr()
Returns the right branch of a node.
cons()
Conses two nodes.
copy_list()
Returns a copy of a list
even_elements()
Extracts even elements of list L.
find_atom()
Search the node hash for a given node.
find_node()
Creates a new node.
free_list()
Frees all the elements of the list.
free_node()
Free a node of the node manager.
in_list()
Checks list R to see if it contains the element N.
is_list_empty()
Returns 1 is the list is empty, 0 otherwise
last()
Returns the last cons in X.
llength()
Returns the length of list r.
map2()
Applies FUN to successive cars of LISTs and returns the results as a list. Lists l1 and l2 are traversed in parallel.
map()
Applies FUN to successive cars of LISTs and returns the results as a list.
new_lined_node()
Creates a new node.
new_list()
Returns a new empty list
new_node()
Creates a new node.
node_alloc()
Allocates NODE_MEM_CHUNK records and stores them in the free list of the node manager.
node_cmp_fun()
Comparison function for node sorted insertion. Returns is < 0 if node1 < node2, 0 if node1 == node2, and > 0 if node1 > node2
node_eq_fun()
Equality function for node hash.
node_hash_fun()
Hash function for nodes.
node_init()
Initializes the node manager.
node_is_failure()
Returns 0 if given node is not a FAILURE node
node_is_leaf()
Tells if the given node is a numeric/boolean leaf
node_normalize_list()
Does the same thing as node_normalize but do it more efficiently if sexp is a list
node_pkg_get_global_master_normalizer()
Returns the global master normalizer
node_pkg_get_global_master_sexp_printer()
Returns the global master wff printer
node_pkg_get_global_master_wff_printer()
Returns the global master wff printer
node_pkg_get_indenting_master_wff_printer()
Returns the indenting master wff printer
node_pkg_init()
Initializes the node package
node_pkg_quit()
Deinitializes the packages, finalizing all internal structures
node_quit()
De-initializes the node manager.
node_set_type()
Replaces the type of the node
node_subtract()
Deletes from list set2 the elements of list set1.
odd_elements()
Extracts odd elements of list L.
print_array_type_rec()
Private function of print_array_type
print_array_type()
Print an ARRAY_TYPE structure in smv
print_node_indent_at()
Pretty print a formula on a file (indenting)
print_node_indent()
Pretty print a formula on a file (indenting)
print_node()
Pretty print a formula on a file
reverse_ns()
reverses the list with no side-effect
reverse()
Reverse a list.
setcar()
Replaces the car of X with Y
setcdr()
Replaces the cdr of X with Y
sprint_node_indent_at()
Pretty print a formula into a string (indenting)
sprint_node_indent()
Pretty print a formula into a string (indenting)
sprint_node()
Pretty print a formula into a string
swap_nodes()
Swaps two nodes.
walk()
Applies FUN to successive cars of LISTs.
()
Casts the given int to a node_ptr
()
Casts the given node_ptr to an int
()
Casts the given pointer to a node_ptr
()
Comparison function used for profiling
()
Inserts a node in the node hash.
()
Quits the node manager.
()
Traverses the tree, and returns a possibly new tree that is a normalized copy of the first. Use for constant-time comparison of two trees

Last updated on 2012/11/18 14h:16