debugDDe (1158408), страница 2

typedef struct tag_TABLE

{

byte

IsInit;

s_COLLECTION

cTable;

size_t

TableSize;

size_t

CurSize;

size_t

ElemSize;

PFN_TABLE_ELEMDESTRUCTOR

Destruct;

}

TABLE;

IsInit

–

flag of the table initialization. It is used for postponed initialization improve performance.

cTable

–

a set of pointers to allocated memory blocks

TableSize

–

number of elements to allocate when the table is expanded

CurSize

–

number of used elements in the current table block

ElemSize

–

size in bytes of one element

Destruct

–

pointer to the function with prototype

void (*PFN_TABLE_ELEMDESTRUCTOR)(void *Elem).

This function is called for each table element when it is removed from the table.

void table_Init(TABLE *tb, size_t TableSize, size_t ElemSize, PFN_TABLE_ELEMDESTRUCTOR Destruct)

tb

–

pointer to the TABLE structure to be initialized.

TableSize

–

number of the elements to allocate when expanding the table

ElemSize

–

size in bytes of one table element

Destuct

–

pointer to table element destructor function. It can be NULL.

void table_Done( TABLE *tb )

tb

–

pointer to the TABLE structure.

long table_Count( TABLE *tb )

tb

–

pointer to the TABLE structure.

void *table_At( TABLE *tb, long No )

tb

–

pointer to the TABLE structure.

No

–

zero based element number. The program will aborted if the No does not fall to number of elements range

long table_Put( TABLE *tb, void *Struct )

tb

–

pointer to the TABLE structure.

Struct

–

pointer to the inserted element. Only ElemSize bytes will be copied into the table

void *table_GetNew( TABLE *tb )

tb

–

pointer to the TABLE structure.

void table_RemoveFrom( TABLE *tb, long Index )

tb

–

pointer to the TABLE structure.

Index

–

element number from which elements will be removed.

void table_RemoveAll( TABLE *tb )

tb

–

pointer to the TABLE structure.

void table_Iterator(TABLE *tb, PFN_TABLEITERATION Proc, void *Param1, void *Param2)

tb

–

pointer to the TABLE structure.

Proc

–

iteration function with the following prototype:

void (*PFN_TABLEITERATION)( void *Elem, void *Param1, void *Param2 ).

This function will be called for each element of the table

Param1

–

the parameter passed as Param1 into the Proc function

Param2

–

the parameter passed as Param2 into the Proc function

typedef size_t HASH_VALUE

typedef unsigned long STORE_VALUE

typedef struct tag_HashList

{

long

NextElem;

STORE_VALUE

Value;

long

Assign;

}

HashList;

NextElem

–

the number of the next chain element. It is equal to zero for the last chain element.

Value

–

the element key. This key is used to access to the element

Assign

–

the stored value

typedef struct tag_HASH_TABLE

{

TABLE

hTable;

long *

pIndex;

size_t

IndexSize;

PFN_CALC_HASH_FUNC

HashFunc;

unsigned long *

pElements;

unsigned long

statCompare, statPut, statFind;

}

HASH_TABLE;

hTable

–

the hash-array of hash-table elements. The hash-array is organized as a table structure.

pIndex

–

the hash-index, an array containing starting indexes of the chains. The hash-value gives an index in the hash-index.

IndexSize

–

size of the pIndex array.

HashFunc

–

pointer to the function that calculates a hash-value by a key.

pElements

–

array that keeps chain sizes of corresponding pIndex elements. It is used to store statistics of using hash-table elements.

statCompare, statPut, statFind

–

statistics fields. These fields contain count of ‘compare’, ‘put’ and ‘find’ actions performed with the hash-table.

void hash_Init(HASH_TABLE *HT, size_t IndexSize, int TableSize, PFN_CALC_HASH_FUNC Func)

HT

–

pointer to HASH_TABLE structure to be initialized.

IndexSize

–

the size of the hash-index

TableSize

–

hash-array increment value for hash-array expansion.

Func

–

pointer to the function that calculates hash-value. If Func is, equal to NULL then the standard function StandartHashCalc will be applied. The function StandartHashCalc calculates hash-value using the following formula: <hash-value> = <key> % IndexSize.

void hash_Done( HASH_TABLE *HT )

HT

–

pointer to the HASH_TABLE structure.

long hash_Find( HASH_TABLE *HT, STORE_VALUE Val )

HT

–

pointer to the HASH_TABLE structure.

Val

–

the key of the element.

void hash_Insert( HASH_TABLE *HT, STORE_VALUE Val, long Assign )

HT

–

pointer to the HASH_TABLE structure.

Val

–

the key of inserted element.

Assign

–

the value associated with the key.

void hash_Change( HASH_TABLE *HT, STORE_VALUE Val, long Assign )

HT

–

pointer to the HASH_TABLE structure.

Val

–

the key of changed element.

Assign

–

the value associated with the key.

void hash_Remove( HASH_TABLE *HT, STORE_VALUE Val )

HT

–

pointer to the HASH_TABLE structure.

Val

–

the key of removed element.

void hash_Iterator(HASH_TABLE *HT, PFN_HASHITERATION Proc, void *Param)

HT

–

pointer to the HASH_TABLE structure.

Proc

–

iteration function with the following prototype:

void (*PFN_HASHITERATION)(long Elem, void *Param)

where Elem is associated value of a hash-table element and Param is additional parameter. This function will be called for each hash-table element.

Param

–

parameter passed as Param into the Proc function

void hash_RemoveAll( HASH_TABLE *HT )

HT

–

pointer to the HASH_TABLE structure.