Lines Matching full:nkey
86 static int intHash(const void *pKey, int nKey){
87 return nKey ^ (nKey<<8) ^ (nKey>>8);
98 static int ptrHash(const void *pKey, int nKey){
112 static int strHash(const void *pKey, int nKey){
115 if( nKey<=0 ) nKey = (int) strlen(z);
116 while( nKey > 0 ){
118 nKey--;
130 static int binHash(const void *pKey, int nKey){
133 while( nKey-- > 0 ){
244 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
257 int nKey,
270 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
317 ** that matches pKey,nKey. Return the data for this element if it is
320 void *HashFind(const Hash *pH, const void *pKey, int nKey){
328 h = (*xHash)(pKey,nKey);
330 elem = findElementGivenHash(pH,pKey,nKey, h & (pH->htsize-1));
334 /* Insert an element into the hash table pH. The key is pKey,nKey
349 void *HashInsert(Hash *pH, const void *pKey, int nKey, void *data){
359 hraw = (*xHash)(pKey, nKey);
362 elem = findElementGivenHash(pH,pKey,nKey,h);
376 new_elem->pKey = pH->xMalloc( nKey );
381 memcpy((void*)new_elem->pKey, pKey, nKey);
385 new_elem->nKey = nKey;
