aboutsummaryrefslogtreecommitdiff
path: root/src/cuckoocache.h
diff options
context:
space:
mode:
authorpracticalswift <practicalswift@users.noreply.github.com>2017-01-18 16:15:37 +0100
committerpracticalswift <practicalswift@users.noreply.github.com>2017-01-27 21:22:35 +0100
commitcc16d99f1dc8305b1b255f1cc0f2b1516aa77ed0 (patch)
treee07bb46576b327b22a3b2d0c8d51b7be29a13280 /src/cuckoocache.h
parenta7ea2f8fdbe9392bcbd4a219a42ebd9518d2e2ef (diff)
downloadbitcoin-cc16d99f1dc8305b1b255f1cc0f2b1516aa77ed0.tar.xz
[trivial] Fix typos in comments
Diffstat (limited to 'src/cuckoocache.h')
-rw-r--r--src/cuckoocache.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/cuckoocache.h b/src/cuckoocache.h
index efd6a820b5..ff47e9776b 100644
--- a/src/cuckoocache.h
+++ b/src/cuckoocache.h
@@ -257,7 +257,7 @@ private:
*
* First, epoch_check decrements and checks the cheap heuristic, and then does
* a more expensive scan if the cheap heuristic runs out. If the expensive
- * scan suceeds, the epochs are aged and old elements are allow_erased. The
+ * scan succeeds, the epochs are aged and old elements are allow_erased. The
* cheap heuristic is reset to retrigger after the worst case growth of the
* current epoch's elements would exceed the epoch_size.
*/
@@ -395,7 +395,7 @@ public:
* 1) On first iteration, last_loc == invalid(), find returns last, so
* last_loc defaults to locs[0].
* 2) On further iterations, where last_loc == locs[k], last_loc will
- * go to locs[k+1 % 8], i.e., next of the 8 indicies wrapping around
+ * go to locs[k+1 % 8], i.e., next of the 8 indices wrapping around
* to 0 if needed.
*
* This prevents moving the element we just put in.