indexed.h

public : indexed::~indexed() destructor - will deallocate any existing entry

public : void indexed::dealociiis(iii * f) deallocates a tree and it's leafes iii * f : tree structure pointer

public : void indexed::deleteIndexedElement(char * s) deletes a single entry and any empty parent trees, case insensitve [converts the string to upper case] char * s : null terminated string to delete from index;

public : void indexed::deleteIndexedElement(char * s, int slen) deletes a single entry and any empty parent tres [case sesitive] char * s : any byte array int slen : array length

public : void indexed::deleteIndexedElementCaseSens(char * s) deletes a single entry and any empty parent trees, case sesitive char * s : null terminated string to delete from index;

public : void indexed::deleteIndexedElementCaseSens(unsigned char * s, int slen) deletes a single entry and any empty parent trees, case sensitve char * s : any byte array int slen : array length

public : int indexed::getIndexedElement(char * s) retreaves a cached entry, case insesitive char *s : null termintated string

public : int indexed::getIndexedElement(char * s, int slen) retreaves a cached entry, case insensitive char *s : any char array int slen : array length

public : iii * indexed::getIndexedElementByPtr(char * s) retreaves the pointer to the cached entry; case insesitive char *s : null terminated string

public : iii * indexed::getIndexedElementByPtr(char * s, int slen) retreaves the pointer to the cached entry; case insensitive; user specified length char *s : char array int slen : array length

public : iii * indexed::getIndexedElementByPtrCaseSens(char * s) retreavs the pointer to the cached entry, case insensitive char *s : null-termintated string

public : iii * indexed::getIndexedElementByPtrCaseSens(unsigned char * s, int slen)

public : int indexed::getIndexedElementCaseSens(char * s)

public : int indexed::getIndexedElementCaseSens(unsigned char * s, int slen)

public : indexed::indexed() constructor - inits the root entry

public : indexed::indexed(int d) constructor - inits the root entry, with a specific segmentation depth int d : segmentation depth

public : indexed::indexed(int d, char s) constructor - inits the root entry, with a specific segmentation depth and starting index int d : segmentation depth char s : starting index - will cause all char's to be substracted by s

public : void indexed::printf_iis(iii * sarmisegetusa, char * tilnow, int index)

public : void indexed::setIndexedElement(char * s, int value)

public : void indexed::setIndexedElement(char * s, int value, int slen)

public : void indexed::setIndexedElementCaseSens(char * s, int value)

public : void indexed::setIndexedElementCaseSens(unsigned char * s, int value, int slen)

public : int indexed::setIndexedElementCaseSensIfNotAllready(char * s, int value)

public : int indexed::setIndexedElementCaseSensIfNotAllready(unsigned char * s, int value, int slen)

public : int indexed::setIndexedElementIfNotAllready(char * s, int value)

public : int indexed::setIndexedElementIfNotAllready(char * s, int value, int slen)

public : int indexed::depth_segmentation segmentation depth - number of leafes which a tree has [up to 256]

public : iii * indexed::f root entry

public : char indexed::starting_char s