sl@0: /*
sl@0: ** 2001 September 22
sl@0: **
sl@0: ** The author disclaims copyright to this source code.  In place of
sl@0: ** a legal notice, here is a blessing:
sl@0: **
sl@0: **    May you do good and not evil.
sl@0: **    May you find forgiveness for yourself and forgive others.
sl@0: **    May you share freely, never taking more than you give.
sl@0: **
sl@0: *************************************************************************
sl@0: ** This is the header file for the generic hash-table implemenation
sl@0: ** used in SQLite.  We've modified it slightly to serve as a standalone
sl@0: ** hash table implementation for the full-text indexing module.
sl@0: **
sl@0: */
sl@0: #ifndef _FTS1_HASH_H_
sl@0: #define _FTS1_HASH_H_
sl@0: 
sl@0: /* Forward declarations of structures. */
sl@0: typedef struct fts1Hash fts1Hash;
sl@0: typedef struct fts1HashElem fts1HashElem;
sl@0: 
sl@0: /* A complete hash table is an instance of the following structure.
sl@0: ** The internals of this structure are intended to be opaque -- client
sl@0: ** code should not attempt to access or modify the fields of this structure
sl@0: ** directly.  Change this structure only by using the routines below.
sl@0: ** However, many of the "procedures" and "functions" for modifying and
sl@0: ** accessing this structure are really macros, so we can't really make
sl@0: ** this structure opaque.
sl@0: */
sl@0: struct fts1Hash {
sl@0:   char keyClass;          /* HASH_INT, _POINTER, _STRING, _BINARY */
sl@0:   char copyKey;           /* True if copy of key made on insert */
sl@0:   int count;              /* Number of entries in this table */
sl@0:   fts1HashElem *first;    /* The first element of the array */
sl@0:   void *(*xMalloc)(int);  /* malloc() function to use */
sl@0:   void (*xFree)(void *);  /* free() function to use */
sl@0:   int htsize;             /* Number of buckets in the hash table */
sl@0:   struct _fts1ht {        /* the hash table */
sl@0:     int count;               /* Number of entries with this hash */
sl@0:     fts1HashElem *chain;     /* Pointer to first entry with this hash */
sl@0:   } *ht;
sl@0: };
sl@0: 
sl@0: /* Each element in the hash table is an instance of the following 
sl@0: ** structure.  All elements are stored on a single doubly-linked list.
sl@0: **
sl@0: ** Again, this structure is intended to be opaque, but it can't really
sl@0: ** be opaque because it is used by macros.
sl@0: */
sl@0: struct fts1HashElem {
sl@0:   fts1HashElem *next, *prev; /* Next and previous elements in the table */
sl@0:   void *data;                /* Data associated with this element */
sl@0:   void *pKey; int nKey;      /* Key associated with this element */
sl@0: };
sl@0: 
sl@0: /*
sl@0: ** There are 2 different modes of operation for a hash table:
sl@0: **
sl@0: **   FTS1_HASH_STRING        pKey points to a string that is nKey bytes long
sl@0: **                           (including the null-terminator, if any).  Case
sl@0: **                           is respected in comparisons.
sl@0: **
sl@0: **   FTS1_HASH_BINARY        pKey points to binary data nKey bytes long. 
sl@0: **                           memcmp() is used to compare keys.
sl@0: **
sl@0: ** A copy of the key is made if the copyKey parameter to fts1HashInit is 1.  
sl@0: */
sl@0: #define FTS1_HASH_STRING    1
sl@0: #define FTS1_HASH_BINARY    2
sl@0: 
sl@0: /*
sl@0: ** Access routines.  To delete, insert a NULL pointer.
sl@0: */
sl@0: void sqlite3Fts1HashInit(fts1Hash*, int keytype, int copyKey);
sl@0: void *sqlite3Fts1HashInsert(fts1Hash*, const void *pKey, int nKey, void *pData);
sl@0: void *sqlite3Fts1HashFind(const fts1Hash*, const void *pKey, int nKey);
sl@0: void sqlite3Fts1HashClear(fts1Hash*);
sl@0: 
sl@0: /*
sl@0: ** Shorthand for the functions above
sl@0: */
sl@0: #define fts1HashInit   sqlite3Fts1HashInit
sl@0: #define fts1HashInsert sqlite3Fts1HashInsert
sl@0: #define fts1HashFind   sqlite3Fts1HashFind
sl@0: #define fts1HashClear  sqlite3Fts1HashClear
sl@0: 
sl@0: /*
sl@0: ** Macros for looping over all elements of a hash table.  The idiom is
sl@0: ** like this:
sl@0: **
sl@0: **   fts1Hash h;
sl@0: **   fts1HashElem *p;
sl@0: **   ...
sl@0: **   for(p=fts1HashFirst(&h); p; p=fts1HashNext(p)){
sl@0: **     SomeStructure *pData = fts1HashData(p);
sl@0: **     // do something with pData
sl@0: **   }
sl@0: */
sl@0: #define fts1HashFirst(H)  ((H)->first)
sl@0: #define fts1HashNext(E)   ((E)->next)
sl@0: #define fts1HashData(E)   ((E)->data)
sl@0: #define fts1HashKey(E)    ((E)->pKey)
sl@0: #define fts1HashKeysize(E) ((E)->nKey)
sl@0: 
sl@0: /*
sl@0: ** Number of entries in a hash table
sl@0: */
sl@0: #define fts1HashCount(H)  ((H)->count)
sl@0: 
sl@0: #endif /* _FTS1_HASH_H_ */