

from abc import ABC, abstractmethod
from typing import List, Optional

class 					a__						(					snake_case			):
			"""simple docstring"""







			def __init__(    self       )  ->						Optional[Any]:
							'''simple docstring'''






							self.test()


			def      UpperCamelCase		(    self       )  ->						Optional[Any]:
							'''simple docstring'''






							A__        =			0
							A__        =			False
							while not completed:
											if counter == 1:
															self.reset()
											A__        =			self.advance()
											if not self.does_advance(lowercase       ):
															raise Exception(
															    "Custom Constraint is not defined correctly. self.does_advance(self.advance()) must be true."       )

											A__    ,				A__    ,				A__        =			self.update(lowercase       )
											counter += 1

											if counter > 10000:
															raise Exception("update() does not fulfill the constraint."       )

							if self.remaining() != 0:
											raise Exception("Custom Constraint is not defined correctly."       )


			@abstractmethod
			def      UpperCamelCase		(    self       )  ->						Optional[int]:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )


			@abstractmethod
			def      UpperCamelCase		(    self      ,      lowercase       )  ->						int:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )


			@abstractmethod
			def      UpperCamelCase		(    self      ,      lowercase       )  ->						Dict:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )


			@abstractmethod
			def      UpperCamelCase		(    self       )  ->						List[Any]:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )


			@abstractmethod
			def      UpperCamelCase		(    self       )  ->						Any:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )


			@abstractmethod
			def      UpperCamelCase		(    self      ,      lowercase=False       )  ->						int:
							'''simple docstring'''






							raise NotImplementedError(
							    F'{self.__class__} is an abstract class. Only classes inheriting this class can be called.'       )

class 					a__						(					snake_case			):
			"""simple docstring"""







			def __init__(    self      ,      lowercase       )  ->						List[str]:
							'''simple docstring'''






							super(lowercase      ,      self       ).__init__()

							if not isinstance(lowercase      ,      lowercase       ) or len(lowercase       ) == 0:
											raise ValueError(F'`token_ids` has to be a non-empty list, but is {token_ids}.'       )
							if any((not isinstance(lowercase      ,      lowercase       ) or token_id < 0) for token_id in token_ids       ):
											raise ValueError(F'Each list in `token_ids` has to be a list of positive integers, but is {token_ids}.'       )

							A__        =			token_ids

							A__        =			len(self.token_ids       )
							A__        =			-1  # the index of the currently fulfilled step
							A__        =			False


			def      UpperCamelCase		(    self       )  ->						List[Any]:
							'''simple docstring'''






							if self.completed:
											return None
							return self.token_ids[self.fulfilled_idx + 1]


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						Optional[Any]:
							'''simple docstring'''






							if not isinstance(lowercase      ,      lowercase       ):
											raise ValueError(F'`token_id` has to be an `int`, but is {token_id} of type {type(lowercase       )}'       )

							if self.completed:
											return False

							return token_id == self.token_ids[self.fulfilled_idx + 1]


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						List[str]:
							'''simple docstring'''






							if not isinstance(lowercase      ,      lowercase       ):
											raise ValueError(F'`token_id` has to be an `int`, but is {token_id} of type {type(lowercase       )}'       )

							A__        =			False
							A__        =			False
							A__        =			False

							if self.does_advance(lowercase       ):
											self.fulfilled_idx += 1
											A__        =			True
											if self.fulfilled_idx == (self.seqlen - 1):
															A__        =			True
											A__        =			completed
							else:
											# failed to make progress.
											A__        =			True
											self.reset()
							return stepped, completed, reset


			def      UpperCamelCase		(    self       )  ->						Optional[Any]:
							'''simple docstring'''






							A__        =			False
							A__        =			0


			def      UpperCamelCase		(    self       )  ->						Tuple:
							'''simple docstring'''






							return self.seqlen - (self.fulfilled_idx + 1)


			def      UpperCamelCase		(    self      ,      lowercase=False       )  ->						Tuple:
							'''simple docstring'''






							A__        =			PhrasalConstraint(self.token_ids       )

							if stateful:
											A__        =			self.seqlen
											A__        =			self.fulfilled_idx
											A__        =			self.completed

							return new_constraint

class 					a__						:
			"""simple docstring"""







			def __init__(    self      ,      lowercase      ,      lowercase=True       )  ->						Any:
							'''simple docstring'''






							A__        =			max([len(lowercase       ) for one in nested_token_ids]       )

							A__        =			{}
							for token_ids in nested_token_ids:
											A__        =			root
											for tidx, token_id in enumerate(lowercase       ):
															if token_id not in level:
																			A__        =			{}

															A__        =			level[token_id]

							if no_subsets and self.has_subsets(lowercase      ,      lowercase       ):
											raise ValueError(
											    "Each list in `nested_token_ids` can't be a complete subset of another list, but is"
											    F' {nested_token_ids}.'       )

							A__        =			root


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						Dict:
							'''simple docstring'''






							A__        =			self.trie

							for current_token in current_seq:
											A__        =			start[current_token]

							A__        =			list(start.keys()       )

							return next_tokens


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						int:
							'''simple docstring'''






							A__        =			self.next_tokens(lowercase       )

							return len(lowercase       ) == 0


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						str:
							'''simple docstring'''






							A__        =			list(root.values()       )
							if len(lowercase       ) == 0:
											return 1
							else:
											return sum([self.count_leaves(lowercase       ) for nn in next_nodes]       )


			def      UpperCamelCase		(    self      ,      lowercase      ,      lowercase       )  ->						str:
							'''simple docstring'''






							A__        =			self.count_leaves(lowercase       )
							return len(lowercase       ) != leaf_count

class 					a__						(					snake_case			):
			"""simple docstring"""







			def __init__(    self      ,      lowercase       )  ->						Dict:
							'''simple docstring'''






							super(lowercase      ,      self       ).__init__()

							if not isinstance(lowercase      ,      lowercase       ) or len(lowercase       ) == 0:
											raise ValueError(F'`nested_token_ids` has to be a non-empty list, but is {nested_token_ids}.'       )
							if any(not isinstance(lowercase      ,      lowercase       ) for token_ids in nested_token_ids       ):
											raise ValueError(F'`nested_token_ids` has to be a list of lists, but is {nested_token_ids}.'       )
							if any(
							    any((not isinstance(lowercase      ,      lowercase       ) or token_id < 0) for token_id in token_ids       )
							    for token_ids in nested_token_ids       ):
											raise ValueError(
											    F'Each list in `nested_token_ids` has to be a list of positive integers, but is {nested_token_ids}.'       )

							A__        =			DisjunctiveTrie(lowercase       )
							A__        =			nested_token_ids

							A__        =			self.trie.max_height
							A__        =			[]
							A__        =			False


			def      UpperCamelCase		(    self       )  ->						List[str]:
							'''simple docstring'''






							A__        =			self.trie.next_tokens(self.current_seq       )

							if len(lowercase       ) == 0:
											return None
							else:
											return token_list


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						Optional[Any]:
							'''simple docstring'''






							if not isinstance(lowercase      ,      lowercase       ):
											raise ValueError(F'`token_id` is supposed to be type `int`, but is {token_id} of type {type(lowercase       )}'       )

							A__        =			self.trie.next_tokens(self.current_seq       )

							return token_id in next_tokens


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						str:
							'''simple docstring'''






							if not isinstance(lowercase      ,      lowercase       ):
											raise ValueError(F'`token_id` is supposed to be type `int`, but is {token_id} of type {type(lowercase       )}'       )

							A__        =			False
							A__        =			False
							A__        =			False

							if self.does_advance(lowercase       ):
											self.current_seq.append(lowercase       )
											A__        =			True
							else:
											A__        =			True
											self.reset()

							A__        =			self.trie.reached_leaf(self.current_seq       )
							A__        =			completed

							return stepped, completed, reset


			def      UpperCamelCase		(    self       )  ->						int:
							'''simple docstring'''






							A__        =			False
							A__        =			[]


			def      UpperCamelCase		(    self       )  ->						List[Any]:
							'''simple docstring'''






							if self.completed:
											# since this can be completed without reaching max height
											return 0
							else:
											return self.seqlen - len(self.current_seq       )


			def      UpperCamelCase		(    self      ,      lowercase=False       )  ->						Optional[Any]:
							'''simple docstring'''






							A__        =			DisjunctiveConstraint(self.token_ids       )

							if stateful:
											A__        =			self.seqlen
											A__        =			self.current_seq
											A__        =			self.completed

							return new_constraint

