--- a/spec/latest/json-ld-api/index.html Sun Feb 17 15:15:21 2013 +0100
+++ b/spec/latest/json-ld-api/index.html Sun Feb 17 15:25:43 2013 +0100
@@ -759,7 +759,7 @@
</section>
<section>
- <h2 id="remote-context">Remote Context Resolution</h2>
+ <h2>Remote Context Resolution</h2>
<section>
<h3>Purpose</h3>
@@ -813,7 +813,7 @@
</section>
<section>
-<h2 id="context-processing">Context Processing</h2>
+<h2>Context Processing</h2>
<p>
When processing a JSON-LD data structure, each processing rule is applied
@@ -983,7 +983,7 @@
</li>
<li>
For each <em>key</em>-<em>value</em> pair in <em>context</em> invoke
- the <a href="#create-term-definition">Create Term Definition</a>
+ the <a href="#create-term-definition-subalgorithm">Create Term Definition</a>
subalgorithm, passing <em>result</em> for <tref>active context</tref>,
<em>context</em> for <tref>local context</tref>, <em>key</em>,
and <em>defined</em>.
@@ -1001,7 +1001,7 @@
</section>
<section>
-<h2 id="create-term-definition">Create Term Definition Subalgorithm</h2>
+<h2>Create Term Definition Subalgorithm</h2>
<p>
This algorithm is called from the
@@ -1609,7 +1609,7 @@
<ol class="algorithm">
<li>
Set <em>expanded value</em> to the result of the
- <a href="#label-blank-nodes">Label Blank Nodes</a>
+ <a href="#label-blank-nodes-subalgorithm">Label Blank Nodes</a>
subalgorithm, passing <tref>active context</tref> and
<em>expanded value</em> as <em>element</em>.
</li>
@@ -1746,7 +1746,7 @@
</section> <!-- end of Expansion Algorithm -->
<section>
- <h2 id="iri-expansion">IRI Expansion</h2>
+ <h2>IRI Expansion</h2>
<p>In JSON-LD documents, some keys and values may represent
<tref title="IRI">IRIs</tref>. This section defines an algorithm for
@@ -1761,7 +1761,7 @@
<a href="#context-processing">Context Processing</a> algorithm are passed
to this algorithm. This allows for <tref>term definition</tref> dependencies
to be processed via the context processing subalgorithm,
- <a href="#create-term-definition">Create Term Definition</a>.</p>
+ <a href="#create-term-definition-subalgorithm">Create Term Definition</a>.</p>
<p>After application of this algorithm, values processed by this algorithm are
said to be in <tdef>expanded IRI form</tdef> (Advanced note: this form
@@ -1799,7 +1799,7 @@
which <tref title="term">terms</tref> have already been defined or are
in the process of being defined. We create a
<tref>term definition</tref> by using the
- <a href="#create-term-definition">Create Term Definition</a> subalgorithm.</p>
+ <a href="#create-term-definition-subalgorithm">Create Term Definition</a> subalgorithm.</p>
<p>To begin, we handle the simplest case, where <em>value</em> is
<tref>null</tref> or a <tref>keyword</tref>. Here all we do is return
@@ -1856,7 +1856,7 @@
<li>If <tref>local context</tref> is not <tref>null</tref>, it contains
a key that equals <em>value</em>, and the value associated with the key
that equals <em>value</em> in <em>defined</em> is not <tref>true</tref>,
- then invoke the <a href="#create-term-definition">Create Term Definition</a>
+ then invoke the <a href="#create-term-definition-subalgorithm">Create Term Definition</a>
subalgorithm, passing <tref>active context</tref>, <tref>local context</tref>,
<em>value</em> as <em>term</em>, and <em>defined</em>. This will ensure that
a <tref>term definition</tref> is created for <em>value</em> in
@@ -1889,7 +1889,7 @@
<ol class="algorithm">
<li>If <tref>local context</tref> is not <tref>null</tref> and it
contains a key that equals <tref>prefix</tref>, then invoke the
- <a href="#create-term-definition">Create Term Definition</a>
+ <a href="#create-term-definition-subalgorithm">Create Term Definition</a>
subalgorithm, passing <tref>active context</tref>,
<tref>local context</tref>, <em>prefix</em> as <em>term</em>,
and <em>defined</em>. This will ensure that a
@@ -1936,7 +1936,7 @@
</section> <!-- end of IRI Expansion -->
<section>
-<h2 id="value-expansion">Value Expansion</h2>
+<h2>Value Expansion</h2>
<p>
Some values in JSON-LD can be expressed in a <tref>compacted form</tref>.
@@ -2114,7 +2114,7 @@
</section>
<section>
-<h2 id="label-blank-nodes">Label Blank Nodes Subalgorithm</h2>
+<h2>Label Blank Nodes Subalgorithm</h2>
<p>
During <tref>expansion</tref>, it is sometimes necessary to ensure
@@ -2194,7 +2194,7 @@
</section>
<section>
-<h2 id="generate-blank-node-identifier">Generate Blank Node Identifier</h2>
+<h2>Generate Blank Node Identifier</h2>
<p>
This algorithm is used to generate new
@@ -2287,7 +2287,7 @@
<em>element</em>. Then, we compact each value in the shallow copy
for each key recursively. Some of the keys will be
compacted, using the
- <a href="#iri-compaction">IRI Compaction</a> algorithm,
+ <a href="#iri-compaction-algorithm">IRI Compaction</a> algorithm,
to <tref title="term">terms</tref> or
<tref title="compact IRI">compact IRIs</tref> and others will be
compacted from <tref title="keyword">keywords</tref> to
@@ -2431,7 +2431,7 @@
If <em>expanded value</em> is a <tref>string</tref>,
then initialize <em>compacted value</em> to the result
of using the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref>,
<em>expanded value</em> for <em>iri</em>,
and <tref>true</tref> for <em>vocabRelative</em> if
@@ -2450,7 +2450,7 @@
For each item <em>expanded type</em> in
<em>expanded value</em>, append the result of
of using the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref>,
<em>expanded type</em> for <em>iri</em>, and
<tref>true</tref> for <em>vocabRelative</em>,
@@ -2465,7 +2465,7 @@
</li>
<li>
Initialize <em>alias</em> to the result of using the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref> and
<em>expanded property</em> for <em>iri</em>.
</li>
@@ -2491,7 +2491,7 @@
</li>
<li>
Otherwise, initialize <em>alias</em> to the result of using
- the <a href="#iri-compaction">IRI Compaction</a>
+ the <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref> and
<em>expanded property</em> for <em>iri</em>.
</li>
@@ -2509,7 +2509,7 @@
<li>
Initialize <em>item active property</em> to the result of
using the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref>,
<em>expanded property</em> for <em>iri</em>,
<em>expanded value</em> for <em>value</em>,
@@ -2533,7 +2533,7 @@
<ol class="algorithm">
<li>
Initialize <em>item active property</em> to the result of using
- the <a href="#iri-compaction">IRI Compaction</a>
+ the <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref>,
<em>expanded property</em> for <em>iri</em>,
<em>expanded item</em> for <em>value</em>,
@@ -2550,7 +2550,7 @@
If there is a <tref>term definition</tref> for
<em>item active property</em> in <tref>active context</tref>
that is a <tref>property generator</tref>, then invoke the
- <a href="#find-property-generator-duplicates">Find Property Generator Duplicates</a>
+ <a href="#find-property-generator-duplicates-subalgorithm">Find Property Generator Duplicates</a>
algorithm, passing <tref>active context</tref>,
<em>shallow</em> for <em>element</em>,
<em>expanded property</em>, <em>expanded item</em> for
@@ -2583,7 +2583,7 @@
<tref>list object</tref> by setting it to a
<tref>JSON object</tref> containing key-value pair
where the key is the result of the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@list</code> for <em>iri</em>, and the
value is <em>compacted item</em>.
@@ -2593,7 +2593,7 @@
<code>@index</code>, then add a key-value pair
to <em>compacted item</em> where the key is the
result of the
- <a href="#iri-compaction">IRI Compaction</a>
+ <a href="#iri-compaction-algorithm">IRI Compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@index</code> for <em>iri</em>, and the
value is the value associated with the
@@ -2697,7 +2697,7 @@
an <tref>array</tref> with two or more items and a <em>context</em> has
been passed, replace it with a new <tref>JSON object</tref> with a single
key-value pair where the key is the result of using the
-<a href="#iri-compaction">IRI Compaction</a> algorithm, passing
+<a href="#iri-compaction-algorithm">IRI Compaction</a> algorithm, passing
<tref>active context</tref> and <code>@graph</code> for <em>iri</em>, and
the value is <em>result</em>. Otherwise, if <em>result</em> is an
<tref>array</tref> with only one item, set <em>result</em> to that item.
@@ -2714,7 +2714,7 @@
</section>
<section>
-<h2 id="iri-compaction">IRI Compaction Algorithm</h2>
+<h2>IRI Compaction Algorithm</h2>
<p>
This section defines an algorithm for transforming an <tref>IRI</tref>
@@ -2755,7 +2755,7 @@
JSON-LD lists, the <tref>type mapping</tref> or <tref>language mapping</tref>
will be chosen based on the most specific values that work for all items in
the list. Once this information is gathered, it is passed to the
-<a href="#term-selection">Term Selection</a> subalgorithm, which will
+<a href="#term-selection-subalgorithm">Term Selection</a> subalgorithm, which will
return the most appropriate <tref>term</tref> to use.</p>
<p>
@@ -2802,7 +2802,7 @@
If <em>vocabRelative</em> is <tref>true</tref> and
<tref>active context</tref> has no associated
<tref>inverse context</tref>, then generate it using the
- <a href="#inverse-context-creation">Inverse Context Creation</a>
+ <a href="#inverse-context-creation-subalgorithm">Inverse Context Creation</a>
algorithm. Set <em>inverse context</em> to the
<tref>inverse context</tref> associated with <tref>active context</tref>.
</li>
@@ -2962,7 +2962,7 @@
</li>
<li>
Initialize <em>term</em> to the result of the
- <a href="#term-selection">Term Selection</a> subalgorithm, passing
+ <a href="#term-selection-subalgorithm">Term Selection</a> subalgorithm, passing
<tref>active context</tref>, <em>inverse context</em>, <em>iri</em>,
<em>value</em>, <em>parent</em>, <em>containers</em>,
<em>typeOrLanguage</em>, and <em>typeOrLangaugeValue</em>.
@@ -3056,7 +3056,7 @@
</section>
<section>
-<h2 id="inverse-context-creation">Inverse Context Creation Subalgorithm</h2>
+<h2>Inverse Context Creation Subalgorithm</h2>
<p>
When there is more than one <tref>term</tref> that could be chosen
@@ -3085,7 +3085,7 @@
<tref title="container mapping">container mappings</tref> and the
<tref>type mapping</tref> or <tref>language mapping</tref> are gathered
for a particular value associated with an <tref>IRI</tref>. These parameters
-are then fed to the <a href="#term-selection">Term Selection</a>
+are then fed to the <a href="#term-selection-subalgorithm">Term Selection</a>
subalgorithm, which will find the <tref>term</tref> that most appropriately
matches the value's mappings.
</p>
@@ -3117,7 +3117,7 @@
<tref>language mapping</tref> (or some combination of these), then it
will have an entry in the <tref>inverse context</tref> using the special
key <code>@none</code>. This allows the
-<a href="#term-selection">Term Selection</a> subalgorithm to fall back
+<a href="#term-selection-subalgorithm">Term Selection</a> subalgorithm to fall back
to choosing more generic <tref title="term">terms</tref> when a more
specificly-matching <tref>term</tref> is not available for a particular
<tref>IRI</tref> and value combination.
@@ -3361,11 +3361,11 @@
</section>
<section>
-<h2 id="term-selection">Term Selection Subalgorithm</h2>
+<h2>Term Selection Subalgorithm</h2>
<p>
This subalgorithm, invoked via the
-<a href="#iri-compaction">IRI Compaction</a> algorithm, makes use
+<a href="#iri-compaction-algorithm">IRI Compaction</a> algorithm, makes use
of an <tref title="active context">active context's</tref>
<tref>inverse context</tref> to find the <tref>term</tref> that is best
used to <tref title="compaction">compact</tref> an <tref>IRI</tref>. Other
@@ -3406,7 +3406,7 @@
mappings are resolved by first choosing the shortest terms, and then by
choosing the lexicographically least term. Note that these ties are
resolved automatically because they were previously resolved when the
-<a href="#inverse-context-creation">Inverse Context Creation algorithm</a>
+<a href="#inverse-context-creation-subalgorithm">Inverse Context Creation algorithm</a>
was used to create the <tref>inverse context</tref>.
</p>
@@ -3460,7 +3460,7 @@
<ol class="algorithm">
<li>
If the result of using the
- <a href="#iri-compaction">IRI compaction</a> algorithm,
+ <a href="#iri-compaction-algorithm">IRI compaction</a> algorithm,
passing <tref>active context</tref>, the value associated with the
<code>@id</code> key in <em>value</em> for
<em>iri</em>, <tref>true</tref> for <em>vocabRelative</em>, and
@@ -3524,7 +3524,7 @@
<ol class="algorithm">
<li>
Initialize <em>match</em> to the result of using the
- <a href="#find-property-generator-duplicates">Find Property Generator Duplicates</a>
+ <a href="#find-property-generator-duplicates-subalgorithm">Find Property Generator Duplicates</a>
algorithm, passing <tref>active context</tref>,
<em>parent</em> for <em>element</em>, <em>iri</em> for
<em>expanded property</em>, <em>value</em>,
@@ -3559,7 +3559,7 @@
</section>
<section>
-<h2 id="value-compaction">Value Compaction</h2>
+<h2>Value Compaction</h2>
<p>
<tref>Expansion</tref> transforms all values into <tref>expanded form</tref>
@@ -3608,7 +3608,7 @@
<p>
For the latter case, where the key <code>@id</code> appears in <em>value</em>,
we compact the associated value using the
-<a href="#iri-compaction">IRI Compaction</a> algorithm, and
+<a href="#iri-compaction-algorithm">IRI Compaction</a> algorithm, and
use its value if the <tref>type mapping</tref> associated with the
<tref>active property</tref> is <code>@id</code> or the expanded value for
the <tref>active property</tref> is <code>@graph</code>. Otherwise, we
@@ -3666,7 +3666,7 @@
<li>
If <em>preserveIndex</em> equals <tref>true</tref>, then add
a key-value pair to <em>result</em> where the key is the result
- using the <a href="#iri-compaction">IRI compaction</a>
+ using the <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@index</code> for <em>iri</em>, and the value is
the value associated with the <code>@index</code> key in
@@ -3675,10 +3675,10 @@
<li>
If <em>value</em> contains the key <code>@type</code>, then add
a key-value pair to <em>result</em> where the key is the result
- using the <a href="#iri-compaction">IRI compaction</a>
+ using the <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@type</code> for <em>iri</em>, and the value is the result
- of using the <a href="#iri-compaction">IRI compaction</a>
+ of using the <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref>, the value associated
with the <code>@type</code> key in <em>value</em> for <em>iri</em>,
and <tref>true</tref> for <em>vocabRelative</em>.
@@ -3687,7 +3687,7 @@
Otherwise, if <em>value</em> contains the key <code>@language</code>,
then add a key-value pair to <em>result</em> where the key is the
result using the
- <a href="#iri-compaction">IRI compaction</a>
+ <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@language</code> for <em>iri</em>, and the value is the
value associated with the <code>@language</code> key in
@@ -3695,7 +3695,7 @@
</li>
<li>
Add a key-value pair to <em>result</em> where the key is the result
- using the <a href="#iri-compaction">IRI compaction</a>
+ using the <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref> and
<code>@value</code> for <em>iri</em>, and the value is the value
associated with the <code>@value</code> key in <em>value</em>.
@@ -3714,7 +3714,7 @@
</li>
<li>
Initialize <em>term</em> to the result of using the
- <a href="#iri-compaction">IRI compaction</a> algorithm,
+ <a href="#iri-compaction-algorithm">IRI compaction</a> algorithm,
passing <tref>active context</tref>, the value associated with
the key <code>@id</code> in <em>value</em> for <em>iri</em>, and
<tref>true</tref> for <em>vocabRelative</em> if
@@ -3730,7 +3730,7 @@
<li>
Initialize <em>result</em> to an empty <tref>JSON object</tref>. Add
a key-value pair to <em>result</em> where the key is the result of
- using the <a href="#iri-compaction">IRI compaction</a>
+ using the <a href="#iri-compaction-algorithm">IRI compaction</a>
algorithm, passing <tref>active context</tref>, and <code>@id</code> for
<em>iri</em>, and the value is <em>term</em>.
</li>
@@ -3745,7 +3745,7 @@
</section>
<section>
-<h2 id="find-property-generator-duplicates">Find Property Generator Duplicates Subalgorithm</h2>
+<h2>Find Property Generator Duplicates Subalgorithm</h2>
<p>
This algorithm checks if a specific value exists for all
@@ -4209,7 +4209,7 @@
</section>
-<section id="list-conversion">
+<section>
<h3>List Conversion</h3>
<p>