diff --git a/index.html b/index.html index b7d2f436..ed759f9a 100644 --- a/index.html +++ b/index.html @@ -3468,7 +3468,7 @@

Algorithm

member of node map using the variable graph. If the active subject is null, set node to null otherwise reference the active subject member of graph using the - variable node. + variable subject node.
  • If element has an @type member, perform for each item the following steps:
      @@ -3481,12 +3481,12 @@

      Algorithm

      1. If list is null:
          -
        1. If node does not have an active property member, +
        2. If subject node does not have an active property member, create one and initialize its value to an array containing element.
        3. Otherwise, compare element against every item in the array associated with the active property - member of node. If there is no item equivalent to element, + member of subject node. If there is no item equivalent to element, append element to the array. Two dictionaries are considered equal if they have equivalent key-value pairs.
          4. @@ -3505,7 +3505,7 @@

          Algorithm

          active subject, active property, and result for list.
        4. Append result to the value of the active property member - of node.
          5. + of subject node.
      2. Otherwise element is a node object, perform @@ -3544,12 +3544,12 @@

        Algorithm

        @id whose value is id.
      3. If list is null:
          -
        1. If node does not have an active property member, +
        2. If subject node does not have an active property member, create one and initialize its value to an array containing reference.
        3. Otherwise, compare reference against every item in the array associated with the active property - member of node. If there is no item equivalent to reference, + member of subject node. If there is no item equivalent to reference, append reference to the array. Two dictionaries are considered equal if they have equivalent key-value pairs.