2004-10-18 18:24:54 +00:00
|
|
|
/**
|
|
|
|
@file
|
|
|
|
|
2005-01-20 21:19:47 +00:00
|
|
|
A non-reentrant, experimental hashtable implementation. This hash
|
|
|
|
implementation provides the base of linearHash.h, and probably
|
|
|
|
is only of interest to LLADD's developers.
|
|
|
|
|
2004-10-18 18:24:54 +00:00
|
|
|
@ingroup OPERATIONS
|
|
|
|
|
|
|
|
$Id$
|
|
|
|
*/
|
|
|
|
|
2005-01-20 21:19:47 +00:00
|
|
|
#ifndef __NAIVE_LINEAR_HASH_H
|
|
|
|
#define __NAIVE_LINEAR_HASH_H
|
|
|
|
|
|
|
|
|
2004-10-18 18:24:54 +00:00
|
|
|
|
2008-11-03 21:42:42 +00:00
|
|
|
recordid TnaiveHashCreate(int xid, int keySize, int valSize) ;
|
2004-10-18 18:24:54 +00:00
|
|
|
|
2005-01-10 03:02:02 +00:00
|
|
|
void TnaiveHashInsert(int xid, recordid hashRid,
|
2004-10-18 18:24:54 +00:00
|
|
|
void * key, int keySize,
|
|
|
|
void * val, int valSize);
|
2005-01-10 03:02:02 +00:00
|
|
|
int TnaiveHashDelete(int xid, recordid hashRid,
|
2004-10-19 21:16:37 +00:00
|
|
|
void * key, int keySize, int valSize);
|
2005-01-10 03:02:02 +00:00
|
|
|
void TnaiveHashUpdate(int xid, recordid hashRid, void * key, int keySize, void * val, int valSize);
|
|
|
|
int TnaiveHashLookup(int xid, recordid hashRid, void * key, int keySize, void * buf, int valSize);
|
2008-11-03 21:42:42 +00:00
|
|
|
void TnaiveHashInit();
|
|
|
|
void TnaiveHashDeinit();
|
|
|
|
int TnaiveHashOpen(int xid, recordid hashRid, int keySize, int valSize);
|
|
|
|
int TnaiveHashClose(int xid, recordid hashRid) ;
|
2004-10-18 18:24:54 +00:00
|
|
|
#endif
|