UNPKG

luhn-generator

Version:

A generator of numbers that passes the validation of Luhn algorithm or Luhn formula, also known as the 'modulus 10' or 'mod 10' algorithm

53 lines (42 loc) 1.52 kB
"use strict"; Object.defineProperty(exports, "__esModule", { value: true }); exports["default"] = mayContainChildComponent; var _jsxAstUtils = require("jsx-ast-utils"); /** * Returns true if it can positively determine that the element lacks an * accessible label. If no determination is possible, it returns false. Treat * false as an unknown value. The element might still have an accessible label, * but this module cannot determine it positively. * * */ function mayContainChildComponent(root, componentName) { var maxDepth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1; function traverseChildren(node, depth) { // Bail when maxDepth is exceeded. if (depth > maxDepth) { return false; } if (node.children) { /* $FlowFixMe */ for (var i = 0; i < node.children.length; i += 1) { /* $FlowFixMe */ var childNode = node.children[i]; // Assume an expression container renders a label. It is the best we can // do in this case. if (childNode.type === 'JSXExpressionContainer') { return true; } // Check for comonents with the provided name. if (childNode.type === 'JSXElement' && childNode.openingElement && (0, _jsxAstUtils.elementType)(childNode.openingElement) === componentName) { return true; } if (traverseChildren(childNode, depth + 1)) { return true; } } } return false; } return traverseChildren(root, 1); }