diff --git a/index.html b/index.html index f5bd8023..c0be88be 100644 --- a/index.html +++ b/index.html @@ -29,7 +29,9 @@ // if there a publicly available Editor's Draft, this is the link edDraftURI: "https://w3c.github.io/json-ld-api/", - testSuiteURI: "https://w3c.github.io/json-ld-api/", + testSuiteURI: "https://w3c.github.io/json-ld-api/tests/", + github: "https://github.com/w3c/json-ld-api/", + issueBase: "https://github.com/w3c/json-ld-api/issues/", // if you want to have extra CSS, append them to this list // it is recommended that the respec.css stylesheet be kept @@ -38,7 +40,6 @@ includePermalinks: true, doJsonLd: true, highlightVars: true, - testSuiteURIkey: "https://w3c.github.io/json-ld-api/", postProcess: [internalizeTermListReferences], // editors, add as many as you like @@ -97,8 +98,6 @@ note: "v1.0" } ], - github: "https://github.com/w3c/json-ld-api/", - // name of the WG wg: "JSON-LD Working Group", @@ -1469,12 +1468,13 @@

Algorithm

algorithm recursively, passing active context, active property, item as element, and the frame expansion flag. -
  • If the active property is @list or its - container mapping includes @list, the - expanded item must not be an array or a - list object, otherwise a - list of lists - error has been detected and processing is aborted.
    • +
  • If active property + is @list, or its container mapping is set + to @list, and expanded item is an + array, set expanded item to a new + dictionary containing the key-value pair + @list where the value is the original + expanded item.
  • If expanded item is an array, append each of its items to result. Otherwise, if expanded item is not null, append it to result.
    • @@ -1599,9 +1599,6 @@

    Algorithm

    this algorithm recursively passing active context, active property, value for element, and the frame expansion flag. -
  • If expanded value is a list object, a - list of lists - error has been detected and processing is aborted.
  • If expanded property is @set, set @@ -1711,7 +1708,7 @@

    Algorithm

    language), unless item is null. If language is @none, - or expands to @none, do not set the @language member. + or expands to @none, do not set the @language member.
    • @@ -1813,6 +1810,7 @@

    Algorithm

    pair @graph-ev where ev is represented as an array. +
  • Otherwise, if the term definition associated to key indicates that it is a reverse property
      @@ -2145,6 +2143,13 @@

      Algorithm

      passing active context, inverse context, active property,and element as value is a scalar, return that result. +
    1. If element is a + list object, and the container mapping for active + property in active context is @list, + return the esult of using this algorithm recursively, passing + active context, inverse context, + active property, and value of @list + in element for element.
    2. Initialize inside reverse to true if active property equals @reverse, otherwise to false.
      3. @@ -2393,13 +2398,11 @@

      Algorithm

      @index key in expanded item as value.
    • -
  • Otherwise, item active property must not be a key - in nest result because there cannot be two - list objects associated - with an active property that has a - container mapping; a - compaction to list of lists - error has been detected and processing is aborted.
    • +
  • Otherwise, append compacted item + to the value associated with the key that equals + item active property in + nest result, initializing it to a new empty array, if + necessary.
  • @@ -3504,8 +3507,10 @@

    Algorithm

    @list member for element, active graph, active subject, active property, and result for list.
    • -
  • Append result to the value of the active property member +
  • If list is null, + append result to the value of the active property member of subject node.
    • +
  • Otherwise, append result to the @list member of list.
  • Otherwise element is a node object, perform @@ -3808,24 +3813,19 @@

    Algorithm

    blank node identifier. For each item in values:
      -
    1. If item is a list object, initialize - list triples as an empty array and - list head to the result of the List Conversion algorithm, passing - the value associated with the @list key from - item and list triples. Append first a - triple composed of subject, - property, and list head to triples and - finally append all triples from - list triples to triples.
      2. -
    2. Otherwise, item is a value object - or a node object. Append a triple +
    3. item is a value object, list object, + or a node object.
      4. +
    4. Initialize list triples as an empty array.
      5. +
    5. Append a triple composed of subject, property, and the result of using the Object to RDF Conversion algorithm - passing item to triples, unless the result is - null, indicating a relative IRI that has + passing item + and list triples to triples, + unless the result is null, indicating a relative IRI that has to be ignored.
      6. +
    6. Append all triples from + list triples to triples.
    • @@ -3846,13 +3846,15 @@

    Algorithm

    Object to RDF Conversion

    -

    This algorithm takes a node object or value object +

    This algorithm takes a node object, list object, or value object and transforms it into an RDF resource to be used as the object of an RDF triple. If a node object containing a relative IRI is passed to the algorithm, null is returned which then causes the resulting - RDF triple to be ignored.

    + RDF triple to be ignored. + If the input is a list object, it will also + return the triples created from that input.

    Overview

    @@ -3869,8 +3871,9 @@

    Overview

    Algorithm

    -

    The algorithm takes as its sole argument item which MUST be - either a value object or node object.

    +

    The algorithm takes as two arguments item which MUST be + either a value object, list object, or node object + and list triples, which is an empty array.

    1. If item is a node object and the value of @@ -3879,6 +3882,12 @@

      Algorithm

    2. If item is a node object, return the IRI or blank node identifier associated with its @id member.
      3. +
    3. If item is a list object + return the result of the + List Conversion algorithm, passing + the value associated with the @list key from + item and list triples. +
    4. Otherwise, item is a value object. Initialize value to the value associated with the @value member in item. @@ -3936,7 +3945,7 @@

      Overview

      For each element of the list a new blank node identifier is allocated which is used to generate rdf:first and - rdf:rest ABBR. The + rdf:rest. The algorithm returns the list head, which is either the first allocated blank node identifier or rdf:nil if the list is empty. If a list element represents a relative IRI, @@ -3955,18 +3964,21 @@

      Algorithm

    5. Otherwise, create an array bnodes composed of a newly generated blank node identifier for each entry in list.
      6. -
    6. Initialize an empty array list triples.
    7. For each pair of subject from bnodes and item from list:
        +
      1. Initialize embedded triples to a new empty array.
      2. Initialize object to the result of using the Object to RDF Conversion algorithm - passing item to list triples.
        3. + passing item + and embedded triples for list triples.
      3. Unless object is null, append a triple - composed of subject, rdf:first, and object.
        4. + composed of subject, rdf:first, and object + to list triples.
      4. Set rest as the next entry in bnodes, or if that does not exist, rdf:nil. Append a triple composed of subject, rdf:rest, and rest to list triples.
        5. +
      5. Append all values from embedded triples to list triples
    8. Return the first blank node from bnodes or @@ -4143,28 +4155,6 @@

      Algorithm

      exit the while loop.
    -
  • If property equals rdf:first, i.e., the - detected list is nested inside another list -
      -
    1. and the value of the @id of node equals - rdf:nil, i.e., the detected list is empty, - continue with the next usage item. The - rdf:nil node cannot be converted to a - list object as it would result in a list of - lists, which isn't supported.
      2. -
    2. Otherwise, the list consists of at least one item. We preserve the - head node and transform the rest of the linked list to a - list object.
      3. -
    3. Set head id to the value of the @id - member of head.
      4. -
    4. Set head to the value of the head id member of - graph object so that all it's properties can be accessed.
      5. -
    5. Then, set head to the only item in the value of the - rdf:rest member of head.
      6. -
    6. Finally, remove the last item of the list array - and the last item of the list nodes array.
      7. -
    -
  • Remove the @id member from head.
  • Reverse the order of the list array.
  • Add an @list member to head and initialize @@ -4789,7 +4779,6 @@

    JsonLdErrorCode