






"""simple docstring"""



from __future__ import annotations

from queue import Queue
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    int						,   __snake_case     :    int       ):





  '''simple docstring'''





  a ^= b
  b ^= a
  a ^= b
  return a, b
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    int						,   __snake_case     :    list[list[int]]       ):





  '''simple docstring'''





  lowercase				       =			1
  while (1 << j) < max_node:
    for i in range(1						,   max_node + 1       ):
      lowercase				       =			parent[j - 1][parent[j - 1][i]]
    j += 1
  return parent
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    int						,   __snake_case     :    int						,   __snake_case     :    list[int]						,   __snake_case     :    list[list[int]]       ):





  '''simple docstring'''





  if level[u] < level[v]:
    lowercase       ,	lowercase				       =			swap(__snake_case						,   __snake_case       )
  # making depth of u same as depth of v
  for i in range(18						,   -1						,   -1       ):
    if level[u] - (1 << i) >= level[v]:
      lowercase				       =			parent[i][u]
    # at the same depth if u==v that mean lca is found
  if u == v:
    return u
  # moving both nodes upwards till lca in found
  for i in range(18						,   -1						,   -1       ):
    if parent[i][u] not in [0, parent[i][v]]:
      lowercase       ,	lowercase				       =			parent[i][u], parent[i][v]
    # returning longest common ancestor of u,v
  return parent[0][u]
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    list[int]						,   __snake_case     :    list[list[int]]						,   __snake_case     :    int						,   __snake_case     :    dict[int, list[int]]						,   __snake_case     :    int = 1						,   ):





  '''simple docstring'''





  lowercase				       =			0
  lowercase				       =			Queue(maxsize=__snake_case       )
  q.put(__snake_case       )
  while q.qsize() != 0:
    lowercase				       =			q.get()
    for v in graph[u]:
      if level[v] == -1:
        lowercase				       =			level[u] + 1
        q.put(__snake_case       )
        lowercase				       =			u
  return level, parent
def 		_SCREAMING_SNAKE_CASE					(       ):





  '''simple docstring'''





  lowercase				       =			13
  # initializing with 0
  lowercase				       =			[[0 for _ in range(max_node + 10       )] for _ in range(20       )]
  # initializing with -1 which means every node is unvisited
  lowercase				       =			[-1 for _ in range(max_node + 10       )]
  lowercase				       =			{
      1: [2, 3, 4],
      2: [5],
      3: [6, 7],
      4: [8],
      5: [9, 10],
      6: [11],
      7: [],
      8: [12, 13],
      9: [],
      10: [],
      11: [],
      12: [],
      13: [],
  }
  lowercase       ,	lowercase				       =			breadth_first_search(__snake_case						,   __snake_case						,   __snake_case						,   __snake_case						,   1       )
  lowercase				       =			create_sparse(__snake_case						,   __snake_case       )
  print('LCA of node 1 and 3 is: '						,   lowest_common_ancestor(1						,   3						,   __snake_case						,   __snake_case       )       )
  print('LCA of node 5 and 6 is: '						,   lowest_common_ancestor(5						,   6						,   __snake_case						,   __snake_case       )       )
  print('LCA of node 7 and 11 is: '						,   lowest_common_ancestor(7						,   11						,   __snake_case						,   __snake_case       )       )
  print('LCA of node 6 and 7 is: '						,   lowest_common_ancestor(6						,   7						,   __snake_case						,   __snake_case       )       )
  print('LCA of node 4 and 12 is: '						,   lowest_common_ancestor(4						,   12						,   __snake_case						,   __snake_case       )       )
  print('LCA of node 8 and 8 is: '						,   lowest_common_ancestor(8						,   8						,   __snake_case						,   __snake_case       )       )


if __name__ == "__main__":
    main()










import argparse
import os
import re


# All paths are set with the intent you should run this script from the root of the repo with the command
# python utils/check_dummies.py
_a       =    '''src/transformers'''

# Matches is_xxx_available()
_a       =    re.compile(r'''is\_([a-z_]*)_available()''')
# Matches from xxx import bla
_a       =    re.compile(r'''\s+from\s+\S*\s+import\s+([^\(\s].*)\n''')
_a       =    re.compile(r'''^\s+if\s+not\s+\(?is\_[a-z_]*\_available\(\)''')


_a       =    '''
{0} = None
'''

_a       =    '''
class {0}(metaclass=DummyObject):
    _backends = {1}

    def __init__(self, *args, **kwargs):
        requires_backends(self, {1})
'''


_a       =    '''
def {0}(*args, **kwargs):
    requires_backends({0}, {1})
'''


def __A       ( __lowerCAmelCase      )->    str:





						"""simple docstring"""



						if _re_test_backend.search(__lowerCAmelCase      ) is None:
												return None
						_UpperCAmelCase							   =     [b[0] for b in _re_backend.findall(__lowerCAmelCase      )]
						backends.sort()
						return "_and_".join(__lowerCAmelCase      )


