node.h
External header file
nodeInt.h
Internal header file
node.c
The main routines of the node package.
nodePkg.c
Initialization and deinitialization for package node and subpackages
nodePrint.c
Pretty prints a node struct.
nodeWffPrint.c
Pretty printing of formulas represented using node struct.

node.h

External header file

By: Marco Roveri

()
Casts the given pointer to a node_ptr
()
Casts the given node_ptr to an int
()
Casts the given int to a node_ptr

nodeInt.h

Internal header file

By: Marco Roveri


node.c

The main routines of the node package.

By: Marco Roveri

This file provides an abstract data type a la s-expression in LISP.

node_init()
Initializes the node manager.
node_quit()
Quits the node manager.
free_node()
Free a node of the node manager.
new_node()
Creates a new node.
new_lined_node()
Creates a new node.
find_node()
Creates a new node.
find_atom()
Search the node hash for a given node.
cons()
Conses two nodes.
car()
Returns the left branch of a node.
cdr()
Returns the right branch of a node.
setcar()
Replaces the car of X with Y
setcdr()
Replaces the cdr of X with Y
node_set_type()
Replaces the type of the node
node_is_failure()
Returns 0 if given node is not a FAILURE node
new_list()
Returns a new empty list
copy_list()
Returns a copy of a list
free_list()
Frees all the elements of the list.
is_list_empty()
Returns 1 is the list is empty, 0 otherwise
in_list()
Checks list R to see if it contains the element N.
llength()
Returns the length of list r.
append()
Appends two lists and returns the result.
append_ns()
Appends two lists and returns the result.
reverse()
Reverse a list.
reverse_ns()
reverses the list with no side-effect Description [Returns a reversed version of the given list
last()
Returns the last cons in X.
map()
Applies FUN to successive cars of LISTs and returns the results as a list.
map2()
Applies FUN to successive cars of LISTs and returns the results as a list. Lists l1 and l2 are traversed in parallel.
odd_elements()
Extracts odd elements of list L.
even_elements()
Extracts even elements of list L.
walk()
Applies FUN to successive cars of LISTs.
node_subtract()
Deletes from list set2 the elements of list set1.
swap_nodes()
Swaps two nodes.
insert_node()
Inserts a node in the node hash.
node_normalize()
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
node_hash_fun()
Hash function for nodes.
node_eq_fun()
Equality function for node hash.
node_alloc()
Allocates NODE_MEM_CHUNK records and stores them in the free list of the node manager.

nodePkg.c

Initialization and deinitialization for package node and subpackages

By: Roberto Cavada

Initialization and deinitialization for package node and subpackages

node_pkg_init()
Initializes the node package
node_pkg_quit()
Deinitializes the packages, finalizing all internal structures
node_pkg_get_global_master_wff_printer()
Returns the global master wff printer

nodePrint.c

Pretty prints a node struct.

By: Marco Roveri

This function pretty print a node struct, in a way similar to a s-expression in LISP.

print_sexp_custom()
Main node printing function.

nodeWffPrint.c

Pretty printing of formulas represented using node struct.

By: Marco Roveri

This file conatins the code to perform pretty printing of a formula represented with a node struct.

See Alsonode.c

print_node()
Pretty print a formula on a file
sprint_node()
Pretty print a formula into a string

Last updated on 2009/01/30 14h:53