@@ -16,7 +16,7 @@ import { commit } from './commit'
16
16
let currentFiber : IFiber
17
17
let effectlist : any = { }
18
18
19
- export const enum LANE {
19
+ export const enum TAG {
20
20
UPDATE = 1 << 1 ,
21
21
INSERT = 1 << 2 ,
22
22
REMOVE = 1 << 3 ,
@@ -34,8 +34,8 @@ export const render = (vnode: FreElement, node: Node): void => {
34
34
}
35
35
36
36
export const update = ( fiber ?: IFiber ) => {
37
- if ( fiber && ! ( fiber . lane & LANE . DIRTY ) ) {
38
- fiber . lane = LANE . UPDATE | LANE . DIRTY
37
+ if ( fiber && ! ( fiber . lane & TAG . DIRTY ) ) {
38
+ fiber . lane = TAG . UPDATE | TAG . DIRTY
39
39
schedule ( ( ) => {
40
40
effectlist = fiber
41
41
return reconcile ( fiber )
@@ -78,8 +78,8 @@ const capture = (wip: IFiber): IFiber | undefined => {
78
78
const getSibling = ( wip ) => {
79
79
while ( wip ) {
80
80
bubble ( wip )
81
- if ( wip . lane & LANE . DIRTY ) {
82
- wip . lane &= ~ LANE . DIRTY
81
+ if ( wip . lane & TAG . DIRTY ) {
82
+ wip . lane &= ~ TAG . DIRTY
83
83
commit ( wip )
84
84
return null
85
85
}
@@ -118,7 +118,7 @@ const updateHook = <P = Attributes>(wip: IFiber): any => {
118
118
const updateHost = ( wip : IFiber ) : void => {
119
119
wip . parentNode = ( getParentNode ( wip ) as any ) || { }
120
120
if ( ! wip . node ) {
121
- if ( wip . type === 'svg' ) wip . lane |= LANE . SVG
121
+ if ( wip . type === 'svg' ) wip . lane |= TAG . SVG
122
122
wip . node = createElement ( wip ) as HTMLElementEx
123
123
}
124
124
wip . childNodes = Array . from ( wip . node . childNodes || [ ] )
@@ -145,12 +145,12 @@ const diffKids = (wip: any, children: FreNode): void => {
145
145
146
146
while ( aHead <= aTail && bHead <= bTail ) {
147
147
if ( ! same ( aCh [ aHead ] , bCh [ bHead ] ) ) break
148
- clone ( aCh [ aHead ++ ] , bCh [ bHead ++ ] , LANE . UPDATE )
148
+ clone ( aCh [ aHead ++ ] , bCh [ bHead ++ ] , TAG . UPDATE )
149
149
}
150
150
151
151
while ( aHead <= aTail && bHead <= bTail ) {
152
152
if ( ! same ( aCh [ aTail ] , bCh [ bTail ] ) ) break
153
- clone ( aCh [ aTail -- ] , bCh [ bTail -- ] , LANE . UPDATE )
153
+ clone ( aCh [ aTail -- ] , bCh [ bTail -- ] , TAG . UPDATE )
154
154
}
155
155
156
156
const { diff, keymap } = LCSdiff ( bCh , aCh , bHead , bTail , aHead , aTail )
@@ -159,44 +159,44 @@ const diffKids = (wip: any, children: FreNode): void => {
159
159
for ( let i = 0 , aIndex = aHead , bIndex = bHead , mIndex ; i < diff . length ; i ++ ) {
160
160
const op = diff [ i ]
161
161
const after = wip . node ?. childNodes [ aIndex ]
162
- if ( op === LANE . UPDATE ) {
162
+ if ( op === TAG . UPDATE ) {
163
163
if ( ! same ( aCh [ aIndex ] , bCh [ bIndex ] ) ) {
164
- bCh [ bIndex ] . lane = LANE . INSERT
164
+ bCh [ bIndex ] . lane = TAG . INSERT
165
165
bCh [ bIndex ] . after = after
166
- aCh [ aIndex ] . lane = LANE . REMOVE
166
+ aCh [ aIndex ] . lane = TAG . REMOVE
167
167
append ( aCh [ aIndex ] )
168
168
append ( bCh [ bIndex ] )
169
169
} else {
170
- clone ( aCh [ aIndex ] , bCh [ bIndex ] , LANE . UPDATE )
170
+ clone ( aCh [ aIndex ] , bCh [ bIndex ] , TAG . UPDATE )
171
171
}
172
172
aIndex ++
173
173
bIndex ++
174
- } else if ( op === LANE . INSERT ) {
174
+ } else if ( op === TAG . INSERT ) {
175
175
let c = bCh [ bIndex ]
176
176
mIndex = c . key != null ? keymap [ c . key ] : null
177
177
if ( mIndex != null ) {
178
178
c . after = after
179
- clone ( aCh [ mIndex ] , c , LANE . INSERT )
179
+ clone ( aCh [ mIndex ] , c , TAG . INSERT )
180
180
aCh [ mIndex ] = undefined
181
181
} else {
182
182
c . after = isMount ? null : after
183
- c . lane = LANE . INSERT
183
+ c . lane = TAG . INSERT
184
184
append ( c )
185
185
}
186
186
bIndex ++
187
- } else if ( op === LANE . REMOVE ) {
187
+ } else if ( op === TAG . REMOVE ) {
188
188
aIndex ++
189
189
}
190
190
}
191
191
192
192
for ( let i = 0 , aIndex = aHead ; i < diff . length ; i ++ ) {
193
193
let op = diff [ i ]
194
- if ( op === LANE . UPDATE ) {
194
+ if ( op === TAG . UPDATE ) {
195
195
aIndex ++
196
- } else if ( op === LANE . REMOVE ) {
196
+ } else if ( op === TAG . REMOVE ) {
197
197
let c = aCh [ aIndex ]
198
198
if ( c !== undefined ) {
199
- c . lane = LANE . REMOVE
199
+ c . lane = TAG . REMOVE
200
200
append ( c )
201
201
}
202
202
aIndex ++
@@ -205,8 +205,8 @@ const diffKids = (wip: any, children: FreNode): void => {
205
205
206
206
for ( let i = 0 , prev = null , len = bCh . length ; i < len ; i ++ ) {
207
207
const child = bCh [ i ]
208
- if ( wip . lane & LANE . SVG ) {
209
- child . lane |= LANE . SVG
208
+ if ( wip . lane & TAG . SVG ) {
209
+ child . lane |= TAG . SVG
210
210
}
211
211
child . parent = wip
212
212
if ( i > 0 ) {
@@ -301,24 +301,24 @@ function LCSdiff(
301
301
while ( ptr ) {
302
302
const { newi, oldi } = ptr
303
303
while ( curNewi > newi ) {
304
- diff [ d -- ] = LANE . INSERT
304
+ diff [ d -- ] = TAG . INSERT
305
305
curNewi --
306
306
}
307
307
while ( curOldi > oldi ) {
308
- diff [ d -- ] = LANE . REMOVE
308
+ diff [ d -- ] = TAG . REMOVE
309
309
curOldi --
310
310
}
311
- diff [ d -- ] = LANE . UPDATE
311
+ diff [ d -- ] = TAG . UPDATE
312
312
curNewi --
313
313
curOldi --
314
314
ptr = ptr . prev
315
315
}
316
316
while ( curNewi >= bHead ) {
317
- diff [ d -- ] = LANE . INSERT
317
+ diff [ d -- ] = TAG . INSERT
318
318
curNewi --
319
319
}
320
320
while ( curOldi >= aHead ) {
321
- diff [ d -- ] = LANE . REMOVE
321
+ diff [ d -- ] = TAG . REMOVE
322
322
curOldi --
323
323
}
324
324
return {
0 commit comments