--- a/spec/latest/json-ld-connect/index.html Mon Nov 05 19:19:03 2012 +0100
+++ b/spec/latest/json-ld-connect/index.html Mon Nov 05 19:20:30 2012 +0100
@@ -12,71 +12,72 @@
<script type="text/javascript" src="../respec-w3c-extensions.js" class="remove"></script>
<script type="text/javascript" class="remove">
//<![CDATA[
-
- var respecConfig = {
- doRDFa: "1.1",
- // specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
- specStatus: "CG-DRAFT",
- // if you wish the publication date to be other than today, set this
- //publishDate: "2012-08-30",
- copyrightStart: "2012",
-
- // the specification's short name, as in http://www.w3.org/TR/short-name/
- shortName: "json-ld-connect",
- subtitle: "An Algorithm for Turning JSON-LD Data into Graphs",
-
- // if there is a previously published draft, uncomment this and set its YYYY-MM-DD date
- // and its maturity status
- //previousPublishDate: "2012-09-27",
- //previousMaturity: "unofficial",
- //previousDiffURI: "http://json-ld.org/spec/ED/json-ld-connect/YYYMMDD/",
-
- // if there a publicly available Editor's Draft, this is the link
- edDraftURI: "http://json-ld.org/spec/latest/json-ld-connect/",
-
- // if this is a LCWD, uncomment and set the end of its review period
- // lcEnd: "2009-08-05",
-
- // if you want to have extra CSS, append them to this list
- // it is recommended that the respec.css stylesheet be kept
- // extraCSS: [],
-
- issueBase: "https://github.com/json-ld/json-ld.org/issues/",
+ var respecConfig = {
+ // extend the bibliography entries
+ "localBiblio": localBibliography,
- // editors, add as many as you like
- // only "name" is required
- editors: [
- { name: " Niklas Lindström", url: "http://neverspace.net/id#self" }
- ],
-
- // authors, add as many as you like.
- // This is optional, uncomment if you have authors as well as editors.
- // only "name" is required. Same format as editors.
-
- authors: [
- { name: " Niklas Lindström", url: "http://neverspace.net/id#self" }
- ],
-
- // name of the WG
- wg: "Linking Data in JSON Community Group",
+ doRDFa: "1.1",
+ // specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
+ specStatus: "CG-DRAFT",
+ // if you wish the publication date to be other than today, set this
+ //publishDate: "2012-08-30",
+ copyrightStart: "2012",
- // URI of the public WG page
- wgURI: "http://json-ld.org/",
-
- // name (with the @w3c.org) of the public mailing to which comments are due
- wgPublicList: "public-linked-json@w3c.org",
+ // the specification's short name, as in http://www.w3.org/TR/short-name/
+ shortName: "json-ld-connect",
+ subtitle: "An Algorithm for Turning JSON-LD Data into Graphs",
- // URI of the patent status for this WG, for Rec-track documents
- // !!!! IMPORTANT !!!!
- // This is important for Rec-track documents, do not copy a patent URI from a random
- // document unless you know what you're doing. If in doubt ask your friendly neighbourhood
- // Team Contact.
- wgPatentURI: "",
- maxTocLevel: 4,
- preProcess: [ preProc ],
- //alternateFormats: [ {uri: "diff-20120524.html", label: "diff to previous version"} ],
- };
+ // if there is a previously published draft, uncomment this and set its YYYY-MM-DD date
+ // and its maturity status
+ //previousPublishDate: "2012-09-27",
+ //previousMaturity: "unofficial",
+ //previousDiffURI: "http://json-ld.org/spec/ED/json-ld-connect/YYYMMDD/",
+ // if there a publicly available Editor's Draft, this is the link
+ edDraftURI: "http://json-ld.org/spec/latest/json-ld-connect/",
+
+ // if this is a LCWD, uncomment and set the end of its review period
+ // lcEnd: "2009-08-05",
+
+ // if you want to have extra CSS, append them to this list
+ // it is recommended that the respec.css stylesheet be kept
+ // extraCSS: [],
+
+ issueBase: "https://github.com/json-ld/json-ld.org/issues/",
+
+ // editors, add as many as you like
+ // only "name" is required
+ editors: [
+ { name: " Niklas Lindström", url: "http://neverspace.net/id#self" }
+ ],
+
+ // authors, add as many as you like.
+ // This is optional, uncomment if you have authors as well as editors.
+ // only "name" is required. Same format as editors.
+
+ authors: [
+ { name: " Niklas Lindström", url: "http://neverspace.net/id#self" }
+ ],
+
+ // name of the WG
+ wg: "Linking Data in JSON Community Group",
+
+ // URI of the public WG page
+ wgURI: "http://json-ld.org/",
+
+ // name (with the @w3c.org) of the public mailing to which comments are due
+ wgPublicList: "public-linked-json@w3c.org",
+
+ // URI of the patent status for this WG, for Rec-track documents
+ // !!!! IMPORTANT !!!!
+ // This is important for Rec-track documents, do not copy a patent URI from a random
+ // document unless you know what you're doing. If in doubt ask your friendly neighbourhood
+ // Team Contact.
+ wgPatentURI: "",
+ maxTocLevel: 4,
+ preProcess: [ preProc ],
+ //alternateFormats: [ {uri: "diff-20120524.html", label: "diff to previous version"} ],
+ };
//]]>
</script>
<style type="text/css">
@@ -86,7 +87,7 @@
<body>
<section id="abstract">
-<p>JSON-LD Connect is a way of turning a JSON-LD document into a live graph of
+<p>JSON-LD Connect is a way of turning a JSON-LD document into a live graph of
interconnected and indexed objects.</p>
</section>
@@ -98,24 +99,24 @@
<h1>Introduction</h1>
<p>
A JSON-LD document is a representation of a directed graph. A single
- directed graph can have many different serializations, each expressing
- exactly the same information. Developers wanting to work with interconnected
+ directed graph can have many different serializations, each expressing
+ exactly the same information. Developers wanting to work with interconnected
<tref>JSON object</tref>s,
can use the connect algorithm described here to "stich together"
<tref>node definition</tref>s
- and creating an index of important values mapped to each node. This enables
- navigation between node definitions via interlinking keys (representing arcs
+ and creating an index of important values mapped to each node. This enables
+ navigation between node definitions via interlinking keys (representing arcs
in graph nomenclature).
</p>
<p>
- Technically, connect works by replacing each <tref>node reference</tref> in
- the input data with a real, programmatic object reference, to one, merged
+ Technically, connect works by replacing each <tref>node reference</tref> in
+ the input data with a real, programmatic object reference, to one, merged
node definition. This results in the creation of a simple in-memory graph.
</p>
<p>
- Out of the box, the connect process creates an index mapping node
- <code>@id</code> values to the <tref>node definition</tref>. It is also
- possible to configure the process to create additional indexes, as well as
+ Out of the box, the connect process creates an index mapping node
+ <code>@id</code> values to the <tref>node definition</tref>. It is also
+ possible to configure the process to create additional indexes, as well as
adding a local <tref>reverse key map</tref> to each node definition.
</p>
@@ -124,14 +125,14 @@
<h2>How to Read this Document</h2>
<p>
-This document is a detailed specification for Linked Data in JSON. The document
+This document is a detailed specification for Linked Data in JSON. The document
is primarily intended for the following audiences:
</p>
<ul>
<li>Software developers that want to implement processors and APIs for
JSON-LD.</li>
- <li>Web developers who want to navigate JSON-LD documents as interconnected
+ <li>Web developers who want to navigate JSON-LD documents as interconnected
nodes.</li>
</ul>
@@ -272,7 +273,7 @@
<p>The algorithm described in this section is intended to operate on
language-native data structures. That is, the serialization to a text-based
-JSON document isn't required as input or output, and language-native data
+JSON document isn't required as input or output, and language-native data
structures MUST be used where applicable.</p>
<section>
@@ -290,7 +291,7 @@
<section>
<h2>Connect</h2>
<p>
- Connecting is the process of turning an input JSON-LD document into an
+ Connecting is the process of turning an input JSON-LD document into an
interconnected and indexed data structure.
</p>
@@ -304,7 +305,7 @@
</dd>
<dt><tdef>map of result objects</tdef></dt>
<dd>
- A map of resulting <tref>node definition</tref>s that is the result of
+ A map of resulting <tref>node definition</tref>s that is the result of
this algorithm.
</dd>
<dt><tdef>type map</tdef></dt>
@@ -313,7 +314,7 @@
</dd>
<dt><tdef>reverse key map</tdef></dt>
<dd>
- A map of keys with arrays of subjects that link to the current node using
+ A map of keys with arrays of subjects that link to the current node using
that key.
</dd>
<dt><tdef>connected output</tdef></dt>
@@ -327,8 +328,8 @@
<h3>Connect Algorithm</h3>
<p>
- Create an <code>idMap</code> and a <code>typeMap</code>, being the
- <tref>map of result objects</tref> and <tref>type map</tref> of the
+ Create an <code>idMap</code> and a <code>typeMap</code>, being the
+ <tref>map of result objects</tref> and <tref>type map</tref> of the
<tref>connected output</tref> respectively.
</p>
@@ -337,33 +338,33 @@
<ol class="algorithm">
<li>
If the object has a key whose resolved meaning is <code>@id</code>,
- find an existing object indexed by that id from the <code>idMap</code>. If
+ find an existing object indexed by that id from the <code>idMap</code>. If
one is found, use that as the <tref>current result object</tref>.
</li>
<li>
- Otherwise (on no key or no existing), create a new object and use that as
+ Otherwise (on no key or no existing), create a new object and use that as
the result object.
</li>
<li>
For each key, value pair in the current object, do the following:
<ol class="algorithm">
<li>
- If the resolved key meaning is <code>@id</code>, add the result object
+ If the resolved key meaning is <code>@id</code>, add the result object
under that key to the <code>idMap</code>.
</li>
<li>
- If the resolved key meaning is <code>@type</code>, and the current
- object has no key whose resolved meaning is <code>@value</code>, get or
- add an array for the type value in the <code>typeMap</code>. Append the
+ If the resolved key meaning is <code>@type</code>, and the current
+ object has no key whose resolved meaning is <code>@value</code>, get or
+ add an array for the type value in the <code>typeMap</code>. Append the
result object to that array.
</li>
<li>
- If the value is an object, create a new value by using the result of
+ If the value is an object, create a new value by using the result of
running these steps recursively with the value as input.
</li>
<li>
- Otherwise, if the value is an array, create a new array. Then apply
- these steps recursively to each object in the array, appending each
+ Otherwise, if the value is an array, create a new array. Then apply
+ these steps recursively to each object in the array, appending each
result to the new array.
</li>
<li>
@@ -380,22 +381,22 @@
</ol>
<p>
- If the <code>@rev</code> flag is used, pass the current key (called reverse
- link) and current object (called linking object) to each recursive call in
- the process above. At the end of the process, get or create a
- <em>revMap</em> from the current object. Get or create a list for the
- reverse link key from the revMap, and append the linking object to that.
+ If the <code>@rev</code> flag is used, pass the current key (called reverse
+ link) and current object (called linking object) to each recursive call in
+ the process above. At the end of the process, get or create a
+ <em>revMap</em> from the current object. Get or create a list for the
+ reverse link key from the revMap, and append the linking object to that.
Then set that revMap on the current object.
</p>
<p>
- The resulting <code>idMap</code> and <code>typeMap</code> are added to the
+ The resulting <code>idMap</code> and <code>typeMap</code> are added to the
final <tref>connected output</tref>.
</p>
<p class="issue">
- This algorithm is a work in progress. It is currently undefined whether the
- creation of typeMaps and revMaps should be optional. It is also still
+ This algorithm is a work in progress. It is currently undefined whether the
+ creation of typeMaps and revMaps should be optional. It is also still
undefined which keys will label these in the connected output.
</p>
@@ -424,7 +425,7 @@
<dt>void connect()</dt>
<dd>
- <a href="#connect">Connects</a> the given <code>input</code> according
+ <a href="#connect">Connects</a> the given <code>input</code> according
to the steps in the
<a href="#connect-algorithm">Connect Algorithm</a>. The <code>input</code>
is used to build the <tref>connected output</tref> and is returned if there are no errors.
@@ -466,7 +467,7 @@
<section>
<h3>JsonLdOptions</h3>
- <p>The <a>JsonLdOptions</a> type is used to convert a set of options to an
+ <p>The <a>JsonLdOptions</a> type is used to convert a set of options to an
interface method.</p>
<p>See <dtref>JsonLdOptions</dtref> definition in [[!JSON-LD-API]].</p>
</section>
@@ -480,7 +481,7 @@
participants who worked through many of the technical issues on the mailing
list and the weekly telecons. Of special mention are
<!-- TODO: maintain this -->
- Manu Sporny, Dave Longley, Gregg Kellogg, Markus Lanthaler, François Daoust,
+ Manu Sporny, Dave Longley, Gregg Kellogg, Markus Lanthaler, François Daoust,
and Zdenko 'Denny' Vrandečić.
The editors would like to thank Mark Birbeck, who provided a great deal of
the initial push behind the JSON-LD work via his work on RDFj.
--- a/spec/latest/respec-w3c-extensions.js Mon Nov 05 19:19:03 2012 +0100
+++ b/spec/latest/respec-w3c-extensions.js Mon Nov 05 19:20:30 2012 +0100
@@ -1,17 +1,19 @@
+// extend the bibliography entries
+var localBibliography = {
+ "JSON-LD": "<cite><a href=\"http://json-ld.org/spec/ED/json-ld-syntax/20120522/\">The JSON-LD Syntax</a></cite> Manu Sporny, Gregg Kellogg, Markus Lanthaler Editors. World Wide Web Consortium (work in progress). 22 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://json-ld.org/spec/ED/json-ld-syntax/20120522/. The <a href=\"http://json-ld.org/spec/latest/json-ld-syntax/\">latest edition of the JSON-LD Syntax</a> is available at http://json-ld.org/spec/latest/json-ld-syntax/",
+ "JSON-LD-API": "<cite><a href=\"http://json-ld.org/spec/ED/json-ld-api/20120524/\">The JSON-LD API 1.0</a></cite> Manu Sporny, Gregg Kellogg, Dave Longley, Markus Lanthaler, Editors. World Wide Web Consortium (work in progress). 24 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://json-ld.org/spec/ED/json-ld-api/20120524/. The <a href=\"http://json-ld.org/spec/latest/json-ld-api/\">latest edition of the JSON-LD Syntax</a> is available at http://json-ld.org/spec/latest/json-ld-api/",
+ "IEEE-754-1985": "IEEE. <cite>IEEE Standard for Binary Floating-Point Arithmetic.</cite> See <a href=\"http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html\">http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html</a>",
+ "RFC5988": "<cite><a href=\"http://tools.ietf.org/rfc/rfc5988\">Web Linking</a></cite> M. Nottingham. Editor. October 2010. IETF Standard. URL: <a href=\"http://tools.ietf.org/rfc/rfc5988.txt\">http://tools.ietf.org/rfc/rfc5988.txt</a>",
+ "RDF-CONCEPTS": "<cite><a href=\"http://www.w3.org/TR/2011/WD-rdf11-concepts-20110830/\">RDF 1.1 Concepts and Abstract Syntax</a></cite> Richard Cyganiak, David Wood, Editors. World Wide Web Consortium (work in progress). 30 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://www.w3.org/TR/2011/WD-rdf11-concepts-20110830/. The <a href=\"http://www.w3.org/TR/rdf11-concepts/\">latest edition of the JSON-LD Syntax</a> is available at http://www.w3.org/TR/rdf11-concepts/",
+ "TURTLE-TR": "Eric Prud'hommeaux, Gavin Carothers. <cite><a href=\"http://www.w3.org/TR/2011/WD-turtle-20110809/\">Turtle: Terse RDF Triple Language.</a></cite> 09 August 2011. W3C Working Draft. URL: <a href=\"http://www.w3.org/TR/2011/WD-turtle-20110809/\">http://www.w3.org/TR/2011/WD-turtle-20110809/</a>",
+ "MICRODATA": "<cite><a href=\"http://www.w3.org/TR/2012/WD-microdata-20120329/\">HTML Microdata</a></cite> Ian Hickson Editor. World Wide Web Consortium (work in progress). 29 March 2012. This edition of the HTML Microdata specification is http://www.w3.org/TR/2012/WD-microdata-20120329/. The <a href=\"http://www.w3.org/TR/microdata/\">latest edition of HTML Microdata</a> is available at http://www.w3.org/TR/microdata/",
+ "WEBIDL": "<cite><a href=\"http://www.w3.org/TR/2012/CR-WebIDL-20120419/\">Web IDL</a></cite> Cameron McCormack, Editor. World Wide Web Consortium. 19 April 2012. Candidate Recommendataion. This edition of Web IDL is http://www.w3.org/TR/2012/CR-WebIDL-20120419/. The <a href=\"http://dev.w3.org/2006/webapi/WebIDL/\">latest edition of Web IDL</a> is available at http://dev.w3.org/2006/webapi/WebIDL/",
+ "JSON-POINTER": "<cite><a href=\"http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02\">JSON Pointer</a></cite> P. Bryan, Ed. IETF Draft. URL: <a href=\"http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02\">http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02</a>",
+ "RDF-NORMALIZATION": "<cite><a href=\"http://json-ld.org/spec/ED/rdf-graph-normalization/20111016/\">RDF Graph Normalization</a></cite> Manu Sporny, Dave Longley Editors. World Wide Web Consortium (work in progress). 16 October 2011. Editor's Draft. This edition of the RDF Graph Normalization specification is http://json-ld.org/spec/ED/rdf-graph-normalization/20111016/. The <a href=\"http://json-ld.org/spec/latest/rdf-graph-normalization/\">latest edition of RDF Graph Normalization</a> is available at http://json-ld.org/spec/latest/rdf-graph-normalization/"
+};
+
var preProc = {
apply: function(c) {
- // extend the bibliography entries
- berjon.biblio["JSON-LD"] = "<cite><a href=\"http://json-ld.org/spec/ED/json-ld-syntax/20120522/\">The JSON-LD Syntax</a></cite> Manu Sporny, Gregg Kellogg, Markus Lanthaler Editors. World Wide Web Consortium (work in progress). 22 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://json-ld.org/spec/ED/json-ld-syntax/20120522/. The <a href=\"http://json-ld.org/spec/latest/json-ld-syntax/\">latest edition of the JSON-LD Syntax</a> is available at http://json-ld.org/spec/latest/json-ld-syntax/";
- berjon.biblio["JSON-LD-API"] = "<cite><a href=\"http://json-ld.org/spec/ED/json-ld-api/20120524/\">The JSON-LD API 1.0</a></cite> Manu Sporny, Gregg Kellogg, Dave Longley, Markus Lanthaler, Editors. World Wide Web Consortium (work in progress). 24 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://json-ld.org/spec/ED/json-ld-api/20120524/. The <a href=\"http://json-ld.org/spec/latest/json-ld-api/\">latest edition of the JSON-LD Syntax</a> is available at http://json-ld.org/spec/latest/json-ld-api/";
- berjon.biblio["IEEE-754-1985"] = "IEEE. <cite>IEEE Standard for Binary Floating-Point Arithmetic.</cite> See <a href=\"http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html\">http://standards.ieee.org/reading/ieee/std_public/description/busarch/754-1985_desc.html</a>";
- berjon.biblio["RFC5988"] = "<cite><a href=\"http://tools.ietf.org/rfc/rfc5988\">Web Linking</a></cite> M. Nottingham. Editor. October 2010. IETF Standard. URL: <a href=\"http://tools.ietf.org/rfc/rfc5988.txt\">http://tools.ietf.org/rfc/rfc5988.txt</a>";
- berjon.biblio["RDF-CONCEPTS"] = "<cite><a href=\"http://www.w3.org/TR/2011/WD-rdf11-concepts-20110830/\">RDF 1.1 Concepts and Abstract Syntax</a></cite> Richard Cyganiak, David Wood, Editors. World Wide Web Consortium (work in progress). 30 May 2012. Editor's Draft. This edition of the JSON-LD Syntax specification is http://www.w3.org/TR/2011/WD-rdf11-concepts-20110830/. The <a href=\"http://www.w3.org/TR/rdf11-concepts/\">latest edition of the JSON-LD Syntax</a> is available at http://www.w3.org/TR/rdf11-concepts/";
- berjon.biblio["TURTLE-TR"] = "Eric Prud'hommeaux, Gavin Carothers. <cite><a href=\"http://www.w3.org/TR/2011/WD-turtle-20110809/\">Turtle: Terse RDF Triple Language.</a></cite> 09 August 2011. W3C Working Draft. URL: <a href=\"http://www.w3.org/TR/2011/WD-turtle-20110809/\">http://www.w3.org/TR/2011/WD-turtle-20110809/</a>";
- berjon.biblio["MICRODATA"] = "<cite><a href=\"http://www.w3.org/TR/2012/WD-microdata-20120329/\">HTML Microdata</a></cite> Ian Hickson Editor. World Wide Web Consortium (work in progress). 29 March 2012. This edition of the HTML Microdata specification is http://www.w3.org/TR/2012/WD-microdata-20120329/. The <a href=\"http://www.w3.org/TR/microdata/\">latest edition of HTML Microdata</a> is available at http://www.w3.org/TR/microdata/";
- berjon.biblio["WEBIDL"] = "<cite><a href=\"http://www.w3.org/TR/2012/CR-WebIDL-20120419/\">Web IDL</a></cite> Cameron McCormack, Editor. World Wide Web Consortium. 19 April 2012. Candidate Recommendataion. This edition of Web IDL is http://www.w3.org/TR/2012/CR-WebIDL-20120419/. The <a href=\"http://dev.w3.org/2006/webapi/WebIDL/\">latest edition of Web IDL</a> is available at http://dev.w3.org/2006/webapi/WebIDL/";
- berjon.biblio["JSON-POINTER"] = "<cite><a href=\"http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02\">JSON Pointer</a></cite> P. Bryan, Ed. IETF Draft. URL: <a href=\"http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02\">http://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-02</a>";
- berjon.biblio["RDF-NORMALIZATION"] = "<cite><a href=\"http://json-ld.org/spec/ED/rdf-graph-normalization/20111016/\">RDF Graph Normalization</a></cite> Manu Sporny, Dave Longley Editors. World Wide Web Consortium (work in progress). 16 October 2011. Editor's Draft. This edition of the RDF Graph Normalization specification is http://json-ld.org/spec/ED/rdf-graph-normalization/20111016/. The <a href=\"http://json-ld.org/spec/latest/rdf-graph-normalization/\">latest edition of RDF Graph Normalization</a> is available at http://json-ld.org/spec/latest/rdf-graph-normalization/";
-
// process the document before anything else is done
var refs = document.querySelectorAll('adef') ;
for (var i = 0; i < refs.length; i++) {