[Python-checkins] r51115 - python/trunk/Objects/dictnotes.txt python/trunk/Objects/dictobject.c

Fri Aug 4 22:37:43 CEST 2006

Author: andrew.kuchling
Date: Fri Aug 4 22:37:43 2006
New Revision: 51115
Modified:
 python/trunk/Objects/dictnotes.txt
 python/trunk/Objects/dictobject.c
Log:
Typo fixes
Modified: python/trunk/Objects/dictnotes.txt
==============================================================================

--- python/trunk/Objects/dictnotes.txt	(original)
+++ python/trunk/Objects/dictnotes.txt	Fri Aug 4 22:37:43 2006
@@ -243,7 +243,7 @@
 Caching Lookups
 ---------------
 The idea is to exploit key access patterns by anticipating future lookups
-based of previous lookups.
+based on previous lookups.
 
 The simplest incarnation is to save the most recently accessed entry.
 This gives optimal performance for use cases where every get is followed
Modified: python/trunk/Objects/dictobject.c
==============================================================================
--- python/trunk/Objects/dictobject.c	(original)
+++ python/trunk/Objects/dictobject.c	Fri Aug 4 22:37:43 2006
@@ -532,7 +532,7 @@
 /* Note that, for historical reasons, PyDict_GetItem() suppresses all errors
 * that may occur (originally dicts supported only string keys, and exceptions
 * weren't possible). So, while the original intent was that a NULL return
- * meant the key wasn't present, it reality it can mean that, or that an error
+ * meant the key wasn't present, in reality it can mean that, or that an error
 * (suppressed) occurred while computing the key's hash, or that some error
 * (suppressed) occurred when comparing keys in the dict's internal probe
 * sequence. A nasty example of the latter is when a Python-coded comparison
