Added some minor clarifications and fixes to algorithms.
authorDave Longley <dlongley@digitalbazaar.com>
Wed, 31 Aug 2011 00:15:15 -0400
changeset 192 73fbbc6f6c23
parent 191 93e16e1ad328
child 193 02adaec539af
Added some minor clarifications and fixes to algorithms.
spec/latest/index.html
--- a/spec/latest/index.html	Tue Aug 30 15:49:07 2011 -0700
+++ b/spec/latest/index.html	Wed Aug 31 00:15:15 2011 -0400
@@ -2163,7 +2163,7 @@
   the <a href="#context">context</a> section. Process each key, expanding 
   the key according to the <a href="#iri-expansion">IRI Expansion</a> rules.</li>
   <ol class="algorithm">
-    <li>Process each value associated with each key
+    <li>Process each value associated with each key:
       <ol class="algorithm">
         <li>If the value is an <tref>array</tref>, process each item in the <tref>array</tref> 
         recursively using this algorithm.</li>
@@ -2175,7 +2175,7 @@
         If the value does not need to be coerced, leave the value as-is.
         </li>
       </ol>
-    <li>Remove the context from the object</li>
+    <li>Remove the context from the object.</li>
   </ol>
 </ol>
 </section>
@@ -2199,13 +2199,14 @@
 
 <ol class="algorithm">
   <li>Perform the <a href="#expansion-algorithm">Expansion Algorithm</a> on 
-  the <tref>JSON-LD input</tref>.</li>
+  the <tref>JSON-LD input</tref>. This removes any existing context to allow the given context to be cleanly applied.</li>
+  <li>Set the <tref>active context</tref> to the given context.
   <li>If the top-level item is an <tref>array</tref>, process each item in the <tref>array</tref> 
     recursively, starting at this step.
   <li>If the top-level item is an object, compress each key using the steps
     defined in <a href="#iri-compaction">IRI Compaction</a> and compress each
     value using the steps defined in 
-    <a href="#value-compaction">Value Compaction</a></li>
+    <a href="#value-compaction">Value Compaction</a>.</li>
   </li>
 </ol>
 </section>