The data objects used until now all remained there form while they exist. Now, the concept of state and the change of state is discussed. Primitives are introduced that change the state of an object. This forces us to look at the implications of state change.
MUST | |||
SICP 3.1 | Assignment and Local State | 6.1 | Local state |
6.2 | State variables | ||
6.3 | Object-oriented view of a system | ||
SICP 3.1.1 | Local State Variables | 6.4 | Objects with (time-varying) state |
6.5 | set! | ||
6.6 | sequence! | ||
SICP 3.1.2 | The Costs of Introducing Assignment | 6.7 | Substitutions Model invalid |
6.8 | Sameness | ||
SICP 3.3 | Modeling with Mutable Data | 6.9 | Mutators |
SICP 3.3.1 | Mutable List Structures | 6.10 | set-car! |
6.11 | set-cdr! | ||
6.12 | Sharing andindentity | ||
6.13 | Mutation == Assignment | ||
SICP 3.3.2 | Representing Queues | 6.14 | Queue |
6.15 | Queue implementation | ||
SHOULD | |||
COULD | |||
SICP 3.3.3 | Representing Tables | How to implement efficient tables used in data-directed programming | |
SICP 3.1.3 | The Benefits of Introducing Assignment | Implementing Random number generators |
10