Home
last modified time | relevance | path

Searched refs:hashNext (Results 1 – 25 of 122) sorted by relevance

12345

/dports/devel/tpasm/tpasm1.11/
H A Dsymbols.c28 *hashNext, member
95 node=node->hashNext; in STFindNode()
114 node=node->hashNext; in STFindNodeNoCase()
122 if(node->hashNext) // first unlink it from the hash table in STRemoveEntry()
124 node->hashNext->hashPrev=node->hashPrev; in STRemoveEntry()
129 node->hashPrev->hashNext=node->hashNext; in STRemoveEntry()
133 table->hashList[node->hashValue&((1<<table->hashTableBits)-1)]=node->hashNext; in STRemoveEntry()
199 newNode->hashNext=table->hashList[hashIndex]; // link into hash list in STAddEntryAtStart()
236 newNode->hashNext=table->hashList[hashIndex]; // link into hash list in STAddEntryAtEnd()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/
H A DDuplicateAttributeVerifier.java43 private Entry hashNext; field in DuplicateAttributeVerifier.Entry
105 newEntry.hashNext = null; in checkForDuplicateAttribute()
116 } while ((e = e.hashNext) != null); in checkForDuplicateAttribute()
118 newEntry.hashNext = head; in checkForDuplicateAttribute()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/
H A DDuplicateAttributeVerifier.java43 private Entry hashNext; field in DuplicateAttributeVerifier.Entry
105 newEntry.hashNext = null; in checkForDuplicateAttribute()
116 } while ((e = e.hashNext) != null); in checkForDuplicateAttribute()
118 newEntry.hashNext = head; in checkForDuplicateAttribute()
/dports/databases/hbase/hbase-1.2.1/hbase-procedure/src/main/java/org/apache/hadoop/hbase/procedure2/store/wal/
H A DProcedureWALFormatReader.java246 protected Entry hashNext; field in ProcedureWALFormatReader.Entry
260 public Entry(Entry hashNext) { this.hashNext = hashNext; } in Entry() argument
445 p.hashNext = procedureMap[slotIndex]; in mergeTail()
705 prev.hashNext = entry.hashNext; in removeFromMap()
707 procedureMap[slotIndex] = entry.hashNext; in removeFromMap()
709 entry.hashNext = null; in removeFromMap()
713 entry = entry.hashNext; in removeFromMap()
728 entry = entry.hashNext; in getProcedure()
/dports/games/ufoai/ufoai-2.5-source/src/client/sound/
H A Ds_sample.cpp52 for (sample = sampleHash[hash]; sample; sample = sample->hashNext) in S_FindByName()
130 sample->hashNext = sampleHash[hash]; in S_LoadSampleIdx()
150 for (sample = sampleHash[i]; sample; sample = sample->hashNext) { in S_FreeSamples()
158 next = sample->hashNext; in S_FreeSamples()
/dports/games/egl/egl-0.3.1_9/common/
H A Dalias.c55 for (alias=com_aliasHashTree[hash] ; alias ; alias=alias->hashNext) { in Alias_Exists()
127 alias->hashNext = com_aliasHashTree[alias->hashValue]; in Alias_AddAlias()
186 *prev = alias->hashNext; in Alias_RemoveAlias()
192 prev = &alias->hashNext; in Alias_RemoveAlias()
H A Dcmd.c38 struct cmdFunc_s *hashNext; member
67 for (cmd=com_cmdHashTree[hash] ; cmd ; cmd=cmd->hashNext) { in Cmd_Exists()
390 cmd->hashNext = com_cmdHashTree[cmd->hashValue]; in _Cmd_AddCommand()
430 *prev = cmd->hashNext; in Cmd_RemoveCommand()
435 prev = &cmd->hashNext; in Cmd_RemoveCommand()
H A Dalias.h41 struct aliasCmd_s *hashNext; member
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/demos/tutorial/q_gram_index/
H A Dindex_qgram_hash.cpp16 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
22 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
/dports/biology/seqan/seqan-library-2.4.0/share/doc/seqan/html/demos/dox/index/
H A Dshape_hash_init.cpp14 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
20 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/demos/dox/index/
H A Dshape_hash_init.cpp14 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
20 std::cout << hashNext(myShape, begin(text) + i) << '\t'; in main()
H A DUNUSED_shape_hash_next.cpp14 std::cout << '\t' << hashNext(myShape, begin(text) + i); in main()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/tests/index/
H A Dtest_shapes.h67 H1b = hashNext(shape1b, it); in testShape()
68 H2b = hashNext(shape2b, it); in testShape()
115 hashNext(shape2, it); in testHashInit()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/demos/tutorial/generic_programming/
H A Dexample_hashing.cpp56 hashNext(Shape< TValue, UngappedShape<q> > const & shape, TIterator it, unsigned int prev) in hashNext() function
80 unsigned int hash_value = hashNext(shape, it, hash_value); in specializedHashAll()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/mason2/
H A Dmethylation_levels.h195 hashNext(shape2, it); in run()
196 hashNext(shape3, it); in run()
204 hashNext(shape2, it++); in run()
/dports/games/openarena/openarena-engine-source-0.8.8/code/qcommon/
H A Dcvar.c93 for (var=hashTable[hash] ; var ; var=var->hashNext) { in Cvar_FindVar()
442 var->hashNext = hashTable[hash]; in Cvar_Get()
996 cv->hashPrev->hashNext = cv->hashNext; in Cvar_Unset()
998 hashTable[cv->hashIndex] = cv->hashNext; in Cvar_Unset()
999 if(cv->hashNext) in Cvar_Unset()
1000 cv->hashNext->hashPrev = cv->hashPrev; in Cvar_Unset()
/dports/games/openarena-server/openarena-engine-source-0.8.8/code/qcommon/
H A Dcvar.c93 for (var=hashTable[hash] ; var ; var=var->hashNext) { in Cvar_FindVar()
442 var->hashNext = hashTable[hash]; in Cvar_Get()
996 cv->hashPrev->hashNext = cv->hashNext; in Cvar_Unset()
998 hashTable[cv->hashIndex] = cv->hashNext; in Cvar_Unset()
999 if(cv->hashNext) in Cvar_Unset()
1000 cv->hashNext->hashPrev = cv->hashPrev; in Cvar_Unset()
/dports/games/iortcw/iortcw-1.51c/SP/code/qcommon/
H A Dcvar.c102 for ( var = hashTable[hash] ; var ; var = var->hashNext ) { in Cvar_FindVar()
468 var->hashNext = hashTable[hash]; in Cvar_Get()
1139 cv->hashPrev->hashNext = cv->hashNext; in Cvar_Unset()
1141 hashTable[cv->hashIndex] = cv->hashNext; in Cvar_Unset()
1142 if(cv->hashNext) in Cvar_Unset()
1143 cv->hashNext->hashPrev = cv->hashPrev; in Cvar_Unset()
/dports/games/iortcw/iortcw-1.51c/MP/code/qcommon/
H A Dcvar.c102 for ( var = hashTable[hash] ; var ; var = var->hashNext ) { in Cvar_FindVar()
499 var->hashNext = hashTable[hash]; in Cvar_Get()
1178 cv->hashPrev->hashNext = cv->hashNext; in Cvar_Unset()
1180 hashTable[cv->hashIndex] = cv->hashNext; in Cvar_Unset()
1181 if(cv->hashNext) in Cvar_Unset()
1182 cv->hashNext->hashPrev = cv->hashPrev; in Cvar_Unset()
/dports/games/egl/egl-0.3.1_9/renderer/
H A Drf_program.h42 struct program_s *hashNext; member
/dports/games/openjk/OpenJK-07675e2/code/qcommon/
H A Dcvar.cpp109 for (var=hashTable[hash] ; var ; var=var->hashNext) { in Cvar_FindVar()
471 var->hashNext = hashTable[hash]; in Cvar_Get()
1123 cv->hashPrev->hashNext = cv->hashNext; in Cvar_Unset()
1125 hashTable[cv->hashIndex] = cv->hashNext; in Cvar_Unset()
1126 if(cv->hashNext) in Cvar_Unset()
1127 cv->hashNext->hashPrev = cv->hashPrev; in Cvar_Unset()
/dports/sysutils/xvidcap/xvidcap-1.1.7/ffmpeg/libavcodec/
H A Dlzwenc.c87 static inline int hashNext(int head, const int offset) in hashNext() function
133 h = hashNext(h, hash_offset); in findCode()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/index/
H A Dshape_minimizer.h123 miniTmp = _min(miniTmp, hashNext(tmpShape, strIt));
171 hashNext(Shape<TValue, MinimizerShape<TSPAN, TWEIGHT, TSpec> > &me, TIter const &it)
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/index/
H A Dshape_minimizer.h123 miniTmp = _min(miniTmp, hashNext(tmpShape, strIt));
171 hashNext(Shape<TValue, MinimizerShape<TSPAN, TWEIGHT, TSpec> > &me, TIter const &it)
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/manual/source/Tutorial/DataStructures/Indices/
H A DQgramIndex.rst48 …nce of q characters to a hash value by the Functions :dox:`Shape#hash`, :dox:`Shape#hashNext`, etc.
54 With :dox:`Shape#hash` and :dox:`Shape#hash hashNext`, we can compute the hash values of arbitrary …
59 … and gaps of a q-gram shape but also stores the hash value returned by the last hash/hashNext call.
61 …ues of the following overlapping q-grams can more efficiently be computed by :dox:`Shape#hashNext`.
63 As a remedy, the :dox:`Shape#hashInit` function can be used first and then :dox:`Shape#hashNext` on…
93 The hash value returned by :dox:`Shape#hash` or :dox:`Shape#hashNext` is also stored in the shape a…

12345