hashavltree.h

多任务下的数据结构与算法的源码

/*
 * Copyright (c) 2000-2008
 * Author: Weiming Zhou
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  
 */

#ifndef __HASHAVLTREE_H__
#define __HASHAVLTREE_H__


#ifdef __cplusplus
extern "C" {
#endif

typedef BINTREEBASENODE AVLTREENODE;

typedef struct HASHAVLTREE_st {
    AVLTREENODE **ppBucket;	/* 索引表指针 */
    UINT 	uBucketCount;	/* 索引表的大小. */
    UINT 	uNodeCount;	/* 表中的实际节点个数. */
    
    UINT        uCurBucketNo;   /* 当前要执行的Bucket序号 */
    AVLTREENODE *pCurEntry;      /* 当前bucket中的下一个要执行的节点条目 */ 
} HASHAVLTREE;


HASHAVLTREE *HashAVLTree_Create(UINT uBucketCount);
void HashAVLTree_Destroy(HASHAVLTREE *pHashAVLTree, DESTROYFUNC DestroyFunc);


INT HashAVLTree_Insert(HASHAVLTREE *pHashAVLTree, void *pData, HASHFUNC HashFunc,
                      COMPAREFUNC CompareFunc);

INT HashAVLTree_Delete(HASHAVLTREE *pHashAVLTree, void *pData, 
                      HASHFUNC HashFunc, 
                      COMPAREFUNC CompareFunc,
                      DESTROYFUNC DestroyFunc);

void * HashAVLTree_Find(HASHAVLTREE *pHashAVLTree, void *pData, 
                       HASHFUNC HashFunc, 
                       COMPAREFUNC CompareFunc );

void HashAVLTree_EnumBegin(HASHAVLTREE *pHashAVLTree);

void *HashAVLTree_EnumNext(HASHAVLTREE *pHashAVLTree);




#ifdef __cplusplus
}
#endif

#endif /* __HASHAVLTREE_H__ */