docs: def calcFnWeight(node):
      '''Calculates the weight of a function definition by recursively counting 
      its child nodes in the AST. Note that the tree traversal will become 
      O(n^2) instead of O(n) if this feature is enabled.'''
      stack = [node]
      count = 0
      while len(stack) > 0:
          node = stack.pop()
          children = [x for x in ast.iter_child_nodes(node)]
          count += len(children)
          stack = stack + children
      return count