mirror of
https://github.com/aria2/aria2.git
synced 2025-04-05 21:47:37 +03:00
make clang-format using clang-format-3.6
This commit is contained in:
parent
4abad2f64c
commit
b1132d6b10
1095 changed files with 30423 additions and 33770 deletions
|
@ -10,7 +10,7 @@
|
|||
|
||||
namespace aria2 {
|
||||
|
||||
class DHTBucketTreeTest:public CppUnit::TestFixture {
|
||||
class DHTBucketTreeTest : public CppUnit::TestFixture {
|
||||
|
||||
CPPUNIT_TEST_SUITE(DHTBucketTreeTest);
|
||||
CPPUNIT_TEST(testDig);
|
||||
|
@ -18,6 +18,7 @@ class DHTBucketTreeTest:public CppUnit::TestFixture {
|
|||
CPPUNIT_TEST(testFindClosestKNodes);
|
||||
CPPUNIT_TEST(testEnumerateBucket);
|
||||
CPPUNIT_TEST_SUITE_END();
|
||||
|
||||
public:
|
||||
void testDig();
|
||||
void testFindBucketFor();
|
||||
|
@ -25,7 +26,6 @@ public:
|
|||
void testEnumerateBucket();
|
||||
};
|
||||
|
||||
|
||||
CPPUNIT_TEST_SUITE_REGISTRATION(DHTBucketTreeTest);
|
||||
|
||||
void DHTBucketTreeTest::testDig()
|
||||
|
@ -132,7 +132,7 @@ void DHTBucketTreeTest::testFindClosestKNodes()
|
|||
auto bp3 = make_unique<DHTBucketTreeNode>(std::move(bp2), std::move(b1));
|
||||
DHTBucketTreeNode bp4(std::move(b2), std::move(bp3));
|
||||
|
||||
for(size_t i = 0; i < 2; ++i) {
|
||||
for (size_t i = 0; i < 2; ++i) {
|
||||
bucket1->getRandomNodeID(id);
|
||||
bucket1->addNode(std::make_shared<DHTNode>(id));
|
||||
bucket2->getRandomNodeID(id);
|
||||
|
@ -175,7 +175,7 @@ void DHTBucketTreeTest::testFindClosestKNodes()
|
|||
CPPUNIT_ASSERT(bucket4->isInRange(nodes[7]));
|
||||
}
|
||||
{
|
||||
for(size_t i = 0; i < 6; ++i) {
|
||||
for (size_t i = 0; i < 6; ++i) {
|
||||
bucket4->getRandomNodeID(id);
|
||||
bucket4->addNode(std::make_shared<DHTNode>(id));
|
||||
}
|
||||
|
@ -184,14 +184,13 @@ void DHTBucketTreeTest::testFindClosestKNodes()
|
|||
std::vector<std::shared_ptr<DHTNode>> nodes;
|
||||
dht::findClosestKNodes(nodes, &bp4, targetID);
|
||||
CPPUNIT_ASSERT_EQUAL((size_t)8, nodes.size());
|
||||
for(size_t i = 0; i < DHTBucket::K; ++i) {
|
||||
for (size_t i = 0; i < DHTBucket::K; ++i) {
|
||||
CPPUNIT_ASSERT(bucket4->isInRange(nodes[i]));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void DHTBucketTreeTest::testEnumerateBucket()
|
||||
{
|
||||
unsigned char localNodeID[DHT_ID_LENGTH];
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue