


"""simple docstring"""







import argparse
import os
import re

import packaging.version


lowerCamelCase_       :       Dict      						=  """examples/"""
lowerCamelCase_       :       str      						=  {
    """examples""": (re.compile(R"""^check_min_version\(\"[^\"]+\"\)\s*$""", re.MULTILINE), """check_min_version(\"VERSION\")\n"""),
    """init""": (re.compile(R"""^__version__\s+=\s+\"([^\"]+)\"\s*$""", re.MULTILINE), """__version__ = \"VERSION\"\n"""),
    """setup""": (re.compile(R"""^(\s*)version\s*=\s*\"[^\"]+\",""", re.MULTILINE), R"""\1version=\"VERSION\","""),
    """doc""": (re.compile(R"""^(\s*)release\s*=\s*\"[^\"]+\"$""", re.MULTILINE), """release = \"VERSION\"\n"""),
}
lowerCamelCase_       :       Optional[int]      						=  {
    """init""": """src/transformers/__init__.py""",
    """setup""": """setup.py""",
}
lowerCamelCase_       :       str      						=  """README.md"""
def _A						(						lowercase	,   lowercase	,   lowercase		):







    """simple docstring"""
    with open(lowercase	,   '''r'''	,   encoding='''utf-8'''	,   newline='''\n'''		) as f:
        a					=f.read()
    a		,				a					=REPLACE_PATTERNS[pattern]
    a					=replace.replace('''VERSION'''	,   lowercase		)
    a					=re_pattern.sub(lowercase	,   lowercase		)
    with open(lowercase	,   '''w'''	,   encoding='''utf-8'''	,   newline='''\n'''		) as f:
        f.write(lowercase		)
def _A						(						lowercase		):







    """simple docstring"""
    for folder, directories, fnames in os.walk(lowercase		):
        # Removing some of the folders with non-actively maintained examples from the walk
        if "research_projects" in directories:
            directories.remove('''research_projects'''		)
        if "legacy" in directories:
            directories.remove('''legacy'''		)
        for fname in fnames:
            if fname.endswith('''.py'''		):
                update_version_in_file(os.path.join(lowercase	,   lowercase		)	,   lowercase	,   pattern='''examples'''		)
def _A						(						lowercase	,   lowercase=False		):







    """simple docstring"""
    for pattern, fname in REPLACE_FILES.items():
        update_version_in_file(lowercase	,   lowercase	,   lowercase		)
    if not patch:
        update_version_in_examples(lowercase		)
def _A						(						):







    """simple docstring"""
    a					='''🤗 Transformers currently provides the following architectures'''
    a					='''1. Want to contribute a new model?'''
    with open(lowercase	,   '''r'''	,   encoding='''utf-8'''	,   newline='''\n'''		) as f:
        a					=f.readlines()

    # Find the start of the list.
    a					=0
    while not lines[start_index].startswith(_start_prompt		):
        start_index += 1
    start_index += 1

    a					=start_index
    # Update the lines in the model list.
    while not lines[index].startswith(_end_prompt		):
        if lines[index].startswith('''1.'''		):
            a					=lines[index].replace(
                '''https://huggingface.co/docs/transformers/main/model_doc'''	,   '''https://huggingface.co/docs/transformers/model_doc'''	,   )
        index += 1

    with open(lowercase	,   '''w'''	,   encoding='''utf-8'''	,   newline='''\n'''		) as f:
        f.writelines(lowercase		)
def _A						(						):







    """simple docstring"""
    with open(REPLACE_FILES['''init''']	,   '''r'''		) as f:
        a					=f.read()
    a					=REPLACE_PATTERNS['''init'''][0].search(lowercase		).groups()[0]
    return packaging.version.parse(lowercase		)
def _A						(						lowercase=False		):







    """simple docstring"""
    a					=get_version()
    if patch and default_version.is_devrelease:
        raise ValueError('''Can\'t create a patch version from the dev branch, checkout a released version!'''		)
    if default_version.is_devrelease:
        a					=default_version.base_version
    elif patch:
        a					=f'''{default_version.major}.{default_version.minor}.{default_version.micro + 1}'''
    else:
        a					=f'''{default_version.major}.{default_version.minor + 1}.0'''

    # Now let's ask nicely if that's the right one.
    a					=input(f'''Which version are you releasing? [{default_version}]'''		)
    if len(lowercase		) == 0:
        a					=default_version

    print(f'''Updating version to {version}.'''		)
    global_version_update(lowercase	,   patch=lowercase		)
    if not patch:
        print('''Cleaning main README, don\'t forget to run `make fix-copies`.'''		)
        clean_main_ref_in_model_list()
