Showing 17 of 19 total issues
Function Patrun
has a Cognitive Complexity of 275 (exceeds 5 allowed). Consider refactoring. Open
Open
function Patrun(custom?: any) {
custom = custom || {}
var self: any = {}
var top: any = {}
- Read upRead up
Cognitive Complexity
Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.
A method's cognitive complexity is based on a few simple rules:
- Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
- Code is considered more complex for each "break in the linear flow of the code"
- Code is considered more complex when "flow breaking structures are nested"
Further reading
Function Patrun
has 354 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function Patrun(custom?: any) {
custom = custom || {}
var self: any = {}
var top: any = {}
File patrun.ts
has 375 lines of code (exceeds 250 allowed). Consider refactoring. Open
Open
/* Copyright (c) 2013-2022 Richard Rodger, MIT License */
// TODO: matchers should accept string[] of key names - only operate on these keys
// TODO: expose walk as method for general purpose
Function add
has 86 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
self.add = function (pat: any, data: any) {
pat = { ...pat }
var customizer =
'function' === typeof custom ? custom.call(self, pat, data) : null
Function find
has 65 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
self.find = function (pat: any, exact: any, collect: any) {
if (null == pat) return null
var keymap: any = top
var data: any = void 0 === top.d ? null : top.d
Function toString
has 65 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
self.toString = function (first: any, second: any) {
var tree = true === first ? true : !!second
var dstr =
'function' === typeof first
Function list
has 58 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
self.list = function (pat: any, exact: boolean) {
pat = pat || {}
function descend(keymap: any, match: any, missing: any, acc: any) {
if (keymap.v) {
Function walk
has 47 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function walk(n: any, o: any, d: any, vs: any) {
var vsc
if (void 0 !== n.d) {
o.push(' ' + dstr(n.d))
Function descend
has 45 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function descend(keymap: any, match: any, missing: any, acc: any) {
if (keymap.v) {
var key = keymap.k
var gexval = Gex(
pat ? (null == pat[key] ? (exact ? null : '*') : pat[key]) : '*',
Function remove
has 42 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
self.remove = function (pat: any) {
var keymap = top
var data = null
var key
var path = []
Avoid deeply nested control flow statements. Open
Open
if (g) {
keymap.s.g = g
}
Avoid deeply nested control flow statements. Open
Open
if (s) {
keymap.s.s = s
}
Avoid deeply nested control flow statements. Open
Open
if (ga[gi].match(val)) {
nextkeymap = ga[gi].keymap
break
}
Avoid deeply nested control flow statements. Open
Open
if (keymap.g) {
keymap.g = {}
}
Avoid deeply nested control flow statements. Open
Open
if (mv) {
var g = (keymap.g = keymap.g || {})
var ga = (g[key] = g[key] || [])
mv = (ga.find((gmv: MatchValue) => gmv.same(mv)) ||
(ga.push(mv), mv)) as MatchValue
Avoid deeply nested control flow statements. Open
Open
if (mvs[mvi].fix === pat[key]) {
path.push({ km: keymap, v: pat[key], mv: mvs[mvi] })
nextkeymap = mvs[mvi].keymap
break
}
Consider simplifying this complex logical expression. Open
Open
if (mv) {
var g = (keymap.g = keymap.g || {})
var ga = (g[key] = g[key] || [])
mv = (ga.find((gmv: MatchValue) => gmv.same(mv)) ||
(ga.push(mv), mv)) as MatchValue