music

OSdata.com

lists

summary

    This subchapter looks at lists.

free computer programming text book project table of contents If you like the idea of this project, then please donate some money. more information on donating

stub section

    This subchapter is a stub section. It will be filled in with instructional material later. For now it serves the purpose of a place holder for the order of instruction.

    Professors are invited to give feedback on both the proposed contents and the propsed order of this text book. Send commentary to Milo, PO Box 1361, Tustin, California, 92781, USA.

lists

    This subchapter looks at lists.

functions

LISP    ATOM(x) — LISP predicate function that takes one argument of type s-list and returns whether or not the argument is an atom. ATOM returns T if the argument is an ATOM and returns NIL if the argument is not an atom.

LISP    APPEND(x) — LISP function that takes zero or more arguments of type list and creates a list that has those component lists in the designated order. Note in the example of APPEND '((A) (B)) ;((C) (D))) that APPEND returns ((A) (B) (C) (D)) rather than (A B C D).

LISP    ARG(x) — LISP function that takes one arguments of type fixed point number (as an index into a list) and extracts the desired argument from a list.

LISP    APPLY(x) — LISP function that takes two or three arguments of type function, type argument list, and optional type environ, and applies the designated function to the designated list.

Ada

other

   “Pointers also require sensible notation. np is just as mnemonic as nodepointer if you consistently use a naming convention from which np means “node pointer” is easily derived.” —Rob Pike, Notes on Programming in C, February 21, 1989

---