def _A						(						):







    """simple docstring"""
    a					=get_version()
    a					=f'''{current_version.major}.{current_version.minor + 1}.0.dev0'''
    a					=current_version.base_version

    # Check with the user we got that right.
    a					=input(f'''Which version are we developing now? [{dev_version}]'''		)
    if len(lowercase		) == 0:
        a					=dev_version

    print(f'''Updating version to {version}.'''		)
    global_version_update(lowercase		)
    print('''Cleaning main README, don\'t forget to run `make fix-copies`.'''		)
    clean_main_ref_in_model_list()


if __name__ == "__main__":
       lowerCamelCase_       :       Tuple      						=  argparse.ArgumentParser()
       parser.add_argument("""--post_release""", action="""store_true""", help="""Whether this is pre or post release.""")
       parser.add_argument("""--patch""", action="""store_true""", help="""Whether or not this is a patch release.""")
       lowerCamelCase_       :       Union[str, Any]      						=  parser.parse_args()
       if not args.post_release:
              pre_release_work(patch=args.patch)
       elif args.patch:
              print("""Nothing to do after a patch :-)""")
       else:
              post_release_work()



"""simple docstring"""







from __future__ import annotations

from typing import Generic, TypeVar

lowerCamelCase_       :       List[Any]      						=  TypeVar("""T""")






class 				__A    (	Generic[T]      ):






 """simple docstring"""




 def __init__(		self			,   __A						) ->					None:
     a					=data
     a					=self
     a					=0






class 				__A    (	Generic[T]      ):






 """simple docstring"""




 def __init__(		self						) ->					None:
     # map from node name to the node object
     a					={}


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A						) ->					None:
     # create a new set with x as its member
     a					=DisjointSetTreeNode(__A						)


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A						) ->					DisjointSetTreeNode[T]:
     # find the set x belongs to (with path-compression)
     a					=self.map[data]
     if elem_ref != elem_ref.parent:
         a					=self.find_set(elem_ref.parent.data						)
     return elem_ref.parent


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A			,   __A						) ->					None:
     # helper function for union operation
     if nodea.rank > nodea.rank:
         a					=nodea
     else:
         a					=nodea
         if nodea.rank == nodea.rank:
             nodea.rank += 1





 def 				SCREAMING_SNAKE_CASE							(		self			,   __A			,   __A						) ->					None:
     # merge 2 disjoint sets
     self.link(self.find_set(__A						)			,   self.find_set(__A						)						)






class 				__A    (	Generic[T]      ):






 """simple docstring"""




 def __init__(		self						) ->					None:
     # connections: map from the node to the neighbouring nodes (with weights)
     a					={}


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A						) ->					None:
     # add a node ONLY if its not present in the graph
     if node not in self.connections:
         a					={}


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A			,   __A			,   __A						) ->					None:
     # add an edge with the given weight
     self.add_node(__A						)
     self.add_node(__A						)
     a					=weight
     a					=weight





 def 				SCREAMING_SNAKE_CASE							(		self						) ->					GraphUndirectedWeighted[T]:
     a					=[]
     a					=set()
     for start in self.connections:
         for end in self.connections[start]:
             if (start, end) not in seen:
                 seen.add((end, start)						)
                 edges.append((start, end, self.connections[start][end])						)
     edges.sort(key=lambda __A						: x[2]						)

     # creating the disjoint set
     a					=DisjointSetTree[T]()
     for node in self.connections:
         disjoint_set.make_set(__A						)

     # MST generation
     a					=0
     a					=0
     a					=GraphUndirectedWeighted[T]()
     while num_edges < len(self.connections						) - 1:
         a		,				a		,				a					=edges[index]
         index += 1
         a					=disjoint_set.find_set(__A						)
         a					=disjoint_set.find_set(__A						)
         if parent_u != parent_v:
             num_edges += 1
             graph.add_edge(__A			,   __A			,   __A						)
             disjoint_set.union(__A			,   __A						)
     return graph