traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix comment typo

This commit is contained in:
Andrew M. Kuchling 2006-04-22 01:58:40 +00:00
parent 3ccdb6ab36
commit 6ce35a9691
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Modules/rotatingtree.h
View File

@ -4,7 +4,7 @@
* *
* It's a dict-like data structure that works best when accesses are not * 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 * 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. * and over again, and this set of keys evolves slowly over time.
*/ */