@@ -107,27 +107,27 @@ class SymbolTree {
107
107
*
108
108
* `O(1)`
109
109
*
110
- * @method prev
110
+ * @method previousSibling
111
111
* @memberOf module:symbol-tree#
112
112
* @param {Object } object
113
113
* @return {Object }
114
114
*/
115
- prev ( object ) {
116
- return this . _node ( object ) . prev ;
115
+ previousSibling ( object ) {
116
+ return this . _node ( object ) . previousSibling ;
117
117
}
118
118
119
119
/**
120
- * Return the next sibling of the given object.
120
+ * Return the nextSibling sibling of the given object.
121
121
*
122
122
* `O(1)`
123
123
*
124
- * @method next
124
+ * @method nextSibling
125
125
* @memberOf module:symbol-tree#
126
126
* @param {Object } object
127
127
* @return {Object }
128
128
*/
129
- next ( object ) {
130
- return this . _node ( object ) . next ;
129
+ nextSibling ( object ) {
130
+ return this . _node ( object ) . nextSibling ;
131
131
}
132
132
133
133
/**
@@ -187,10 +187,10 @@ class SymbolTree {
187
187
return null ;
188
188
}
189
189
190
- const prev = this . _node ( object ) . prev ;
190
+ const previousSibling = this . _node ( object ) . previousSibling ;
191
191
192
- if ( prev ) {
193
- return this . lastInclusiveDescendant ( prev ) ;
192
+ if ( previousSibling ) {
193
+ return this . lastInclusiveDescendant ( previousSibling ) ;
194
194
}
195
195
196
196
// if there is no previous sibling return the parent (might be null)
@@ -229,10 +229,10 @@ class SymbolTree {
229
229
return null ;
230
230
}
231
231
232
- const next = this . _node ( object ) . next ;
232
+ const nextSibling = this . _node ( object ) . nextSibling ;
233
233
234
- if ( next ) {
235
- return next ;
234
+ if ( nextSibling ) {
235
+ return nextSibling ;
236
236
}
237
237
238
238
object = this . _node ( object ) . parent ;
@@ -276,7 +276,7 @@ class SymbolTree {
276
276
array . push ( object ) ;
277
277
}
278
278
279
- object = node . next ;
279
+ object = node . nextSibling ;
280
280
++ index ;
281
281
}
282
282
@@ -387,7 +387,7 @@ class SymbolTree {
387
387
return new TreeIterator (
388
388
this ,
389
389
object ,
390
- this . _node ( object ) . prev ,
390
+ this . _node ( object ) . previousSibling ,
391
391
TreeIterator . PREV
392
392
) ;
393
393
}
@@ -406,7 +406,7 @@ class SymbolTree {
406
406
return new TreeIterator (
407
407
this ,
408
408
object ,
409
- this . _node ( object ) . next ,
409
+ this . _node ( object ) . nextSibling ,
410
410
TreeIterator . NEXT
411
411
) ;
412
412
}
@@ -487,7 +487,7 @@ class SymbolTree {
487
487
488
488
if ( parentNode . childIndexCachedUpTo ) {
489
489
const cachedUpToNode = this . _node ( parentNode . childIndexCachedUpTo ) ;
490
- object = cachedUpToNode . next ;
490
+ object = cachedUpToNode . nextSibling ;
491
491
index = cachedUpToNode . getCachedIndex ( parentNode ) + 1 ;
492
492
}
493
493
@@ -500,7 +500,7 @@ class SymbolTree {
500
500
}
501
501
502
502
++ index ;
503
- object = node . next ;
503
+ object = node . nextSibling ;
504
504
}
505
505
506
506
parentNode . childIndexCachedUpTo = child ;
@@ -635,30 +635,30 @@ class SymbolTree {
635
635
remove ( removeObject ) {
636
636
const removeNode = this . _node ( removeObject ) ;
637
637
const parentNode = this . _node ( removeNode . parent ) ;
638
- const prevNode = this . _node ( removeNode . prev ) ;
639
- const nextNode = this . _node ( removeNode . next ) ;
638
+ const prevNode = this . _node ( removeNode . previousSibling ) ;
639
+ const nextNode = this . _node ( removeNode . nextSibling ) ;
640
640
641
641
if ( parentNode ) {
642
642
if ( parentNode . firstChild === removeObject ) {
643
- parentNode . firstChild = removeNode . next ;
643
+ parentNode . firstChild = removeNode . nextSibling ;
644
644
}
645
645
646
646
if ( parentNode . lastChild === removeObject ) {
647
- parentNode . lastChild = removeNode . prev ;
647
+ parentNode . lastChild = removeNode . previousSibling ;
648
648
}
649
649
}
650
650
651
651
if ( prevNode ) {
652
- prevNode . next = removeNode . next ;
652
+ prevNode . nextSibling = removeNode . nextSibling ;
653
653
}
654
654
655
655
if ( nextNode ) {
656
- nextNode . prev = removeNode . prev ;
656
+ nextNode . previousSibling = removeNode . previousSibling ;
657
657
}
658
658
659
659
removeNode . parent = null ;
660
- removeNode . prev = null ;
661
- removeNode . next = null ;
660
+ removeNode . previousSibling = null ;
661
+ removeNode . nextSibling = null ;
662
662
663
663
if ( parentNode ) {
664
664
parentNode . childrenChanged ( ) ;
@@ -682,7 +682,7 @@ class SymbolTree {
682
682
*/
683
683
insertBefore ( newObject , referenceObject ) {
684
684
const referenceNode = this . _node ( referenceObject ) ;
685
- const prevNode = this . _node ( referenceNode . prev ) ;
685
+ const prevNode = this . _node ( referenceNode . previousSibling ) ;
686
686
const newNode = this . _node ( newObject ) ;
687
687
const parentNode = this . _node ( referenceNode . parent ) ;
688
688
@@ -691,12 +691,12 @@ class SymbolTree {
691
691
}
692
692
693
693
newNode . parent = referenceNode . parent ;
694
- newNode . prev = referenceNode . prev ;
695
- newNode . next = referenceObject ;
696
- referenceNode . prev = newObject ;
694
+ newNode . previousSibling = referenceNode . previousSibling ;
695
+ newNode . nextSibling = referenceObject ;
696
+ referenceNode . previousSibling = newObject ;
697
697
698
698
if ( prevNode ) {
699
- prevNode . next = newObject ;
699
+ prevNode . nextSibling = newObject ;
700
700
}
701
701
702
702
if ( parentNode && parentNode . firstChild === referenceObject ) {
@@ -725,7 +725,7 @@ class SymbolTree {
725
725
*/
726
726
insertAfter ( newObject , referenceObject ) {
727
727
const referenceNode = this . _node ( referenceObject ) ;
728
- const nextNode = this . _node ( referenceNode . next ) ;
728
+ const nextNode = this . _node ( referenceNode . nextSibling ) ;
729
729
const newNode = this . _node ( newObject ) ;
730
730
const parentNode = this . _node ( referenceNode . parent ) ;
731
731
@@ -734,12 +734,12 @@ class SymbolTree {
734
734
}
735
735
736
736
newNode . parent = referenceNode . parent ;
737
- newNode . prev = referenceObject ;
738
- newNode . next = referenceNode . next ;
739
- referenceNode . next = newObject ;
737
+ newNode . previousSibling = referenceObject ;
738
+ newNode . nextSibling = referenceNode . nextSibling ;
739
+ referenceNode . nextSibling = newObject ;
740
740
741
741
if ( nextNode ) {
742
- nextNode . prev = newObject ;
742
+ nextNode . previousSibling = newObject ;
743
743
}
744
744
745
745
if ( parentNode && parentNode . lastChild === referenceObject ) {
0 commit comments