mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-11-03 19:34:08 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

Changes to some math using underscore as subscript, necessary since

Browse source 
the new style file defines underscore as an underscore in tt font.
This commit is contained in:
Guido van Rossum 1992-12-17 15:31:02 +00:00
parent 16b22193e6
commit 4ac605e627
3 changed files with 6 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

3
Doc/Makefile
View file

@ -13,6 +13,7 @@ tut:
ref: ref:
touch ref.ind touch ref.ind
latex ref latex ref
./fix_hack ref.idx
makeindex ref makeindex ref
latex ref latex ref
dvips ref >ref.ps dvips ref >ref.ps
@ -38,7 +39,7 @@ libinfo:
sh fix.sh sh fix.sh
clean: clean:
rm -f @* *~ *.aux *.idx *.ilg *.ind *.log *.toc *.blg *.bbl rm -f @* *~ *.aux *.idx *.ilg *.ind *.log *.toc *.blg *.bbl *.pyc
# Sources: .tex, .bib, .sty # Sources: .tex, .bib, .sty
# Useful results: .dvi, .ps # Useful results: .dvi, .ps

2
Doc/ref/ref5.tex
View file

@ -523,12 +523,14 @@ evaluated only once (but in both cases $z$ is not evaluated at all
when $x < y$ is found to be false). when $x < y$ is found to be false).
\indexii{chaining}{comparisons} \indexii{chaining}{comparisons}
\catcode`\_=8
Formally, $e_0 op_1 e_1 op_2 e_2 ...e_{n-1} op_n e_n$ is equivalent to Formally, $e_0 op_1 e_1 op_2 e_2 ...e_{n-1} op_n e_n$ is equivalent to
$e_0 op_1 e_1$ \verb\and\ $e_1 op_2 e_2$ \verb\and\ ... \verb\and\ $e_0 op_1 e_1$ \verb\and\ $e_1 op_2 e_2$ \verb\and\ ... \verb\and\
$e_{n-1} op_n e_n$, except that each expression is evaluated at most once. $e_{n-1} op_n e_n$, except that each expression is evaluated at most once.
Note that $e_0 op_1 e_1 op_2 e_2$ does not imply any kind of comparison Note that $e_0 op_1 e_1 op_2 e_2$ does not imply any kind of comparison
between $e_0$ and $e_2$, e.g. $x < y > z$ is perfectly legal. between $e_0$ and $e_2$, e.g. $x < y > z$ is perfectly legal.
\catcode`\_=12
The forms \verb\<>\ and \verb\!=\ are equivalent; for consistency with The forms \verb\<>\ and \verb\!=\ are equivalent; for consistency with
C, \verb\!=\ is preferred; where \verb\!=\ is mentioned below C, \verb\!=\ is preferred; where \verb\!=\ is mentioned below

2
Doc/ref5.tex
View file

@ -523,12 +523,14 @@ evaluated only once (but in both cases $z$ is not evaluated at all
when $x < y$ is found to be false). when $x < y$ is found to be false).
\indexii{chaining}{comparisons} \indexii{chaining}{comparisons}
\catcode`\_=8
Formally, $e_0 op_1 e_1 op_2 e_2 ...e_{n-1} op_n e_n$ is equivalent to Formally, $e_0 op_1 e_1 op_2 e_2 ...e_{n-1} op_n e_n$ is equivalent to
$e_0 op_1 e_1$ \verb\and\ $e_1 op_2 e_2$ \verb\and\ ... \verb\and\ $e_0 op_1 e_1$ \verb\and\ $e_1 op_2 e_2$ \verb\and\ ... \verb\and\
$e_{n-1} op_n e_n$, except that each expression is evaluated at most once. $e_{n-1} op_n e_n$, except that each expression is evaluated at most once.
Note that $e_0 op_1 e_1 op_2 e_2$ does not imply any kind of comparison Note that $e_0 op_1 e_1 op_2 e_2$ does not imply any kind of comparison
between $e_0$ and $e_2$, e.g. $x < y > z$ is perfectly legal. between $e_0$ and $e_2$, e.g. $x < y > z$ is perfectly legal.
\catcode`\_=12
The forms \verb\<>\ and \verb\!=\ are equivalent; for consistency with The forms \verb\<>\ and \verb\!=\ are equivalent; for consistency with
C, \verb\!=\ is preferred; where \verb\!=\ is mentioned below C, \verb\!=\ is preferred; where \verb\!=\ is mentioned below