summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorFred Drake <fdrake@acm.org>2001-09-18 17:58:20 (GMT)
committerFred Drake <fdrake@acm.org>2001-09-18 17:58:20 (GMT)
commit18d8d5a708dda187e1ff733f955920d7d5723446 (patch)
tree14db8fefe005aba3f38e359897d946497e37054b
parent624c8af706ee13203e07e9f2ad6940a53ad2a78d (diff)
downloadcpython-18d8d5a708dda187e1ff733f955920d7d5723446.zip
cpython-18d8d5a708dda187e1ff733f955920d7d5723446.tar.gz
cpython-18d8d5a708dda187e1ff733f955920d7d5723446.tar.bz2
Fix minor usage and consistency nits.
-rw-r--r--Doc/ref/ref3.tex9
1 files changed, 5 insertions, 4 deletions
diff --git a/Doc/ref/ref3.tex b/Doc/ref/ref3.tex
index d5711d2..4f1e388 100644
--- a/Doc/ref/ref3.tex
+++ b/Doc/ref/ref3.tex
@@ -1145,9 +1145,10 @@ multiplication (meaning repetition) by defining the methods
\method{__mul__()}, \method{__rmul__()} and \method{__imul__()} described
below; they should not define \method{__coerce__()} or other numerical
operators. It is recommended that both mappings and sequences
-implement the \method{__contains__}, to allow efficient use of the
-\code{in} operator; for mappings, \code{in} should be equivalent of
-\method{has_key()}; for sequences, it should search through the values.
+implement the \method{__contains__()} method to allow efficient use of
+the \code{in} operator; for mappings, \code{in} should be equivalent
+of \method{has_key()}; for sequences, it should search through the
+values.
\withsubitem{(mapping object method)}{
\ttindex{keys()}
\ttindex{values()}
@@ -1310,7 +1311,7 @@ the \method{__*item__()} methods.
Calling \code{max(0, i)} conveniently returns the proper value.
The membership test operators (\keyword{in} and \keyword{not in}) are
-normally implemented as iteration loop through the sequence. However,
+normally implemented as an iteration through the sequence. However,
sequence objects can supply the following special method with a more
efficient implementation: