Lines Matching defs:hash
42 // Interface functions for hash table
264 /** return the current size of the hash table
271 /** Remove a numeric keyed entry from a hash table if it exists,
276 ANTLR3_UINT32 hash;
281 /* First we need to know the hash of the provided key
283 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo));
285 /* Knowing the hash, we can find the bucket
287 bucket = table->buckets + hash;
327 /** Remove the element in the hash table for a particular
333 ANTLR3_UINT32 hash;
338 /* First we need to know the hash of the provided key
340 hash = antlr3Hash(key, (ANTLR3_UINT32)strlen((const char *)key));
342 /* Knowing the hash, we can find the bucket
344 bucket = table->buckets + (hash % table->modulo);
440 /** Return the element pointer in the hash table for a particular
446 ANTLR3_UINT32 hash;
450 /* First we need to know the hash of the provided key
452 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo));
454 /* Knowing the hash, we can find the bucket
456 bucket = table->buckets + hash;
479 /** Return the element pointer in the hash table for a particular
485 ANTLR3_UINT32 hash;
490 /* First we need to know the hash of the provided key
492 hash = antlr3Hash(key, (ANTLR3_UINT32)strlen((const char *)key));
494 /* Knowing the hash, we can find the bucket
496 bucket = table->buckets + (hash % table->modulo);
520 * hash of the provided key.
525 ANTLR3_UINT32 hash;
530 /* First we need to know the hash of the provided key
532 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo));
534 /* Knowing the hash, we can find the bucket
536 bucket = table->buckets + hash;
591 * hash of the provided key.
596 ANTLR3_UINT32 hash;
601 /* First we need to know the hash of the provided key
603 hash = antlr3Hash(key, (ANTLR3_UINT32)strlen((const char *)key));
605 /* Knowing the hash, we can find the bucket
607 bucket = table->buckets + (hash % table->modulo);
667 /** \brief Creates an enumeration structure to traverse the hash table.
817 /** \brief Frees up the memory structures that represent a hash table
829 /** Given an input key of arbitrary length, return a hash value of
836 /* Accumulate the hash value of the key
838 ANTLR3_UINT32 hash;
842 hash = 0;
845 /* Iterate the key and accumulate the hash
849 hash = (hash << 4) + (*(keyPtr++));
851 if ((i1=hash&0xf0000000) != 0)
853 hash = hash ^ (i1 >> 24);
854 hash = hash ^ i1;
859 return hash;