[pure-lang-svn] SF.net SVN: pure-lang: [421] pure/trunk/examples/hello.pure

[<ag...@us...>]

Revision: 421
          http://pure-lang.svn.sourceforge.net/pure-lang/?rev=421&view=rev
Author:   agraef
Date:     2008-07-08 03:53:09 -0700 (Tue, 08 Jul 2008)

Log Message:
-----------
Comment change.

Modified Paths:
--------------
    pure/trunk/examples/hello.pure

Modified: pure/trunk/examples/hello.pure
===================================================================
--- pure/trunk/examples/hello.pure	2008-07-08 10:51:02 UTC (rev 420)
+++ pure/trunk/examples/hello.pure	2008-07-08 10:53:09 UTC (rev 421)
@@ -232,9 +232,9 @@
 /* Lists are all good and fine, but what about other, more complicated kinds
    of data? Luckily, as a term rewriting language Pure is well-suited to
    process any kind of tree-structured data. We only discuss a simple example
-   here, but using similar, more elaborate techniques like AVL trees, it is
-   possible to implement almost any kind of container data structure in an
-   efficient way.
+   here, but using similar, more elaborate techniques like AVL trees (see
+   avltree.pure for an example), it is possible to implement almost any kind
+   of container data structure in an efficient way.
 
    So let's see how we can implement simple binary search trees in Pure. These
    are represented using the constant symbol 'nil' (which denotes the empty


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.