class 					a__						:
			"""simple docstring"""







			def __init__(    self      ,      lowercase       )  ->						List[str]:
							'''simple docstring'''






							A__        =			constraints

							# max # of steps required to fulfill a given constraint
							A__        =			max([c.seqlen for c in constraints]       )
							A__        =			len(lowercase       )
							A__        =			False

							self.init_state()


			def      UpperCamelCase		(    self       )  ->						Optional[Any]:
							'''simple docstring'''






							A__        =			[]
							A__        =			None
							A__        =			[constraint.copy(stateful=lowercase       ) for constraint in self.constraints]


			def      UpperCamelCase		(    self       )  ->						Optional[int]:
							'''simple docstring'''






							A__        =			0
							if self.inprogress_constraint:
											# extra points for having a constraint mid-fulfilled
											add += self.max_seqlen - self.inprogress_constraint.remaining()

							return (len(self.complete_constraints       ) * self.max_seqlen) + add


			def      UpperCamelCase		(    self       )  ->						List[Any]:
							'''simple docstring'''






							A__        =			[]
							if self.inprogress_constraint is None:
											for constraint in self.pending_constraints:  # "pending" == "unfulfilled yet"
															A__        =			constraint.advance()
															if isinstance(lowercase      ,      lowercase       ):
																			token_list.append(lowercase       )
															elif isinstance(lowercase      ,      lowercase       ):
																			token_list.extend(lowercase       )
							else:
											A__        =			self.inprogress_constraint.advance()
											if isinstance(lowercase      ,      lowercase       ):
															token_list.append(lowercase       )
											elif isinstance(lowercase      ,      lowercase       ):
															token_list.extend(lowercase       )

							if len(lowercase       ) == 0:
											return None
							else:
											return token_list


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						List[str]:
							'''simple docstring'''






							self.init_state()

							if token_ids is not None:
											for token in token_ids:
															# completes or steps **one** constraint
															A__    ,				A__        =			self.add(lowercase       )

															# the entire list of constraints are fulfilled
															if self.completed:
																			break


			def      UpperCamelCase		(    self      ,      lowercase       )  ->						List[str]:
							'''simple docstring'''






							if not isinstance(lowercase      ,      lowercase       ):
											raise ValueError(F'`token_id` should be an `int`, but is `{token_id}`.'       )

							A__    ,				A__        =			False, False

							if self.completed:
											A__        =			True
											A__        =			False
											return complete, stepped

							if self.inprogress_constraint is not None:
											# In the middle of fulfilling a constraint. If the `token_id` *does* makes an incremental progress to current
											# job, simply update the state

											A__    ,				A__    ,				A__        =			self.inprogress_constraint.update(lowercase       )
											if reset:
															# 1. If the next token breaks the progress, then we must restart.
															#     e.g. constraint = "I love pies" and sequence so far is "I love" but `token_id` == "books".

															#     But that doesn't mean we self.init_state(), since we only reset the state for this particular
															#     constraint, not the full list of constraints.

															self.pending_constraints.append(self.inprogress_constraint.copy(stateful=lowercase       )       )
															A__        =			None

											if complete:
															# 2. If the next token completes the constraint, move it to completed list, set
															#     inprogress to None. If there are no pending constraints either, then this full list of constraints
															#     is complete.

															self.complete_constraints.append(self.inprogress_constraint       )
															A__        =			None

															if len(self.pending_constraints       ) == 0:
																			# we're done!
																			A__        =			True

							else:
											# Not in the middle of fulfilling a constraint. So does this `token_id` helps us step towards any of our list
											# of constraints?

											for cidx, pending_constraint in enumerate(self.pending_constraints       ):
															if pending_constraint.does_advance(lowercase       ):
																			A__    ,				A__    ,				A__        =			pending_constraint.update(lowercase       )

																			if not stepped:
																							raise Exception(
																							    "`constraint.update(token_id)` is not yielding incremental progress, "
																							    "even though `constraint.does_advance(token_id)` is true."       )

																			if complete:
																							self.complete_constraints.append(lowercase       )
																							A__        =			None

																			if not complete and stepped:
																							A__        =			pending_constraint

																			if complete or stepped:
																							# If we made any progress at all, then it's at least not a "pending constraint".

																							A__        =			(
																							    self.pending_constraints[:cidx] + self.pending_constraints[cidx + 1 :]
																							)

																							if len(self.pending_constraints       ) == 0 and self.inprogress_constraint is None:
																											# If there's no longer any pending after this and no inprogress either, then we must be
																											# complete.

																											A__        =			True

																							break  # prevent accidentally stepping through multiple constraints with just one token.

							return complete, stepped


			def      UpperCamelCase		(    self      ,      lowercase=True       )  ->						Dict:
							'''simple docstring'''






							A__        =			ConstraintListState(self.constraints       )  # we actually never though self.constraints objects
							# throughout this process. So it's at initialization state.

							if stateful:
											A__        =			[
											    constraint.copy(stateful=lowercase       ) for constraint in self.complete_constraints
											]
											if self.inprogress_constraint is not None:
															A__        =			self.inprogress_constraint.copy(stateful=lowercase       )
											A__        =			[constraint.copy() for constraint in self.pending_constraints]

							return new_state




