Home
last modified time | relevance | path

Searched refs:hashTable (Results 1 – 25 of 1282) sorted by relevance

12345678910>>...52

/dports/devel/csoap/libsoap-1.1.0/utils/
H A Dhashtable.c63 hashtable_t *hashTable; in hashtable_create() local
69 if (hashTable == NULL) in hashtable_create()
75 free(hashTable); in hashtable_create()
85 hashTable->idealRatio = 3.0; in hashtable_create()
95 return hashTable; in hashtable_create()
129 free(hashTable); in hashtable_destroy()
216 hashValue = hashTable->hashFunction(key) % hashTable->numOfBuckets; in hashtable_put()
246 if (hashTable->upperRehashThreshold > hashTable->idealRatio) { in hashtable_put()
276 long hashValue = hashTable->hashFunction(key) % hashTable->numOfBuckets; in hashtable_get()
302 long hashValue = hashTable->hashFunction(key) % hashTable->numOfBuckets; in hashtable_remove()
[all …]
H A Dhashtable.h90 void hashtable_destroy(hashtable_t *hashTable);
172 void *hashtable_get(const hashtable_t *hashTable, const void *key);
190 void hashtable_remove(hashtable_t *hashTable, const void *key);
206 void hashtable_remove_all(hashtable_t *hashTable);
223 int hashtable_is_empty(const hashtable_t *hashTable);
240 long hashtable_size(const hashtable_t *hashTable);
258 long hashtable_get_num_buckets(const hashtable_t *hashTable);
279 void hashtable_set_key_comparision_function(hashtable_t *hashTable,
325 void hashtable_set_hashfunction(hashtable_t *hashTable,
354 void hashtable_rehash(hashtable_t *hashTable, long numOfBuckets);
[all …]
/dports/biology/subread/subread-2.0.2-source/src/longread-one/
H A DLRMhashtable.c92 HashTable *hashTable; in LRMHashTableCreate() local
99 if (hashTable == NULL) in LRMHashTableCreate()
106 hashTable->counter1=0; in LRMHashTableCreate()
107 hashTable->counter2=0; in LRMHashTableCreate()
108 hashTable->counter3=0; in LRMHashTableCreate()
113 free(hashTable); in LRMHashTableCreate()
133 return hashTable; in LRMHashTableCreate()
170 free(hashTable); in LRMHashTableDestroy()
259 hashValue = hashTable->hashFunction(key) % hashTable->numOfBuckets; in LRMHashTablePutReplace()
293 if (hashTable->upperRehashThreshold > hashTable->idealRatio) { in LRMHashTablePutReplace()
[all …]
H A DLRMhashtable.h102 void LRMHashTableDestroy(HashTable *hashTable);
185 void * LRMHashTableGet(const HashTable *hashTable, const void *key);
203 void LRMHashTableRemove(HashTable *hashTable, const void *key);
219 void LRMHashTableRemoveAll(HashTable *hashTable);
236 int LRMHashTableIsEmpty(const HashTable *hashTable);
253 srInt_64 LRMHashTableSize(const HashTable *hashTable);
271 srInt_64 LRMHashTableGetNumBuckets(const HashTable *hashTable);
292 void LRMHashTableSetKeyComparisonFunction(HashTable *hashTable,
314 void LRMHashTableSetValueComparisonFunction(HashTable *hashTable,
338 void LRMHashTableSetHashFunction(HashTable *hashTable,
[all …]
/dports/games/uqm/uqm-0.8.0/src/libs/uio/
H A Dhashtable.c86 entry = hashTable->entries[hash & hashTable->hashMask]; in HASHTABLE_()
99 hashTable->entries[hash & hashTable->hashMask] = in HASHTABLE_()
102 hashTable->entries[hash & hashTable->hashMask]); in HASHTABLE_()
105 if (hashTable->numEntries > hashTable->maxSize) in HASHTABLE_()
136 if (hashTable->numEntries < hashTable->minSize) in HASHTABLE_()
150 entry = hashTable->entries[hash & hashTable->hashMask]; in HASHTABLE_()
174 hashTable->hashMask = hashTable->size - 1; in HASHTABLE_()
177 hashTable->maxSize = floor(((double) hashTable->size) in HASHTABLE_()
179 hashTable->entries = uio_calloc(hashTable->size, in HASHTABLE_()
199 HASHTABLE_(setup)(hashTable, hashTable->numEntries); in HASHTABLE_()
[all …]
/dports/devel/poco/poco-1.10.1-all/Foundation/testsuite/src/
H A DHashTableTest.cpp37 hashTable.insert(s1, 13); in testInsert()
46 hashTable.insert(s1, 22); in testInsert()
52 hashTable.get(s2); in testInsert()
58 hashTable.insert(s2, 13); in testInsert()
69 hashTable.insert(s1, 13); in testUpdate()
109 hashTable.remove("1"); in testSize()
111 hashTable.remove("3"); in testSize()
118 hashTable.clear(); in testSize()
127 hashTable.resize(19); in testResize()
132 hashTable.resize(1009); in testResize()
[all …]
H A DSimpleHashTableTest.cpp37 hashTable.insert(s1, 13); in testInsert()
38 assertTrue (hashTable.exists(s1)); in testInsert()
46 hashTable.insert(s1, 22); in testInsert()
52 hashTable.get(s2); in testInsert()
58 hashTable.insert(s2, 13); in testInsert()
69 hashTable.insert(s1, 13); in testUpdate()
70 hashTable.update(s1, 14); in testUpdate()
79 hashTable.update(s2, 15); in testUpdate()
109 hashTable.clear(); in testSize()
118 hashTable.resize(2467); in testResize()
[all …]
/dports/biology/subread/subread-2.0.2-source/src/
H A Dhashtable.c288 HashTable *hashTable; in HashTableCreate() local
295 if (hashTable == NULL) in HashTableCreate()
302 hashTable->counter1=0; in HashTableCreate()
303 hashTable->counter2=0; in HashTableCreate()
304 hashTable->counter3=0; in HashTableCreate()
309 free(hashTable); in HashTableCreate()
329 return hashTable; in HashTableCreate()
366 free(hashTable); in HashTableDestroy()
456 hashValue = hashTable->hashFunction(key) % hashTable->numOfBuckets; in HashTablePutReplaceEx()
490 if (hashTable->upperRehashThreshold > hashTable->idealRatio) { in HashTablePutReplaceEx()
[all …]
/dports/emulators/qemu-utils/qemu-4.2.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu5/qemu-5.2.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu-powernv/qemu-powernv-3.0.50/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu42/qemu-4.2.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu/qemu-6.2.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/emulators/qemu60/qemu-6.0.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/
H A DIxEthDBHashtable.c70 void ixEthDBInitHash(HashTable *hashTable, in ixEthDBInitHash() argument
80 hashTable->entryHashFunction = entryHashFunction; in ixEthDBInitHash()
81 hashTable->matchFunctions = matchFunctions; in ixEthDBInitHash()
82 hashTable->freeFunction = freeFunction; in ixEthDBInitHash()
85 hashTable->numBuckets = numBuckets; in ixEthDBInitHash()
88 memset(hashTable->hashBuckets, 0, hashSize); in ixEthDBInitHash()
152 hashTable->hashBuckets[bucketIndex] = newNode; in ixEthDBAddHashEntry()
221 hashTable->freeFunction(node->data); in ixEthDBRemoveHashEntry()
280 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBSearchHashEntry()
330 node = hashTable->hashBuckets[hashValue % hashTable->numBuckets]; in ixEthDBPeekHashEntry()
[all …]
/dports/audio/csound/csound-6.15.0/tests/c/
H A Dcsound_data_structures_test.c83 cs_hash_table_put(csound, hashTable, "a", "1"); in test_cs_hash_table()
84 cs_hash_table_put(csound, hashTable, "b", "2"); in test_cs_hash_table()
85 cs_hash_table_put(csound, hashTable, "c", "3"); in test_cs_hash_table()
91 cs_hash_table_remove(csound, hashTable, "c"); in test_cs_hash_table()
97 cs_hash_table_put(csound, hashTable, testValue, NULL); in test_cs_hash_table()
111 cs_hash_table_put(csound, hashTable, "a", "1"); in test_cs_hash_table_merge()
112 cs_hash_table_put(csound, hashTable, "b", "2"); in test_cs_hash_table_merge()
113 cs_hash_table_put(csound, hashTable, "c", "3"); in test_cs_hash_table_merge()
123 cs_hash_table_merge(csound, hashTable, hashTable2); in test_cs_hash_table_merge()
138 a = cs_hash_table_put_key(csound, hashTable, "test"); in test_cs_hash_table_get_put_key()
[all …]
/dports/graphics/opendx/dx-4.4.4/src/exec/libdx/
H A Dhash.c98 struct hashTable struct
173 HashTable hashTable; in DXCreateHash() local
175 hashTable = ( HashTable ) DXAllocate( sizeof( struct hashTable ) ); in DXCreateHash()
177 if ( ! hashTable ) in DXCreateHash()
189 hashTable->cmp = cmp; in DXCreateHash()
196 hashTable->directoryMask = maskBits[ hashTable->directory.depth ]; in DXCreateHash()
197 hashTable->directoryLength = powers_of_2[ hashTable->directory.depth ]; in DXCreateHash()
213 return hashTable; in DXCreateHash()
220 if ( ! hashTable ) in DXDestroyHash()
228 hashTable->nInserts, hashTable->nCollisions ); in DXDestroyHash()
[all …]
/dports/audio/csound/csound-6.15.0/Engine/
H A Dcsound_data_structures.c29 CS_HASH_TABLE* hashTable,
158 index = cs_name_hash(hashTable, key); in cs_hash_table_get()
159 item = hashTable->buckets[index]; in cs_hash_table_get()
181 item = hashTable->buckets[index]; in cs_hash_table_get_key()
227 item = hashTable->buckets[index]; in cs_hash_table_put_no_key_copy()
228 hashTable->count++; in cs_hash_table_put_no_key_copy()
267 item = hashTable->buckets[index]; in cs_hash_table_remove()
277 hashTable->count--; in cs_hash_table_remove()
355 csound->Free(csound, hashTable); in cs_hash_table_free()
373 csound->Free(csound, hashTable); in cs_hash_table_mfree_complete()
[all …]
/dports/games/scummvm/scummvm-2.5.1/engines/icb/common/
H A Dpx_clu_api.cpp57 output[0] = hashTable[(hash >> 27) & 0x1F]; in EngineHashFile()
58 output[1] = hashTable[(hash >> 22) & 0x1F]; in EngineHashFile()
59 output[2] = hashTable[(hash >> 17) & 0x1F]; in EngineHashFile()
60 output[3] = hashTable[(hash >> 12) & 0x1F]; in EngineHashFile()
61 output[4] = hashTable[(hash >> 7) & 0x1F]; in EngineHashFile()
62 output[5] = hashTable[(hash >> 2) & 0x1F]; in EngineHashFile()
63 output[6] = hashTable[hash & 0x3]; in EngineHashFile()
72 output[0] = hashTable[(hash >> 27) & 0x1F]; in EngineHashToFile()
76 output[4] = hashTable[(hash >> 7) & 0x1F]; in EngineHashToFile()
77 output[5] = hashTable[(hash >> 2) & 0x1F]; in EngineHashToFile()
[all …]
/dports/graphics/povray38/povunix-v3.8.0-beta.2-src/source/core/math/
H A Djitter.h53 extern unsigned short *hashTable; // GLOBAL VARIABLE
55 extern ALIGN16 unsigned short hashTable[]; // GLOBAL VARIABLE
62 return JitterTable[int(hashTable[int(hashTable[int(x & 0xfff)] ^ y) & 0xfff]) & 0xff]; in Jitter2d()
67 …jx = JitterTable[int(hashTable[int(hashTable[int((x + 1021) & 0xfff)] ^ (y + 1019)) & 0xfff]) & 0x… in Jitter2d()
68 …jy = JitterTable[int(hashTable[int(hashTable[int((x + 1019) & 0xfff)] ^ (y + 1021)) & 0xfff]) & 0x… in Jitter2d()
73 …return JitterTable[int(hashTable[int(hashTable[(int(x * 1021.0) & 0xfff)] ^ int(y * 1021.0)) & 0xf… in Jitter2d()
78 …jx = JitterTable[int(hashTable[int(hashTable[(int(x * 1021.0) & 0xfff)] ^ int(y * 1019.0)) & 0xfff… in Jitter2d()
79 …jy = JitterTable[int(hashTable[int(hashTable[(int(x * 1019.0) & 0xfff)] ^ int(y * 1021.0)) & 0xfff… in Jitter2d()
/dports/graphics/povray37/povray-3.7.0.10/source/backend/support/
H A Djitter.h41 extern unsigned short *hashTable; // GLOBAL VARIABLE
43 extern ALIGN16 unsigned short hashTable[]; // GLOBAL VARIABLE
50 return JitterTable[int(hashTable[int(hashTable[int(x & 0xfff)] ^ y) & 0xfff]) & 0xff]; in Jitter2d()
55 …jx = JitterTable[int(hashTable[int(hashTable[int((x + 1021) & 0xfff)] ^ (y + 1019)) & 0xfff]) & 0x… in Jitter2d()
56 …jy = JitterTable[int(hashTable[int(hashTable[int((x + 1019) & 0xfff)] ^ (y + 1021)) & 0xfff]) & 0x… in Jitter2d()
61 …return JitterTable[int(hashTable[int(hashTable[(int(x * 1021.0) & 0xfff)] ^ int(y * 1021.0)) & 0xf… in Jitter2d()
66 …jx = JitterTable[int(hashTable[int(hashTable[(int(x * 1021.0) & 0xfff)] ^ int(y * 1019.0)) & 0xfff… in Jitter2d()
67 …jy = JitterTable[int(hashTable[int(hashTable[(int(x * 1019.0) & 0xfff)] ^ int(y * 1021.0)) & 0xfff… in Jitter2d()
/dports/x11-fonts/libXfont2/libXfont2-2.0.5/src/stubs/
H A Datom.c47 static AtomListPtr *hashTable; variable
95 if (hashTable[i]) { in ResizeHashTable()
108 free(hashTable); in ResizeHashTable()
109 hashTable = newHashTable; in ResizeHashTable()
156 if (hashTable) { in __libxfont_internal__MakeAtom()
158 if (hashTable[h]) { in __libxfont_internal__MakeAtom()
159 if (hashTable[h]->hash == hash && hashTable[h]->len == len && in __libxfont_internal__MakeAtom()
168 if (!hashTable[h]) in __libxfont_internal__MakeAtom()
170 if (hashTable[h]->hash == hash && hashTable[h]->len == len && in __libxfont_internal__MakeAtom()
196 if (hashTable[h]) { in __libxfont_internal__MakeAtom()
[all …]
/dports/lang/maude/maude-2.7.1/src/Utility/
H A DintSet.cc48 int j = hashTable[i]; in insert()
57 hashTable[i] = j; in insert()
87 int j = hashTable[i]; in subtract()
125 hashTable.contractTo(0); in intersect()
178 int j = hashTable[i]; in findEntry()
185 j = hashTable[i]; in findEntry()
195 int n = hashTable.length(); in resize()
199 hashTable.expandTo(n); in resize()
206 int n = hashTable.length(); in rehash()
208 hashTable[i] = UNUSED; in rehash()
[all …]
/dports/net/tightvnc/vnc_unixsrc/Xvnc/lib/font/util/
H A Datom.c92 if (hashTable[i]) in ResizeHashTable()
107 xfree (hashTable); in ResizeHashTable()
108 hashTable = newHashTable; in ResizeHashTable()
149 if (hashTable)
152 if (hashTable[h])
154 if (hashTable[h]->hash == hash && hashTable[h]->len == len &&
165 if (!hashTable[h])
167 if (hashTable[h]->hash == hash && hashTable[h]->len == len &&
188 if (hashTable[h])
195 } while (hashTable[h]);
[all …]
/dports/x11-fonts/bdftopcf/bdftopcf-1.1/
H A Datom.c95 if (hashTable[i]) in ResizeHashTable()
110 free (hashTable); in ResizeHashTable()
111 hashTable = newHashTable; in ResizeHashTable()
164 if (hashTable) in MakeAtom()
167 if (hashTable[h]) in MakeAtom()
169 if (hashTable[h]->hash == hash && hashTable[h]->len == len && in MakeAtom()
172 return hashTable[h]->atom; in MakeAtom()
180 if (!hashTable[h]) in MakeAtom()
182 if (hashTable[h]->hash == hash && hashTable[h]->len == len && in MakeAtom()
208 if (hashTable[h]) in MakeAtom()
[all …]

12345678910>>...52