38 lines
1.1 KiB
Plaintext
38 lines
1.1 KiB
Plaintext
|
/**
|
||
|
|
* Copyright (c) 2013-present, Facebook, Inc.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* This source code is licensed under the BSD-style license found in the
|
||
|
|
* LICENSE file in the root directory of this source tree. An additional grant
|
||
|
|
* of patent rights can be found in the PATENTS file in the same directory.
|
||
|
|
*
|
||
|
|
* @providesModule containsNode
|
||
|
|
* @flow
|
||
|
|
*/
|
||
|
|
|
||
|
|
const isTextNode = require('./isTextNode');
|
||
|
|
|
||
|
|
/*eslint-disable no-bitwise */
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Checks if a given DOM node contains or is another DOM node.
|
||
|
|
*/
|
||
|
|
function containsNode(outerNode: ?Node, innerNode: ?Node): boolean {
|
||
|
|
if (!outerNode || !innerNode) {
|
||
|
|
return false;
|
||
|
|
} else if (outerNode === innerNode) {
|
||
|
|
return true;
|
||
|
|
} else if (isTextNode(outerNode)) {
|
||
|
|
return false;
|
||
|
|
} else if (isTextNode(innerNode)) {
|
||
|
|
return containsNode(outerNode, innerNode.parentNode);
|
||
|
|
} else if ('contains' in outerNode) {
|
||
|
|
return outerNode.contains(innerNode);
|
||
|
|
} else if (outerNode.compareDocumentPosition) {
|
||
|
|
return !!(outerNode.compareDocumentPosition(innerNode) & 16);
|
||
|
|
} else {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
module.exports = containsNode;
|