commit 6ce35a9691404351966c003c7deb161e14c13af2
author Andrew M. Kuchling <amk@amk.ca> Sat Apr 22 01:58:40 2006 +0000
committer Andrew M. Kuchling <amk@amk.ca> Sat Apr 22 01:58:40 2006 +0000
tree e471e5892738291f88e66c57b808148484ed8514
parent 3ccdb6ab36db19c79644d5f5bda799f3fcc78aaa

Fix comment typo

Modules/rotatingtree.h

diff --git a/Modules/rotatingtree.h b/Modules/rotatingtree.h
index 97cc8e8..3aa0986 100644
--- a/Modules/rotatingtree.h
+++ b/Modules/rotatingtree.h
@@ -4,7 +4,7 @@
  *
  * It's a dict-like data structure that works best when accesses are not
  * random, but follow a strong pattern.  The one implemented here is for
- * accesses patterns where the same small set of keys is looked up over
+ * access patterns where the same small set of keys is looked up over
  * and over again, and this set of keys evolves slowly over time.
  */