From 9047a6298be9a3fb3bf95a76543d6c70af68c18b Mon Sep 17 00:00:00 2001 From: jim Date: Wed, 29 Apr 2015 11:04:32 -0400 Subject: [PATCH] add anchors --- exercises/assignment12.mdwn | 2 ++ 1 file changed, 2 insertions(+) diff --git a/exercises/assignment12.mdwn b/exercises/assignment12.mdwn index 58068c4f..02a78ac7 100644 --- a/exercises/assignment12.mdwn +++ b/exercises/assignment12.mdwn @@ -290,6 +290,7 @@ Here are the beginnings of functions to move from one focused tree to another: # next2 ();; - : int option = None + ## Same-fringe using streams ## Now we'll describe a different way to create "the little subprograms" that we built above with `make_fringe_enumerator`. This code will make use of a data structure called a "stream". A stream is like a list in that it wraps a series of elements of a single type. It differs from a list in that the tail of the series is left uncomputed until needed. We turn the stream off and on by thunking it, nad by forcing the thunk. @@ -364,6 +365,7 @@ Some other Scheme details or reminders: + 4. Here is the Scheme code handling the same-fringe problem. You should fill in the blanks: (define (lazy-flatten tree) -- 2.11.0