Avoid too many return statements within this function.

Open

                return [data[i] for i in item]

Avoid too many return statements within this function.

Open

        return Iter(_chunks_split(func, seq))

Avoid too many return statements within this function.

Open

            return Iter(compress_or_select(item, self._iterator), size)

Avoid too many return statements within this function.

Open

    return ast

Avoid too many return statements within this function.

Open

        return Iter(_chunks_sizes_ex(n, seq, False, pad))

Avoid too many return statements within this function.

Open

                return [x for key, x in zip(item, data) if key]

Avoid too many return statements within this function.

Open

        return Iter(_chunks_sizes(n, seq))

Avoid too many return statements within this function.

Open

    return fn(_juxt(*funcs))

Avoid too many return statements within this function.

Open

        return Call(caller, args, kwargs)

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

Open

    def consume_until(self, n: int):
        """
        Consume iterator until list reaches at most size n.
        """

• Read up
  Read up

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

Open

def _is_identical(
    value,
    name=None,
    render=None,
    doc=None,

• Read up
  Read up

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

Open

    def __init__(*args, **extra):
        self, *args = args
        cls = type(self)
        args = dict(zip(self._meta.fields, args))
        kwargs = dict(self._meta.defaults)

• Read up
  Read up

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

Open

def _(ast):
    # Optimizations:
    #   * Var nodes are handled more efficiently with operator.attrgetter
    #   * Call nodes are handled with operator.methodcaller, when possible
    #   * Chained getattrs are also handled with operator.attrgetter

• Read up
  Read up

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

Open

    def __call__(self, *args, **kwargs):
        if not args and not kwargs:
            raise TypeError("curried function cannot be called without arguments")

        try:

• Read up
  Read up

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

Open

def make_xor(f, g):
    """
    Compose functions in a short-circuit version of xor using the following
    table:

• Read up
  Read up

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

Open

def extract_fields_from_annotations(bases, ns):
    annotations = {}
    annotations.update(ns.get("__annotations__", ()))
    for base in bases:
        if isinstance(base, RecordMeta):

• Read up
  Read up

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

Open

def make_init_function_code(names_map: dict, defaults: Mapping) -> str:
    """
    Return a string with source code for the init function.
    """

• Read up
  Read up

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

Open

    def discard_child(self, child, raises=False):
        """
        Discard child if present in tree.
        """
        for idx, elem in self._children:

• Read up
  Read up

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

Open

    def parent(self, value):
        if value is None:
            self._parent = None
        elif not isinstance(value, Node):
            raise TypeError(f"Parent node {value!r} is not of type 'Node'.")

• Read up
  Read up

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

Open

    def _generator(self, iterator, default):
        queue = self._tail_iters
        pop = queue.popleft

        yield from iterator

• Read up
  Read up