Scoop test with a huge tree

scoop_tree.py

from scoop.futures import map

def root():
    for _ in range(100):
        r = list(map(node, [range(1000)] * 100))


def node(data):
    for _ in range(5):
        r1 = sum(map(leaf, [range(1000)] * 10))
        r2 = sum(map(leaf, [range(1000)] * 10))

    return r1 + r2

def leaf(data):
    return sum(data)

if __name__ == "__main__":
    root()