Chebfun has 48 functions (exceeds 20 allowed). Consider refactoring.

Open

class Chebfun:
    def __init__(self, funs):
        self.funs = check_funs(funs)
        self.breakdata = compute_breakdata(self.funs)
        self.transposed = False

File chebfun.py has 343 lines of code (exceeds 250 allowed). Consider refactoring.

Open

import operator

import numpy as np

from .bndfun import Bndfun

Function initfun_fixedlen has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.

Open

    def initfun_fixedlen(cls, f, n, domain=None):
        nn = np.array(n)
        if nn.size < 2:
            funs = generate_funs(domain, Bndfun.initfun_fixedlen, {"f": f, "n": n})
        else:

• Read up
  Read up

Function roots has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring.

Open

    def roots(self, merge=None):
        """Compute the roots of a Chebfun, i.e., the set of values x for which
        f(x) = 0.
        """
        merge = merge if merge is not None else prefs.mergeroots

• Read up
  Read up

Function _apply_binop has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring.

Open

    def _apply_binop(self, f, op):
        """Funnel method used in the implementation of Chebfun binary
        operators. The high-level idea is to first break each chebfun into a
        series of pieces corresponding to the union of the domains of each
        before applying the supplied binary operator and simplifying. In the

• Read up
  Read up

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

Open

    def _break(self, targetdomain):
        """Resamples self to the supplied Domain object, targetdomain. This
        method is intended as private since one will typically need to have
        called either Domain.union(f), or Domain.merge(f) prior to call."""
        newfuns = []

• Read up
  Read up