import collections
import importlib.util
import os
import re
from pathlib import Path


lowerCAmelCase__	   = """src/transformers"""


# Matches is_xxx_available()
lowerCAmelCase__	   = re.compile(R"""is\_([a-z_]*)_available()""")
# Catches a one-line _import_struct = {xxx}
lowerCAmelCase__	   = re.compile(R"""^_import_structure\s+=\s+\{([^\}]+)\}""")
# Catches a line with a key-values pattern: "bla": ["foo", "bar"]
lowerCAmelCase__	   = re.compile(R"""\s+\"\S*\":\s+\[([^\]]*)\]""")
# Catches a line if not is_foo_available
lowerCAmelCase__	   = re.compile(R"""^\s*if\s+not\s+is\_[a-z_]*\_available\(\)""")
# Catches a line _import_struct["bla"].append("foo")
lowerCAmelCase__	   = re.compile(R"""^\s*_import_structure\[\"\S*\"\]\.append\(\"(\S*)\"\)""")
# Catches a line _import_struct["bla"].extend(["foo", "bar"]) or _import_struct["bla"] = ["foo", "bar"]
lowerCAmelCase__	   = re.compile(R"""^\s*_import_structure\[\S*\](?:\.extend\(|\s*=\s+)\[([^\]]*)\]""")
# Catches a line with an object between quotes and a comma:     "MyModel",
lowerCAmelCase__	   = re.compile("""^\s+\"([^\"]+)\",""")
# Catches a line with objects between brackets only:    ["foo", "bar"],
lowerCAmelCase__	   = re.compile("""^\s+\[([^\]]+)\]""")
# Catches a line with from foo import bar, bla, boo
lowerCAmelCase__	   = re.compile(R"""\s+from\s+\S*\s+import\s+([^\(\s].*)\n""")
# Catches a line with try:
lowerCAmelCase__	   = re.compile(R"""^\s*try:""")
# Catches a line with else:
lowerCAmelCase__	   = re.compile(R"""^\s*else:""")



def 					lowerCAmelCase__							(	SCREAMING_SNAKE_CASE_:							Any      )			->      int:




				'''simple docstring'''





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



