Re-arange IRI compaction information to create a new algorithm section in an attempt to manage algorithm numbering.
--- a/spec/latest/json-ld-api/index.html Thu Apr 19 12:46:51 2012 -0700
+++ b/spec/latest/json-ld-api/index.html Thu Apr 19 12:56:01 2012 -0700
@@ -1105,6 +1105,8 @@
algorithm for transforming an IRI (<em>iri</em>) to a <tref>term</tref> or <tref>compact IRI</tref> using the
<tref>term</tref>s specified in the <tref>active context</tref> using an optional <em>value</em>.</p>
+<section>
+ <h3>Algorithm</h3>
<p>The algorithm for generating a <tref>compact IRI</tref> is:
<ol class="algorithm">
<li>If <em>iri</em> is <code>rdf:type</code> and <em>value</em> is <tref>null</tref>, return <code>@type</code>.</li>
@@ -1121,13 +1123,13 @@
rank</tref> for every entry in the list, removing entries having a
<tref>term rank</tref> of <code>0</code>.</li>
<li>Remove entries from <em>terms</em> which have <code>@container</code>
- set to <code>@set</code> in the<tref>active context</tref>.</li>
+ set to <code>@set</code> in the <tref>active context</tref>.</li>
</ol>
</li>
<li>If <em>term map</em> is empty:
<ol class="algorithm">
<li>Remove entries from <em>terms</em> which have <code>@container</code>
- set to <code>@list</code> in the<tref>active context</tref>.</li>
+ set to <code>@list</code> in the <tref>active context</tref>.</li>
<li>For each entry in <em>terms</em>,
add an entry to <em>term map</em> as the <tref>term rank</tref> for <em>value</em>,
removing entries having a <tref>term rank</tref> of <code>0</code>.</li>
@@ -1149,6 +1151,7 @@
<li>The final value is the shortest and lexicographically least value in <em>terms</em>.</li>
</ol>
</p>
+</section>
<section>
<h3>Term Rank</h3>