Clean up whitespace

This commit is contained in:
Lassi Kortela 2022-08-04 19:01:44 +03:00
parent 779047cf8e
commit 40ca72d01a
3 changed files with 56 additions and 58 deletions

View File

@ -1,28 +1,28 @@
_ {} _ {}
H4 H3 H2 H1 { font-family: verdana, arial, helvetica; } H4 H3 H2 H1 { font-family: verdana, arial, helvetica; }
BLOCKQUOTE { width: 400px; } BLOCKQUOTE { width: 400px; }
P.item { width: 450px; margin: 0pt 0pt 10pt 0pt; } P.item { width: 450px; margin: 0pt 0pt 10pt 0pt; }
P.section { color: #669980; font-style: italic; font-weight: bold;} P.section { color: #669980; font-style: italic; font-weight: bold;}
P.quiet { color: #cccccc; } P.quiet { color: #cccccc; }
BODY { font-family: verdana, arial, helvetica; BODY { font-family: verdana, arial, helvetica;
font-size: 10pt; margin: 0pt; background:#ffffff;} font-size: 10pt; margin: 0pt; background:#ffffff;}
TABLE.doctable { } TABLE.doctable { }
TD { font-family: verdana, arial, helvetica; TD { font-family: verdana, arial, helvetica;
font-size: 10pt; } font-size: 10pt; }
TD.leftcol { background: #996680; width: 100px; } TD.leftcol { background: #996680; width: 100px; }
TD.maintitle { background: #669980; color: #ddffdd; TD.maintitle { background: #669980; color: #ddffdd;
text-align: right; padding: 2px 5px 2px 5px; } text-align: right; padding: 2px 5px 2px 5px; }
TD.leftedge { background: #999966; width: 100px; } TD.leftedge { background: #999966; width: 100px; }
TD.body { padding: 5px 10px 5px 5px; } TD.body { padding: 5px 10px 5px 5px; }
TD.announce { background: #ffffcc; } TD.announce { background: #ffffcc; }
TR.toprow { height: 100; } TR.toprow { height: 100; }
CODE { font-family: courier, courier new; color:#000088; } CODE { font-family: courier, courier new; color:#000088; }
FONT.output { font-family: courier, courier new; color:#AA0000; } FONT.output { font-family: courier, courier new; color:#AA0000; }
TABLE.db { background: #999999; } TABLE.db { background: #999999; }
A:link { text-decoration: none; A:link { text-decoration: none;
color: #cc0000; } color: #cc0000; }
A:visited { text-decoration: none; A:visited { text-decoration: none;
color: #880000; } color: #880000; }
A:hover { text-decoration: underline; A:hover { text-decoration: underline;
color: #ff0000; } color: #ff0000; }

View File

@ -21,9 +21,9 @@
</tr> </tr>
<tr> <tr>
<td class="leftedge"></td> <td class="body"> <td class="leftedge"></td> <td class="body">
<h3>Release History</h3> <h3>Release History</h3>
@ -40,7 +40,7 @@ the <a href="benchmark.html">benchmark page</a>. Other enhancements:
got faster due to just general tuning. The compiler helps a great got faster due to just general tuning. The compiler helps a great
deal for computationally-bound programs.</li> deal for computationally-bound programs.</li>
<li><b>New functions:</b> By analogy with Common LISP, <code>bound?</code>, <li><b>New functions:</b> By analogy with Common LISP, <code>bound?</code>,
<code>nconc</code> and <code>symbol-value</code>. For utility purposes, <code>nconc</code> and <code>symbol-value</code>. For utility purposes,
<code>getcwd</code>, <code>chdir</code>, <code>display*</code> (which <code>getcwd</code>, <code>chdir</code>, <code>display*</code> (which
displays each of its arguments in turn, displays each of its arguments in turn,
@ -76,7 +76,7 @@ time collecting garbage. Obviously, reducing garbage generation and
simplifying garbage collection would improve performance, and that was simplifying garbage collection would improve performance, and that was
done in this release, with the following two (internal) changes: </li> done in this release, with the following two (internal) changes: </li>
<li><b>Win32 port:</b> Project files are provided so vx-scheme can <li><b>Win32 port:</b> Project files are provided so vx-scheme can
compile ith Visual Studio .NET.</li> compile ith Visual Studio .NET.</li>
<li><b>Short Integers:</b> Internally, an integer that can fit in 24 <li><b>Short Integers:</b> Internally, an integer that can fit in 24
@ -85,11 +85,11 @@ allocated. This means that computations with small integers can
proceed with much less garbage generated. (Many classic LISP systems proceed with much less garbage generated. (Many classic LISP systems
use this trick.) The short arithmetic automatically expands to 32 use this trick.) The short arithmetic automatically expands to 32
bits when necessary, preserving the full range of 32-bit arithmetic bits when necessary, preserving the full range of 32-bit arithmetic
with no programmer intervention needed. Still no arbitrary-precision with no programmer intervention needed. Still no arbitrary-precision
arithmetic, though.</li> arithmetic, though.</li>
<li><b>Uniform cell-size:</b> Versions before this one had the <li><b>Uniform cell-size:</b> Versions before this one had the
concept of single- and double-size cells. While this saved a concept of single- and double-size cells. While this saved a
small amount of memory, it greatly complicated the garbage collector.</li> small amount of memory, it greatly complicated the garbage collector.</li>
</ul> </ul>
Consult the change log for more information. Consult the change log for more information.
@ -106,7 +106,7 @@ than <code>()</code> as in Common Lisp.)</li>
<li><b>Perl-style vector operations:</b> New functions <li><b>Perl-style vector operations:</b> New functions
<code>vector-shift!, vector-unshift!, vector-push!,</code> and <code>vector-shift!, vector-unshift!, vector-push!,</code> and
<code>vector-pop!</code> are provided. Shift and unshift work at the <code>vector-pop!</code> are provided. Shift and unshift work at the
left side of a vector, push and pop at the right. Vectors will left side of a vector, push and pop at the right. Vectors will
grow and shrink as needed.</li> grow and shrink as needed.</li>
<li><b>More testcases:</b>Three new testcases, adding 500 more lines <li><b>More testcases:</b>Three new testcases, adding 500 more lines
@ -114,14 +114,14 @@ to the suite.</li>
</ul> </ul>
</td></tr></table> </td></tr></table>
<p>I've started writing a <b>bytecode compiler</b>, which has been an <p>I've started writing a <b>bytecode compiler</b>, which has been an
interesting exercise. If that interests you drop me a interesting exercise. If that interests you drop me a
<a href="mailto:colin.smith@gmail.com">note</a>!</p> <a href="mailto:colin.smith@gmail.com">note</a>!</p>
<h3>Download</h3> <h3>Download</h3>
The easy-to-build source distribution is available here: The easy-to-build source distribution is available here:
<ul> <ul>
<li>Tar/gzip format: <code><a href= <li>Tar/gzip format: <code><a href=
"http://colin-smith.net/vx-scheme/vx-scheme-0.7.tgz">vx-scheme-0.7.tgz</a></code></li> "http://colin-smith.net/vx-scheme/vx-scheme-0.7.tgz">vx-scheme-0.7.tgz</a></code></li>
@ -134,13 +134,13 @@ Previous versions can be downloaded as well, but I don't recommend
them. Newer releases always pass a stronger test suite than older them. Newer releases always pass a stronger test suite than older
ones. The previous releases are 0.6 ones. The previous releases are 0.6
[<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.6.tgz">tgz</a>, [<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.6.tgz">tgz</a>,
<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.6.zip">zip</a>], <a href="http://colin-smith.net/vx-scheme/vx-scheme-0.6.zip">zip</a>],
0.5 0.5
[<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.5.tgz">tgz</a>, [<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.5.tgz">tgz</a>,
<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.5.zip">zip</a>], <a href="http://colin-smith.net/vx-scheme/vx-scheme-0.5.zip">zip</a>],
0.4 0.4
[<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.4.tgz">tgz</a>, [<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.4.tgz">tgz</a>,
<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.4.zip">zip</a>], <a href="http://colin-smith.net/vx-scheme/vx-scheme-0.4.zip">zip</a>],
and 0.3 (the first release) and 0.3 (the first release)
[<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.3.tgz">tgz</a>, [<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.3.tgz">tgz</a>,
<a href="http://colin-smith.net/vx-scheme/vx-scheme-0.3.zip">zip</a>]. <a href="http://colin-smith.net/vx-scheme/vx-scheme-0.3.zip">zip</a>].
@ -160,7 +160,7 @@ are too, drop me a note!</p>
Wind River. The brace indenting is a bit unorthodox. At Wind, the Wind River. The brace indenting is a bit unorthodox. At Wind, the
party line was always "they're nobody's favorite indenting rules, but party line was always "they're nobody's favorite indenting rules, but
we all use them, and therein lies the value." True enough. Now that we all use them, and therein lies the value." True enough. Now that
I've left WR to work at I've left WR to work at
<a href="http://www.google.com/"><font color="#0000ff"><b>G</font><font color="#ff0000">o</font><font color="#cccc00">o</font><font color="#0000ff">g</font><font color="#009900">l</font><font color="#ff0000">e</font></a></b>, <a href="http://www.google.com/"><font color="#0000ff"><b>G</font><font color="#ff0000">o</font><font color="#cccc00">o</font><font color="#0000ff">g</font><font color="#009900">l</font><font color="#ff0000">e</font></a></b>,
I've been tempted to reformat the code in a more mainstream style, I've been tempted to reformat the code in a more mainstream style,
though. Maybe next version.</p> though. Maybe next version.</p>
@ -216,7 +216,7 @@ above and then, in your simulator window, do</p>
<blockquote> <blockquote>
<pre> <pre>
<code><font class="output">-&gt;</font> scheme <code><font class="output">-&gt;</font> scheme
<font class="output">=&gt;</font> <font class="output">=&gt;</font>
</code> </code>
</pre> </pre>
</blockquote> </blockquote>
@ -270,7 +270,7 @@ native I/O system gives us.</p>
indebted to that given by Peter Norvig in <a indebted to that given by Peter Norvig in <a
href="http://www.norvig.com/paip.html">Paradigms of Artificial href="http://www.norvig.com/paip.html">Paradigms of Artificial
Intelligence Programming</a>) is complete, I don't have any big plans. Intelligence Programming</a>) is complete, I don't have any big plans.
Feel free to write if you're thinking of using this code for anything Feel free to write if you're thinking of using this code for anything
at all! at all!
<p class="quiet">Copyright &copy; 2002 Colin Smith.</p> <p class="quiet">Copyright &copy; 2002 Colin Smith.</p>
@ -284,4 +284,3 @@ _uacct = "UA-728799-1";
urchinTracker(); urchinTracker();
</script></body> </script></body>
</html> </html>

View File

@ -7,8 +7,8 @@
<meta name="Author" <meta name="Author"
content="Colin Smith"> content="Colin Smith">
<meta name="description" <meta name="description"
content="An implementation of Scheme for VxWorks."> content="An implementation of Scheme for VxWorks.">
<meta name="keywords" <meta name="keywords"
content="Scheme, Colin Smith, Google, Lisp, VxWorks, Real-Time"> content="Scheme, Colin Smith, Google, Lisp, VxWorks, Real-Time">
<link rel="stylesheet" type="text/css" href="css.css"> <link rel="stylesheet" type="text/css" href="css.css">
@ -70,7 +70,7 @@ standard is a marvel of concision, but still conceals within it about
200 procedures and special forms. I also considered how the Scheme 200 procedures and special forms. I also considered how the Scheme
language might be integrated with language might be integrated with
<a href="http://www.bluedonkey.org/cgi-bin/twiki/bin/view/Books/VxWorksCookBook">VxWorks</a>, an RTOS made by my former employer, <a href="http://www.bluedonkey.org/cgi-bin/twiki/bin/view/Books/VxWorksCookBook">VxWorks</a>, an RTOS made by my former employer,
<a href="http://www.windriver.com">Wind River</a> (today I work at <a href="http://www.windriver.com">Wind River</a> (today I work at
<a href="http://www.google.com/"><font color="#0000ff"><b>G</font><font color="#ff0000">o</font><font color="#cccc00">o</font><font color="#0000ff">g</font><font color="#009900">l</font><font color="#ff0000">e</font></a></b>). <a href="http://www.google.com/"><font color="#0000ff"><b>G</font><font color="#ff0000">o</font><font color="#cccc00">o</font><font color="#0000ff">g</font><font color="#009900">l</font><font color="#ff0000">e</font></a></b>).
That RTOS has a simple control shell based on C syntax, that's integrated That RTOS has a simple control shell based on C syntax, that's integrated
with the runtime symbol table. Could Scheme do that as well? I wanted with the runtime symbol table. Could Scheme do that as well? I wanted
@ -236,7 +236,7 @@ on the same semaphore.</p>
<blockquote> <blockquote>
<pre> <pre>
<code>=&gt; (let ((s (semBCreate 0 0))) <code>=&gt; (let ((s (semBCreate 0 0)))
(do ((i 0 (+ i 1))) ((= i 3) 'ok) (sp 'semTake s -1))) (do ((i 0 (+ i 1))) ((= i 3) 'ok) (sp 'semTake s -1)))
<font class="output">task spawned: id = 0x1cefaf8, name = t4 <font class="output">task spawned: id = 0x1cefaf8, name = t4
task spawned: id = 0x1ce7980, name = t5 task spawned: id = 0x1ce7980, name = t5
@ -269,7 +269,7 @@ for the architecture of your choice.</p>
</li> </li>
<li><b><a href="http://fedora.redhat.com/">Fedora</a></b><br> <li><b><a href="http://fedora.redhat.com/">Fedora</a></b><br>
<p class="item">I've recently installed Fedora Core 2 and I'm <p class="item">I've recently installed Fedora Core 2 and I'm
pretty happy with it. VxScheme works just fine on it.</p></li> pretty happy with it. VxScheme works just fine on it.</p></li>
<li><b><a href="http://www.cygwin.com/">Cygwin</a></b><br> <li><b><a href="http://www.cygwin.com/">Cygwin</a></b><br>
@ -292,9 +292,9 @@ cdr. They are required to contain 8-byte aligned addresses, leaving
the lower three bits free for tagging. The LSB is the "atom" tag, the lower three bits free for tagging. The LSB is the "atom" tag,
and the other two are for GC marking/freelist management.</p> and the other two are for GC marking/freelist management.</p>
<p>Integers that will fit in 24 bits are stored directly "in the <p>Integers that will fit in 24 bits are stored directly "in the
pointer" with no heap allocation. No special syntax is required pointer" with no heap allocation. No special syntax is required
to access this feature and spillover to 32-bit arithmetic is to access this feature and spillover to 32-bit arithmetic is
automatic (though such numbers come from cell storage).</p> automatic (though such numbers come from cell storage).</p>
<p>Garbage collection is straight mark &amp; sweep. We start with a <p>Garbage collection is straight mark &amp; sweep. We start with a
@ -505,14 +505,14 @@ body of the procedure is printed as well, instead of an
ellipsis.</p></li> ellipsis.</p></li>
<li><code>0x20: TRACE_GC_ALL</code><br> <li><code>0x20: TRACE_GC_ALL</code><br>
<p class="item">Trace all marking and sweeping activity. This is <p class="item">Trace all marking and sweeping activity. This is
only useful if you are tracking down a garbage collection bug. Having only useful if you are tracking down a garbage collection bug. Having
done this a few times, I can only offer my wish that this fate never done this a few times, I can only offer my wish that this fate never
befalls you. As of this writing (10 May 2003), I am not aware of befalls you. As of this writing (10 May 2003), I am not aware of
any garbage collection bugs in vx-scheme.</p></li> any garbage collection bugs in vx-scheme.</p></li>
</ul> </ul>
Example use: Example use:
<ul> <ul>
<li> <li>
<p class="item">UNIX: <code>T=1 ./vx-scheme &lt; <p class="item">UNIX: <code>T=1 ./vx-scheme &lt;
@ -606,4 +606,3 @@ urchinTracker();
</script> </script>
</body> </body>
</html> </html>