aboutsummaryrefslogtreecommitdiff
path: root/src/addrman.h
diff options
context:
space:
mode:
authorJeff Garzik <jgarzik@exmulti.com>2012-08-01 10:56:47 -0700
committerJeff Garzik <jgarzik@exmulti.com>2012-08-01 10:56:47 -0700
commitf81e6f779b66e235afd6c5241306d5e70ec41276 (patch)
tree208e1d5fb7b77c41e67edb372e2590250c32faac /src/addrman.h
parentffe47d6d5d6ddfc0ad145f5a891e2165c3d69009 (diff)
parentb49f1398a1a02eab06def81a9d25b972c81b8fe1 (diff)
downloadbitcoin-f81e6f779b66e235afd6c5241306d5e70ec41276.tar.xz
Merge pull request #1632 from luke-jr/spelling
Fix spelling and grammar errors
Diffstat (limited to 'src/addrman.h')
-rw-r--r--src/addrman.h10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/addrman.h b/src/addrman.h
index 0392654366..7c141c427b 100644
--- a/src/addrman.h
+++ b/src/addrman.h
@@ -117,7 +117,7 @@ public:
// * Bucket selection is based on cryptographic hashing, using a randomly-generated 256-bit key, which should not
// be observable by adversaries.
// * Several indexes are kept for high performance. Defining DEBUG_ADDRMAN will introduce frequent (and expensive)
-// consistency checks for the entire datastructure.
+// consistency checks for the entire data structure.
// total number of buckets for tried addresses
#define ADDRMAN_TRIED_BUCKET_COUNT 64
@@ -174,13 +174,13 @@ private:
// last used nId
int nIdCount;
- // table with information about all nId's
+ // table with information about all nIds
std::map<int, CAddrInfo> mapInfo;
// find an nId based on its network address
std::map<CNetAddr, int> mapAddr;
- // randomly-ordered vector of all nId's
+ // randomly-ordered vector of all nIds
std::vector<int> vRandom;
// number of "tried" entries
@@ -253,8 +253,8 @@ public:
// * nNew
// * nTried
// * number of "new" buckets
- // * all nNew addrinfo's in vvNew
- // * all nTried addrinfo's in vvTried
+ // * all nNew addrinfos in vvNew
+ // * all nTried addrinfos in vvTried
// * for each bucket:
// * number of elements
// * for each element: index