original_docstring: 
      Recursively resolve the NODE:DRIFT notation used by treemix
      
docstring: Recursively resolve the NODE:DRIFT notation used by treemix
docstring_tokens: Recursively resolve the NODE : DRIFT notation used by treemix
code: def treemix_tree(nested):
      """
      Recursively resolve the NODE:DRIFT notation used by treemix
      """
      nodes = []
      children = prev_item = None
  
      for item in nested:
          if isinstance(item, list):
              children = treemix_tree(item)
          else:
              m = re.match('^([A-Za-z0-9]+)?:([0-9.e-]+)$', item)
              if m.group(1):
                  # leaf node (ie. LABEL:DRIFT)
                  hash = hash_node(item)
                  labels[hash] = m.group(1)
                  node = (hash, m.group(2), [])
              else:
                  # internal node (i.e. :DRIFT)
                  hash = hash_node([prev_item, item])
                  labels[hash] = new_label()
                  node = (hash, m.group(2), children)
              nodes.append(node)
          prev_item = item
      return nodes
code_tokens: def treemix_tree ( nested ) : nodes = [ ] children = prev_item = None for item in nested : if isinstance ( item , list ) : children = treemix_tree ( item ) else : m = re . match ( '^([A-Za-z0-9]+)?:([0-9.e-]+)$' , item ) if m . group ( 1 ) : hash = hash_node ( item ) labels [ hash ] = m . group ( 1 ) node = ( hash , m . group ( 2 ) , [ ] ) else : hash = hash_node ( [ prev_item , item ] ) labels [ hash ] = new_label ( ) node = ( hash , m . group ( 2 ) , children ) nodes . append ( node ) prev_item = item return nodes
short_docstring: Recursively resolve the NODE:DRIFT notation used by treemix
short_docstring_tokens: Recursively resolve the NODE : DRIFT notation used by treemix
comment: """
      Recursively resolve the NODE:DRIFT notation used by treemix
      """$SEP$# leaf node (ie. LABEL:DRIFT)$SEP$# internal node (i.e. :DRIFT)