Symtree
=======

Symtree is a data structure for storing symbols for quick lookup.
It can be used to store sets and check for existence of a symbol 
within a set.

See practical_examples

Future versions of symtree will implement methods to easily
index binary data and perform set operations. 

See TODO

Symtree can be compiled for specific tasks. The default behaviour
of symtree is to act like a dictionary where all words are lowercase. 

See compile_options
See API
See error_codes

Definitions:

Symbol - a string of elements (eg. a string of characters)

Element - an atomic unit that symbols are composed of (eg. a character)

Delimiting element - an element not in the set of elements that can
	compose a symbol. (eg. the space character when using symtree
	to store a dictionary).

See symtree.sourceforge.net for a documentation and diagrams on how Symtree works and is used.