diff options
| author | Andrew M. Kuchling <amk@amk.ca> | 2006-04-22 01:58:40 (GMT) |
|---|---|---|
| committer | Andrew M. Kuchling <amk@amk.ca> | 2006-04-22 01:58:40 (GMT) |
| commit | 6ce35a9691404351966c003c7deb161e14c13af2 (patch) | |
| tree | e471e5892738291f88e66c57b808148484ed8514 /Modules/rotatingtree.h | |
| parent | 3ccdb6ab36db19c79644d5f5bda799f3fcc78aaa (diff) | |
| download | cpython-6ce35a9691404351966c003c7deb161e14c13af2.zip cpython-6ce35a9691404351966c003c7deb161e14c13af2.tar.gz cpython-6ce35a9691404351966c003c7deb161e14c13af2.tar.bz2 | |
Fix comment typo
Diffstat (limited to 'Modules/rotatingtree.h')
| -rw-r--r-- | Modules/rotatingtree.h | 2 |
1 files changed, 1 insertions, 1 deletions
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. */ |