parameters: (root, current_library, import_base)
docstring: Print F prime dependencies. These should be printed w/o a newlines.
  
      :param root: input XML file to parse parsed, root of tree
      :param current_library: current library to strip from dependencies
      :param import_base: base of imported dictionaries, used for finding and opening them
docstring_summary: Print F prime dependencies. These should be printed w/o a newlines.
docstring_tokens: Print F prime dependencies . These should be printed w / o a newlines .
function: def print_fprime_dependencies(root, current_library, import_base):
      """
      Print F prime dependencies. These should be printed w/o a newlines.
  
      :param root: input XML file to parse parsed, root of tree
      :param current_library: current library to strip from dependencies
      :param import_base: base of imported dictionaries, used for finding and opening them
      """
      dependencies = read_xml_file(root, import_base)
      if current_library in dependencies:
          dependencies.remove(current_library)
      # Rebuilding is broken by non-deterministic set behavior, so this makes it a reverse-sorted (deterministic) list
      dependencies = list(dependencies)
      dependencies.sort()
      dependencies.reverse()
      # Go in order, for GCC
      gcc_order = []
      for dep in DEPENDENCY_ORDER:
          if dep in dependencies:
              gcc_order.append(dep)
      # Find module dependencies, and anything else left over goes last
      for dep in dependencies:
          if not dep in gcc_order:
              gcc_order.append(dep)
      # Write out CMake style list
      sys.stdout.write(";".join(gcc_order))
      sys.stdout.flush()
function_tokens: def print_fprime_dependencies ( root , current_library , import_base ) : dependencies = read_xml_file ( root , import_base ) if current_library in dependencies : dependencies . remove ( current_library ) # Rebuilding is broken by non-deterministic set behavior, so this makes it a reverse-sorted (deterministic) list dependencies = list ( dependencies ) dependencies . sort ( ) dependencies . reverse ( ) # Go in order, for GCC gcc_order = [ ] for dep in DEPENDENCY_ORDER : if dep in dependencies : gcc_order . append ( dep ) # Find module dependencies, and anything else left over goes last for dep in dependencies : if not dep in gcc_order : gcc_order . append ( dep ) # Write out CMake style list sys . stdout . write ( ";" . join ( gcc_order ) ) sys . stdout . flush ( )