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.
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.
insert_node()
Inserts a node in the node hash.
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.
map()
Applies FUN to successive cars of LISTs and returns the results as a list.
memberp()
Checks if node element X occurs in list.
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_eq_fun()
Equality function for node hash.
node_hash_fun()
Hash function for nodes.
node_init()
Initializes the node manager.
node_quit()
Quits the node manager.
node_subtract()
Deletes from list set2 the elements of list set1.
odd_elements()
Extracts odd elements of list L.
print_case_body()
required
print_case()
required
print_node_custom()
Customizable version of print_node
print_node_recur()
Recursive step of print_node_atcol
print_node()
Pretty print a formula on a file
print_sexp_custom()
Main node printing function.
reverse_ns()
reverses the list with no side-effect Description [Returns a reversed version of the given list
reverse()
Reverse a list.
setcar()
Replaces the car of X with Y
setcdr()
Replaces the cdr of X with Y
swap_nodes()
Swaps two nodes.
util_streamprint()
print string on stream.
util_stringprint()
append string to string.
walk()
Applies FUN to successive cars of LISTs.
()
Pretty print a formula into a string

Last updated on 2005/05/05 19h:30