aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorsubtly <subtly@users.noreply.github.com>2015-01-06 05:01:23 +0800
committersubtly <subtly@users.noreply.github.com>2015-01-06 05:01:23 +0800
commit682c68842ca9ac64fb4908c7de6587bc3c95a130 (patch)
tree3144fa9a11e16588d29fd8858db493f6b914838b
parentb4ca2a8b973435df1bc0d76052efbb63412838f3 (diff)
downloaddexon-solidity-682c68842ca9ac64fb4908c7de6587bc3c95a130.tar.gz
dexon-solidity-682c68842ca9ac64fb4908c7de6587bc3c95a130.tar.zst
dexon-solidity-682c68842ca9ac64fb4908c7de6587bc3c95a130.zip
code review
-rw-r--r--net.cpp12
1 files changed, 6 insertions, 6 deletions
diff --git a/net.cpp b/net.cpp
index 0a008d6e..6952c282 100644
--- a/net.cpp
+++ b/net.cpp
@@ -134,16 +134,16 @@ public:
bool success = false;
};
-BOOST_AUTO_TEST_CASE(test_neighbors_packet)
+BOOST_AUTO_TEST_CASE(test_neighbours_packet)
{
KeyPair k = KeyPair::create();
std::vector<std::pair<KeyPair,unsigned>> testNodes(TestNodeTable::createTestNodes(16));
bi::udp::endpoint to(boost::asio::ip::address::from_string("127.0.0.1"), 30000);
- Neighbors out(to);
+ Neighbours out(to);
for (auto n: testNodes)
{
- Neighbors::Node node;
+ Neighbours::Node node;
node.ipAddress = boost::asio::ip::address::from_string("127.0.0.1").to_string();
node.port = n.second;
node.node = n.first.pub();
@@ -153,7 +153,7 @@ BOOST_AUTO_TEST_CASE(test_neighbors_packet)
bytesConstRef packet(out.data.data(), out.data.size());
bytesConstRef rlpBytes(packet.cropped(97, packet.size() - 97));
- Neighbors in = Neighbors::fromBytesConstRef(to, rlpBytes);
+ Neighbours in = Neighbours::fromBytesConstRef(to, rlpBytes);
int count = 0;
for (auto n: in.nodes)
{
@@ -164,10 +164,10 @@ BOOST_AUTO_TEST_CASE(test_neighbors_packet)
}
}
-BOOST_AUTO_TEST_CASE(test_findnode_neighbors)
+BOOST_AUTO_TEST_CASE(test_findnode_neighbours)
{
// Executing findNode should result in a list which is serialized
- // into Neighbors packet. Neighbors packet should then be deserialized
+ // into Neighbours packet. Neighbours packet should then be deserialized
// into the same list of nearest nodes.
}