'#hash(("Key1" . "Value1") ("Key2" . "Value2") ...) — How Racket
prints hash tables. Also how you create a new immutable hash table.
(make-hash) — create a new mutable hash table.
(hash-ref hash key) — Look up a value in a hash table.
(hash-set! hash key value) — Change the value associated with
a key in a mutable hash table.
(hash-remove! hash key) — Remove a key/value pair from a mutable hash table.
(hash-has-key? hash key) — Determine if a key appears in a hash table.
(hash-set immutable-hash key value) — Like hash-set!, but for
immutable hash tables.
(hash-remove immutable-hash key) — Like hash-remove, but for
immutable hash tables.
(hash-keys hash) — Get a list of keys from the hash table.
(for-each proc! lst) — Somewhat like map; apply proc! to each
element of the list, throwing away the result of proc!.
a. Review your answers to the self-check problems from the reading.
b. Decide which partner will be Side A and which partner will be Side B.
c. Grab your respective code files
d. Review any provided code at the top of the file.
This lab was (mostly) newly written in spring 2019 by various CS faculty.
The cartoon sidekicks example was drawn from a lab written by Benjamin Gum in the early 2000’s. Samuel A. Rebelsky likely added Asterix and Obelix and almost certainly added Strong Bad and his cohort.
Jane Eyre is by Charlotte Bronte.