{ "errors": [ "./src/index.js\nModule not found: Error: Can't resolve 'react-tooltip' in '/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src'\nresolve 'react-tooltip' in '/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src'\n Parsed request is a module\n using description file: /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/package.json (relative path: ./src)\n Field 'browser' doesn't contain a valid alias configuration\n after using description file: /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/package.json (relative path: ./src)\n resolve as module\n /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/node_modules doesn't exist or is not a directory\n /Users/mike/dev/enzoic/node_modules doesn't exist or is not a directory\n /Users/mike/dev/node_modules doesn't exist or is not a directory\n /Users/mike/node_modules doesn't exist or is not a directory\n /Users/node_modules doesn't exist or is not a directory\n /node_modules doesn't exist or is not a directory\n looking for modules in /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules\n using description file: /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/package.json (relative path: ./node_modules)\n Field 'browser' doesn't contain a valid alias configuration\n after using description file: /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/package.json (relative path: ./node_modules)\n using description file: /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/package.json (relative path: ./node_modules/react-tooltip)\n no extension\n Field 'browser' doesn't contain a valid alias configuration\n /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip doesn't exist\n .js\n Field 'browser' doesn't contain a valid alias configuration\n /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip.js doesn't exist\n as directory\n /Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip doesn't exist\n[/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/node_modules]\n[/Users/mike/dev/enzoic/node_modules]\n[/Users/mike/dev/node_modules]\n[/Users/mike/node_modules]\n[/Users/node_modules]\n[/node_modules]\n[/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip]\n[/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip.js]\n[/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/react-tooltip]\n @ ./src/index.js 47:20-44" ], "warnings": [], "version": "3.12.0", "hash": "7557953132dcc06286cd", "time": 2033, "publicPath": "", "assetsByChunkName": { "main": "../dist/index.js" }, "assets": [ { "name": "../dist/index.js", "size": 195016, "chunks": [ 0 ], "chunkNames": [ "main" ], "emitted": true } ], "filteredAssets": 0, "entrypoints": { "main": { "chunks": [ 0 ], "assets": [ "../dist/index.js" ] } }, "chunks": [ { "id": 0, "rendered": true, "initial": true, "entry": true, "extraAsync": false, "size": 189819, "names": [ "main" ], "files": [ "../dist/index.js" ], "hash": "ca32baff6caeee6edda0", "parents": [], "modules": [ { "id": 0, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/scoring.js", "name": "./src/zxcvbn/scoring.js", "index": 10, "index2": 7, "size": 25316, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/index.js", "issuerId": 12, "issuerName": "./src/zxcvbn/index.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 12, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/index.js", "module": "./src/zxcvbn/index.js", "moduleName": "./src/zxcvbn/index.js", "type": "cjs require", "userRequest": "./scoring", "loc": "13:14-34" }, { "moduleId": 13, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/matching.js", "module": "./src/zxcvbn/matching.js", "moduleName": "./src/zxcvbn/matching.js", "type": "cjs require", "userRequest": "./scoring", "loc": "7:14-34" }, { "moduleId": 16, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/feedback.js", "module": "./src/zxcvbn/feedback.js", "moduleName": "./src/zxcvbn/feedback.js", "type": "cjs require", "userRequest": "./scoring", "loc": "17:14-34" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 2, "source": "'use strict';\n\n/*\n * decaffeinate suggestions:\n * DS101: Remove unnecessary use of Array.from\n * DS102: Remove unnecessary code created because of implicit returns\n * DS202: Simplify dynamic range loops\n * DS205: Consider reworking code to avoid use of IIFEs\n * DS207: Consider shorter variations of null checks\n * Full docs: https://github.com/decaffeinate/decaffeinate/blob/master/docs/suggestions.md\n */\nvar k = void 0,\n v = void 0;\nvar adjacency_graphs = require('./adjacency_graphs');\n\n// on qwerty, 'g' has degree 6, being adjacent to 'ftyhbv'. '\\' has degree 1.\n// this calculates the average over all keys.\nvar calc_average_degree = function calc_average_degree(graph) {\n var average = 0;\n for (var key in graph) {\n var neighbors = graph[key];\n average += Array.from(neighbors).filter(function (n) {\n return n;\n }).length;\n }\n average /= function () {\n var result = [];\n for (k in graph) {\n v = graph[k];\n result.push(k);\n }\n return result;\n }().length;\n return average;\n};\n\nvar BRUTEFORCE_CARDINALITY = 10;\nvar MIN_GUESSES_BEFORE_GROWING_SEQUENCE = 10000;\nvar MIN_SUBMATCH_GUESSES_SINGLE_CHAR = 10;\nvar MIN_SUBMATCH_GUESSES_MULTI_CHAR = 50;\n\nvar scoring = {\n nCk: function nCk(n, k) {\n // http://blog.plover.com/math/choose.html\n if (k > n) {\n return 0;\n }\n if (k === 0) {\n return 1;\n }\n var r = 1;\n for (var d = 1, end = k, asc = 1 <= end; asc ? d <= end : d >= end; asc ? d++ : d--) {\n r *= n;\n r /= d;\n n -= 1;\n }\n return r;\n },\n log10: function log10(n) {\n return Math.log(n) / Math.log(10);\n },\n // IE doesn't support Math.log10 :(\n log2: function log2(n) {\n return Math.log(n) / Math.log(2);\n },\n factorial: function factorial(n) {\n // unoptimized, called only on small n\n if (n < 2) {\n return 1;\n }\n var f = 1;\n for (var i = 2, end = n, asc = 2 <= end; asc ? i <= end : i >= end; asc ? i++ : i--) {\n f *= i;\n }\n return f;\n },\n\n\n // ------------------------------------------------------------------------------\n // search --- most guessable match sequence -------------------------------------\n // ------------------------------------------------------------------------------\n //\n // takes a sequence of overlapping matches, returns the non-overlapping sequence with\n // minimum guesses. the following is a O(l_max * (n + m)) dynamic programming algorithm\n // for a length-n password with m candidate matches. l_max is the maximum optimal\n // sequence length spanning each prefix of the password. In practice it rarely exceeds 5 and the\n // search terminates rapidly.\n //\n // the optimal \"minimum guesses\" sequence is here defined to be the sequence that\n // minimizes the following function:\n //\n // g = l! * Product(m.guesses for m in sequence) + D^(l - 1)\n //\n // where l is the length of the sequence.\n //\n // the factorial term is the number of ways to order l patterns.\n //\n // the D^(l-1) term is another length penalty, roughly capturing the idea that an\n // attacker will try lower-length sequences first before trying length-l sequences.\n //\n // for example, consider a sequence that is date-repeat-dictionary.\n // - an attacker would need to try other date-repeat-dictionary combinations,\n // hence the product term.\n // - an attacker would need to try repeat-date-dictionary, dictionary-repeat-date,\n // ..., hence the factorial term.\n // - an attacker would also likely try length-1 (dictionary) and length-2 (dictionary-date)\n // sequences before length-3. assuming at minimum D guesses per pattern type,\n // D^(l-1) approximates Sum(D^i for i in [1..l-1]\n //\n // ------------------------------------------------------------------------------\n\n most_guessable_match_sequence: function most_guessable_match_sequence(password, matches, _exclude_additive) {\n var _this = this;\n\n var asc4 = void 0,\n end4 = void 0;\n var guesses = void 0;\n var _ = void 0;\n if (_exclude_additive == null) {\n _exclude_additive = false;\n }\n var n = password.length;\n\n // partition matches into sublists according to ending index j\n var matches_by_j = function () {\n var asc = void 0,\n end = void 0;\n var result = [];\n for (_ = 0, end = n, asc = 0 <= end; asc ? _ < end : _ > end; asc ? _++ : _--) {\n result.push([]);\n }\n return result;\n }();\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = Array.from(matches)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var m = _step.value;\n\n matches_by_j[m.j].push(m);\n }\n // small detail: for deterministic output, sort each sublist by i.\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = Array.from(matches_by_j)[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var lst = _step2.value;\n\n lst.sort(function (m1, m2) {\n return m1.i - m2.i;\n });\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n\n var optimal = {\n // optimal.m[k][l] holds final match in the best length-l match sequence covering the\n // password prefix up to k, inclusive.\n // if there is no length-l sequence that scores better (fewer guesses) than\n // a shorter match sequence spanning the same prefix, optimal.m[k][l] is undefined.\n m: function () {\n var asc1 = void 0,\n end1 = void 0;\n var result1 = [];\n for (_ = 0, end1 = n, asc1 = 0 <= end1; asc1 ? _ < end1 : _ > end1; asc1 ? _++ : _--) {\n result1.push({});\n }\n return result1;\n }(),\n\n // same structure as optimal.m -- holds the product term Prod(m.guesses for m in sequence).\n // optimal.pi allows for fast (non-looping) updates to the minimization function.\n pi: function () {\n var asc2 = void 0,\n end2 = void 0;\n var result2 = [];\n for (_ = 0, end2 = n, asc2 = 0 <= end2; asc2 ? _ < end2 : _ > end2; asc2 ? _++ : _--) {\n result2.push({});\n }\n return result2;\n }(),\n\n // same structure as optimal.m -- holds the overall metric.\n g: function () {\n var asc3 = void 0,\n end3 = void 0;\n var result3 = [];\n for (_ = 0, end3 = n, asc3 = 0 <= end3; asc3 ? _ < end3 : _ > end3; asc3 ? _++ : _--) {\n result3.push({});\n }\n return result3;\n }()\n };\n\n // helper: considers whether a length-l sequence ending at match m is better (fewer guesses)\n // than previously encountered sequences, updating state if so.\n var update = function update(m, l) {\n k = m.j;\n var pi = _this.estimate_guesses(m, password);\n if (l > 1) {\n // we're considering a length-l sequence ending with match m:\n // obtain the product term in the minimization function by multiplying m's guesses\n // by the product of the length-(l-1) sequence ending just before m, at m.i - 1.\n pi *= optimal.pi[m.i - 1][l - 1];\n }\n // calculate the minimization func\n var g = _this.factorial(l) * pi;\n if (!_exclude_additive) {\n g += Math.pow(MIN_GUESSES_BEFORE_GROWING_SEQUENCE, l - 1);\n }\n // update state if new best.\n // first see if any competing sequences covering this prefix, with l or fewer matches,\n // fare better than this sequence. if so, skip it and return.\n for (var competing_l in optimal.g[k]) {\n var competing_g = optimal.g[k][competing_l];\n if (competing_l > l) {\n continue;\n }\n if (competing_g <= g) {\n return;\n }\n }\n // this sequence might be part of the final optimal sequence.\n optimal.g[k][l] = g;\n optimal.m[k][l] = m;\n return optimal.pi[k][l] = pi;\n };\n\n // helper: evaluate bruteforce matches ending at k.\n var bruteforce_update = function bruteforce_update(k) {\n // see if a single bruteforce match spanning the k-prefix is optimal.\n m = make_bruteforce_match(0, k);\n update(m, 1);\n return function () {\n var result4 = [];\n for (var i = 1, end4 = k, asc4 = 1 <= end4; asc4 ? i <= end4 : i >= end4; asc4 ? i++ : i--) {\n // generate k bruteforce matches, spanning from (i=1, j=k) up to (i=k, j=k).\n // see if adding these new matches to any of the sequences in optimal[i-1]\n // leads to new bests.\n m = make_bruteforce_match(i, k);\n result4.push(function () {\n var result5 = [];\n var object = optimal.m[i - 1];\n for (var l in object) {\n var last_m = object[l];\n l = parseInt(l);\n // corner: an optimal sequence will never have two adjacent bruteforce matches.\n // it is strictly better to have a single bruteforce match spanning the same region:\n // same contribution to the guess product with a lower length.\n // --> safe to skip those cases.\n if (last_m.pattern === 'bruteforce') {\n continue;\n }\n // try adding m to this length-l sequence.\n result5.push(update(m, l + 1));\n }\n return result5;\n }());\n }\n return result4;\n }();\n };\n\n // helper: make bruteforce match objects spanning i to j, inclusive.\n var make_bruteforce_match = function make_bruteforce_match(i, j) {\n return {\n pattern: 'bruteforce',\n token: password.slice(i, +j + 1 || undefined),\n i: i,\n j: j\n };\n };\n\n // helper: step backwards through optimal.m starting at the end,\n // constructing the final optimal match sequence.\n var unwind = function unwind(n) {\n var optimal_match_sequence = [];\n k = n - 1;\n // find the final best sequence length and score\n var l = undefined;\n var g = Infinity;\n for (var candidate_l in optimal.g[k]) {\n var candidate_g = optimal.g[k][candidate_l];\n if (candidate_g < g) {\n l = candidate_l;\n g = candidate_g;\n }\n }\n\n while (k >= 0) {\n m = optimal.m[k][l];\n optimal_match_sequence.unshift(m);\n k = m.i - 1;\n l--;\n }\n return optimal_match_sequence;\n };\n\n for (k = 0, end4 = n, asc4 = 0 <= end4; asc4 ? k < end4 : k > end4; asc4 ? k++ : k--) {\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = Array.from(matches_by_j[k])[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n m = _step3.value;\n\n if (m.i > 0) {\n for (var l in optimal.m[m.i - 1]) {\n l = parseInt(l);\n update(m, l + 1);\n }\n } else {\n update(m, 1);\n }\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n\n bruteforce_update(k);\n }\n var optimal_match_sequence = unwind(n);\n var optimal_l = optimal_match_sequence.length;\n\n // corner: empty password\n if (password.length === 0) {\n guesses = 1;\n } else {\n guesses = optimal.g[n - 1][optimal_l];\n }\n\n // final result object\n return {\n password: password,\n guesses: guesses,\n guesses_log10: this.log10(guesses),\n sequence: optimal_match_sequence\n };\n },\n\n\n // ------------------------------------------------------------------------------\n // guess estimation -- one function per match pattern ---------------------------\n // ------------------------------------------------------------------------------\n\n estimate_guesses: function estimate_guesses(match, password) {\n if (match.guesses != null) {\n return match.guesses;\n } // a match's guess estimate doesn't change. cache it.\n var min_guesses = 1;\n if (match.token.length < password.length) {\n min_guesses = match.token.length === 1 ? MIN_SUBMATCH_GUESSES_SINGLE_CHAR : MIN_SUBMATCH_GUESSES_MULTI_CHAR;\n }\n var estimation_functions = {\n bruteforce: this.bruteforce_guesses,\n dictionary: this.dictionary_guesses,\n spatial: this.spatial_guesses,\n repeat: this.repeat_guesses,\n sequence: this.sequence_guesses,\n regex: this.regex_guesses,\n date: this.date_guesses\n };\n var guesses = estimation_functions[match.pattern].call(this, match);\n match.guesses = Math.max(guesses, min_guesses);\n match.guesses_log10 = this.log10(match.guesses);\n return match.guesses;\n },\n bruteforce_guesses: function bruteforce_guesses(match) {\n var guesses = Math.pow(BRUTEFORCE_CARDINALITY, match.token.length);\n if (guesses === Number.POSITIVE_INFINITY) {\n guesses = Number.MAX_VALUE;\n }\n // small detail: make bruteforce matches at minimum one guess bigger than smallest allowed\n // submatch guesses, such that non-bruteforce submatches over the same [i..j] take precedence.\n var min_guesses = match.token.length === 1 ? MIN_SUBMATCH_GUESSES_SINGLE_CHAR + 1 : MIN_SUBMATCH_GUESSES_MULTI_CHAR + 1;\n return Math.max(guesses, min_guesses);\n },\n repeat_guesses: function repeat_guesses(match) {\n return match.base_guesses * match.repeat_count;\n },\n sequence_guesses: function sequence_guesses(match) {\n var base_guesses = void 0;\n var first_chr = match.token.charAt(0);\n // lower guesses for obvious starting points\n if (['a', 'A', 'z', 'Z', '0', '1', '9'].includes(first_chr)) {\n base_guesses = 4;\n } else {\n if (first_chr.match(/\\d/)) {\n base_guesses = 10; // digits\n } else {\n // could give a higher base for uppercase,\n // assigning 26 to both upper and lower sequences is more conservative.\n base_guesses = 26;\n }\n }\n if (!match.ascending) {\n // need to try a descending sequence in addition to every ascending sequence ->\n // 2x guesses\n base_guesses *= 2;\n }\n return base_guesses * match.token.length;\n },\n\n\n MIN_YEAR_SPACE: 20,\n REFERENCE_YEAR: new Date().getFullYear(),\n\n regex_guesses: function regex_guesses(match) {\n var char_class_bases = {\n alpha_lower: 26,\n alpha_upper: 26,\n alpha: 52,\n alphanumeric: 62,\n digits: 10,\n symbols: 33\n };\n if (match.regex_name in char_class_bases) {\n return Math.pow(char_class_bases[match.regex_name], match.token.length);\n } else {\n switch (match.regex_name) {\n case 'recent_year':\n // conservative estimate of year space: num years from REFERENCE_YEAR.\n // if year is close to REFERENCE_YEAR, estimate a year space of MIN_YEAR_SPACE.\n var year_space = Math.abs(parseInt(match.regex_match[0]) - this.REFERENCE_YEAR);\n year_space = Math.max(year_space, this.MIN_YEAR_SPACE);\n return year_space;\n }\n }\n },\n date_guesses: function date_guesses(match) {\n // base guesses: (year distance from REFERENCE_YEAR) * num_days * num_years\n var year_space = Math.max(Math.abs(match.year - this.REFERENCE_YEAR), this.MIN_YEAR_SPACE);\n var guesses = year_space * 365;\n // add factor of 4 for separator selection (one of ~4 choices)\n if (match.separator) {\n guesses *= 4;\n }\n return guesses;\n },\n\n\n KEYBOARD_AVERAGE_DEGREE: calc_average_degree(adjacency_graphs.qwerty),\n // slightly different for keypad/mac keypad, but close enough\n KEYPAD_AVERAGE_DEGREE: calc_average_degree(adjacency_graphs.keypad),\n\n KEYBOARD_STARTING_POSITIONS: function () {\n var result = [];\n for (k in adjacency_graphs.qwerty) {\n v = adjacency_graphs.qwerty[k];\n result.push(k);\n }\n return result;\n }().length,\n KEYPAD_STARTING_POSITIONS: function () {\n var result1 = [];\n for (k in adjacency_graphs.keypad) {\n v = adjacency_graphs.keypad[k];\n result1.push(k);\n }\n return result1;\n }().length,\n\n spatial_guesses: function spatial_guesses(match) {\n var d = void 0,\n i = void 0,\n s = void 0;\n var asc = void 0,\n end = void 0;\n if (['qwerty', 'dvorak'].includes(match.graph)) {\n s = this.KEYBOARD_STARTING_POSITIONS;\n d = this.KEYBOARD_AVERAGE_DEGREE;\n } else {\n s = this.KEYPAD_STARTING_POSITIONS;\n d = this.KEYPAD_AVERAGE_DEGREE;\n }\n var guesses = 0;\n var L = match.token.length;\n var t = match.turns;\n // estimate the number of possible patterns w/ length L or less with t turns or less.\n for (i = 2, end = L, asc = 2 <= end; asc ? i <= end : i >= end; asc ? i++ : i--) {\n var possible_turns = Math.min(t, i - 1);\n for (var j = 1, end1 = possible_turns, asc1 = 1 <= end1; asc1 ? j <= end1 : j >= end1; asc1 ? j++ : j--) {\n guesses += this.nCk(i - 1, j - 1) * s * Math.pow(d, j);\n }\n }\n // add extra guesses for shifted keys. (% instead of 5, A instead of a.)\n // math is similar to extra guesses of l33t substitutions in dictionary matches.\n if (match.shifted_count) {\n var S = match.shifted_count;\n var U = match.token.length - match.shifted_count; // unshifted count\n if (S === 0 || U === 0) {\n guesses *= 2;\n } else {\n var asc2 = void 0,\n end2 = void 0;\n var shifted_variations = 0;\n for (i = 1, end2 = Math.min(S, U), asc2 = 1 <= end2; asc2 ? i <= end2 : i >= end2; asc2 ? i++ : i--) {\n shifted_variations += this.nCk(S + U, i);\n }\n guesses *= shifted_variations;\n }\n }\n return guesses;\n },\n dictionary_guesses: function dictionary_guesses(match) {\n match.base_guesses = match.rank; // keep these as properties for display purposes\n match.uppercase_variations = this.uppercase_variations(match);\n match.l33t_variations = this.l33t_variations(match);\n var reversed_variations = match.reversed && 2 || 1;\n return match.base_guesses * match.uppercase_variations * match.l33t_variations * reversed_variations;\n },\n\n\n START_UPPER: /^[A-Z][^A-Z]+$/,\n END_UPPER: /^[^A-Z]+[A-Z]$/,\n ALL_UPPER: /^[^a-z]+$/,\n ALL_LOWER: /^[^A-Z]+$/,\n\n uppercase_variations: function uppercase_variations(match) {\n var chr = void 0;\n var word = match.token;\n if (word.match(this.ALL_LOWER) || word.toLowerCase() === word) {\n return 1;\n }\n // a capitalized word is the most common capitalization scheme,\n // so it only doubles the search space (uncapitalized + capitalized).\n // allcaps and end-capitalized are common enough too, underestimate as 2x factor to be safe.\n var _arr = [this.START_UPPER, this.END_UPPER, this.ALL_UPPER];\n for (var _i = 0; _i < _arr.length; _i++) {\n var regex = _arr[_i];\n if (word.match(regex)) {\n return 2;\n }\n }\n // otherwise calculate the number of ways to capitalize U+L uppercase+lowercase letters\n // with U uppercase letters or less. or, if there's more uppercase than lower (for eg. PASSwORD),\n // the number of ways to lowercase U+L letters with L lowercase letters or less.\n var U = function () {\n var result2 = [];\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = Array.from(word.split(''))[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n chr = _step4.value;\n if (chr.match(/[A-Z]/)) {\n result2.push(chr);\n }\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n\n return result2;\n }().length;\n var L = function () {\n var result3 = [];\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = Array.from(word.split(''))[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n chr = _step5.value;\n if (chr.match(/[a-z]/)) {\n result3.push(chr);\n }\n }\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n\n return result3;\n }().length;\n var variations = 0;\n for (var i = 1, end = Math.min(U, L), asc = 1 <= end; asc ? i <= end : i >= end; asc ? i++ : i--) {\n variations += this.nCk(U + L, i);\n }\n return variations;\n },\n l33t_variations: function l33t_variations(match) {\n var chr = void 0;\n if (!match.l33t) {\n return 1;\n }\n var variations = 1;\n for (var subbed in match.sub) {\n // lower-case match.token before calculating: capitalization shouldn't affect l33t calc.\n var unsubbed = match.sub[subbed];\n var chrs = match.token.toLowerCase().split('');\n var S = function () {\n var result2 = [];\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = Array.from(chrs)[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n chr = _step6.value;\n if (chr === subbed) {\n result2.push(chr);\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n\n return result2;\n }().length; // num of subbed chars\n var U = function () {\n var result3 = [];\n var _iteratorNormalCompletion7 = true;\n var _didIteratorError7 = false;\n var _iteratorError7 = undefined;\n\n try {\n for (var _iterator7 = Array.from(chrs)[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\n chr = _step7.value;\n if (chr === unsubbed) {\n result3.push(chr);\n }\n }\n } catch (err) {\n _didIteratorError7 = true;\n _iteratorError7 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion7 && _iterator7.return) {\n _iterator7.return();\n }\n } finally {\n if (_didIteratorError7) {\n throw _iteratorError7;\n }\n }\n }\n\n return result3;\n }().length; // num of unsubbed chars\n if (S === 0 || U === 0) {\n // for this sub, password is either fully subbed (444) or fully unsubbed (aaa)\n // treat that as doubling the space (attacker needs to try fully subbed chars in addition to\n // unsubbed.)\n variations *= 2;\n } else {\n // this case is similar to capitalization:\n // with aa44a, U = 3, S = 2, attacker needs to try unsubbed + one sub + two subs\n var p = Math.min(U, S);\n var possibilities = 0;\n for (var i = 1, end = p, asc = 1 <= end; asc ? i <= end : i >= end; asc ? i++ : i--) {\n possibilities += this.nCk(U + S, i);\n }\n variations *= possibilities;\n }\n }\n return variations;\n }\n};\n\n// utilities --------------------------------------------------------------------\n\nmodule.exports = scoring;" }, { "id": 1, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/process/browser.js", "name": "./node_modules/process/browser.js", "index": 15, "index2": 13, "size": 5418, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/index.js", "issuerId": 17, "issuerName": "./node_modules/prop-types/index.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 17, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/index.js", "module": "./node_modules/prop-types/index.js", "moduleName": "./node_modules/prop-types/index.js", "type": "cjs require", "userRequest": "process", "loc": "1:0-34" }, { "moduleId": 18, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/factoryWithTypeCheckers.js", "module": "./node_modules/prop-types/factoryWithTypeCheckers.js", "moduleName": "./node_modules/prop-types/factoryWithTypeCheckers.js", "type": "cjs require", "userRequest": "process", "loc": "1:0-34" }, { "moduleId": 20, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/checkPropTypes.js", "module": "./node_modules/prop-types/checkPropTypes.js", "moduleName": "./node_modules/prop-types/checkPropTypes.js", "type": "cjs require", "userRequest": "process", "loc": "1:0-34" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 2, "source": "// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n" }, { "id": 2, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/lib/ReactPropTypesSecret.js", "name": "./node_modules/prop-types/lib/ReactPropTypesSecret.js", "index": 18, "index2": 15, "size": 314, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/factoryWithTypeCheckers.js", "issuerId": 18, "issuerName": "./node_modules/prop-types/factoryWithTypeCheckers.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 18, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/factoryWithTypeCheckers.js", "module": "./node_modules/prop-types/factoryWithTypeCheckers.js", "moduleName": "./node_modules/prop-types/factoryWithTypeCheckers.js", "type": "cjs require", "userRequest": "./lib/ReactPropTypesSecret", "loc": "12:27-64" }, { "moduleId": 20, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/checkPropTypes.js", "module": "./node_modules/prop-types/checkPropTypes.js", "moduleName": "./node_modules/prop-types/checkPropTypes.js", "type": "cjs require", "userRequest": "./lib/ReactPropTypesSecret", "loc": "13:29-66" }, { "moduleId": 21, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/prop-types/factoryWithThrowingShims.js", "module": "./node_modules/prop-types/factoryWithThrowingShims.js", "moduleName": "./node_modules/prop-types/factoryWithThrowingShims.js", "type": "cjs require", "userRequest": "./lib/ReactPropTypesSecret", "loc": "10:27-64" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 3, "source": "/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n" }, { "id": 3, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/hashes/utils.js", "name": "./src/hashes/utils.js", "index": 22, "index2": 20, "size": 898, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/hashes/sha1.js", "issuerId": 22, "issuerName": "./src/hashes/sha1.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 22, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/hashes/sha1.js", "module": "./src/hashes/sha1.js", "moduleName": "./src/hashes/sha1.js", "type": "cjs require", "userRequest": "./utils", "loc": "7:13-31" }, { "moduleId": 23, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/hashes/sha256.js", "module": "./src/hashes/sha256.js", "moduleName": "./src/hashes/sha256.js", "type": "cjs require", "userRequest": "./utils", "loc": "7:13-31" }, { "moduleId": 24, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/hashes/md5.js", "module": "./src/hashes/md5.js", "moduleName": "./src/hashes/md5.js", "type": "cjs require", "userRequest": "./utils", "loc": "228:13-31" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 2, "source": "\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.default = {\n /**\n * Rotates right (circular right shift) value x by n positions [§3.2.4].\n * @private\n */\n ROTR: function ROTR(n, x) {\n return x >>> n | x << 32 - n;\n },\n\n /**\n * Rotates left (circular left shift) value x by n positions [§3.2.5].\n * @private\n */\n ROTL: function ROTL(x, n) {\n return x << n | x >>> 32 - n;\n },\n\n /**\n * Hexadecimal representation of a number.\n * @private\n */\n toHexStr: function toHexStr(n) {\n // note can't use toString(16) as it is implementation-dependant,\n // and in IE returns signed numbers when used on full words\n var s = \"\",\n v;\n for (var i = 7; i >= 0; i--) {\n v = n >>> i * 4 & 0xf;s += v.toString(16);\n }\n return s;\n }\n\n};" }, { "id": 4, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/adjacency_graphs.js", "name": "./src/zxcvbn/adjacency_graphs.js", "index": 9, "index2": 6, "size": 9849, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/matching.js", "issuerId": 13, "issuerName": "./src/zxcvbn/matching.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 0, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/scoring.js", "module": "./src/zxcvbn/scoring.js", "moduleName": "./src/zxcvbn/scoring.js", "type": "cjs require", "userRequest": "./adjacency_graphs", "loc": "14:23-52" }, { "moduleId": 13, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/matching.js", "module": "./src/zxcvbn/matching.js", "moduleName": "./src/zxcvbn/matching.js", "type": "cjs require", "userRequest": "./adjacency_graphs", "loc": "6:23-52" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 3, "source": "\"use strict\";\n\n// generated by scripts/build_keyboard_adjacency_graphs.py\nvar adjacency_graphs = {\n qwerty: { \"!\": [\"`~\", null, null, \"2@\", \"qQ\", null], \"\\\"\": [\";:\", \"[{\", \"]}\", null, null, \"/?\"], \"#\": [\"2@\", null, null, \"4$\", \"eE\", \"wW\"], \"$\": [\"3#\", null, null, \"5%\", \"rR\", \"eE\"], \"%\": [\"4$\", null, null, \"6^\", \"tT\", \"rR\"], \"&\": [\"6^\", null, null, \"8*\", \"uU\", \"yY\"], \"'\": [\";:\", \"[{\", \"]}\", null, null, \"/?\"], \"(\": [\"8*\", null, null, \"0)\", \"oO\", \"iI\"], \")\": [\"9(\", null, null, \"-_\", \"pP\", \"oO\"], \"*\": [\"7&\", null, null, \"9(\", \"iI\", \"uU\"], \"+\": [\"-_\", null, null, null, \"]}\", \"[{\"], \",\": [\"mM\", \"kK\", \"lL\", \".>\", null, null], \"-\": [\"0)\", null, null, \"=+\", \"[{\", \"pP\"], \".\": [\",<\", \"lL\", \";:\", \"/?\", null, null], \"/\": [\".>\", \";:\", \"'\\\"\", null, null, null], \"0\": [\"9(\", null, null, \"-_\", \"pP\", \"oO\"], \"1\": [\"`~\", null, null, \"2@\", \"qQ\", null], \"2\": [\"1!\", null, null, \"3#\", \"wW\", \"qQ\"], \"3\": [\"2@\", null, null, \"4$\", \"eE\", \"wW\"], \"4\": [\"3#\", null, null, \"5%\", \"rR\", \"eE\"], \"5\": [\"4$\", null, null, \"6^\", \"tT\", \"rR\"], \"6\": [\"5%\", null, null, \"7&\", \"yY\", \"tT\"], \"7\": [\"6^\", null, null, \"8*\", \"uU\", \"yY\"], \"8\": [\"7&\", null, null, \"9(\", \"iI\", \"uU\"], \"9\": [\"8*\", null, null, \"0)\", \"oO\", \"iI\"], \":\": [\"lL\", \"pP\", \"[{\", \"'\\\"\", \"/?\", \".>\"], \";\": [\"lL\", \"pP\", \"[{\", \"'\\\"\", \"/?\", \".>\"], \"<\": [\"mM\", \"kK\", \"lL\", \".>\", null, null], \"=\": [\"-_\", null, null, null, \"]}\", \"[{\"], \">\": [\",<\", \"lL\", \";:\", \"/?\", null, null], \"?\": [\".>\", \";:\", \"'\\\"\", null, null, null], \"@\": [\"1!\", null, null, \"3#\", \"wW\", \"qQ\"], \"A\": [null, \"qQ\", \"wW\", \"sS\", \"zZ\", null], \"B\": [\"vV\", \"gG\", \"hH\", \"nN\", null, null], \"C\": [\"xX\", \"dD\", \"fF\", \"vV\", null, null], \"D\": [\"sS\", \"eE\", \"rR\", \"fF\", \"cC\", \"xX\"], \"E\": [\"wW\", \"3#\", \"4$\", \"rR\", \"dD\", \"sS\"], \"F\": [\"dD\", \"rR\", \"tT\", \"gG\", \"vV\", \"cC\"], \"G\": [\"fF\", \"tT\", \"yY\", \"hH\", \"bB\", \"vV\"], \"H\": [\"gG\", \"yY\", \"uU\", \"jJ\", \"nN\", \"bB\"], \"I\": [\"uU\", \"8*\", \"9(\", \"oO\", \"kK\", \"jJ\"], \"J\": [\"hH\", \"uU\", \"iI\", \"kK\", \"mM\", \"nN\"], \"K\": [\"jJ\", \"iI\", \"oO\", \"lL\", \",<\", \"mM\"], \"L\": [\"kK\", \"oO\", \"pP\", \";:\", \".>\", \",<\"], \"M\": [\"nN\", \"jJ\", \"kK\", \",<\", null, null], \"N\": [\"bB\", \"hH\", \"jJ\", \"mM\", null, null], \"O\": [\"iI\", \"9(\", \"0)\", \"pP\", \"lL\", \"kK\"], \"P\": [\"oO\", \"0)\", \"-_\", \"[{\", \";:\", \"lL\"], \"Q\": [null, \"1!\", \"2@\", \"wW\", \"aA\", null], \"R\": [\"eE\", \"4$\", \"5%\", \"tT\", \"fF\", \"dD\"], \"S\": [\"aA\", \"wW\", \"eE\", \"dD\", \"xX\", \"zZ\"], \"T\": [\"rR\", \"5%\", \"6^\", \"yY\", \"gG\", \"fF\"], \"U\": [\"yY\", \"7&\", \"8*\", \"iI\", \"jJ\", \"hH\"], \"V\": [\"cC\", \"fF\", \"gG\", \"bB\", null, null], \"W\": [\"qQ\", \"2@\", \"3#\", \"eE\", \"sS\", \"aA\"], \"X\": [\"zZ\", \"sS\", \"dD\", \"cC\", null, null], \"Y\": [\"tT\", \"6^\", \"7&\", \"uU\", \"hH\", \"gG\"], \"Z\": [null, \"aA\", \"sS\", \"xX\", null, null], \"[\": [\"pP\", \"-_\", \"=+\", \"]}\", \"'\\\"\", \";:\"], \"\\\\\": [\"]}\", null, null, null, null, null], \"]\": [\"[{\", \"=+\", null, \"\\\\|\", null, \"'\\\"\"], \"^\": [\"5%\", null, null, \"7&\", \"yY\", \"tT\"], \"_\": [\"0)\", null, null, \"=+\", \"[{\", \"pP\"], \"`\": [null, null, null, \"1!\", null, null], \"a\": [null, \"qQ\", \"wW\", \"sS\", \"zZ\", null], \"b\": [\"vV\", \"gG\", \"hH\", \"nN\", null, null], \"c\": [\"xX\", \"dD\", \"fF\", \"vV\", null, null], \"d\": [\"sS\", \"eE\", \"rR\", \"fF\", \"cC\", \"xX\"], \"e\": [\"wW\", \"3#\", \"4$\", \"rR\", \"dD\", \"sS\"], \"f\": [\"dD\", \"rR\", \"tT\", \"gG\", \"vV\", \"cC\"], \"g\": [\"fF\", \"tT\", \"yY\", \"hH\", \"bB\", \"vV\"], \"h\": [\"gG\", \"yY\", \"uU\", \"jJ\", \"nN\", \"bB\"], \"i\": [\"uU\", \"8*\", \"9(\", \"oO\", \"kK\", \"jJ\"], \"j\": [\"hH\", \"uU\", \"iI\", \"kK\", \"mM\", \"nN\"], \"k\": [\"jJ\", \"iI\", \"oO\", \"lL\", \",<\", \"mM\"], \"l\": [\"kK\", \"oO\", \"pP\", \";:\", \".>\", \",<\"], \"m\": [\"nN\", \"jJ\", \"kK\", \",<\", null, null], \"n\": [\"bB\", \"hH\", \"jJ\", \"mM\", null, null], \"o\": [\"iI\", \"9(\", \"0)\", \"pP\", \"lL\", \"kK\"], \"p\": [\"oO\", \"0)\", \"-_\", \"[{\", \";:\", \"lL\"], \"q\": [null, \"1!\", \"2@\", \"wW\", \"aA\", null], \"r\": [\"eE\", \"4$\", \"5%\", \"tT\", \"fF\", \"dD\"], \"s\": [\"aA\", \"wW\", \"eE\", \"dD\", \"xX\", \"zZ\"], \"t\": [\"rR\", \"5%\", \"6^\", \"yY\", \"gG\", \"fF\"], \"u\": [\"yY\", \"7&\", \"8*\", \"iI\", \"jJ\", \"hH\"], \"v\": [\"cC\", \"fF\", \"gG\", \"bB\", null, null], \"w\": [\"qQ\", \"2@\", \"3#\", \"eE\", \"sS\", \"aA\"], \"x\": [\"zZ\", \"sS\", \"dD\", \"cC\", null, null], \"y\": [\"tT\", \"6^\", \"7&\", \"uU\", \"hH\", \"gG\"], \"z\": [null, \"aA\", \"sS\", \"xX\", null, null], \"{\": [\"pP\", \"-_\", \"=+\", \"]}\", \"'\\\"\", \";:\"], \"|\": [\"]}\", null, null, null, null, null], \"}\": [\"[{\", \"=+\", null, \"\\\\|\", null, \"'\\\"\"], \"~\": [null, null, null, \"1!\", null, null] },\n dvorak: { \"!\": [\"`~\", null, null, \"2@\", \"'\\\"\", null], \"\\\"\": [null, \"1!\", \"2@\", \",<\", \"aA\", null], \"#\": [\"2@\", null, null, \"4$\", \".>\", \",<\"], \"$\": [\"3#\", null, null, \"5%\", \"pP\", \".>\"], \"%\": [\"4$\", null, null, \"6^\", \"yY\", \"pP\"], \"&\": [\"6^\", null, null, \"8*\", \"gG\", \"fF\"], \"'\": [null, \"1!\", \"2@\", \",<\", \"aA\", null], \"(\": [\"8*\", null, null, \"0)\", \"rR\", \"cC\"], \")\": [\"9(\", null, null, \"[{\", \"lL\", \"rR\"], \"*\": [\"7&\", null, null, \"9(\", \"cC\", \"gG\"], \"+\": [\"/?\", \"]}\", null, \"\\\\|\", null, \"-_\"], \",\": [\"'\\\"\", \"2@\", \"3#\", \".>\", \"oO\", \"aA\"], \"-\": [\"sS\", \"/?\", \"=+\", null, null, \"zZ\"], \".\": [\",<\", \"3#\", \"4$\", \"pP\", \"eE\", \"oO\"], \"/\": [\"lL\", \"[{\", \"]}\", \"=+\", \"-_\", \"sS\"], \"0\": [\"9(\", null, null, \"[{\", \"lL\", \"rR\"], \"1\": [\"`~\", null, null, \"2@\", \"'\\\"\", null], \"2\": [\"1!\", null, null, \"3#\", \",<\", \"'\\\"\"], \"3\": [\"2@\", null, null, \"4$\", \".>\", \",<\"], \"4\": [\"3#\", null, null, \"5%\", \"pP\", \".>\"], \"5\": [\"4$\", null, null, \"6^\", \"yY\", \"pP\"], \"6\": [\"5%\", null, null, \"7&\", \"fF\", \"yY\"], \"7\": [\"6^\", null, null, \"8*\", \"gG\", \"fF\"], \"8\": [\"7&\", null, null, \"9(\", \"cC\", \"gG\"], \"9\": [\"8*\", null, null, \"0)\", \"rR\", \"cC\"], \":\": [null, \"aA\", \"oO\", \"qQ\", null, null], \";\": [null, \"aA\", \"oO\", \"qQ\", null, null], \"<\": [\"'\\\"\", \"2@\", \"3#\", \".>\", \"oO\", \"aA\"], \"=\": [\"/?\", \"]}\", null, \"\\\\|\", null, \"-_\"], \">\": [\",<\", \"3#\", \"4$\", \"pP\", \"eE\", \"oO\"], \"?\": [\"lL\", \"[{\", \"]}\", \"=+\", \"-_\", \"sS\"], \"@\": [\"1!\", null, null, \"3#\", \",<\", \"'\\\"\"], \"A\": [null, \"'\\\"\", \",<\", \"oO\", \";:\", null], \"B\": [\"xX\", \"dD\", \"hH\", \"mM\", null, null], \"C\": [\"gG\", \"8*\", \"9(\", \"rR\", \"tT\", \"hH\"], \"D\": [\"iI\", \"fF\", \"gG\", \"hH\", \"bB\", \"xX\"], \"E\": [\"oO\", \".>\", \"pP\", \"uU\", \"jJ\", \"qQ\"], \"F\": [\"yY\", \"6^\", \"7&\", \"gG\", \"dD\", \"iI\"], \"G\": [\"fF\", \"7&\", \"8*\", \"cC\", \"hH\", \"dD\"], \"H\": [\"dD\", \"gG\", \"cC\", \"tT\", \"mM\", \"bB\"], \"I\": [\"uU\", \"yY\", \"fF\", \"dD\", \"xX\", \"kK\"], \"J\": [\"qQ\", \"eE\", \"uU\", \"kK\", null, null], \"K\": [\"jJ\", \"uU\", \"iI\", \"xX\", null, null], \"L\": [\"rR\", \"0)\", \"[{\", \"/?\", \"sS\", \"nN\"], \"M\": [\"bB\", \"hH\", \"tT\", \"wW\", null, null], \"N\": [\"tT\", \"rR\", \"lL\", \"sS\", \"vV\", \"wW\"], \"O\": [\"aA\", \",<\", \".>\", \"eE\", \"qQ\", \";:\"], \"P\": [\".>\", \"4$\", \"5%\", \"yY\", \"uU\", \"eE\"], \"Q\": [\";:\", \"oO\", \"eE\", \"jJ\", null, null], \"R\": [\"cC\", \"9(\", \"0)\", \"lL\", \"nN\", \"tT\"], \"S\": [\"nN\", \"lL\", \"/?\", \"-_\", \"zZ\", \"vV\"], \"T\": [\"hH\", \"cC\", \"rR\", \"nN\", \"wW\", \"mM\"], \"U\": [\"eE\", \"pP\", \"yY\", \"iI\", \"kK\", \"jJ\"], \"V\": [\"wW\", \"nN\", \"sS\", \"zZ\", null, null], \"W\": [\"mM\", \"tT\", \"nN\", \"vV\", null, null], \"X\": [\"kK\", \"iI\", \"dD\", \"bB\", null, null], \"Y\": [\"pP\", \"5%\", \"6^\", \"fF\", \"iI\", \"uU\"], \"Z\": [\"vV\", \"sS\", \"-_\", null, null, null], \"[\": [\"0)\", null, null, \"]}\", \"/?\", \"lL\"], \"\\\\\": [\"=+\", null, null, null, null, null], \"]\": [\"[{\", null, null, null, \"=+\", \"/?\"], \"^\": [\"5%\", null, null, \"7&\", \"fF\", \"yY\"], \"_\": [\"sS\", \"/?\", \"=+\", null, null, \"zZ\"], \"`\": [null, null, null, \"1!\", null, null], \"a\": [null, \"'\\\"\", \",<\", \"oO\", \";:\", null], \"b\": [\"xX\", \"dD\", \"hH\", \"mM\", null, null], \"c\": [\"gG\", \"8*\", \"9(\", \"rR\", \"tT\", \"hH\"], \"d\": [\"iI\", \"fF\", \"gG\", \"hH\", \"bB\", \"xX\"], \"e\": [\"oO\", \".>\", \"pP\", \"uU\", \"jJ\", \"qQ\"], \"f\": [\"yY\", \"6^\", \"7&\", \"gG\", \"dD\", \"iI\"], \"g\": [\"fF\", \"7&\", \"8*\", \"cC\", \"hH\", \"dD\"], \"h\": [\"dD\", \"gG\", \"cC\", \"tT\", \"mM\", \"bB\"], \"i\": [\"uU\", \"yY\", \"fF\", \"dD\", \"xX\", \"kK\"], \"j\": [\"qQ\", \"eE\", \"uU\", \"kK\", null, null], \"k\": [\"jJ\", \"uU\", \"iI\", \"xX\", null, null], \"l\": [\"rR\", \"0)\", \"[{\", \"/?\", \"sS\", \"nN\"], \"m\": [\"bB\", \"hH\", \"tT\", \"wW\", null, null], \"n\": [\"tT\", \"rR\", \"lL\", \"sS\", \"vV\", \"wW\"], \"o\": [\"aA\", \",<\", \".>\", \"eE\", \"qQ\", \";:\"], \"p\": [\".>\", \"4$\", \"5%\", \"yY\", \"uU\", \"eE\"], \"q\": [\";:\", \"oO\", \"eE\", \"jJ\", null, null], \"r\": [\"cC\", \"9(\", \"0)\", \"lL\", \"nN\", \"tT\"], \"s\": [\"nN\", \"lL\", \"/?\", \"-_\", \"zZ\", \"vV\"], \"t\": [\"hH\", \"cC\", \"rR\", \"nN\", \"wW\", \"mM\"], \"u\": [\"eE\", \"pP\", \"yY\", \"iI\", \"kK\", \"jJ\"], \"v\": [\"wW\", \"nN\", \"sS\", \"zZ\", null, null], \"w\": [\"mM\", \"tT\", \"nN\", \"vV\", null, null], \"x\": [\"kK\", \"iI\", \"dD\", \"bB\", null, null], \"y\": [\"pP\", \"5%\", \"6^\", \"fF\", \"iI\", \"uU\"], \"z\": [\"vV\", \"sS\", \"-_\", null, null, null], \"{\": [\"0)\", null, null, \"]}\", \"/?\", \"lL\"], \"|\": [\"=+\", null, null, null, null, null], \"}\": [\"[{\", null, null, null, \"=+\", \"/?\"], \"~\": [null, null, null, \"1!\", null, null] },\n keypad: { \"*\": [\"/\", null, null, null, \"-\", \"+\", \"9\", \"8\"], \"+\": [\"9\", \"*\", \"-\", null, null, null, null, \"6\"], \"-\": [\"*\", null, null, null, null, null, \"+\", \"9\"], \".\": [\"0\", \"2\", \"3\", null, null, null, null, null], \"/\": [null, null, null, null, \"*\", \"9\", \"8\", \"7\"], \"0\": [null, \"1\", \"2\", \"3\", \".\", null, null, null], \"1\": [null, null, \"4\", \"5\", \"2\", \"0\", null, null], \"2\": [\"1\", \"4\", \"5\", \"6\", \"3\", \".\", \"0\", null], \"3\": [\"2\", \"5\", \"6\", null, null, null, \".\", \"0\"], \"4\": [null, null, \"7\", \"8\", \"5\", \"2\", \"1\", null], \"5\": [\"4\", \"7\", \"8\", \"9\", \"6\", \"3\", \"2\", \"1\"], \"6\": [\"5\", \"8\", \"9\", \"+\", null, null, \"3\", \"2\"], \"7\": [null, null, null, \"/\", \"8\", \"5\", \"4\", null], \"8\": [\"7\", null, \"/\", \"*\", \"9\", \"6\", \"5\", \"4\"], \"9\": [\"8\", \"/\", \"*\", \"-\", \"+\", null, \"6\", \"5\"] },\n mac_keypad: { \"*\": [\"/\", null, null, null, null, null, \"-\", \"9\"], \"+\": [\"6\", \"9\", \"-\", null, null, null, null, \"3\"], \"-\": [\"9\", \"/\", \"*\", null, null, null, \"+\", \"6\"], \".\": [\"0\", \"2\", \"3\", null, null, null, null, null], \"/\": [\"=\", null, null, null, \"*\", \"-\", \"9\", \"8\"], \"0\": [null, \"1\", \"2\", \"3\", \".\", null, null, null], \"1\": [null, null, \"4\", \"5\", \"2\", \"0\", null, null], \"2\": [\"1\", \"4\", \"5\", \"6\", \"3\", \".\", \"0\", null], \"3\": [\"2\", \"5\", \"6\", \"+\", null, null, \".\", \"0\"], \"4\": [null, null, \"7\", \"8\", \"5\", \"2\", \"1\", null], \"5\": [\"4\", \"7\", \"8\", \"9\", \"6\", \"3\", \"2\", \"1\"], \"6\": [\"5\", \"8\", \"9\", \"-\", \"+\", null, \"3\", \"2\"], \"7\": [null, null, null, \"=\", \"8\", \"5\", \"4\", null], \"8\": [\"7\", null, \"=\", \"/\", \"9\", \"6\", \"5\", \"4\"], \"9\": [\"8\", \"=\", \"/\", \"*\", \"-\", \"+\", \"6\", \"5\"], \"=\": [null, null, null, null, \"/\", \"9\", \"8\", \"7\"] }\n};\n\nmodule.exports = adjacency_graphs;" }, { "id": 5, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/strings/enzoic_strings.js", "name": "./src/strings/enzoic_strings.js", "index": 13, "index2": 10, "size": 2911, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/index.js", "issuerId": 6, "issuerName": "./src/index.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 6, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/index.js", "module": "./src/index.js", "moduleName": "./src/index.js", "type": "cjs require", "userRequest": "./strings/enzoic_strings", "loc": "23:22-57" }, { "moduleId": 16, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/zxcvbn/feedback.js", "module": "./src/zxcvbn/feedback.js", "moduleName": "./src/zxcvbn/feedback.js", "type": "cjs require", "userRequest": "../strings/enzoic_strings", "loc": "3:22-58" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 1, "source": "\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.default = {\n \"strengthRatings\": [\"Hacked\", \"Very Weak\", \"Weak\", \"Medium\", \"Strong\", \"Very Strong\"],\n \"enterAPassword\": \"Choose a password\",\n \"passwordStrength\": \"Password Strength\",\n \"poweredBy\": \"powered by\",\n \"breachedPasswordMessage\": \"This password is known to hackers and should not be used. It was exposed publicly in one or more of the data breaches in recent years (LinkedIn, MySpace, Yahoo, etc.)

We strongly recommend you choose a different password and discontinue usage of this one.\",\n \"hackedPasswordMessage\": \"This password is known to hackers and should not be used. It is found in common password cracking dictionaries.

We strongly recommend you choose a different password and discontinue usage of this one.\",\n \"suggestion\": \"Suggestions\",\n \"suggestions\": {\n \"defaultFeedback\": \"Use a few words, avoid common phrases\",\n \"defaultFeedback2\": \"No need for symbols, digits, or uppercase letters\",\n \"addWord\": \"Add another word or two. Uncommon words are better.\",\n \"rowsOfKeys\": \"Straight rows of keys are easy to guess\",\n \"shortKeyboardPatterns\": \"Short keyboard patterns are easy to guess\",\n \"longerKeyboardPattern\": \"Use a longer keyboard pattern with more turns\",\n \"shortRepeats\": \"Repeats like \\\"aaa\\\" are easy to guess\",\n \"longRepeats\": \"Repeats like \\\"abcabcabc\\\" are only slightly harder to guess than \\\"abc\\\"\",\n \"avoidRepeatedWords\": \"Avoid repeated words and characters\",\n \"avoidSequences\": \"Sequences like abc or 6543 are easy to guess\",\n \"avoidSequences2\": \"Avoid sequences\",\n \"recentYears\": \"Recent years are easy to guess\",\n \"avoidRecentYears\": \"Avoid recent years\",\n \"avoidAssociatedYears\": \"Avoid years that are associated with you\",\n \"datesAreEasy\": \"Dates are often easy to guess\",\n \"avoidAssociatedDates\": \"Avoid dates and years that are associated with you\",\n \"similarToCommon\": \"This is similar to a commonly used password\",\n \"topTenPassword\": \"This is a top-10 common password\",\n \"top100Password\": \"This is a top-100 common password\",\n \"veryCommonPassword\": \"This is a very common password\",\n \"wordByItself\": \"A word by itself is easy to guess\",\n \"namesByThemselves\": \"Names and surnames by themselves are easy to guess\",\n \"commonNamesAndSurnames\": \"Common names and surnames are easy to guess\",\n \"capitalization\": \"Capitalization doesn't help very much\",\n \"allUpperCase\": \"All-uppercase is almost as easy to guess as all-lowercase\",\n \"reversedWords\": \"Reversed words aren't much harder to guess\",\n \"predictableSubs\": \"Predictable substitutions like '@' instead of 'a' don't help very much\"\n }\n};" }, { "id": 6, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/index.js", "name": "./src/index.js", "index": 0, "index2": 26, "size": 17525, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": null, "issuerId": null, "issuerName": null, "failed": false, "errors": 0, "warnings": 0, "reasons": [], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 0, "source": "'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nrequire('./style.css');\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _zxcvbn = require('./zxcvbn');\n\nvar _propTypes = require('prop-types');\n\nvar _propTypes2 = _interopRequireDefault(_propTypes);\n\nvar _enzoic_strings = require('./strings/enzoic_strings');\n\nvar _enzoic_strings2 = _interopRequireDefault(_enzoic_strings);\n\nvar _sha = require('./hashes/sha1');\n\nvar _sha2 = _interopRequireDefault(_sha);\n\nvar _sha3 = require('./hashes/sha256');\n\nvar _sha4 = _interopRequireDefault(_sha3);\n\nvar _md = require('./hashes/md5');\n\nvar _md2 = _interopRequireDefault(_md);\n\nvar _warning = require('../assets/warning.png');\n\nvar _warning2 = _interopRequireDefault(_warning);\n\nvar _info = require('../assets/info.png');\n\nvar _info2 = _interopRequireDefault(_info);\n\nvar _reactTooltip = require('react-tooltip');\n\nvar _reactTooltip2 = _interopRequireDefault(_reactTooltip);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar Enzoic = function (_Component) {\n _inherits(Enzoic, _Component);\n\n function Enzoic(props) {\n _classCallCheck(this, Enzoic);\n\n var _this = _possibleConstructorReturn(this, (Enzoic.__proto__ || Object.getPrototypeOf(Enzoic)).call(this, props));\n\n _this.state = {\n score: 1,\n zxcvbnScore: 1,\n zxcvbnResult: null,\n isValid: false,\n password: '',\n hackedPassword: false,\n breachedPassword: false,\n loading: false\n };\n\n\n _this.clear = _this.clear.bind(_this);\n _this.handleChange = _this.handleChange.bind(_this);\n _this.checkPasswordWhenReady = _this.checkPasswordWhenReady.bind(_this);\n _this.checkPassword = _this.checkPassword.bind(_this);\n _this.checkPasswordAgainstEnzoic = _this.checkPasswordAgainstEnzoic.bind(_this);\n _this.isTooShort = _this.isTooShort.bind(_this);\n\n _this.apiURL = 'https://api.enzoic.com';\n _this.rootDomain = Enzoic.getRootDomain(window.location.hostname);\n return _this;\n }\n\n _createClass(Enzoic, [{\n key: 'componentDidMount',\n value: function componentDidMount() {\n var defaultValue = this.props.defaultValue;\n\n\n if (defaultValue.length > 0) {\n this.setState({ password: defaultValue }, this.handleChange.bind(this, { target: { value: defaultValue } }));\n }\n }\n }, {\n key: 'clear',\n value: function clear() {\n var _this2 = this;\n\n var changeCallback = this.props.changeCallback;\n\n\n this.setState({\n score: 1,\n zxcvbnScore: 1,\n isValid: false,\n password: '',\n loading: false\n }, function () {\n if (changeCallback !== null) {\n changeCallback(_this2.state);\n }\n });\n }\n }, {\n key: 'handleChange',\n value: function handleChange(event) {\n var _this3 = this;\n\n var _props = this.props,\n changeCallback = _props.changeCallback,\n minScore = _props.minScore;\n\n var password = event.target.value;\n\n this.setState({\n password: password\n });\n\n if (this.isTooShort(password) === false) {\n this.checkPasswordWhenReady(password);\n } else {\n // if password is too, short set a score of 1\n var score = 1;\n\n this.setState({\n isValid: score >= minScore,\n score: score,\n zxcvbnScore: 1,\n zxcvbnResult: null,\n loading: false\n }, function () {\n if (changeCallback !== null) {\n changeCallback(_this3.state, null);\n }\n });\n }\n }\n }, {\n key: 'checkPasswordWhenReady',\n value: function checkPasswordWhenReady(passwordToCheck) {\n // wait for zxcvbn to be loaded\n if ((0, _zxcvbn.isZxcvbnLoaded)() === true) {\n this.checkPassword(passwordToCheck);\n } else {\n setTimeout(this.checkPasswordWhenReady.bind(this, passwordToCheck), 500);\n\n this.setState({\n loading: true\n });\n }\n }\n }, {\n key: 'checkPassword',\n value: function checkPassword(passwordToCheck) {\n if (this.checkTimer) {\n clearTimeout(this.checkTimer);\n }\n this.checkTimer = setTimeout(this.checkPasswordAgainstEnzoic.bind(this, passwordToCheck), 500);\n\n var zxcvbnResult = (0, _zxcvbn.zxcvbn)(passwordToCheck, this.props.userInputs);\n var zxcvbnScore = zxcvbnResult.score + 1;\n\n // store zxcvbn results and set state to loading while Enzoic check is processing\n this.setState({\n isValid: this.state.score >= this.props.minScore,\n score: this.state.score,\n zxcvbnScore: zxcvbnScore,\n zxcvbnResult: zxcvbnResult,\n loading: true\n });\n }\n }, {\n key: 'checkPasswordAgainstEnzoic',\n value: function checkPasswordAgainstEnzoic(passwordToCheck) {\n var _this4 = this;\n\n // if we already had an outstanding request in progress, cancel\n if (this.ppCurrentRequest) {\n this.ppCurrentRequest.abort();\n this.ppCurrentRequest = undefined;\n }\n\n if (passwordToCheck) {\n var sha2hash = _sha4.default.hash(passwordToCheck);\n var sha1hash = _sha2.default.hash(passwordToCheck);\n var md5hash = (0, _md2.default)(passwordToCheck);\n var sha2partial = sha2hash.substr(0, 10);\n var sha1partial = sha1hash.substr(0, 10);\n var md5partial = md5hash.substr(0, 10);\n\n this.ppCurrentRequest = new XMLHttpRequest();\n this.ppCurrentRequest.onreadystatechange = function () {\n if (_this4.ppCurrentRequest && _this4.ppCurrentRequest.readyState === 4) {\n var found = false;\n\n if (_this4.ppCurrentRequest.status === 200) {\n try {\n // loop through and see if we have a match\n var result = JSON.parse(_this4.ppCurrentRequest.response);\n if (result.candidates) {\n for (var i = 0; i < result.candidates.length; i++) {\n if (result.candidates[i].md5 === md5hash || result.candidates[i].sha1 === sha1hash || result.candidates[i].sha256 === sha2hash) {\n _this4.setState({\n score: 0,\n isValid: false,\n loading: false\n }, function () {\n if (_this4.props.changeCallback !== null) {\n _this4.props.changeCallback(_this4.state, _this4.state.zxcvbnResult);\n }\n });\n found = true;\n break;\n }\n }\n }\n } catch (err) {\n console.error('Unexpected response from PP API: ' + err);\n }\n }\n\n if (found === false) {\n _this4.setState({\n loading: false,\n score: _this4.state.zxcvbnScore,\n isValid: _this4.state.zxcvbnScore >= _this4.props.minScore\n }, function () {\n if (_this4.props.changeCallback !== null) {\n _this4.props.changeCallback(_this4.state, _this4.state.zxcvbnResult);\n }\n });\n }\n _this4.ppCurrentRequest = undefined;\n }\n };\n\n this.ppCurrentRequest.open('GET', this.apiURL + '/passwords?partial_sha2=' + sha2partial + '&partial_sha1=' + sha1partial + '&partial_md5=' + md5partial, true);\n this.ppCurrentRequest.setRequestHeader('Orgin', this.rootDomain);\n this.ppCurrentRequest.timeout = 1500;\n this.ppCurrentRequest.send();\n } else {\n this.setState({ loading: false });\n }\n }\n }, {\n key: 'isTooShort',\n value: function isTooShort(password) {\n return password.length < this.props.minLength;\n }\n }, {\n key: 'render',\n value: function render() {\n var _state = this.state,\n score = _state.score,\n password = _state.password,\n isValid = _state.isValid,\n loading = _state.loading;\n var _props2 = this.props,\n scoreWords = _props2.scoreWords,\n inputProps = _props2.inputProps,\n className = _props2.className,\n style = _props2.style,\n tooShortWord = _props2.tooShortWord;\n\n\n var inputClasses = ['Enzoic-input'];\n var wrapperClasses = ['Enzoic', className ? className : '', password.length > 0 && loading === false ? 'is-strength-' + score : '', loading ? 'loading' : ''];\n\n var strengthDesc = loading === true ? _react2.default.createElement('div', { className: 'Enzoic-spinner' }) : //()\n this.isTooShort(password) ? tooShortWord : scoreWords[score];\n\n var tooltip = Enzoic.getScoreTooltip(score, this.state.zxcvbnResult);\n\n if (isValid === true) {\n inputClasses.push('is-password-valid');\n } else if (password.length > 0) {\n inputClasses.push('is-password-invalid');\n }\n\n if (inputProps && inputProps.className) {\n inputClasses.push(inputProps.className);\n }\n\n return _react2.default.createElement(\n 'div',\n { className: wrapperClasses.join(' '), style: style },\n _react2.default.createElement('input', _extends({\n type: 'password'\n }, inputProps, {\n className: inputClasses.join(' '),\n onChange: this.handleChange,\n value: password\n })),\n _react2.default.createElement('div', { className: 'Enzoic-strength-bar' }),\n _react2.default.createElement(\n 'span',\n { 'data-tip': tooltip, 'data-html': true, 'data-border': true,\n className: 'Enzoic-strength-desc' },\n strengthDesc\n ),\n _react2.default.createElement(_reactTooltip2.default, null)\n );\n }\n }], [{\n key: 'getRootDomain',\n value: function getRootDomain(pageHost) {\n var domain = pageHost;\n if (pageHost.indexOf('.') > 0) {\n var tldn = domain.substring(domain.lastIndexOf('.') + 1);\n\n if (isNaN(tldn)) {\n // check for IP address\n var temp = domain.substring(0, domain.lastIndexOf('.'));\n if (temp.indexOf('.')) {\n temp = temp.substring(temp.lastIndexOf('.') + 1);\n }\n\n domain = temp + '.' + tldn;\n }\n }\n\n // strip off port, if present\n if (domain.indexOf(':') > 0) {\n domain = domain.substring(0, domain.indexOf(':'));\n }\n\n return domain;\n }\n }, {\n key: 'getMessageFromZXCVBNResult',\n value: function getMessageFromZXCVBNResult(zxcvbnresult) {\n var message = '';\n\n if (zxcvbnresult && zxcvbnresult.feedback) {\n message = '
';\n if (zxcvbnresult.feedback.warning) {\n message = '
' + zxcvbnresult.feedback.warning + '

';\n }\n\n if (zxcvbnresult.feedback.suggestions.length > 0) {\n message += _enzoic_strings2.default.suggestion + \":\";\n }\n }\n\n return message;\n }\n }, {\n key: 'getScoreTooltip',\n value: function getScoreTooltip(score, zxcvbnresult) {\n if (score === 0) {\n return _enzoic_strings2.default.breachedPasswordMessage;\n } else if (score < 4) {\n return Enzoic.getMessageFromZXCVBNResult(zxcvbnresult);\n }\n return '';\n }\n }]);\n\n return Enzoic;\n}(_react.Component);\n\nEnzoic.propTypes = {\n changeCallback: _propTypes2.default.func,\n className: _propTypes2.default.string,\n defaultValue: _propTypes2.default.string,\n inputProps: _propTypes2.default.object,\n minLength: _propTypes2.default.number,\n minScore: _propTypes2.default.number,\n scoreWords: _propTypes2.default.array,\n style: _propTypes2.default.object,\n tooShortWord: _propTypes2.default.string,\n userInputs: _propTypes2.default.array\n};\nEnzoic.defaultProps = {\n changeCallback: null,\n className: '',\n defaultValue: '',\n minLength: 8,\n minScore: 4,\n scoreWords: [_react2.default.createElement(\n 'span',\n null,\n _react2.default.createElement('img', { src: _warning2.default, style: { display: 'inline-block' } }),\n ' ',\n _enzoic_strings2.default.strengthRatings[0],\n ' ',\n _react2.default.createElement('img', {\n src: _warning2.default, style: { display: 'inline-block' } })\n ), _react2.default.createElement(\n 'span',\n null,\n _react2.default.createElement('img', { src: _info2.default, style: { display: 'inline-block' } }),\n ' ',\n _enzoic_strings2.default.strengthRatings[1]\n ), _react2.default.createElement(\n 'span',\n null,\n _react2.default.createElement('img', { src: _info2.default, style: { display: 'inline-block' } }),\n ' ',\n _enzoic_strings2.default.strengthRatings[2]\n ), _react2.default.createElement(\n 'span',\n null,\n _react2.default.createElement('img', { src: _info2.default, style: { display: 'inline-block' } }),\n ' ',\n _enzoic_strings2.default.strengthRatings[3]\n ), _enzoic_strings2.default.strengthRatings[4], _enzoic_strings2.default.strengthRatings[5]],\n tooShortWord: 'Too Short',\n userInputs: [],\n requireSymbol: false,\n requireUppercase: false,\n requireNumber: false\n};\nexports.default = Enzoic;" }, { "id": 7, "identifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/style-loader/index.js!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/css-loader/index.js!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/style.css", "name": "./src/style.css", "index": 1, "index2": 3, "size": 899, "cacheable": true, "built": true, "optional": false, "prefetched": false, "chunks": [ 0 ], "assets": [], "issuer": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/index.js", "issuerId": 6, "issuerName": "./src/index.js", "failed": false, "errors": 0, "warnings": 0, "reasons": [ { "moduleId": 6, "moduleIdentifier": "/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/node_modules/babel-loader/lib/index.js??ref--0!/Users/mike/dev/enzoic/enzoic_react_password_strength_meter/src/index.js", "module": "./src/index.js", "moduleName": "./src/index.js", "type": "cjs require", "userRequest": "./style.css", "loc": "11:0-22" } ], "usedExports": true, "providedExports": null, "optimizationBailout": [], "depth": 1, "source": "// style-loader: Adds some css to the DOM by adding a