slight improvements re. UpdateList (def and example)
--- a/ldpatch.html Fri Nov 21 15:45:04 2014 -0500
+++ b/ldpatch.html Fri Nov 21 22:02:36 2014 +0100
@@ -561,7 +561,7 @@
</p>
<p>
- The <dfn>Slice expression</dfn> is composed of two optional positive integers <var>i<sub>min</sub></var> and <var>i<sub>max</sub></var> separated by "<code>..</code>". An omitted value is interpreted as the end of the collection. The <a>Slice expression</a> will denote the slice of the list being preceded by <var>i<sub>min</sub></var> elements, and spanning over (<var>i<sub>max</sub></var>-<var>i<sub>min</sub></var>) elements.
+ The <dfn>Slice expression</dfn> is composed of two optional positive integers <var>i<sub>min</sub></var> and <var>i<sub>max</sub></var> separated by "<code>..</code>". An omitted value is interpreted as the length of the collection. The <a>Slice expression</a> will denote the slice of the list being preceded by <var>i<sub>min</sub></var> elements, and spanning over (<var>i<sub>max</sub></var>-<var>i<sub>min</sub></var>) elements.
</p>
<p>
For example, here are some <a>Slice expression</a>s for the list <code>( "lorem" "ipsum" "dolor" "sit" "amet" )</code>:
@@ -647,7 +647,7 @@
Here is an illustration of the <a href="#updatelist-algo">previously introduced algorithm</a>.
</p>
<p>
- Consider the graph represented in <a href="#fig-graph-containing-a-collection"></a>. The result of applying an <a>UpdateList</a> operation on the collection in that graph can be seen in <a href="#fig-updatelist-result"></a>.
+ Consider the graph represented in <a href="#fig-graph-containing-a-collection"></a>. The result of applying the operation <code>UpdateList :s :p 2..4 ("foo" "bar" "baz").</code> on the collection in that graph can be seen in <a href="#fig-updatelist-result"></a>.
</p>
<figure id="fig-graph-containing-a-collection">