|
1 | 1 | export function reconcileChildren(workInProgress, elements) {
|
2 | 2 | let index = 0; // 当前遍历的子元素在父节点下的下标
|
3 | 3 | let prevSibling = null; // 记录上一个兄弟节点
|
| 4 | + let oldFiber = workInProgress?.alternate?.child; // 对应的旧 fiber |
4 | 5 |
|
5 |
| - while (index < elements.length) { |
6 |
| - // 遍历子元素 |
| 6 | + while (index < elements.length || oldFiber) { |
| 7 | + // 遍历 elements 和 oldFiber |
7 | 8 | const element = elements[index];
|
8 | 9 | // 创建新的 fiber
|
9 |
| - const newFiber = { |
10 |
| - element, |
11 |
| - return: workInProgress, |
12 |
| - stateNode: null, |
13 |
| - }; |
| 10 | + let newFiber = null; |
| 11 | + const isSameType = |
| 12 | + element?.type && |
| 13 | + oldFiber?.element?.type && |
| 14 | + element.type === oldFiber.element.type; |
| 15 | + |
| 16 | + // 添加 flag 副作用 |
| 17 | + if (isSameType) { |
| 18 | + // type相同,表示更新 |
| 19 | + newFiber = { |
| 20 | + element: { |
| 21 | + ...element, |
| 22 | + props: element.props, |
| 23 | + }, |
| 24 | + stateNode: oldFiber.stateNode, |
| 25 | + return: workInProgress, |
| 26 | + alternate: oldFiber, |
| 27 | + flag: 'Update', |
| 28 | + }; |
| 29 | + } else { |
| 30 | + // type 不同,表示添加或者删除 |
| 31 | + if (element || element === 0) { |
| 32 | + // element 存在,表示添加 |
| 33 | + newFiber = { |
| 34 | + element, |
| 35 | + stateNode: null, |
| 36 | + return: workInProgress, |
| 37 | + alternate: null, |
| 38 | + flag: 'Placement', |
| 39 | + index, |
| 40 | + }; |
| 41 | + } |
| 42 | + if (oldFiber) { |
| 43 | + // oldFiber存在,删除 oldFiber |
| 44 | + oldFiber.flag = 'Deletion'; |
| 45 | + } |
| 46 | + } |
| 47 | + |
| 48 | + if (oldFiber) { |
| 49 | + // oldFiber 存在,则继续遍历其 sibling |
| 50 | + oldFiber = oldFiber.sibling; |
| 51 | + } |
| 52 | + |
14 | 53 | if (index === 0) {
|
15 | 54 | // 如果下标为 0,则将当前fiber设置为父 fiber 的 child
|
16 | 55 | workInProgress.child = newFiber;
|
17 |
| - } else { |
18 |
| - // 否则通过 sibling 作为兄弟 fiber 连接 |
| 56 | + prevSibling = newFiber; |
| 57 | + } else if (newFiber) { |
| 58 | + // newFiber 和 prevSibling 存在,通过 sibling 作为兄弟 fiber 连接 |
19 | 59 | prevSibling.sibling = newFiber;
|
| 60 | + prevSibling = newFiber; |
20 | 61 | }
|
21 |
| - prevSibling = newFiber; |
22 | 62 | index++;
|
23 | 63 | }
|
24 | 64 | }
|
0 commit comments