def 					lowerCAmelCase__							(	SCREAMING_SNAKE_CASE_:							Union[str, Any]      )			->      Optional[Any]:




				'''simple docstring'''





				with open(SCREAMING_SNAKE_CASE_	,       "r"	,       encoding="utf-8"	,       newline="\n"      ) as f:
								A__        =			f.readlines()

				A__        =			0
				while line_index < len(SCREAMING_SNAKE_CASE_      ) and not lines[line_index].startswith("_import_structure = {"      ):
								line_index += 1

				# If this is a traditional init, just return.
				if line_index >= len(SCREAMING_SNAKE_CASE_      ):
								return None

				# First grab the objects without a specific backend in _import_structure
				A__        =			[]
				while not lines[line_index].startswith("if TYPE_CHECKING"      ) and find_backend(lines[line_index]      ) is None:
								A__        =			lines[line_index]
								# If we have everything on a single line, let's deal with it.
								if _re_one_line_import_struct.search(SCREAMING_SNAKE_CASE_      ):
												A__        =			_re_one_line_import_struct.search(SCREAMING_SNAKE_CASE_      ).groups()[0]
												A__        =			re.findall("\[([^\]]+)\]"	,       SCREAMING_SNAKE_CASE_      )
												for imp in imports:
																objects.extend([obj[1:-1] for obj in imp.split(", "      )]      )
												line_index += 1
												continue
								A__        =			_re_import_struct_key_value.search(SCREAMING_SNAKE_CASE_      )
								if single_line_import_search is not None:
												A__        =			[obj[1:-1] for obj in single_line_import_search.groups()[0].split(", "      ) if len(SCREAMING_SNAKE_CASE_      ) > 0]
												objects.extend(SCREAMING_SNAKE_CASE_      )
								elif line.startswith(" " * 8 + "\""      ):
												objects.append(line[9:-3]      )
								line_index += 1

				A__        =			{"none": objects}
				# Let's continue with backend-specific objects in _import_structure
				while not lines[line_index].startswith("if TYPE_CHECKING"      ):
								# If the line is an if not is_backend_available, we grab all objects associated.
								A__        =			find_backend(lines[line_index]      )
								# Check if the backend declaration is inside a try block:
								if _re_try.search(lines[line_index - 1]      ) is None:
												A__        =			None

								if backend is not None:
												line_index += 1

												# Scroll until we hit the else block of try-except-else
												while _re_else.search(lines[line_index]      ) is None:
																line_index += 1

												line_index += 1

												A__        =			[]
												# Until we unindent, add backend objects to the list
												while len(lines[line_index]      ) <= 1 or lines[line_index].startswith(" " * 4      ):
																A__        =			lines[line_index]
																if _re_import_struct_add_one.search(SCREAMING_SNAKE_CASE_      ) is not None:
																				objects.append(_re_import_struct_add_one.search(SCREAMING_SNAKE_CASE_      ).groups()[0]      )
																elif _re_import_struct_add_many.search(SCREAMING_SNAKE_CASE_      ) is not None:
																				A__        =			_re_import_struct_add_many.search(SCREAMING_SNAKE_CASE_      ).groups()[0].split(", "      )
																				A__        =			[obj[1:-1] for obj in imports if len(SCREAMING_SNAKE_CASE_      ) > 0]
																				objects.extend(SCREAMING_SNAKE_CASE_      )
																elif _re_between_brackets.search(SCREAMING_SNAKE_CASE_      ) is not None:
																				A__        =			_re_between_brackets.search(SCREAMING_SNAKE_CASE_      ).groups()[0].split(", "      )
																				A__        =			[obj[1:-1] for obj in imports if len(SCREAMING_SNAKE_CASE_      ) > 0]
																				objects.extend(SCREAMING_SNAKE_CASE_      )
																elif _re_quote_object.search(SCREAMING_SNAKE_CASE_      ) is not None:
																				objects.append(_re_quote_object.search(SCREAMING_SNAKE_CASE_      ).groups()[0]      )
																elif line.startswith(" " * 8 + "\""      ):
																				objects.append(line[9:-3]      )
																elif line.startswith(" " * 1_2 + "\""      ):
																				objects.append(line[1_3:-3]      )
																line_index += 1

												A__        =			objects
								else:
												line_index += 1

    # At this stage we are in the TYPE_CHECKING part, first grab the objects without a specific backend
				A__        =			[]
				while (
				    line_index < len(SCREAMING_SNAKE_CASE_      )
				    and find_backend(lines[line_index]      ) is None
				    and not lines[line_index].startswith("else"      )
				):
								A__        =			lines[line_index]
								A__        =			_re_import.search(SCREAMING_SNAKE_CASE_      )
								if single_line_import_search is not None:
												objects.extend(single_line_import_search.groups()[0].split(", "      )      )
								elif line.startswith(" " * 8      ):
												objects.append(line[8:-2]      )
								line_index += 1

				A__        =			{"none": objects}
				# Let's continue with backend-specific objects
				while line_index < len(SCREAMING_SNAKE_CASE_      ):
								# If the line is an if is_backend_available, we grab all objects associated.
								A__        =			find_backend(lines[line_index]      )
								# Check if the backend declaration is inside a try block:
								if _re_try.search(lines[line_index - 1]      ) is None:
												A__        =			None

								if backend is not None:
												line_index += 1

												# Scroll until we hit the else block of try-except-else
												while _re_else.search(lines[line_index]      ) is None:
																line_index += 1

												line_index += 1

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

												A__        =			objects
								else:
												line_index += 1

				return import_dict_objects, type_hint_objects



