diff options
| author | Neal Norwitz <nnorwitz@gmail.com> | 2006-05-30 04:19:21 (GMT) |
|---|---|---|
| committer | Neal Norwitz <nnorwitz@gmail.com> | 2006-05-30 04:19:21 (GMT) |
| commit | 80af59cbd41505f7d305b0c8ee32e7eb9ef98b4d (patch) | |
| tree | 368db0256b24d24decd8f65c488d08716e14251b /Objects | |
| parent | 9b10f7e0cbacad9be6375f0e6dbf70cf18574e6b (diff) | |
| download | cpython-80af59cbd41505f7d305b0c8ee32e7eb9ef98b4d.zip cpython-80af59cbd41505f7d305b0c8ee32e7eb9ef98b4d.tar.gz cpython-80af59cbd41505f7d305b0c8ee32e7eb9ef98b4d.tar.bz2 | |
Remove stray | in comment
Diffstat (limited to 'Objects')
| -rw-r--r-- | Objects/dictobject.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/dictobject.c b/Objects/dictobject.c index dd369a9..8d61362 100644 --- a/Objects/dictobject.c +++ b/Objects/dictobject.c @@ -578,7 +578,7 @@ PyDict_SetItem(register PyObject *op, PyObject *key, PyObject *value) * Quadrupling the size improves average dictionary sparseness * (reducing collisions) at the cost of some memory and iteration * speed (which loops over every possible entry). It also halves -| * the number of expensive resize operations in a growing dictionary. + * the number of expensive resize operations in a growing dictionary. * * Very large dictionaries (over 50K items) use doubling instead. * This may help applications with severe memory constraints. |