suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix latex output

Browse Source 
svn: r6469
This commit is contained in:
Matthew Flatt 2007-06-04 06:53:10 +00:00
parent d2f0b1756c
commit 2423d8bd2b
2 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
collects/scribble/latex-render.ss
View File

@ -54,6 +54,7 @@
(printf "\\definecolor{PaleBlue}{rgb}{0.90,0.90,1.0}\n") (printf "\\definecolor{PaleBlue}{rgb}{0.90,0.90,1.0}\n")
(printf "\\definecolor{LightGray}{rgb}{0.90,0.90,0.90}\n") (printf "\\definecolor{LightGray}{rgb}{0.90,0.90,0.90}\n")
(printf "\\newcommand{\\schemeinput}[1]{\\colorbox{LightGray}{\\hspace{-0.5ex}\\schemeinputcol{#1}\\hspace{-0.5ex}}}\n") (printf "\\newcommand{\\schemeinput}[1]{\\colorbox{LightGray}{\\hspace{-0.5ex}\\schemeinputcol{#1}\\hspace{-0.5ex}}}\n")
(printf "\\newcommand{\\highlighted}[1]{\\colorbox{PaleBlue}{\\hspace{-0.5ex}\\schemeinputcol{#1}\\hspace{-0.5ex}}}\n")
(printf "\\begin{document}\n") (printf "\\begin{document}\n")
(when (part-title-content d) (when (part-title-content d)
(printf "\\title{") (printf "\\title{")

6
collects/scribblings/guide/lists.scrbl
View File

@ -266,7 +266,7 @@ Both the @scheme[my-length] and @scheme[my-map] procedures run in
imagining how @scheme[(my-length (list "a" "b" "c"))] must evaluate: imagining how @scheme[(my-length (list "a" "b" "c"))] must evaluate:
@schemeblock[ @schemeblock[
(my-length (list "a" "b" "c")) #||# (my-length (list "a" "b" "c"))
#,step (+ 1 (my-length (list "b" "c"))) #,step (+ 1 (my-length (list "b" "c")))
#,step (+ 1 (+ 1 (my-length (list "c")))) #,step (+ 1 (+ 1 (my-length (list "c"))))
#,step (+ 1 (+ 1 (+ 1 (my-length (list))))) #,step (+ 1 (+ 1 (+ 1 (my-length (list)))))
@ -300,7 +300,7 @@ argument @scheme[len]:
Now evaluation looks like this: Now evaluation looks like this:
@schemeblock[ @schemeblock[
(my-length (list "a" "b" "c")) #||# (my-length (list "a" "b" "c"))
#,step (iter (list "a" "b" "c") 0) #,step (iter (list "a" "b" "c") 0)
#,step (iter (list "b" "c") 1) #,step (iter (list "b" "c") 1)
#,step (iter (list "c") 2) #,step (iter (list "c") 2)
@ -397,7 +397,7 @@ duplicates, it returns the result of a @scheme[remove-dups] call
directly, so the tail-call ``optimization'' kicks in: directly, so the tail-call ``optimization'' kicks in:
@schemeblock[ @schemeblock[
(remove-dups (list "a" "b" "b" "b" "b" "b")) #||# (remove-dups (list "a" "b" "b" "b" "b" "b"))
#,step (cons "a" (remove-dups (list "b" "b" "b" "b" "b"))) #,step (cons "a" (remove-dups (list "b" "b" "b" "b" "b")))
#,step (cons "a" (remove-dups (list "b" "b" "b" "b"))) #,step (cons "a" (remove-dups (list "b" "b" "b" "b")))
#,step (cons "a" (remove-dups (list "b" "b" "b"))) #,step (cons "a" (remove-dups (list "b" "b" "b")))