Home
last modified time | relevance | path

Searched refs:m_hash (Results 1 – 25 of 1627) sorted by relevance

12345678910>>...66

/dports/math/scilab/scilab-6.1.1/scilab/modules/core/src/cpp/hash/
H A Dsha3.cpp22 m_hash[i] = 0; in reset()
103 … coefficients[i] = m_hash[i] ^ m_hash[i + 5] ^ m_hash[i + 10] ^ m_hash[i + 15] ^ m_hash[i + 20]; in processBlock()
120 one = m_hash[10]; m_hash[10] = rotateLeft(last, 1); last = one; in processBlock()
121 one = m_hash[ 7]; m_hash[ 7] = rotateLeft(last, 3); last = one; in processBlock()
122 one = m_hash[11]; m_hash[11] = rotateLeft(last, 6); last = one; in processBlock()
123 one = m_hash[17]; m_hash[17] = rotateLeft(last, 10); last = one; in processBlock()
124 one = m_hash[18]; m_hash[18] = rotateLeft(last, 15); last = one; in processBlock()
152 m_hash[j] ^= m_hash[j + 2] & ~two; in processBlock()
153 m_hash[j + 1] ^= m_hash[j + 3] & ~m_hash[j + 2]; in processBlock()
154 m_hash[j + 2] ^= m_hash[j + 4] & ~m_hash[j + 3]; in processBlock()
[all …]
/dports/lang/chaiscript/ChaiScript-6.1.0/src/
H A Dsha3.cpp28 m_hash[i] = 0; in reset()
109 … coefficients[i] = m_hash[i] ^ m_hash[i + 5] ^ m_hash[i + 10] ^ m_hash[i + 15] ^ m_hash[i + 20]; in processBlock()
126 one = m_hash[10]; m_hash[10] = rotateLeft(last, 1); last = one; in processBlock()
127 one = m_hash[ 7]; m_hash[ 7] = rotateLeft(last, 3); last = one; in processBlock()
128 one = m_hash[11]; m_hash[11] = rotateLeft(last, 6); last = one; in processBlock()
129 one = m_hash[17]; m_hash[17] = rotateLeft(last, 10); last = one; in processBlock()
130 one = m_hash[18]; m_hash[18] = rotateLeft(last, 15); last = one; in processBlock()
158 m_hash[j] ^= m_hash[j + 2] & ~two; in processBlock()
159 m_hash[j + 1] ^= m_hash[j + 3] & ~m_hash[j + 2]; in processBlock()
160 m_hash[j + 2] ^= m_hash[j + 4] & ~m_hash[j + 3]; in processBlock()
[all …]
/dports/cad/verilator/verilator-4.216/src/
H A DV3Hasher.cpp45 VL_RESTORER(m_hash); in hashNodeAndIterate()
52 return m_hash; in hashNodeAndIterate()
94 m_hash += nodep->left(); in visit()
95 m_hash += nodep->right(); in visit()
105 m_hash += nodep->name(); in visit()
111 m_hash += nodep->name(); in visit()
164 m_hash += nodep->name(); in visit()
193 m_hash += nodep->size(); in visit()
214 m_hash += nodep->name(); in visit()
219 m_hash += nodep->text(); in visit()
[all …]
/dports/x11-toolkits/qt5-declarative/kde-qtdeclarative-5.15.2p41/src/qml/qml/ftw/
H A Dqhashedstring_p.h201 : QString(string), m_hash(string.m_hash) in QHashedString()
208 m_hash = string.m_hash;
214 return (string.m_hash == m_hash || !string.m_hash || !m_hash) &&
221 (string.m_hash == m_hash || !string.m_hash || !m_hash) &&
274 m_hash = o.m_hash;
287 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
294 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
301 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
314 (m_hash != string.m_hash && m_hash && string.m_hash) ||
321 (m_hash != string.m_hash && m_hash && string.m_hash) ||
[all …]
/dports/x11-toolkits/qt5-declarative-test/kde-qtdeclarative-5.15.2p41/src/qml/qml/ftw/
H A Dqhashedstring_p.h201 : QString(string), m_hash(string.m_hash) in QHashedString()
208 m_hash = string.m_hash;
214 return (string.m_hash == m_hash || !string.m_hash || !m_hash) &&
221 (string.m_hash == m_hash || !string.m_hash || !m_hash) &&
274 m_hash = o.m_hash;
287 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
294 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
301 (m_hash == string.m_hash || !m_hash || !string.m_hash) &&
314 (m_hash != string.m_hash && m_hash && string.m_hash) ||
321 (m_hash != string.m_hash && m_hash && string.m_hash) ||
[all …]
/dports/net-p2p/bitcoin/bitcoin-22.0/src/util/
H A Dhash_type.h12 HashType m_hash;
15 BaseHash() : m_hash() {} in BaseHash()
20 return m_hash.begin(); in begin()
25 return m_hash.begin(); in begin()
30 return m_hash.end(); in end()
35 return m_hash.end(); in end()
40 return std::vector<unsigned char>{m_hash.begin(), m_hash.end()};
50 return m_hash == other.m_hash;
55 return !(m_hash == other.m_hash);
60 return m_hash < other.m_hash;
[all …]
/dports/net-p2p/bitcoin-daemon/bitcoin-22.0/src/util/
H A Dhash_type.h12 HashType m_hash;
15 BaseHash() : m_hash() {} in BaseHash()
20 return m_hash.begin(); in begin()
25 return m_hash.begin(); in begin()
30 return m_hash.end(); in end()
35 return m_hash.end(); in end()
40 return std::vector<unsigned char>{m_hash.begin(), m_hash.end()};
50 return m_hash == other.m_hash;
55 return !(m_hash == other.m_hash);
60 return m_hash < other.m_hash;
[all …]
/dports/net-p2p/bitcoin-utils/bitcoin-22.0/src/util/
H A Dhash_type.h12 HashType m_hash;
15 BaseHash() : m_hash() {} in GolombRiceEncode()
20 return m_hash.begin();
25 return m_hash.begin();
30 return m_hash.end(); in GolombRiceDecode()
35 return m_hash.end();
40 return std::vector<unsigned char>{m_hash.begin(), m_hash.end()};
50 return m_hash == other.m_hash;
55 return !(m_hash == other.m_hash);
60 return m_hash < other.m_hash;
[all …]
/dports/net-p2p/amule/aMule-2.3.3/src/
H A DMD4Hash.h87 ( RawPeekUInt64( m_hash ) == RawPeekUInt64( other_hash.m_hash ) ) &&
88 ( RawPeekUInt64( m_hash + 8 ) == RawPeekUInt64( other_hash.m_hash + 8 ) )
111 if ( m_hash[i] < other_hash.m_hash[i] ) {
113 } else if ( other_hash.m_hash[i] < m_hash[i] ) {
178 m_hash[i/2] = word << 4; in Decode()
180 m_hash[i/2] += word; in Decode()
205 size_t x = ( i % 2 == 0 ) ? ( m_hash[i/2] >> 4 ) : ( m_hash[i/2] & 0xf ); in EncodeSTL()
245 return m_hash; in GetHash()
248 return m_hash; in GetHash()
259 return m_hash[i];
[all …]
/dports/net-p2p/amule-devel/aMule-SVN-r11065/src/
H A DMD4Hash.h87 ( RawPeekUInt64( m_hash ) == RawPeekUInt64( other_hash.m_hash ) ) &&
88 ( RawPeekUInt64( m_hash + 8 ) == RawPeekUInt64( other_hash.m_hash + 8 ) )
111 if ( m_hash[i] < other_hash.m_hash[i] ) {
113 } else if ( other_hash.m_hash[i] < m_hash[i] ) {
178 m_hash[i/2] = word << 4; in Decode()
180 m_hash[i/2] += word; in Decode()
205 size_t x = ( i % 2 == 0 ) ? ( m_hash[i/2] >> 4 ) : ( m_hash[i/2] & 0xf ); in EncodeSTL()
245 return m_hash; in GetHash()
248 return m_hash; in GetHash()
259 return m_hash[i];
[all …]
/dports/databases/mariadb105-client/mariadb-10.5.15/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
40 m_hash.array.m_psi_key= psi_key;
55 my_hash_free(&m_hash); in ~Hash_set()
68 my_hash_init_opt(m_hash.array.m_psi_key, &m_hash, m_hash.charset, in insert()
85 void clear() { my_hash_reset(&m_hash); } in clear()
95 : m_hash(&hash_set.m_hash), in Iterator()
104 if (m_idx < m_hash->records)
110 HASH *m_hash;
[all …]
/dports/databases/mariadb105-server/mariadb-10.5.15/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
40 m_hash.array.m_psi_key= psi_key;
55 my_hash_free(&m_hash); in ~Hash_set()
68 my_hash_init_opt(m_hash.array.m_psi_key, &m_hash, m_hash.charset, in insert()
85 void clear() { my_hash_reset(&m_hash); } in clear()
95 : m_hash(&hash_set.m_hash), in Iterator()
104 if (m_idx < m_hash->records)
110 HASH *m_hash;
[all …]
/dports/biology/avida/avida-2.12.4-src/avida-core/source/tools/
H A DtDictionary.h47 tHashMap<cString, T> m_hash;
60 inline bool OK() const { return m_hash.OK(); } in OK()
69 inline void Clear() { m_hash.ClearAll(); } in Clear()
72 m_hash.AsLists(name_list, value_list); in AsLists()
97 m_hash.AsLists(keys, values); in NearMatch()
118 if (m_hash.Find(name, rval)) return rval; in GetWithDefault()
127 tHashMap<cString, T> m_hash;
137 inline bool OK() { return m_hash.OK(); } in OK()
141 m_hash.AsLists(name_list, value_list); in AsLists()
154 inline void Clear() { m_hash.ClearAll(); } in Clear()
[all …]
/dports/databases/mariadb104-server/mariadb-10.4.24/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
47 my_hash_free(&m_hash); in ~Hash_set()
60 my_hash_init_opt(&m_hash, m_hash.charset, START_SIZE, 0, 0, in insert()
61 m_hash.get_key, 0, MYF(0)); in insert()
66 return my_hash_insert(&m_hash, v); in insert()
90 : m_hash(&hash_set.m_hash), in Iterator()
99 if (m_idx < m_hash->records)
105 HASH *m_hash;
[all …]
/dports/databases/mariadb104-client/mariadb-10.4.24/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
47 my_hash_free(&m_hash); in ~Hash_set()
60 my_hash_init_opt(&m_hash, m_hash.charset, START_SIZE, 0, 0, in insert()
61 m_hash.get_key, 0, MYF(0)); in insert()
66 return my_hash_insert(&m_hash, v); in insert()
90 : m_hash(&hash_set.m_hash), in Iterator()
99 if (m_idx < m_hash->records)
105 HASH *m_hash;
[all …]
/dports/databases/mariadb103-server/mariadb-10.3.34/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
47 my_hash_free(&m_hash); in ~Hash_set()
60 my_hash_init_opt(&m_hash, m_hash.charset, START_SIZE, 0, 0, in insert()
61 m_hash.get_key, 0, MYF(0)); in insert()
66 return my_hash_insert(&m_hash, v); in insert()
90 : m_hash(&hash_set.m_hash), in Iterator()
99 if (m_idx < m_hash->records)
105 HASH *m_hash;
[all …]
/dports/databases/mariadb103-client/mariadb-10.3.34/sql/
H A Dsql_hset.h37 my_hash_clear(&m_hash);
38 m_hash.get_key= (my_hash_get_key)K;
39 m_hash.charset= cs;
47 my_hash_free(&m_hash); in ~Hash_set()
60 my_hash_init_opt(&m_hash, m_hash.charset, START_SIZE, 0, 0, in insert()
61 m_hash.get_key, 0, MYF(0)); in insert()
66 return my_hash_insert(&m_hash, v); in insert()
90 : m_hash(&hash_set.m_hash), in Iterator()
99 if (m_idx < m_hash->records)
105 HASH *m_hash;
[all …]
/dports/mail/spamprobe/spamprobe-1.4d/src/database/
H A DFrequencyDBImpl_split.cc73 m_hash.clear(); in open()
83 m_hash.clear(); in close()
91 if (m_hash.get()) { in flush()
92 m_hash->flush(); in flush()
101 if (m_hash.get()) { in beginTransaction()
111 if (m_hash.get()) { in endTransaction()
120 assert(m_hash.get()); in writeWord()
133 assert(m_hash.get()); in readWord()
149 assert(m_hash.get()); in firstWord()
169 assert(m_hash.get()); in nextWord()
[all …]
/dports/print/limereport/LimeReport-1.5.35/3rdparty/easyprofiler/easy_profiler_core/
H A Dhashed_cstr.h148 size_t m_hash; variable
152 hashed_cstr(const char* _str) : Parent(_str), m_hash(0) in hashed_cstr()
154 m_hash = ::std::_Hash_seq((const unsigned char *)m_str, m_len); in hashed_cstr()
157 hashed_cstr(const char* _str, size_t _hash_code) : Parent(_str), m_hash(_hash_code) in hashed_cstr()
170 return m_hash == _other.m_hash && Parent::operator == (_other);
180 return m_hash; in hcode()
211 size_t m_hash;
227 …shed_stdstring(hashed_stdstring&& _other) : m_str(::std::move(_other.m_str)), m_hash(_other.m_hash)
249 m_hash = _other.m_hash;
255 return m_hash == _other.m_hash && m_str == _other.m_str;
[all …]
/dports/security/keepass/KeePass-2.49-Source/KeePassLib/Cryptography/
H A DHashingStreamEx.cs38 private HashAlgorithm m_hash; field in KeePassLib.Cryptography.HashingStreamEx
83 m_hash = null; in HashingStreamEx()
87 try { if(m_hash == null) m_hash = HashAlgorithm.Create(); } in HashingStreamEx()
93 if(!m_hash.CanTransformMultipleBlocks) in HashingStreamEx()
96 m_hash = null; in HashingStreamEx()
104 if(m_hash != null) in Dispose()
109 m_pbFinalHash = m_hash.Hash; in Dispose()
110 m_hash.Clear(); in Dispose()
114 m_hash = null; in Dispose()
158 if((m_hash != null) && (nRead > 0)) in Read()
[all …]
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/pubkey/xmss/
H A Dxmss_hash.h40 m_hash->update(m_id_prf); in prf()
41 m_hash->update(key); in prf()
42 m_hash->update(data); in prf()
43 m_hash->final(result); in prf()
59 m_hash->update(key); in prf()
60 m_hash->update(data); in prf()
61 return m_hash->final(); in prf()
76 m_hash->update(m_id_f); in f()
77 m_hash->update(key); in f()
78 m_hash->update(data); in f()
[all …]
/dports/security/botan2/Botan-2.18.2/src/lib/pubkey/xmss/
H A Dxmss_hash.h40 m_hash->update(m_id_prf); in prf()
41 m_hash->update(key); in prf()
42 m_hash->update(data); in prf()
43 m_hash->final(result); in prf()
59 m_hash->update(key); in prf()
60 m_hash->update(data); in prf()
61 return m_hash->final(); in prf()
76 m_hash->update(m_id_f); in f()
77 m_hash->update(key); in f()
78 m_hash->update(data); in f()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/pubkey/xmss/
H A Dxmss_hash.h40 m_hash->update(m_id_prf); in prf()
41 m_hash->update(key); in prf()
42 m_hash->update(data); in prf()
43 m_hash->final(result); in prf()
59 m_hash->update(key); in prf()
60 m_hash->update(data); in prf()
61 return m_hash->final(); in prf()
76 m_hash->update(m_id_f); in f()
77 m_hash->update(key); in f()
78 m_hash->update(data); in f()
[all …]
/dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/
H A Dsql_hset.h45 my_hash_clear(&m_hash); in Hash_set()
53 my_hash_free(&m_hash); in ~Hash_set()
69 if (my_hash_search(&m_hash, key, key_len) == NULL) in insert()
70 return my_hash_insert(&m_hash, reinterpret_cast<uchar *>(value)); in insert()
74 bool is_empty() const { return m_hash.records == 0; } in is_empty()
76 size_t size() const { return static_cast<size_t>(m_hash.records); } in size()
82 : m_hash(&hash_set.m_hash), in Iterator()
91 if (m_idx < m_hash->records)
92 return reinterpret_cast<T*>(my_hash_element(m_hash, m_idx++));
97 HASH *m_hash;
[all …]
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/
H A Dsql_hset.h45 my_hash_clear(&m_hash); in Hash_set()
53 my_hash_free(&m_hash); in ~Hash_set()
69 if (my_hash_search(&m_hash, key, key_len) == NULL) in insert()
70 return my_hash_insert(&m_hash, reinterpret_cast<uchar *>(value)); in insert()
74 bool is_empty() const { return m_hash.records == 0; } in is_empty()
76 size_t size() const { return static_cast<size_t>(m_hash.records); } in size()
82 : m_hash(&hash_set.m_hash), in Iterator()
91 if (m_idx < m_hash->records)
92 return reinterpret_cast<T*>(my_hash_element(m_hash, m_idx++));
97 HASH *m_hash;
[all …]

12345678910>>...66