blob: 6f0332b41e43dae3cd2c6763a99653fc6423da14 (
plain) (
tree)
|
|
<HTML>
<HEAD>
<TITLE>Simply Scheme: Table of Scheme Primitives by Category</TITLE>
</HEAD>
<BODY>
<CITE>Simply Scheme</CITE>:
<CITE>Introducing Computer Science</CITE> 2/e Copyright (C) 1999 MIT
<H1>Table of Scheme Primitives by Category</H1>
<TABLE width="100%"><TR><TD>
<IMG SRC="../simply.jpg" ALT="cover photo">
<TD><TABLE>
<TR><TD align="right"><CITE><A HREF="http://www.cs.berkeley.edu/~bh/">Brian
Harvey</A><BR>University of California, Berkeley</CITE>
<TR><TD align="right"><CITE><A HREF="http://ccrma.stanford.edu/~matt">Matthew
Wright</A><BR>University of California, Santa Barbara</CITE>
<TR><TD align="right"><BR>
<TR><TD align="right"><A HREF="../pdf/ssch27.pdf">Download PDF version</A>
<TR><TD align="right"><A HREF="../ss-toc2.html">Back to Table of Contents</A>
<TR><TD align="right"><A HREF="https://people.eecs.berkeley.edu/~bh/ssch26/appuindex.html"><STRONG>BACK</STRONG></A>
chapter thread [no next]
<TR><TD align="right"><A HREF="http://mitpress.mit.edu/0262082810">MIT
Press web page for <CITE>Simply Scheme</CITE></A>
</TABLE></TABLE>
<HR>
<P>Use this table if you've forgotten the name of a primitive. Then
look in the index to find more about how to use the primitive.
<P><SUP>*</SUP> Not part of standard Scheme
<H2>Words and Sentences</H2>
<P><CODE>appearances</CODE><SUP>*</SUP><CODE>
<BR>before?</CODE><SUP>*</SUP><CODE>
<BR>butfirst (bf)</CODE><SUP>*</SUP><CODE>
<BR>butlast (bl)</CODE><SUP>*</SUP><CODE>
<BR>count</CODE><SUP>*</SUP><CODE>
<BR>empty?</CODE><SUP>*</SUP><CODE>
<BR>equal?</CODE><SUP>*</SUP><CODE>
<BR>first</CODE><SUP>*</SUP><CODE>
<BR>item</CODE><SUP>*</SUP><CODE>
<BR>last</CODE><SUP>*</SUP><CODE>
<BR>member?</CODE><SUP>*</SUP><CODE>
<BR>quote
<BR>sentence (se)</CODE><SUP>*</SUP><CODE>
<BR>sentence?</CODE><SUP>*</SUP><CODE>
<BR>word</CODE><SUP>*</SUP><CODE>
<BR>word?</CODE><SUP>*</SUP>
</CODE><H2>Lists</H2>
<P><CODE>append
<BR>assoc
<BR>car
<BR>cdr
<BR>c...r
<BR>cons
<BR>filter</CODE><SUP>*</SUP><CODE>
<BR>for-each
<BR>length
<BR>list
<BR>list?
<BR>list-ref
<BR>map
<BR>member
<BR>null?
<BR>reduce</CODE><SUP>*</SUP>
<H2>Trees</H2>
<P><CODE>children</CODE><SUP>*</SUP><CODE>
<BR>datum</CODE><SUP>*</SUP><CODE>
<BR>make-node</CODE><SUP>*</SUP>
<H2>Arithmetic</H2>
<P><CODE>+</CODE>, <CODE>-</CODE>, <CODE>*</CODE>, <CODE>/</CODE>
<BR><CODE><</CODE>, <CODE><=</CODE>, <CODE>=</CODE>, <CODE>></CODE>, <CODE>>=</CODE>
<BR><CODE>abs
<BR>ceiling
<BR>cos
<BR>even?
<BR>expt
<BR>floor
<BR>integer?
<BR>log
<BR>max
<BR>min
<BR>number?
<BR>odd?
<BR>quotient
<BR>random
<BR>remainder
<BR>round
<BR>sin
<BR>sqrt
</CODE><H2>True and False</H2>
<P><CODE>and
<BR>boolean?
<BR>cond
<BR>if
<BR>not
<BR>or
</CODE><H2>Variables</H2>
<P><CODE>define
<BR>let
</CODE><H2>Vectors</H2>
<P><CODE>list->vector
<BR>make-vector
<BR>vector
<BR>vector?
<BR>vector-length
<BR>vector->list
<BR>vector-ref
<BR>vector-set!
</CODE><H2>Procedures</H2>
<P><CODE>apply
<BR>lambda
<BR>procedure?
</CODE><H2>Higher-OrderProcedures</H2>
<P><CODE>accumulate</CODE><SUP>*</SUP><CODE>
<BR>every</CODE><SUP>*</SUP><CODE>
<BR>filter</CODE><SUP>*</SUP><CODE>
<BR>for-each
<BR>keep</CODE><SUP>*</SUP><CODE>
<BR>map
<BR>reduce</CODE><SUP>*</SUP><CODE>
<BR>repeated</CODE><SUP>*</SUP>
<H2>Control</H2>
<P><CODE>begin
<BR>error
<BR>load
<BR>trace
<BR>untrace
</CODE><H2>Input/Output</H2>
<P><CODE>align</CODE><SUP>*</SUP><CODE>
<BR>display
<BR>newline
<BR>read
<BR>read-line</CODE><SUP>*</SUP><CODE>
<BR>read-string</CODE><SUP>*</SUP><CODE>
<BR>show</CODE><SUP>*</SUP><CODE>
<BR>show-line</CODE><SUP>*</SUP><CODE>
<BR>write
</CODE><H2>Files and Ports</H2>
<P><CODE>close-all-ports</CODE><SUP>*</SUP><CODE>
<BR>close-input-port
<BR>close-output-port
<BR>eof-object?
<BR>open-input-file
<BR>open-output-file
<P>
<P><SUP>*</SUP> Not part of standard Scheme
<HR>
<P><A HREF="../ss-toc2.html">(back to Table of Contents)</A><P>
<A HREF="appindex.html"><STRONG>BACK</STRONG></A>
chapter thread [no next]
<P>
<ADDRESS>
<A HREF="../index.html">Brian Harvey</A>,
<CODE>bh@cs.berkeley.edu</CODE>
</ADDRESS>
</BODY>
</HTML>
|