oss/FrankerFaceZ
oss/FrankerFaceZ
1
0
Fork 0
mirror of https://github.com/FrankerFaceZ/FrankerFaceZ.git synced 2025-09-16 10:06:54 +00:00
Code Wiki Activity

Traverse into different React roots when scanning the tree. This is needed as the new dashboard mounts each widget in its own React root.

Browse source
This commit is contained in:
SirStendec 2018-05-12 02:23:43 -04:00
parent 9dc8252df0
commit 42c3a23840
1 changed files with 38 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

45
src/utilities/compat/fine.js
View file

@ -59,7 +59,7 @@ export default class Fine extends Module {
if ( ! this.accessor ) if ( ! this.accessor )
return; return;
return element[this.accessor]; return element[this.accessor] || (element._reactRootContainer && element._reactRootContainer.current);
} }
getOwner(instance) { getOwner(instance) {
@ -139,7 +139,7 @@ export default class Fine extends Module {
return children; return children;
} }
searchParent(node, criteria, max_depth=15, depth=0) { searchParent(node, criteria, max_depth=15, depth=0, traverse_roots = true) {
if ( node._reactInternalFiber ) if ( node._reactInternalFiber )
node = node._reactInternalFiber; node = node._reactInternalFiber;
else if ( node instanceof Node ) else if ( node instanceof Node )
@ -164,15 +164,27 @@ export default class Fine extends Module {
return inst; return inst;
if ( node.return ) { if ( node.return ) {
const result = this.searchParent(node.return, criteria, max_depth, depth+1); const result = this.searchParent(node.return, criteria, max_depth, depth+1, traverse_roots);
if ( result ) if ( result )
return result; return result;
} }
// Stupid code for traversing up into another React root.
if ( traverse_roots && node.containerInfo ) {
const parent = node.containerInfo.parentElement,
parent_node = parent && this.getReactInstance(parent);
if ( parent_node ) {
const result = this.searchParent(parent_node, criteria, max_depth, depth+1, traverse_roots);
if ( result )
return result;
}
}
return null; return null;
} }
searchTree(node, criteria, max_depth=15, depth=0) { searchTree(node, criteria, max_depth=15, depth=0, traverse_roots = true) {
if ( ! node ) if ( ! node )
node = this.react; node = this.react;
else if ( node._reactInternalFiber ) else if ( node._reactInternalFiber )
@ -201,16 +213,27 @@ export default class Fine extends Module {
if ( node.child ) { if ( node.child ) {
let child = node.child; let child = node.child;
while(child) { while(child) {
const result = this.searchTree(child, criteria, max_depth, depth+1); const result = this.searchTree(child, criteria, max_depth, depth+1, traverse_roots);
if ( result ) if ( result )
return result; return result;
child = child.sibling; child = child.sibling;
} }
} }
if ( traverse_roots && inst && inst.props && inst.props.root ) {
let child = inst.props.root._reactRootContainer && inst.props.root._reactRootContainer.current;
while(child) {
const result = this.searchTree(child, criteria, max_depth, depth+1, traverse_roots);
if ( result )
return result;
child = child.sibling;
}
}
} }
searchAll(node, criterias, max_depth=15, depth=0, data) { searchAll(node, criterias, max_depth=15, depth=0, data, traverse_roots = true) {
if ( ! node ) if ( ! node )
node = this.react; node = this.react;
else if ( node._reactInternalFiber ) else if ( node._reactInternalFiber )
@ -259,7 +282,15 @@ export default class Fine extends Module {
if ( node.child ) { if ( node.child ) {
let child = node.child; let child = node.child;
while(child) { while(child) {
this.searchAll(child, criterias, max_depth, depth+1, data); this.searchAll(child, criterias, max_depth, depth+1, data, traverse_roots);
child = child.sibling;
}
}
if ( traverse_roots && inst && inst.props && inst.props.root ) {
let child = inst.props.root._reactRootContainer && inst.props.root._reactRootContainer.current;
while(child) {
this.searchAll(child, criterias, max_depth, depth+1, data, traverse_roots);
child = child.sibling; child = child.sibling;
} }
} }