



'''simple docstring'''




# this script reports modified .py files under the desired list of top-level sub-dirs passed as a list of arguments, e.g.:
#   python ./utils/get_modified_files.py utils src tests examples
#
# it uses git to find the forking point and which files were modified - i.e. files not under git won't be considered
# since the output of this script is fed into Makefile commands it doesn't print a newline after the results

import re
import subprocess
import sys


lowercase__   :				List[str]      =   subprocess.check_output('''git merge-base main HEAD'''.split()).decode('''utf-8''')
lowercase__   :				Dict      =   subprocess.check_output(f"""git diff --name-only {fork_point_sha}""".split()).decode('''utf-8''').split()

lowercase__   :				Any      =   '''|'''.join(sys.argv[1:])
lowercase__   :				Any      =   re.compile(rf"""^({joined_dirs}).*?\.py$""")

lowercase__   :				str      =   [x for x in modified_files if regex.match(x)]
print(''' '''.join(relevant_modified_files), end='''''')






'''simple docstring'''




lowercase__   :				Any      =   {'''a''': ['''c''', '''b'''], '''b''': ['''d''', '''e'''], '''c''': [], '''d''': [], '''e''': []}
lowercase__   :				List[Any]      =   ['''a''', '''b''', '''c''', '''d''', '''e''']






def 	_lowerCAmelCase      (  __snake_case  :			str			,							__snake_case  :			Tuple			,							__snake_case  :			int      )					->					Tuple:
     __A						:			List[str]								=	start
     # add current to visited
     visited.append(__snake_case      )
     __A						:			Optional[int]								=	edges[current]
     for neighbor in neighbors:
          # if neighbor not in visited, visit
          if neighbor not in visited:
               __A						:			int								=	topological_sort(__snake_case			,							__snake_case			,							__snake_case      )
    # if all neighbors visited add current to sort
     sort.append(__snake_case      )
     # if all vertices haven't been visited select a new one to visit
     if len(__snake_case      ) != len(__snake_case      ):
          for vertice in vertices:
               if vertice not in visited:
                    __A						:			Dict								=	topological_sort(__snake_case			,							__snake_case			,							__snake_case      )
    # return sort
     return sort


if __name__ == "__main__":
  lowercase__   :				Tuple      =   topological_sort('''a''', [], [])
  print(sort)