Home
last modified time | relevance | path

Searched refs:getHash (Results 1 – 25 of 1936) sorted by relevance

12345678910>>...78

/dports/lang/gcc10/gcc-10.3.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/lang/gcc9/gcc-9.4.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/devel/tlsh/tlsh-d842e75/test/
H A Dsimple_unittest.cpp103 printf("hash1 = %s\n", t1.getHash(showvers) ); in main()
104 printf("hash2 = %s\n", t2.getHash(showvers) ); in main()
120 assert(strcmp(t1.getHash(showvers), t3.getHash(showvers)) == 0); in main()
129 assert(strcmp(t2.getHash(showvers), t4.getHash(showvers)) == 0); in main()
131 printf("hash3 = %s\n", t3.getHash(showvers) ); in main()
132 printf("hash4 = %s\n", t4.getHash(showvers) ); in main()
135 printf("Recreating tlsh3 from %s\n", t1.getHash(minSizeBuffer1, sizeof(minSizeBuffer1), showvers)); in main()
138 printf("hash3 = %s\n", t3.getHash(minSizeBuffer2, sizeof(minSizeBuffer2), showvers)); in main()
141 printf("Recreating tlsh4 from %s\n", t2.getHash(minSizeBuffer1, sizeof(minSizeBuffer1), showvers)); in main()
144 printf("hash4 = %s\n", t4.getHash(minSizeBuffer2, sizeof(minSizeBuffer2), showvers)); in main()
/dports/deskutils/coolreader/coolreader-cr3.2.55/crengine/include/
H A Dlvhashtable.h20 inline lUInt32 getHash( lUInt16 n ) in getHash() function
25 inline lUInt32 getHash( lUInt32 n ) in getHash() function
30 inline lUInt32 getHash( lUInt64 n ) in getHash() function
36 inline lUInt32 getHash(LVFont * n ) in getHash() function
38 return getHash((lUInt64)n); in getHash()
41 inline lUInt32 getHash(void * n ) in getHash() function
43 return getHash((lUInt64)n); in getHash()
141 lUInt32 index = getHash( p->key ) % ( nsize ); in resize()
156 lUInt32 index = getHash( key ) % ( _size ); in set()
168 index = getHash( key ) % ( _size ); in set()
[all …]
/dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/rt/util/
H A Dtypeinfo.d128 assert(ti.getHash(&f1) == ti.getHash(&f2));
135 assert(ti.getHash(&a1) == ti.getHash(&a2));
142 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
149 assert(ti.getHash(&s1) == ti.getHash(&s2));
156 assert(ti.getHash(&da1) == ti.getHash(&da2));
163 assert(ti.getHash(&sa1) == ti.getHash(&sa2));
176 assert(ti.getHash(&f1) == ti.getHash(&f2));
183 assert(ti.getHash(&a1) == ti.getHash(&a2));
190 assert(ti.getHash(&aa1) == ti.getHash(&aa2));
197 assert(ti.getHash(&s1) == ti.getHash(&s2));
[all …]
/dports/www/ilias6/ILIAS-6.14/tests/Setup/
H A DObjectiveCollectionTest.php34 $this->assertIsString($c1->getHash());
35 $this->assertIsString($c2->getHash());
36 $this->assertIsString($c3->getHash());
38 $this->assertEquals($c1->getHash(), $c1->getHash());
39 $this->assertNotEquals($c1->getHash(), $c2->getHash());
40 $this->assertEquals($c1->getHash(), $c3->getHash());
/dports/www/ilias6/ILIAS-6.14/Services/Database/test/Setup/
H A DilDatabaseUpdateStepsTest.php75 $step1->getHash()
94 $step2->getHash()
100 $this->assertEquals($step1->getHash(), $preconditions[0]->getHash());
115 $this->assertEquals($step1->getHash(), $preconditions[0]->getHash());
128 $step4->getHash()
147 $step4->getHash()
153 $this->assertEquals($step2->getHash(), $preconditions[0]->getHash());
/dports/www/ilias6/ILIAS-6.14/src/Setup/
H A DObjectiveIterator.php69 if (!isset($this->returned[$objective->getHash()])) {
75 $this->failed[$objective->getHash()] = true;
100 return $this->current()->getHash();
111 $hash = $cur->getHash();
121 $h = $p->getHash();
129 return isset($this->failed[$p->getHash()]);
152 $this->setReverseDependency($p->getHash(), $hash);
/dports/devel/tlsh/tlsh-d842e75/java/src/test/java/com/trendmicro/tlsh/
H A DTlshTest.java217 Tlsh tlsh1 = checksum1.getHash();
221 Tlsh tlsh3 = checksum3.getHash();
233 Tlsh tlsh128 = buckets128.getHash();
237 Tlsh tlsh256 = buckets256.getHash();
308 tlshCreator.getHash();
314 tlshCreator.getHash(true);
322 assertNotNull(tlshCreator.getHash(true));
324 tlshCreator.getHash();
332 assertNotNull(tlshCreator.getHash(true));
333 assertNotNull(tlshCreator.getHash(false));
[all …]
/dports/devel/bullet/bullet3-3.21/src/Bullet3Common/
H A Db3HashMap.h29 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
99 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
137 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
175 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
209 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
263 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity() - 1); // New hash value with n… in growTables()
273 int hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
293 hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
301 int hash = key.getHash() & (m_valueArray.capacity() - 1); in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
[all …]
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/LinearMath/
H A DbtHashMap.h28 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
101 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
139 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
175 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
207 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
258 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity()-1); // New hash value with new … in growTables()
270 int hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
290 hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
298 int hash = key.getHash() & (m_valueArray.capacity()-1); in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
[all …]
/dports/games/critterding/critterding-beta12/src/utils/bullet/LinearMath/
H A DbtHashMap.h12 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
85 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
123 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
159 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
191 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
242 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity()-1); // New hash value with new … in growTables()
254 int hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
274 hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
282 int hash = key.getHash() & (m_valueArray.capacity()-1); in remove()
327 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
[all …]
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Common/
H A Db3HashMap.h29 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
99 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
137 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
175 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
209 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
263 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity() - 1); // New hash value with n… in growTables()
273 int hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
293 hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
301 int hash = key.getHash() & (m_valueArray.capacity() - 1); in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/LinearMath/
H A DbtHashMap.h28 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
101 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
139 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
175 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
207 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
258 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity()-1); // New hash value with new … in growTables()
270 int hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
290 hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
298 int hash = key.getHash() & (m_valueArray.capacity()-1); in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Common/
H A Db3HashMap.h29 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
99 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
137 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
175 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
209 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
263 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity() - 1); // New hash value with n… in growTables()
273 int hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
293 hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
301 int hash = key.getHash() & (m_valueArray.capacity() - 1); in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
[all …]
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/LinearMath/
H A DbtHashMap.h28 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
101 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
139 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
175 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
207 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
258 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity()-1); // New hash value with new … in growTables()
270 int hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
290 hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
298 int hash = key.getHash() & (m_valueArray.capacity()-1); in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/LinearMath/
H A DbtHashMap.h28 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
101 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
139 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
175 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
207 SIMD_FORCE_INLINE unsigned int getHash()const in getHash() function
258 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity()-1); // New hash value with new … in growTables()
270 int hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
290 hash = key.getHash() & (m_valueArray.capacity()-1); in insert()
298 int hash = key.getHash() & (m_valueArray.capacity()-1); in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
[all …]
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Common/
H A Db3HashMap.h29 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
99 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
137 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
175 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
209 B3_FORCE_INLINE unsigned int getHash() const in getHash() function
263 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity() - 1); // New hash value with n… in growTables()
273 int hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
293 hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
301 int hash = key.getHash() & (m_valueArray.capacity() - 1); in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
[all …]
/dports/devel/bullet/bullet3-3.21/src/LinearMath/
H A DbtHashMap.h28 SIMD_FORCE_INLINE unsigned int getHash() const in getHash() function
92 SIMD_FORCE_INLINE unsigned int getHash() const in getHash() function
131 SIMD_FORCE_INLINE unsigned int getHash() const in getHash() function
168 SIMD_FORCE_INLINE unsigned int getHash() const in getHash() function
202 SIMD_FORCE_INLINE unsigned int getHash() const in getHash() function
256 …int hashValue = m_keyArray[i].getHash() & (m_valueArray.capacity() - 1); // New hash value with n… in growTables()
266 int hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
286 hash = key.getHash() & (m_valueArray.capacity() - 1); in insert()
294 int hash = key.getHash() & (m_valueArray.capacity() - 1); in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
[all …]

12345678910>>...78