xuguopeng/rrweb
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix unit test

Browse Source
This commit is contained in:
Yanzhen Yu
2021-05-26 00:04:23 +08:00
parent 995d80a26f
commit 3b20abec2d
1 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
src/record/mutation.ts
View File

@@ -316,7 +316,7 @@ export default class MutationBuffer {
for (const n of this.movedSet) { for (const n of this.movedSet) {
if ( if (
isParentRemoved(this.removes, n) && isParentRemoved(this.removes, n, this.mirror) &&
!this.movedSet.has(n.parentNode!) !this.movedSet.has(n.parentNode!)
) { ) {
continue; continue;
@@ -327,7 +327,7 @@ export default class MutationBuffer {
for (const n of this.addedSet) { for (const n of this.addedSet) {
if ( if (
!isAncestorInSet(this.droppedSet, n) && !isAncestorInSet(this.droppedSet, n) &&
!isParentRemoved(this.removes, n) !isParentRemoved(this.removes, n, this.mirror)
) { ) {
pushAdd(n); pushAdd(n);
} else if (isAncestorInSet(this.movedSet, n)) { } else if (isAncestorInSet(this.movedSet, n)) {
@@ -419,6 +419,7 @@ export default class MutationBuffer {
}; };
private processMutation = (m: mutationRecord) => { private processMutation = (m: mutationRecord) => {
console.log({ m });
if (isIgnored(m.target)) { if (isIgnored(m.target)) {
return; return;
} }
@@ -558,16 +559,20 @@ function deepDelete(addsSet: Set<Node>, n: Node) {
n.childNodes.forEach((childN) => deepDelete(addsSet, childN)); n.childNodes.forEach((childN) => deepDelete(addsSet, childN));
} }
function isParentRemoved(removes: removedNodeMutation[], n: Node): boolean { function isParentRemoved(
removes: removedNodeMutation[],
n: Node,
mirror: Mirror,
): boolean {
const { parentNode } = n; const { parentNode } = n;
if (!parentNode) { if (!parentNode) {
return false; return false;
} }
const parentId = this.mirror.getId((parentNode as Node) as INode); const parentId = mirror.getId((parentNode as Node) as INode);
if (removes.some((r) => r.id === parentId)) { if (removes.some((r) => r.id === parentId)) {
return true; return true;
} }
return isParentRemoved(removes, parentNode); return isParentRemoved(removes, parentNode, mirror);
} }
function isAncestorInSet(set: Set<Node>, n: Node): boolean { function isAncestorInSet(set: Set<Node>, n: Node): boolean {