summary refs log tree commit diff stats
path: root/doc/curses.ascii.html
blob: 1c361b0a9b0fcab9006015e6ba96476a66342cdc (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module curses.ascii</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head><body bgcolor="#f0f0f8">

<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial">&nbsp;<br><big><big><strong><a href="curses.html"><font color="#ffffff">curses</font></a>.ascii</strong></big></big></font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="file:/usr/lib/python3.1/curses/ascii.py">/usr/lib/python3.1/curses/ascii.py</a><br><a href="http://docs.python.org/library/curses.ascii">Module Docs</a></font></td></tr></table>
    <p><tt>Constants&nbsp;and&nbsp;membership&nbsp;tests&nbsp;for&nbsp;ASCII&nbsp;characters</tt></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#eeaa77">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Functions</strong></big></font></td></tr>
    
<tr><td bgcolor="#eeaa77"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl><dt><a name="-alt"><strong>alt</strong></a>(c)</dt></dl>
 <dl><dt><a name="-ascii"><strong>ascii</strong></a>(c)</dt></dl>
 <dl><dt><a name="-ctrl"><strong>ctrl</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isalnum"><strong>isalnum</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isalpha"><strong>isalpha</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isascii"><strong>isascii</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isblank"><strong>isblank</strong></a>(c)</dt></dl>
 <dl><dt><a name="-iscntrl"><strong>iscntrl</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isctrl"><strong>isctrl</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isdigit"><strong>isdigit</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isgraph"><strong>isgraph</strong></a>(c)</dt></dl>
 <dl><dt><a name="-islower"><strong>islower</strong></a>(c)</dt></dl>
 <dl><dt><a name="-ismeta"><strong>ismeta</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isprint"><strong>isprint</strong></a>(c)</dt></dl>
 <dl><dt><a name="-ispunct"><strong>ispunct</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isspace"><strong>isspace</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isupper"><strong>isupper</strong></a>(c)</dt></dl>
 <dl><dt><a name="-isxdigit"><strong>isxdigit</strong></a>(c)</dt></dl>
 <dl><dt><a name="-unctrl"><strong>unctrl</strong></a>(c)</dt></dl>
</td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#55aa55">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Data</strong></big></font></td></tr>
    
<tr><td bgcolor="#55aa55"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><strong>ACK</strong> = 6<br>
<strong>BEL</strong> = 7<br>
<strong>BS</strong> = 8<br>
<strong>CAN</strong> = 24<br>
<strong>CR</strong> = 13<br>
<strong>DC1</strong> = 17<br>
<strong>DC2</strong> = 18<br>
<strong>DC3</strong> = 19<br>
<strong>DC4</strong> = 20<br>
<strong>DEL</strong> = 127<br>
<strong>DLE</strong> = 16<br>
<strong>EM</strong> = 25<br>
<strong>ENQ</strong> = 5<br>
<strong>EOT</strong> = 4<br>
<strong>ESC</strong> = 27<br>
<strong>ETB</strong> = 23<br>
<strong>ETX</strong> = 3<br>
<strong>FF</strong> = 12<br>
<strong>FS</strong> = 28<br>
<strong>GS</strong> = 29<br>
<strong>HT</strong> = 9<br>
<strong>LF</strong> = 10<br>
<strong>NAK</strong> = 21<br>
<strong>NL</strong> = 10<br>
<strong>NUL</strong> = 0<br>
<strong>RS</strong> = 30<br>
<strong>SI</strong> = 15<br>
<strong>SO</strong> = 14<br>
<strong>SOH</strong> = 1<br>
<strong>SP</strong> = 32<br>
<strong>STX</strong> = 2<br>
<strong>SUB</strong> = 26<br>
<strong>SYN</strong> = 22<br>
<strong>TAB</strong> = 9<br>
<strong>US</strong> = 31<br>
<strong>VT</strong> = 11<br>
<strong>controlnames</strong> = ['NUL', 'SOH', 'STX', 'ETX', 'EOT', 'ENQ', 'ACK', 'BEL', 'BS', 'HT', 'LF', 'VT', 'FF', 'CR', 'SO', 'SI', 'DLE', 'DC1', 'DC2', 'DC3', ...]</td></tr></table>
</body></html>
span>A HREF="v2-toc2.html#ch13">Example: Fourier Series Plotter</A> (<A HREF="pdf/v2ch13.pdf">PDF</A>) (<A HREF="v2ch13/fourie.html">HTML</A>) <LI><A HREF="v2-toc2.html#refman">Berkeley Logo Reference Manual</A> (<A HREF="pdf/v2ch14.pdf">backmatter in PDF</A>) (<A HREF="v2ch14/manual.html">HTML</A>)<BR> &nbsp;&nbsp;&nbsp;&nbsp;<SMALL><SMALL>The PDF link is to the published book; the HTML link is to the current Berkeley Logo manual (HTML and PDF).</SMALL></SMALL> <LI>Index of Defined Procedures (<A HREF="v2ch14/appuindex.html">HTML</A>) <LI>General Index (<A HREF="v2ch14/appindex.html">HTML</A>) </UL> <HR> <TABLE><TR><TD><H3>Preface</H3><TD> (<A HREF="pdf/v2ch00.pdf">frontmatter in PDF</A>) (<A HREF="v2ch0/preface.html">HTML</A>) </TABLE> <UL> <LI>About the projects <LI>About this series <LI>How to read this book. </UL> <TABLE><TR><TD><H3>Acknowledgments</H3><TD> (<A HREF="v2ch0/ack.html">HTML</A>) </TABLE> <TABLE><TR><TD><H3><A name="ch1">1. Data Files</A></H3><TD> (<A HREF="pdf/v2ch01.pdf">PDF</A>) (<A HREF="v2ch1/files.html">HTML</A>) </TABLE> <UL> <LI>Reader and Writer <LI>End of File <LI>Case Sensitivity <LI>Dribble Files <LI>A Text Formatter <LI>Page Geometry <LI>The Program <LI>Improving the Formatter </UL> <TABLE><TR><TD><H3><A name="ch2">2. Example: Finding File Differences</A></H3><TD> (<A HREF="pdf/v2ch02.pdf">PDF</A>) (<A HREF="v2ch2/diff.html">HTML</A>) </TABLE> <P> <I>This project is an implementation in Logo of the often-needed utility program to find the changes between two versions of a file.</I> <UL> <LI>Program Overview <LI>The File Information Block Abstract Data Type <LI>Saving and Re-Reading Input Lines <LI>Skipping Equal Lines <LI>Comparing and Remembering Unequal Lines <LI>Reporting a Difference <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch3">3. Nonlocal Exit</A></H3><TD> (<A HREF="pdf/v2ch03.pdf">PDF</A>) (<A HREF="v2ch3/exit.html">HTML</A>) </TABLE> <UL> <LI>Quiz Program Revisited <LI>Nonlocal Exit and Modularity <LI>Nonlocal Output <LI>Catching Errors <LI>Ending It All </UL> <TABLE><TR><TD><H3><A name="ch4">4. Example: Solitaire</A></H3><TD> (<A HREF="pdf/v2ch04.pdf">PDF</A>) (<A HREF="v2ch4/solitaire.html">HTML</A>) </TABLE> <P> <I>This project deals a simulated deck of cards and allows the user to play a game of solitaire. The program checks for legal moves and displays the board layout.</I> <UL> <LI>The User Interface <LI>The Game of Solitaire <LI>Running the Program <LI>Program Structure <LI>Initialization <LI>Data Abstraction <LI>Stacks <LI>Program as Data <LI>Multiple Branching <LI>Further Explorations <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch5">5. Program as Data</A></H3><TD> (<A HREF="pdf/v2ch05.pdf">PDF</A>) (<A HREF="v2ch5/prgdat.html">HTML</A>) </TABLE> <UL> <LI><CODE>Text</CODE> and <CODE>Define</CODE> <LI>Automated Definition <LI>A Single-Keystroke Program Generator <LI>Procedure Cross-Reference Listings </UL> <TABLE><TR><TD><H3><A name="ch6">6. Example: BASIC Compiler</A></H3><TD> (<A HREF="pdf/v2ch06.pdf">PDF</A>) (<A HREF="v2ch6/basic.html">HTML</A>) </TABLE> <P> <I>This project is a first look at what it means to compile a program. It's simplified because it translates BASIC programs into Logo, rather than into machine language. But it introduces the ideas that will return in more realistic form in the third volume.</I> <UL> <LI>A Short Course in BASIC <LI>Using the BASIC Translator <LI>Overview of the Implementation <LI>The Reader <LI>The Parser <LI>The Code Generator <LI>The Runtime Library <LI>Further Explorations <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch7">7. Pattern Matcher</A></H3><TD> (<A HREF="pdf/v2ch07.pdf">PDF</A>) (<A HREF="v2ch7/match.html">HTML</A>) </TABLE> <P> <I>This program looks for patterns in a list. It can be used, for example, to recognize particular types of English sentences.</I> <UL> <LI>Reinventing <CODE>Equalp</CODE> for Lists <LI>A Simple Pattern Matcher <LI>Efficiency and Elegance <LI>Logo's Evaluation of Inputs <LI>Indirect Assignment <LI>Defaults <LI>Program as Data <LI>Parsing Rules <LI>Further Explorations <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch8">8. Property Lists</A></H3><TD> (<A HREF="pdf/v2ch08.pdf">PDF</A>) (<A HREF="v2ch8/plist.html">HTML</A>) </TABLE> <UL> <LI>Naming Properties <LI>Writing Property List Procedures in Logo <LI>Property Lists Aren't Variables <LI>How Language Designers Earn Their Pay <LI>Fast Replacement <LI>Defaults <LI>An Example: Family Trees </UL> <TABLE><TR><TD><H3><A name="ch9">9. Example: Doctor</A></H3><TD> (<A HREF="pdf/v2ch09.pdf">PDF</A>) (<A HREF="v2ch9/doctor.html">HTML</A>) </TABLE> <P> <I>This project uses the pattern matcher to carry out a conversation with the user, pretending to be a psychiatrist. It is a Logo version of a program originally written by Joseph Weizenbaum.</I> <UL> <LI>Eliza and Artificial Intelligence <LI>Eliza's Linguistic Strategy <LI>Stimulus-Response Psychology <LI>Property Lists <LI>Generated Symbols <LI>Modification of List Structure <LI>Linguistic Structure <LI>Further Explorations <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch10">10. Iteration, Control Structures, Extensibility</A></H3><TD> (<A HREF="pdf/v2ch10.pdf">PDF</A>) (<A HREF="v2ch10/iter.html">HTML</A>) </TABLE> <UL> <LI>Recursion as Iteration <LI>Numeric Iteration <LI>Logo: an Extensible Language <LI>No Perfect Control Structures <LI>Iteration Over a List <LI>Implementing <CODE>Apply</CODE> <LI>Mapping <LI>Mapping as a Metaphor <LI>Other Higher Order functions <LI>Mapping Over Trees <LI>Iteration and Tail Recursion <LI>Multiple Inputs to <CODE>For</CODE> <LI>The Evaluation Environment Bug </UL> <TABLE><TR><TD><H3><A name="ch11">11. Example: Cryptographer's Helper</A></H3><TD> (<A HREF="pdf/v2ch11.pdf">PDF</A>) (<A HREF="v2ch11/crypto.html">HTML</A>) </TABLE> <P> <I>This project is a tool to assist the user in solving cryptograms (simple substitution ciphers). It makes some guesses automatically, and records other guesses made by the user.</I> <UL> <LI>Program Structure <LI>Guided Tour of Global Variables <LI>What's in a Name? <LI>Flag Variables <LI>Iteration Over Letters <LI>Computed Variable Names <LI>Further Explorations <LI>Program Listing </UL> <TABLE><TR><TD><H3><A name="ch12">12. Macros</A></H3><TD> (<A HREF="pdf/v2ch12.pdf">PDF</A>) (<A HREF="v2ch12/macro.html">HTML</A>) </TABLE> <UL> <LI><CODE>Localmake</CODE> <LI>Backquote <LI>Implementing Iterative Commands <LI>Debugging Macros <LI>The Real Thing </UL> <TABLE><TR><TD><H3><A name="ch13">13. Example: Fourier Series Plotter</A></H3><TD> (<A HREF="pdf/v2ch13.pdf">PDF</A>) (<A HREF="v2ch13/fourie.html">HTML</A>) </TABLE> <P> <I>This program displays graphs of the Fourier (harmonics of sine waves) approximation to a square wave. It illustrates how harmonics are combined to control the timbres of notes in computer-generated music.</I> <UL> <LI>Square Waves <LI>Keyword Inputs <LI>Making the Variables Local <LI>Indirect Assignment <LI>Numeric Precision <LI>Dynamic Scope <LI>Further Explorations <LI>Program Listing </UL> <H2>Appendices</H2><TD> (<A HREF="pdf/v2ch14.pdf">backmatter in PDF</A>) </TABLE> <TABLE><TR><TD><H3><A name="refman">Berkeley Logo Reference Manual</A></H3><TD> (<A HREF="v2ch14/manual.html">HTML</A>) </TABLE> <UL> <LI>Entering and Leaving Logo <LI>Tokenization <LI>Data Structure Primitives <UL><LI>Constructors <LI>Selectors <LI>Mutators <LI>Predicates <LI>Queries </UL> <LI>Communication <UL><LI>Transmitters <LI>Receivers <LI>File Access <LI>Terminal Access </UL> <LI>Arithmetic <UL><LI>Numeric Operations <LI>Predicates <LI>Random Numbers <LI>Print Formatting <LI>Bitwise Operations </UL> <LI>Logical operations. <LI>Graphics <UL><LI>Turtle Motion <LI>Turtle Motion Queries <LI>Turtle and Window Control <LI>Turtle and Window Queries <LI>Pen and Background Control <LI>Pen Queries </UL> <LI>Workspace Management <UL><LI>Procedure Definition <LI>Variable Definition <LI>Property Lists <LI>Predicates <LI>Queries <LI>Inspection <LI>Workspace Control </UL> <LI>Control Structures <UL><LI>Template-Based Iteration <LI>Macros </UL> <LI>Error Processing <LI>Error Codes <LI>Special variables </UL> <TABLE><TR><TD><H3>Index of Defined Procedures</H3><TD> (<A HREF="v2ch14/appuindex.html">HTML</A>) </TABLE> <TABLE><TR><TD><H3>General Index</H3><TD> (<A HREF="v2ch14/appindex.html">HTML</A>) </TABLE> <P><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-2">MIT Press web page for <CITE>Computer Science Logo Style</CITE></A> <P> <ADDRESS> <A HREF="index.html">Brian Harvey</A>, <CODE>bh@cs.berkeley.edu</CODE> </ADDRESS> </BODY> </HTML>