def find_next()

in bowler/helpers.py [0:0]

• 7 lines of code
• 3 McCabe index (conditional complexity)

def find_next(node: LN, target: int, recursive: bool = False) -> Optional[LN]:
    while node.next_sibling is not None:
        node = node.next_sibling
        result = find_first(node, target, recursive)
        if result:
            return result
    return None