Fundamentals of Computer Science I: Media Computing (CS151.02 2007F)
[Skip to Body]
Primary:
[Front Door]
[Glance]
-
[Academic Honesty]
[Instructions]
Current:
[Outline]
[EBoard]
[Reading]
[Lab]
[Assignment]
Groupings:
[Assignments]
[EBoards]
[Examples]
[Exams]
[Handouts]
[Labs]
[Outlines]
[Projects]
[Readings]
[Reference]
Reference:
[Scheme Report (R5RS)]
[Scheme Reference]
[DrScheme Manual]
Related Courses:
[CSC151.01 2007F (Davis)]
[CSC151 2007S (Rebelsky)]
[CSCS151 2005S (Stone)]
This list of procedures is also available in PDF.
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
Non-Alphabetic.
(+ val1 ... valn)
(- val)
(- val1 val2 ... valn)
(* val1 ... valn)
(/ val1 val2 ... valn)
(= num1 num2)
(< num1 num2 ... numn)
(<= num1 num2 ... numn)
(> num1 num2 ... numn)
(>= num1 num2 ... numn)
#f
#t
(and exp1 exp2 ... expn)
(append lst1 lst2)
(caar lst)
(cadr lst)
(car lst)
(cdar lst)
(cddr lst)
(cdr lst)
(ceiling num)
(cname->rgb string)
color.black
color.blue
color.green
(cname.list)
(cname.list str)
color.red
color.white
(compose f g)
(cond (test1 consequent1) (test2 consequent2) ... (testn consequentn) (else alternative))
(cons value lst)
(cos angle)
(define name expression)
(exact? num)
(expt num power)
(floor num)
(foreach! func list)
(if test consequent alternative)
#f
), evaluate and return alternative.(image? val)
(image.get-pixel image column row)
(image.height image)
(image.load filename)
(image.map fun image)
(image.map! fun image)
(image.new width height)
(image.set-pixel! image column row rgb-color)
(image.show image)
(image.transform-pixel! image col row func)
(integer? val)
(image.width image)
(inexact? num)
(lambda (params) body)
(left-section proc left)
(lambda (x) (proc left x))
.(length lst)
(let ((name1 exp1) ... (namen exp1)) body)
(let proc ((param1 init1) ... (paramn init1)) body)
(letrec ((name1 exp1) ... (namen exp1)) body)
let
, except that it works for recursive procedures. (The particularly technique used is not important.)(list val1 ... valn)
(list-ref lst n)
(log num)
(l-s proc left)
(lambda (x) (proc left x))
.(map fun lst)
(max num1 ... numn)
(min num1 ... numn)
(modulo value modulus)
remainder
, except guarantees that the result has the same sign as the modulus. For positive modulus, returns a value in the range 0..modulus-1, inclusive.nil
(not exp)
#t
). Otherwise, returns false (#f
).(or exp1 exp2 ... expn)
pi
(position.col pos)
(position.new col row)
(position.row pos)
(quotient dividend divisor)
(real? value)
(region.compute-pixels! image first-col first-row last-col last-row function)
(remainder dividend divisor)
(reverse lst)
(rgb? value)
(rgb.blue color)
(rgb.bluer rgb-color)
(rgb.complement rgb-color)
(rgb.darker rgb-color)
(rgb.green color)
(rgb.greener rgb-color)
(rgb.lighter rgb-color)
(rgb.map fun color)
(rgb.new r g b)
(rgb.red color)
(rgb.redder rgb-color)
(rgb.rotate rgb-color)
(rgb->rgb-list color)
(rgb->string color)
(right-section proc left)
(lambda (x) (proc x right))
.(round num)
(r-s proc left)
(lambda (x) (proc x right))
.(sin angle)
(sqrt num)
(truncate num)
[Skip to Body]
Primary:
[Front Door]
[Glance]
-
[Academic Honesty]
[Instructions]
Current:
[Outline]
[EBoard]
[Reading]
[Lab]
[Assignment]
Groupings:
[Assignments]
[EBoards]
[Examples]
[Exams]
[Handouts]
[Labs]
[Outlines]
[Projects]
[Readings]
[Reference]
Reference:
[Scheme Report (R5RS)]
[Scheme Reference]
[DrScheme Manual]
Related Courses:
[CSC151.01 2007F (Davis)]
[CSC151 2007S (Rebelsky)]
[CSCS151 2005S (Stone)]
Disclaimer:
I usually create these pages on the fly
, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Sun Nov 25 14:05:14 2007.
The source to the document was last modified on Mon Nov 5 14:00:09 2007.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2007F/Reference/index.html
.
You may wish to
validate this document's HTML
;
;
http://creativecommons.org/licenses/by-nc/2.5/
or send a letter to Creative Commons, 543 Howard Street, 5th Floor,
San Francisco, California, 94105, USA.