def __A       ( )->    int:





						"""simple docstring"""



						with open(os.path.join(__lowerCAmelCase					,						'__init__.py'      )					,						'r'					,						encoding='utf-8'					,						newline='\n'      ) as f:
												_UpperCAmelCase							   =     f.readlines()

						# Get to the point we do the actual imports for type checking
						_UpperCAmelCase							   =     0
						while not lines[line_index].startswith('if TYPE_CHECKING'      ):
												line_index += 1

						_UpperCAmelCase							   =     {}
						# Go through the end of the file
						while line_index < len(__lowerCAmelCase      ):
												# If the line is an if is_backend_available, we grab all objects associated.
												_UpperCAmelCase							   =     find_backend(lines[line_index]      )
												if backend is not None:
																		while not lines[line_index].startswith('    else:'      ):
																								line_index += 1
																		line_index += 1

																		_UpperCAmelCase							   =     []
																		# Until we unindent, add backend objects to the list
																		while len(lines[line_index]      ) <= 1 or lines[line_index].startswith(' ' * 8      ):
																								_UpperCAmelCase							   =     lines[line_index]
																								_UpperCAmelCase							   =     _re_single_line_import.search(__lowerCAmelCase      )
																								if single_line_import_search is not None:
																														objects.extend(single_line_import_search.groups()[0].split(', '      )      )
																								elif line.startswith(' ' * 12      ):
																														objects.append(line[12:-2]      )
																								line_index += 1

																		_UpperCAmelCase							   =     objects
												else:
																		line_index += 1

						return backend_specific_objects


def __A       ( __lowerCAmelCase					,						__lowerCAmelCase      )->    Any:





						"""simple docstring"""



						if name.isupper():
												return DUMMY_CONSTANT.format(__lowerCAmelCase      )
						elif name.islower():
												return DUMMY_FUNCTION.format(__lowerCAmelCase					,						__lowerCAmelCase      )
						else:
												return DUMMY_CLASS.format(__lowerCAmelCase					,						__lowerCAmelCase      )


def __A       ( __lowerCAmelCase=None      )->    Union[str, Any]:





						"""simple docstring"""



						if backend_specific_objects is None:
												_UpperCAmelCase							   =     read_init()
						# For special correspondence backend to module name as used in the function requires_modulename
						_UpperCAmelCase							   =     {}

						for backend, objects in backend_specific_objects.items():
												_UpperCAmelCase							   =     '[' + ', '.join(F"""\"{b}\"""" for b in backend.split('_and_'      )      ) + ']'
												_UpperCAmelCase							   =     '# This file is autogenerated by the command `make fix-copies`, do not edit.\n'
												dummy_file += "from ..utils import DummyObject, requires_backends\n\n"
												dummy_file += "\n".join([create_dummy_object(__lowerCAmelCase					,						__lowerCAmelCase      ) for o in objects]      )
												_UpperCAmelCase							   =     dummy_file

						return dummy_files


def __A       ( __lowerCAmelCase=False      )->    int:





						"""simple docstring"""



						_UpperCAmelCase							   =     create_dummy_files()
						# For special correspondence backend to shortcut as used in utils/dummy_xxx_objects.py
						_UpperCAmelCase							   =     {'torch': 'pt'}

						# Locate actual dummy modules and read their content.
						_UpperCAmelCase							   =     os.path.join(__lowerCAmelCase					,						'utils'      )
						_UpperCAmelCase							   =     {
						    backend: os.path.join(__lowerCAmelCase					,						F"""dummy_{short_names.get(__lowerCAmelCase					,						__lowerCAmelCase      )}_objects.py"""      )
						    for backend in dummy_files.keys()
						}

						_UpperCAmelCase							   =     {}
						for backend, file_path in dummy_file_paths.items():
												if os.path.isfile(__lowerCAmelCase      ):
																		with open(__lowerCAmelCase					,						'r'					,						encoding='utf-8'					,						newline='\n'      ) as f:
																								_UpperCAmelCase							   =     f.read()
												else:
																		_UpperCAmelCase							   =     ''

						for backend in dummy_files.keys():
												if dummy_files[backend] != actual_dummies[backend]:
																		if overwrite:
																								print(
																								    F"""Updating transformers.utils.dummy_{short_names.get(__lowerCAmelCase					,						__lowerCAmelCase      )}_objects.py as the main """
																								    '__init__ has new objects.'      )
																								with open(dummy_file_paths[backend]					,						'w'					,						encoding='utf-8'					,						newline='\n'      ) as f:
																														f.write(dummy_files[backend]      )
																		else:
																								raise ValueError(
																								    'The main __init__ has objects that are not present in '
																								    F"""transformers.utils.dummy_{short_names.get(__lowerCAmelCase					,						__lowerCAmelCase      )}_objects.py. Run `make fix-copies` """
																								    'to fix this.'      )


if __name__ == "__main__":
		_a       =    argparse.ArgumentParser()
		parser.add_argument('''--fix_and_overwrite''', action='''store_true''', help='''Whether to fix inconsistencies.''')
		_a       =    parser.parse_args()

		check_dummies(args.fix_and_overwrite)
