Lines Matching full:value
25 * hashcode. This increment is added to the initial hash value to
29 * the array be prime, and the increment be any value from
128 * Constants for hinting whether a key or value is an integer
142 UHashTok key, UHashTok value, int8_t hint) {
144 UHashTok oldValue = e->value;
151 oldValue.pointer != value.pointer) { /* Avoid double deletion */
168 e->value.pointer = value.pointer;
170 e->value = value;
235 p->value = emptytok;
315 * "jump" value (moduloing by the length again to keep it within
326 * otherwise we are not guaranteed that the jump value (the secondary
349 /* We have hit a slot which contains a key-value pair,
359 /* The jump value must be relatively prime to the table
360 * length. As long as the length is prime, then any value
425 e->value = old[i].value;
462 UHashTok value,
466 /* Put finds the position in the table for the new value. If the
468 * non-NULL keyDeleter. Then the key, the hash and the value are
480 if ((hint & HINT_VALUE_POINTER) && value.pointer == NULL) {
518 return _uhash_setElement(hash, e, hashcode & 0x7FFFFFFF, key, value, hint);
522 * value arguments, and we must be sure to delete the key and/or
523 * value in all cases, even upon failure.
525 HASH_DELETE_KEY_VALUE(hash, key.pointer, value.pointer);
580 HASH_DELETE_KEY_VALUE(hash, e->key.pointer, e->value.pointer);
644 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.pointer;
652 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.pointer;
660 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.integer;
668 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.integer;
674 void* value,
678 valueholder.pointer = value;
687 void* value,
691 valueholder.pointer = value;
700 int32_t value,
704 valueholder.integer = value;
714 int32_t value,
718 valueholder.integer = value;
837 multiply the previous hash value by a prime number and add the new
839 producing a pseudorandom deterministic value well distributed over
917 const UHashTok val1 = elem1->value;
919 * value from hash2. If the hashes are equal then then both hashes should
923 const UHashTok val2 = elem2->value;
