| /xsrc/external/mit/xkeyboard-config/dist/tests/ruby/ |
| utils.rb | 8 # The hash containing non-unique mappings
12 class NonuniqueCountingHash < Hash
19 hash = get_original(key)
20 if hash.nil?
21 put_original(key, hash = Hash.new)
23 if hash.has_key?(value)
24 hash[value] += 1
26 hash[value] = 1
34 values.inject(0) do | rv, hash |
[all...] |
| xkbparser.rb | 11 class Symbols < Hash
86 # Create a hash including all elements of this hash which are not in the
87 # other hash, use symbols + and * for marking the elements which existed in
88 # the original hash (+ if not existed)
117 class SymbolsList < Hash
138 matching = Hash.new
|
| /xsrc/external/mit/libX11/dist/src/ |
| Context.c | 74 #define INITHASHMASK 63 /* Number of entries originally in the hash table. */
83 typedef struct _XContextDB { /* Stores hash table for one display. */
84 TableEntry *table; /* Pointer to array of hash entries. */
85 int mask; /* Current size of hash table minus 1. */
100 #define Hash(db,rid,context) \
124 head = &Hash(db, entry->rid, entry->context);
206 head = &Hash(db, rid, context);
253 for (entry = Hash(db, rid, context); entry; entry = entry->next)
288 for (prev = &Hash(db, rid, context);
|
| /xsrc/external/mit/libXfont/dist/src/util/ |
| patcache.c | 38 * Static sized hash table for looking up font name patterns
54 int hash; member in struct:_FontPatternCacheEntry
116 Hash (const char *string, int len)
118 int hash; local
120 hash = 0;
122 hash = (hash << 1) ^ *string++;
123 if (hash < 0)
124 hash = -hash;
180 int hash; local
[all...] |
| atom.c | 42 int hash; member in struct:_AtomList
57 Hash(const char *string, int len)
97 h = (hashTable[i]->hash) & newHashMask;
100 r = hashTable[i]->hash % newRehash | 1;
157 int hash; local
163 hash = Hash (string, len);
166 h = hash & hashMask;
169 if (hashTable[h]->hash == hash && hashTable[h]->len == len &
[all...] |
| /xsrc/external/mit/libXfont2/dist/src/util/ |
| patcache.c | 39 * Static sized hash table for looking up font name patterns
55 int hash; member in struct:_FontPatternCacheEntry
117 Hash (const char *string, int len)
119 int hash; local
121 hash = 0;
123 hash = (hash << 1) ^ *string++;
124 if (hash < 0)
125 hash = -hash;
181 int hash; local
[all...] |
| /xsrc/external/mit/bdftopcf/dist/ |
| atom.c | 41 int hash; member in struct:_AtomList
56 Hash(const char *string, unsigned len)
89 unsigned h = (hashTable[i]->hash) & newHashMask;
91 unsigned r = hashTable[i]->hash % newRehash | 1;
144 unsigned hash; local
148 hash = Hash(string, len);
150 h = hash & hashMask;
152 if (hashTable[h]->hash == hash && hashTable[h]->len == len &
[all...] |
| /xsrc/external/mit/libXfont2/dist/src/stubs/ |
| atom.c | 43 int hash; member in struct:_AtomList
58 Hash(const char *string, unsigned len)
94 h = (hashTable[i]->hash) & newHashMask;
96 r = hashTable[i]->hash % newRehash | 1;
149 unsigned hash; local
153 hash = Hash(string, len);
155 h = hash & hashMask;
157 if (hashTable[h]->hash == hash && hashTable[h]->len == len &
[all...] |
| /xsrc/external/mit/brotli/dist/c/enc/ |
| static_dict.c | 19 static BROTLI_INLINE uint32_t Hash(const uint8_t* data) {
82 size_t offset = dictionary->buckets[Hash(data)];
327 size_t offset = dictionary->buckets[Hash(&data[1])];
422 size_t offset = dictionary->buckets[Hash(&data[2])];
451 size_t offset = dictionary->buckets[Hash(&data[5])];
|
| compress_fragment.c | 43 static BROTLI_INLINE uint32_t Hash(const uint8_t* p, size_t shift) {
504 for (next_hash = Hash(++ip, shift); ; ) {
527 uint32_t hash = next_hash; local
529 BROTLI_DCHECK(hash == Hash(next_ip, shift));
535 next_hash = Hash(next_ip, shift);
539 table[hash] = (int)(ip - base_ip);
543 candidate = base_ip + table[hash];
547 table[hash] = (int)(ip - base_ip);
656 next_hash = Hash(++ip, shift)
[all...] |
| compress_fragment_two_pass.c | 42 static BROTLI_INLINE uint32_t Hash(const uint8_t* p,
265 for (next_hash = Hash(++ip, shift, min_match); ; ) {
289 uint32_t hash = next_hash; local
292 BROTLI_DCHECK(hash == Hash(ip, shift, min_match));
297 next_hash = Hash(next_ip, shift, min_match);
301 table[hash] = (int)(ip - base_ip);
305 candidate = base_ip + table[hash];
309 table[hash] = (int)(ip - base_ip);
440 next_hash = Hash(++ip, shift, min_match)
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/dix/ |
| resource.c | 110 * (varying with the size of the hash table).
333 Hash(int client, XID id)
367 res = clientTable[client].resources[Hash(client, id)];
499 head = &rrec->resources[Hash(client, id)];
554 tptr = &tails[Hash(client, res->id)];
576 head = &clientTable[cid].resources[Hash(cid, id)];
616 head = &clientTable[cid].resources[Hash(cid, id)];
657 res = clientTable[cid].resources[Hash(cid, id)];
913 res = clientTable[cid].resources[Hash(cid, id)];
946 res = clientTable[cid].resources[Hash(cid, id)]
[all...] |