def 					lowerCAmelCase__							(	SCREAMING_SNAKE_CASE_:							Dict	,       SCREAMING_SNAKE_CASE_:							List[Any]      )			->      Optional[int]:




				'''simple docstring'''





				def find_duplicates(SCREAMING_SNAKE_CASE_:							str      ):
								return [k for k, v in collections.Counter(SCREAMING_SNAKE_CASE_      ).items() if v > 1]

				if list(import_dict_objects.keys()      ) != list(type_hint_objects.keys()      ):
								return ["Both sides of the init do not have the same backends!"]

				A__        =			[]
				for key in import_dict_objects.keys():
								A__        =			find_duplicates(import_dict_objects[key]      )
								if duplicate_imports:
												errors.append(F'Duplicate _import_structure definitions for: {duplicate_imports}'      )
								A__        =			find_duplicates(type_hint_objects[key]      )
								if duplicate_type_hints:
												errors.append(F'Duplicate TYPE_CHECKING objects for: {duplicate_type_hints}'      )

								if sorted(set(import_dict_objects[key]      )      ) != sorted(set(type_hint_objects[key]      )      ):
												A__        =			"base imports" if key == "none" else F'{key} backend'
												errors.append(F'Differences for {name}:'      )
												for a in type_hint_objects[key]:
																if a not in import_dict_objects[key]:
																				errors.append(F'  {a} in TYPE_HINT but not in _import_structure.'      )
												for a in import_dict_objects[key]:
																if a not in type_hint_objects[key]:
																				errors.append(F'  {a} in _import_structure but not in TYPE_HINT.'      )
				return errors



def 					lowerCAmelCase__							(	)			->      Dict:




				'''simple docstring'''





				A__        =			[]
				for root, _, files in os.walk(SCREAMING_SNAKE_CASE_      ):
								if "__init__.py" in files:
												A__        =			os.path.join(SCREAMING_SNAKE_CASE_	,       "__init__.py"      )
												A__        =			parse_init(SCREAMING_SNAKE_CASE_      )
												if objects is not None:
																A__        =			analyze_results(*SCREAMING_SNAKE_CASE_      )
																if len(SCREAMING_SNAKE_CASE_      ) > 0:
																				A__        =			F'Problem in {fname}, both halves do not define the same objects.\n{errors[0]}'
																				failures.append("\n".join(SCREAMING_SNAKE_CASE_      )      )
				if len(SCREAMING_SNAKE_CASE_      ) > 0:
								raise ValueError("\n\n".join(SCREAMING_SNAKE_CASE_      )      )



def 					lowerCAmelCase__							(	)			->      Optional[Any]:




				'''simple docstring'''





				A__        =			[]
				for path, directories, files in os.walk(SCREAMING_SNAKE_CASE_      ):
								for folder in directories:
												# Ignore private modules
												if folder.startswith("_"      ):
																directories.remove(SCREAMING_SNAKE_CASE_      )
																continue
												# Ignore leftovers from branches (empty folders apart from pycache)
												if len(list((Path(SCREAMING_SNAKE_CASE_      ) / folder).glob("*.py"      )      )      ) == 0:
																continue
												A__        =			str((Path(SCREAMING_SNAKE_CASE_      ) / folder).relative_to(SCREAMING_SNAKE_CASE_      )      )
												A__        =			short_path.replace(os.path.sep	,       "."      )
												submodules.append(SCREAMING_SNAKE_CASE_      )
								for fname in files:
												if fname == "__init__.py":
																continue
												A__        =			str((Path(SCREAMING_SNAKE_CASE_      ) / fname).relative_to(SCREAMING_SNAKE_CASE_      )      )
												A__        =			short_path.replace(".py"	,       ""      ).replace(os.path.sep	,       "."      )
												if len(submodule.split("."      )      ) == 1:
																submodules.append(SCREAMING_SNAKE_CASE_      )
				return submodules


lowerCAmelCase__	   = [
    """convert_pytorch_checkpoint_to_tf2""",
    """modeling_flax_pytorch_utils""",
]



def 					lowerCAmelCase__							(	)			->      Optional[int]:




				'''simple docstring'''





				A__        =			importlib.util.spec_from_file_location(
				    "transformers"	,       os.path.join(SCREAMING_SNAKE_CASE_	,       "__init__.py"      )	,       submodule_search_locations=[PATH_TO_TRANSFORMERS]	,       )
				A__        =			spec.loader.load_module()

				A__        =			[
				    module
				    for module in get_transformers_submodules()
				    if module not in IGNORE_SUBMODULES and module not in transformers._import_structure.keys()
				]
				if len(SCREAMING_SNAKE_CASE_      ) > 0:
								A__        =			"\n".join(F'- {module}' for module in module_not_registered      )
								raise ValueError(
								    "The following submodules are not properly registered in the main init of Transformers:\n"
								    F'{list_of_modules}\n'
								    "Make sure they appear somewhere in the keys of `_import_structure` with an empty list as value."      )


if __name__ == "__main__":
	check_all_inits()
	check_submodules()

