small fixes ldpatch
authorAlexandre Bertails <alexandre@bertails.org>
Mon, 24 Nov 2014 15:27:52 -0500
branchldpatch
changeset 916 12d2fb2fa378
parent 915 a61e98c879f0
child 917 71f27638abd0
small fixes
ldpatch.html
--- a/ldpatch.html	Mon Nov 24 14:05:57 2014 -0500
+++ b/ldpatch.html	Mon Nov 24 15:27:52 2014 -0500
@@ -297,7 +297,7 @@
 
 UpdateList &lt;#&gt; ex:preferredLanguages 1..2 ( "fr-CH" ) .
 
-Bind ?event &lt;#&gt; / schema:attendee[ / schema:url = &lt;https://www.w3.org/2012/ldp/wiki/F2F5&gt; ]  .
+Bind ?event &lt;#&gt; / schema:attendee [ / schema:url = &lt;https://www.w3.org/2012/ldp/wiki/F2F5&gt; ]  .
 Add { ?event rdf:type schema:Event } .
 
 Bind ?ted &lt;http://conferences.ted.com/TED2009/&gt; / ^schema:url ! .
@@ -564,7 +564,7 @@
           </p>
 
           <p>
-              The <dfn>Slice expression</dfn> is composed of two optional non-negative 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.
+              The <dfn>Slice expression</dfn> is composed of two optional non-negative 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 @@
             <h3>Example</h3>
 
             <p>
-                Here is an illustration of the <a href="#updatelist-algo">previously introduced algorithm</a>.
+                Here is an illustration of the <a href="#updatelist-algo">algorithm introduced previously</a>.
             </p>
             <p>
                 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>.