Home
last modified time | relevance | path

Searched refs:hash2 (Results 1 – 25 of 1742) sorted by relevance

12345678910>>...70

/dports/archivers/par2cmdline/par2cmdline-0.8.1/src/
H A Dmd5_test.cpp43 MD5Hash hash2; in test1() local
46 if (hash1 != hash2) { in test1()
65 MD5Hash hash2; in test2() local
66 hash2.hash[0] = 0xd4; in test2()
67 hash2.hash[1] = 0x1d; in test2()
68 hash2.hash[2] = 0x8c; in test2()
102 MD5Hash hash2; in test3() local
103 hash2 = hash1; in test3()
113 if (hash1 < hash2) { in test3()
117 if (hash1 > hash2) { in test3()
[all …]
/dports/devel/p5-Data-Structure-Util/Data-Structure-Util-0.16/t/
H A D04utf8.t37 my $hash2 = test_utf8( $hash );
38 if ( $hash2 ) {
42 $hash2 = dclone( $hash );
47 my $string2 = $hash2->{key1};
54 ok( has_utf8( $hash2 ), "Has utf8" );
55 is( has_utf8( $hash2 ), $hash2, "Has utf8" );
57 is( $hash2->{key1}, $hash->{key1}, "Same string" );
59 ok( utf8_off( $hash2 ), "Have decoded utf8" );
60 ok( !has_utf8( $hash2 ), "Has not utf8" );
101 $hash2->{key1} = $utf8;
[all …]
/dports/devel/cutter/cutter-1.2.6/test/gcutter/
H A Dtest-gcut-hash-table.c16 static GHashTable *hash1, *hash2; variable
23 hash2 = NULL; in cut_setup()
33 if (hash2) in cut_teardown()
34 g_hash_table_unref(hash2); in cut_teardown()
65 cut_assert_true(gcut_hash_table_string_equal(hash1, hash2)); in test_new()
74 hash2 = gcut_hash_table_string_string_new("key1", "value1", in test_equal_same_content()
87 hash2 = gcut_hash_table_string_string_new("key1", "value1", in test_equal_same_size_and_different_content()
100 hash2 = gcut_hash_table_string_string_new("key1", "value1", in test_equal_different_size()
110 hash2 = gcut_hash_table_string_string_new(NULL, NULL); in test_equal_empty()
152 hash2 = gcut_hash_table_string_string_copy(hash1); in test_copy()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections.NonGeneric/tests/
H A DHashtableTests.cs59 VerifyHashtable(hash1, hash2, null); in Ctor_IDictionary()
410 hash2.Add("Key", foo); in Add_ReferenceType()
617 hash2.Remove(removedKey); in ContainsKey()
632 hash2.Add(foo1, 101); in ContainsKey_EqualObjects()
642 hash2.Add(l1, 101); in ContainsKey_EqualObjects()
683 hash2.Add("Key_101", null); in ContainsValue()
688 hash2.Remove(removedKey); in ContainsValue()
702 hash2.Add(101, foo1); in ContainsValue_EqualObjects()
894 if (hash2 == null) in VerifyHashtable()
909 hash2.Clear(); in VerifyHashtable()
[all …]
/dports/games/KnightCap/Export/
H A Dhash.c130 if (t->hash2 == b->hash2 && in check_hash()
139 if (t->hash2 != b->hash2 || in check_hash()
194 if (t->hash2 != b->hash2 || in fetch_hash()
276 t->hash2 = b->hash2; in insert_hash()
406 hash2 = b->hash2; in ettc_check_hash()
425 b->hash2 = hash2; in ettc_check_hash()
441 b->hash2 = hash2; in ettc_check_hash()
457 hash2 = b->hash2; in hash_ordering()
480 b->hash2 = hash2; in hash_ordering()
488 b->hash2 = hash2; in hash_ordering()
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/tests/auto/qhash/
H A Dtst_qhash.cpp315 hash2 = hash; in insert1()
316 hash = hash2; in insert1()
317 hash2 = hash2; in insert1()
319 hash2.clear(); in insert1()
320 hash2 = hash2; in insert1()
347 hash2.detach(); in insert1()
790 hash2.squeeze(); in compare()
796 hash2.take(234); in compare()
800 hash2.take(261); in compare()
1146 i = hash2.find(2, 22); in qmultihash_specific()
[all …]
/dports/security/seal/SEAL-3.7.2/native/tests/seal/util/
H A Dhash.cpp26 HashFunction::hash_block_type hash1, hash2; in TEST() local
29 HashFunction::hash(input, 0, hash2); in TEST()
30 ASSERT_TRUE(hash1 != hash2); in TEST()
32 HashFunction::hash(input, 1, hash2); in TEST()
33 ASSERT_TRUE(hash1 == hash2); in TEST()
35 HashFunction::hash(input, 2, hash2); in TEST()
36 ASSERT_TRUE(hash1 != hash2); in TEST()
39 hash(0x023456, hash2); in TEST()
40 ASSERT_TRUE(hash1 != hash2); in TEST()
45 HashFunction::hash(input, 2, hash2); in TEST()
[all …]
/dports/net-mgmt/nitpicker/nitpicker-1.2.1/tools/parse_flowfile/src/
H A Diptable.c37 int hash1,hash2; in addflow() local
46 hash2=matchip(htonl(flow->dip)); in addflow()
53 if( (hash1 > 0) && (hash2 > 0) ) { in addflow()
60 else if ( (hash1 == -1 ) && (hash2 == -1 ) ) { in addflow()
74 if (iptable[hash2].starttime==0) in addflow()
76 iptable[hash2].starttime = absflowstart ; in addflow()
77 iptable[hash2].stoptime = absflowstop ; in addflow()
100 if ( iptable[hash2].stoptime < absflowstop ) in addflow()
101 iptable[hash2].stoptime = absflowstop ; in addflow()
119 if ( iptable[hash2].stoptime < absflowstop ) in addflow()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corert/src/Common/src/TypeSystem/Common/
H A DTypeHashingAlgorithms.cs58 int hash2 = _hash2 + _rotl(_hash2, 8); in ToHashCode()
60 return hash1 ^ hash2; in ToHashCode()
76 int hash2 = 0; in ComputeNameHashCode()
82 hash2 = (hash2 + _rotl(hash2, 5)) ^ src[i + 1]; in ComputeNameHashCode()
86 hash2 += _rotl(hash2, 8); in ComputeNameHashCode()
88 return hash1 ^ hash2; in ComputeNameHashCode()
94 int hash2 = 0; in ComputeASCIINameHashCode()
106 hash2 = (hash2 + _rotl(hash2, 5)) ^ b2; in ComputeASCIINameHashCode()
111 hash2 += _rotl(hash2, 8); in ComputeASCIINameHashCode()
115 return hash1 ^ hash2; in ComputeASCIINameHashCode()
/dports/security/botan110/Botan-1.10.17/src/hash/comb4p/
H A Dcomb4p.cpp38 hash1(h1), hash2(h2) in Comb4P()
40 if(hash1->name() == hash2->name()) in Comb4P()
43 if(hash1->output_length() != hash2->output_length()) in Comb4P()
46 hash2->name()); in Comb4P()
66 hash2->clear(); in clear()
70 hash2->update(0); in clear()
76 hash2->update(input, length); in add_data()
82 SecureVector<byte> h2 = hash2->final(); in final_result()
88 comb4p_round(h2, h1, 1, hash1, hash2); in final_result()
91 comb4p_round(h1, h2, 2, hash1, hash2); in final_result()
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/fparser/fpoptimizer/
H A Dhash.hh21 fphash_value_t hash1, hash2; member
23 fphash_t() : hash1(0), hash2(0) { } in fphash_t()
25 const fphash_value_t& b) : hash1(a), hash2(b) { } in fphash_t()
28 { return hash1 == rhs.hash1 && hash2 == rhs.hash2; } in operator ==()
31 { return hash1 != rhs.hash1 || hash2 != rhs.hash2; } in operator !=()
34 { return hash1 != rhs.hash1 ? hash1 < rhs.hash1 : hash2 < rhs.hash2; } in operator <()
/dports/net/p5-XML-Compile-SOAP/XML-Compile-SOAP-3.27/t/
H A D12soapmust.t87 my $hash2 = $receiver2->($msg1_soap);
89 ok(defined $hash2, 'received2 works');
90 is(ref $hash2, 'HASH', 'produced HASH');
92 ok(defined $hash2->{Fault}, 'fault');
93 ok(defined $hash2->{Fault}{faultcode}, 'faultcode');
94 ok(defined $hash2->{Fault}{faultstring}, 'faultstring');
116 delete $hash2->{header};
117 delete $hash2->{delete $hash2->{Fault}{_NAME}};
119 my $xml2 = $sender->($hash2);
/dports/devel/git-svn/git-2.34.1/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/git-gui/git-2.34.1/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/git-p4/git-2.34.1/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/git/git-2.34.1/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/git-cvs/git-2.34.1/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/cgit/cgit-1.2.3/git/
H A Dmatch-trees.c82 void *two_buf = fill_tree_desc_strict(&two, hash2); in score_trees()
131 const struct object_id *hash2, in match_trees() argument
149 score = score_trees(elem, hash2); in match_trees()
253 const struct object_id *hash2, in shift_tree() argument
285 oidcpy(shifted, hash2); in shift_tree()
296 del_prefix, oid_to_hex(hash2)); in shift_tree()
303 splice_tree(hash1, add_prefix, hash2, shifted); in shift_tree()
313 const struct object_id *hash2, in shift_tree_by() argument
333 int best_score = score_trees(hash1, hash2); in shift_tree_by()
337 score = score_trees(&sub1, hash2); in shift_tree_by()
[all …]
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/jesseduffield/go-git/v5/go-git-341962be15a4/plumbing/protocol/packp/
H A Dupdreq_encode_test.go40 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
45 {Name: name, Old: hash1, New: hash2},
58 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
62 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
63 {Name: plumbing.ReferenceName("myref2"), Old: plumbing.ZeroHash, New: hash2},
79 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
83 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
101 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
105 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
125 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
[all …]
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/go-git/go-git/v5/plumbing/protocol/packp/
H A Dupdreq_encode_test.go39 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
44 {Name: name, Old: hash1, New: hash2},
57 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
61 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
62 {Name: plumbing.ReferenceName("myref2"), Old: plumbing.ZeroHash, New: hash2},
78 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
82 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
100 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
104 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
124 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
[all …]
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/go-git/go-git/v5/plumbing/protocol/packp/
H A Dupdreq_encode_test.go39 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
44 {Name: name, Old: hash1, New: hash2},
57 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
61 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
62 {Name: plumbing.ReferenceName("myref2"), Old: plumbing.ZeroHash, New: hash2},
78 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
82 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
100 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
104 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
124 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
[all …]
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/go-git/go-git/v5/plumbing/protocol/packp/
H A Dupdreq_encode_test.go39 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
44 {Name: name, Old: hash1, New: hash2},
57 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
61 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
62 {Name: plumbing.ReferenceName("myref2"), Old: plumbing.ZeroHash, New: hash2},
78 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
82 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
100 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
104 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
124 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
[all …]
/dports/devel/qca/qca-2.3.4/examples/md5crypt/
H A Dmd5crypt.cpp64 QCA::Hash hash2(QStringLiteral("md5")); in qca_md5crypt() local
72 hash2.update(password); in qca_md5crypt()
73 hash2.update(salt); in qca_md5crypt()
74 hash2.update(password); in qca_md5crypt()
76 finalState = hash2.final(); in qca_md5crypt()
99 hash2.clear(); in qca_md5crypt()
102 hash2.update(password); in qca_md5crypt()
108 hash2.update(salt); in qca_md5crypt()
112 hash2.update(password); in qca_md5crypt()
118 hash2.update(password); in qca_md5crypt()
[all …]
/dports/devel/gitlab-shell/gitlab-shell-65b8ec55bebd0aea64ac52b9878bafcc2ad992d3/vendor/gitlab.com/gitlab-org/gitaly/v14/internal/gitaly/hook/
H A Dupdate_test.go90 newHash: hash2,
105 newHash: hash2,
114 newHash: hash2,
124 newHash: hash2,
132 newHash: hash2,
141 newHash: hash2,
150 newHash: hash2,
161 newHash: hash2,
170 newHash: hash2,
177 newHash: hash2,
[all …]
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/go-git/go-git/v5/plumbing/protocol/packp/
H A Dupdreq_encode_test.go39 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
44 {Name: name, Old: hash1, New: hash2},
57 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
61 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
62 {Name: plumbing.ReferenceName("myref2"), Old: plumbing.ZeroHash, New: hash2},
78 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
82 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
100 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
104 {Name: plumbing.ReferenceName("myref1"), Old: hash1, New: hash2},
124 hash2 := plumbing.NewHash("2ecf0ef2c2dffb796033e5a02219af86ec6584e5")
[all …]

12345678910>>...70