     return
   )(tree,m['app'])
   m
-
 
 getBranchSize = (branch) ->
   i = 0


      indents = []
      if level > 1
        for i in [1...level]
          gapChar = if parentAry[i] then " " else "│"
          indents.push gapChar+"  " #add one extra space per (horizontal) length of branch

      if level <= 0
        lines.push "#{key}" #root
      else
        lines.push "#{indents.join('')}#{turnChar}──#{forkChar} #{key}"

      arguments.callee(branch[key], level+1, parentAry.concat(isLast)) #recurse into key's tree (NB: parentAry.length === level)
    return
  )(tree, 0, [])

    clearParentEntries(tree)
    console.log tree



sortDependencies = (tree) -> # must flatten array into levels to get an ordered list of filenames w/resp. paths
  obj = {}
  ((treePos) ->
