-
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_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.
-
last()
- Returns the last cons in X.
-
llenght()
- Returns the lenght 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_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_node_atcol()
- Pretty print a formula in a given file at given column
-
print_node()
- Pretty print a formula on a file
-
reverse()
- Reverse a list.
-
setcar()
- Replaces the car of X with Y, and returns the modified X
-
sprint_node_recur()
- Recursive step of sprint_node
-
sprint_node()
- Pretty print a formula in a string.
-
swap_nodes()
- Swaps two nodes.
-
util_strncat()
- Concatenate two strings.
-
walk()
- Applies FUN to successive cars of LISTs.
Last updated on 990908 16h51