@@ -3468,7 +3468,7 @@ <h3>Algorithm</h3>
3468
3468
member of < var > node map</ var > using the variable < var > graph</ var > . If the
3469
3469
< var > active subject</ var > is < code > null</ code > , set < var > node</ var > to < code > null</ code >
3470
3470
otherwise reference the < var > active subject</ var > member of < var > graph</ var > using the
3471
- variable < var > node</ var > .</ li >
3471
+ variable < var > subject node</ var > .</ li >
3472
3472
< li > If < var > element</ var > has an < code > @type</ code > member, perform for each
3473
3473
< var > item</ var > the following steps:
3474
3474
< ol >
@@ -3481,12 +3481,12 @@ <h3>Algorithm</h3>
3481
3481
< ol >
3482
3482
< li > If < var > list</ var > is < code > null</ code > :
3483
3483
< ol >
3484
- < li > If < var > node</ var > does not have an < var > active property</ var > member,
3484
+ < li > If < var > subject node</ var > does not have an < var > active property</ var > member,
3485
3485
create one and initialize its value to an < a > array</ a >
3486
3486
containing < var > element</ var > .</ li >
3487
3487
< li > Otherwise, compare < var > element</ var > against every item in the
3488
3488
< a > array</ a > associated with the < var > active property</ var >
3489
- member of < var > node</ var > . If there is no item equivalent to < var > element</ var > ,
3489
+ member of < var > subject node</ var > . If there is no item equivalent to < var > element</ var > ,
3490
3490
append < var > element</ var > to the < a > array</ a > . Two
3491
3491
< a class ="changed "> dictionaries</ a > are considered
3492
3492
equal if they have equivalent key-value pairs.</ li >
@@ -3505,7 +3505,7 @@ <h3>Algorithm</h3>
3505
3505
< var > active subject</ var > , < var > active property</ var > , and
3506
3506
< var > result</ var > for < var > list</ var > .</ li >
3507
3507
< li > Append < var > result</ var > to the value of the < var > active property</ var > member
3508
- of < var > node</ var > .</ li >
3508
+ of < var > subject node</ var > .</ li >
3509
3509
</ ol >
3510
3510
</ li >
3511
3511
< li > Otherwise < var > element</ var > is a < a > node object</ a > , perform
@@ -3544,12 +3544,12 @@ <h3>Algorithm</h3>
3544
3544
< code > @id</ code > whose value is < var > id</ var > .</ li >
3545
3545
< li > If < var > list</ var > is < code > null</ code > :
3546
3546
< ol >
3547
- < li > If < var > node</ var > does not have an < var > active property</ var > member,
3547
+ < li > If < var > subject node</ var > does not have an < var > active property</ var > member,
3548
3548
create one and initialize its value to an < a > array</ a >
3549
3549
containing < var > reference</ var > .</ li >
3550
3550
< li > Otherwise, compare < var > reference</ var > against every item in the
3551
3551
< a > array</ a > associated with the < var > active property</ var >
3552
- member of < var > node</ var > . If there is no item equivalent to < var > reference</ var > ,
3552
+ member of < var > subject node</ var > . If there is no item equivalent to < var > reference</ var > ,
3553
3553
append < var > reference</ var > to the < a > array</ a > . Two
3554
3554
< a class ="changed "> dictionaries</ a > are considered
3555
3555
equal if they have equivalent key-value pairs.</ li >
0 commit comments