1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/sqlite3api/SQLite/fts2_hash.h Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,110 @@
1.4 +/*
1.5 +** 2001 September 22
1.6 +**
1.7 +** The author disclaims copyright to this source code. In place of
1.8 +** a legal notice, here is a blessing:
1.9 +**
1.10 +** May you do good and not evil.
1.11 +** May you find forgiveness for yourself and forgive others.
1.12 +** May you share freely, never taking more than you give.
1.13 +**
1.14 +*************************************************************************
1.15 +** This is the header file for the generic hash-table implemenation
1.16 +** used in SQLite. We've modified it slightly to serve as a standalone
1.17 +** hash table implementation for the full-text indexing module.
1.18 +**
1.19 +*/
1.20 +#ifndef _FTS2_HASH_H_
1.21 +#define _FTS2_HASH_H_
1.22 +
1.23 +/* Forward declarations of structures. */
1.24 +typedef struct fts2Hash fts2Hash;
1.25 +typedef struct fts2HashElem fts2HashElem;
1.26 +
1.27 +/* A complete hash table is an instance of the following structure.
1.28 +** The internals of this structure are intended to be opaque -- client
1.29 +** code should not attempt to access or modify the fields of this structure
1.30 +** directly. Change this structure only by using the routines below.
1.31 +** However, many of the "procedures" and "functions" for modifying and
1.32 +** accessing this structure are really macros, so we can't really make
1.33 +** this structure opaque.
1.34 +*/
1.35 +struct fts2Hash {
1.36 + char keyClass; /* HASH_INT, _POINTER, _STRING, _BINARY */
1.37 + char copyKey; /* True if copy of key made on insert */
1.38 + int count; /* Number of entries in this table */
1.39 + fts2HashElem *first; /* The first element of the array */
1.40 + int htsize; /* Number of buckets in the hash table */
1.41 + struct _fts2ht { /* the hash table */
1.42 + int count; /* Number of entries with this hash */
1.43 + fts2HashElem *chain; /* Pointer to first entry with this hash */
1.44 + } *ht;
1.45 +};
1.46 +
1.47 +/* Each element in the hash table is an instance of the following
1.48 +** structure. All elements are stored on a single doubly-linked list.
1.49 +**
1.50 +** Again, this structure is intended to be opaque, but it can't really
1.51 +** be opaque because it is used by macros.
1.52 +*/
1.53 +struct fts2HashElem {
1.54 + fts2HashElem *next, *prev; /* Next and previous elements in the table */
1.55 + void *data; /* Data associated with this element */
1.56 + void *pKey; int nKey; /* Key associated with this element */
1.57 +};
1.58 +
1.59 +/*
1.60 +** There are 2 different modes of operation for a hash table:
1.61 +**
1.62 +** FTS2_HASH_STRING pKey points to a string that is nKey bytes long
1.63 +** (including the null-terminator, if any). Case
1.64 +** is respected in comparisons.
1.65 +**
1.66 +** FTS2_HASH_BINARY pKey points to binary data nKey bytes long.
1.67 +** memcmp() is used to compare keys.
1.68 +**
1.69 +** A copy of the key is made if the copyKey parameter to fts2HashInit is 1.
1.70 +*/
1.71 +#define FTS2_HASH_STRING 1
1.72 +#define FTS2_HASH_BINARY 2
1.73 +
1.74 +/*
1.75 +** Access routines. To delete, insert a NULL pointer.
1.76 +*/
1.77 +void sqlite3Fts2HashInit(fts2Hash*, int keytype, int copyKey);
1.78 +void *sqlite3Fts2HashInsert(fts2Hash*, const void *pKey, int nKey, void *pData);
1.79 +void *sqlite3Fts2HashFind(const fts2Hash*, const void *pKey, int nKey);
1.80 +void sqlite3Fts2HashClear(fts2Hash*);
1.81 +
1.82 +/*
1.83 +** Shorthand for the functions above
1.84 +*/
1.85 +#define fts2HashInit sqlite3Fts2HashInit
1.86 +#define fts2HashInsert sqlite3Fts2HashInsert
1.87 +#define fts2HashFind sqlite3Fts2HashFind
1.88 +#define fts2HashClear sqlite3Fts2HashClear
1.89 +
1.90 +/*
1.91 +** Macros for looping over all elements of a hash table. The idiom is
1.92 +** like this:
1.93 +**
1.94 +** fts2Hash h;
1.95 +** fts2HashElem *p;
1.96 +** ...
1.97 +** for(p=fts2HashFirst(&h); p; p=fts2HashNext(p)){
1.98 +** SomeStructure *pData = fts2HashData(p);
1.99 +** // do something with pData
1.100 +** }
1.101 +*/
1.102 +#define fts2HashFirst(H) ((H)->first)
1.103 +#define fts2HashNext(E) ((E)->next)
1.104 +#define fts2HashData(E) ((E)->data)
1.105 +#define fts2HashKey(E) ((E)->pKey)
1.106 +#define fts2HashKeysize(E) ((E)->nKey)
1.107 +
1.108 +/*
1.109 +** Number of entries in a hash table
1.110 +*/
1.111 +#define fts2HashCount(H) ((H)->count)
1.112 +
1.113 +#endif /* _FTS2_HASH_H_ */