Home
last modified time | relevance | path

Searched refs:num_npref (Results 1 – 6 of 6) sorted by relevance

/dports/net-p2p/bitcoin/bitcoin-22.0/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()
/dports/net-p2p/bitcoin-utils/bitcoin-22.0/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()
/dports/net-p2p/bitcoin-daemon/bitcoin-22.0/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()
/dports/net-p2p/namecoin/namecoin-core-nc0.21.0.1/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()
/dports/net-p2p/namecoin-daemon/namecoin-core-nc0.21.0.1/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()
/dports/net-p2p/namecoin-utils/namecoin-core-nc0.21.0.1/src/test/
H A Dtxrequest_tests.cpp377 int num_npref = peers - num_pref; // some not preferred. in BuildBigPriorityTest() local
382 for (int i = 0; i < num_npref; ++i) { in BuildBigPriorityTest()
389 for (int i = 0; i < num_npref; ++i) request_order.push_back(npref_peers[i]); in BuildBigPriorityTest()