Avoid too many return statements within this function.

Open

      if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) return true;

Avoid too many return statements within this function.

Open

      if (!(has$1(b, key) && eq(a[key], b[key], aStack, bStack))) return false;

Avoid too many return statements within this function.

Open

      if (keys(b).length !== length) return false;

Avoid too many return statements within this function.

Open

    if (aStack[length] === a) return bStack[length] === b;

Avoid too many return statements within this function.

Open

    return true;

Avoid too many return statements within this function.

Open

      if (!eq(a[length], b[length], aStack, bStack)) return false;

Avoid too many return statements within this function.

Open

  return true;

Avoid too many return statements within this function.

Open

        return false;

Function range has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export default function range(start, stop, step) {
  if (stop == null) {
    stop = start || 0;
    start = 0;
  }

• Read up
  Read up

Function keys has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export default function keys(obj) {
  if (!isObject(obj)) return [];
  if (nativeKeys) return nativeKeys(obj);
  var keys = [];
  for (var key in obj) if (has(obj, key)) keys.push(key);

• Read up
  Read up

Function collectNonEnumProps has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

function collectNonEnumProps(obj, keys) {
  keys = emulatedSet(keys);
  var nonEnumIdx = nonEnumerableProps.length;
  var constructor = obj.constructor;
  var proto = (isFunction$1(constructor) && constructor.prototype) || ObjProto;

• Read up
  Read up

Function last has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export default function last(array, n, guard) {
  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];
  if (n == null || guard) return array[array.length - 1];
  return rest(array, Math.max(0, array.length - n));
}

• Read up
  Read up

Function each has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

function each(obj, iteratee, context) {
  iteratee = optimizeCb(iteratee, context);
  var i, length;
  if (isArrayLike(obj)) {
    for (i = 0, length = obj.length; i < length; i++) {

• Read up
  Read up

Function first has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export default function first(array, n, guard) {
  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];
  if (n == null || guard) return array[0];
  return initial(array, array.length - n);
}

• Read up
  Read up

Function each has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export default function each(obj, iteratee, context) {
  iteratee = optimizeCb(iteratee, context);
  var i, length;
  if (isArrayLike(obj)) {
    for (i = 0, length = obj.length; i < length; i++) {

• Read up
  Read up

Function keys has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

function keys(obj) {
  if (!isObject(obj)) return [];
  if (nativeKeys) return nativeKeys(obj);
  var keys = [];
  for (var key in obj) if (has$1(obj, key)) keys.push(key);

• Read up
  Read up

Function every has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

function every(obj, predicate, context) {
  predicate = cb(predicate, context);
  var _keys = !isArrayLike(obj) && keys(obj),
      length = (_keys || obj).length;
  for (var index = 0; index < length; index++) {

• Read up
  Read up