



import dataclasses
import json
import sys
import types
from argparse import ArgumentDefaultsHelpFormatter, ArgumentParser, ArgumentTypeError
from copy import copy
from enum import Enum
from inspect import isclass
from pathlib import Path
from typing import Any, Callable, Dict, Iterable, List, Literal, NewType, Optional, Tuple, Union, get_type_hints

import yaml


__snake_case						:Optional[int]      		=     NewType('''DataClass''', Any)
__snake_case						:str      		=     NewType('''DataClassType''', Any)





def      __snake_case	(			_UpperCAmelCase				):
    if isinstance(_UpperCAmelCase   , _UpperCAmelCase				):
        return v
    if v.lower() in ("yes", "true", "t", "y", "1"):
        return True
    elif v.lower() in ("no", "false", "f", "n", "0"):
        return False
    else:
        raise ArgumentTypeError(
            f'Truthy value expected: got {v} but expected one of yes/no, true/false, t/f, y/n, 1/0 (case insensitive).'				)





def      __snake_case	(			_UpperCAmelCase				):
    __a						       =				{str(_UpperCAmelCase				): choice for choice in choices}
    return lambda _UpperCAmelCase				: str_to_choice.get(_UpperCAmelCase   , _UpperCAmelCase				)





def      __snake_case	(			*,
    _UpperCAmelCase = None   , _UpperCAmelCase = None   , _UpperCAmelCase = dataclasses.MISSING   , _UpperCAmelCase = dataclasses.MISSING   , _UpperCAmelCase = None   , **_UpperCAmelCase   , ):
    if metadata is None:
        # Important, don't use as default param in function signature because dict is mutable and shared across function calls
        __a						       =				{}
    if aliases is not None:
        __a						       =				aliases
    if help is not None:
        __a						       =				help

    return dataclasses.field(metadata=_UpperCAmelCase   , default=_UpperCAmelCase   , default_factory=_UpperCAmelCase   , **_UpperCAmelCase				)

class     _A       (	__UpperCAmelCase    ):
       UpperCamelCase__  :    Iterable[DataClassType]



       def __init__(		self							:     Dict     ,		__SCREAMING_SNAKE_CASE							:     Union[DataClassType, Iterable[DataClassType]]     ,		**__SCREAMING_SNAKE_CASE							:     Dict):


           '''simple docstring'''

           if "formatter_class" not in kwargs:
               __a						       =				ArgumentDefaultsHelpFormatter
           super().__init__(**__SCREAMING_SNAKE_CASE)
           if dataclasses.is_dataclass(__SCREAMING_SNAKE_CASE):
               __a						       =				[dataclass_types]
           __a						       =				list(__SCREAMING_SNAKE_CASE)
           for dtype in self.dataclass_types:
               self._add_dataclass_arguments(__SCREAMING_SNAKE_CASE)



       @staticmethod
       def 		_lowerCamelCase			(		__SCREAMING_SNAKE_CASE							:     ArgumentParser     ,		__SCREAMING_SNAKE_CASE							:     dataclasses.Field):


           '''simple docstring'''

           __a						       =				F'--{field.name}'
           __a						       =				field.metadata.copy()
           # field.metadata is not used at all by Data Classes,
           # it is provided as a third-party extension mechanism.
           if isinstance(field.type     ,		__SCREAMING_SNAKE_CASE):
               raise RuntimeError(
                   '''Unresolved type detected, which should have been done with the help of '''
                   '''`typing.get_type_hints` method by default''')

           __a						       =				kwargs.pop('''aliases'''     ,		[])
           if isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
               __a						       =				[aliases]

           __a						       =				getattr(field.type     ,		'''__origin__'''     ,		field.type)
           if origin_type is Union or (hasattr(__SCREAMING_SNAKE_CASE     ,		'''UnionType''') and isinstance(__SCREAMING_SNAKE_CASE     ,		types.UnionType)):
               if str not in field.type.__args__ and (
                   len(field.type.__args__) != 2 or type(__SCREAMING_SNAKE_CASE) not in field.type.__args__
               ):
                   raise ValueError(
                       '''Only `Union[X, NoneType]` (i.e., `Optional[X]`) is allowed for `Union` because'''
                       ''' the argument parser only supports one type per argument.'''
                       F' Problem encountered in field \'{field.name}\'.')
               if type(__SCREAMING_SNAKE_CASE) not in field.type.__args__:
                   # filter `str` in Union
                   __a						       =				field.type.__args__[0] if field.type.__args__[1] == str else field.type.__args__[1]
                   __a						       =				getattr(field.type     ,		'''__origin__'''     ,		field.type)
               elif bool not in field.type.__args__:
                   # filter `NoneType` in Union (except for `Union[bool, NoneType]`)
                   __a						       =				(
                       field.type.__args__[0] if isinstance(__SCREAMING_SNAKE_CASE     ,		field.type.__args__[1]) else field.type.__args__[1]
                   )
                   __a						       =				getattr(field.type     ,		'''__origin__'''     ,		field.type)

        # A variable to store kwargs for a boolean field, if needed
        # so that we can init a `no_*` complement argument (see below)
           __a						       =				{}
           if origin_type is Literal or (isinstance(field.type     ,		__SCREAMING_SNAKE_CASE) and issubclass(field.type     ,		__SCREAMING_SNAKE_CASE)):
               if origin_type is Literal:
                   __a						       =				field.type.__args__
               else:
                   __a						       =				[x.value for x in field.type]

               __a						       =				make_choice_type_function(kwargs['''choices'''])

               if field.default is not dataclasses.MISSING:
                   __a						       =				field.default
               else:
                   __a						       =				True
           elif field.type is bool or field.type == Optional[bool]:
               # Copy the currect kwargs to use to instantiate a `no_*` complement argument below.
               # We do not initialize it here because the `no_*` alternative must be instantiated after the real argument
               __a						       =				copy(__SCREAMING_SNAKE_CASE)

               # Hack because type=bool in argparse does not behave as we want.
               __a						       =				string_to_bool
               if field.type is bool or (field.default is not None and field.default is not dataclasses.MISSING):
                   # Default value is False if we have no default when of type bool.
                   __a						       =				False if field.default is dataclasses.MISSING else field.default
                   # This is the value that will get picked if we don't include --field_name in any way
                   __a						       =				default
                   # This tells argparse we accept 0 or 1 value after --field_name
                   __a						       =				'''?'''
                   # This is the value that will get picked if we do --field_name (without value)
                   __a						       =				True
           elif isclass(__SCREAMING_SNAKE_CASE) and issubclass(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
               __a						       =				field.type.__args__[0]
               __a						       =				'''+'''
               if field.default_factory is not dataclasses.MISSING:
                   __a						       =				field.default_factory()
               elif field.default is dataclasses.MISSING:
                   __a						       =				True
           else:
               __a						       =				field.type
               if field.default is not dataclasses.MISSING:
                   __a						       =				field.default
               elif field.default_factory is not dataclasses.MISSING:
                   __a						       =				field.default_factory()
               else:
                   __a						       =				True
           parser.add_argument(__SCREAMING_SNAKE_CASE     ,		*__SCREAMING_SNAKE_CASE     ,		**__SCREAMING_SNAKE_CASE)

           # Add a complement `no_*` argument for a boolean field AFTER the initial field has already been added.
           # Order is important for arguments with the same destination!
           # We use a copy of earlier kwargs because the original kwargs have changed a lot before reaching down
           # here and we do not need those changes/additional keys.
           if field.default is True and (field.type is bool or field.type == Optional[bool]):
               __a						       =				False
               parser.add_argument(F'--no_{field.name}'     ,		action='''store_false'''     ,		dest=field.name     ,		**__SCREAMING_SNAKE_CASE)



       def 		_lowerCamelCase			(		self							:     int     ,		__SCREAMING_SNAKE_CASE							:     DataClassType):


           '''simple docstring'''

           if hasattr(__SCREAMING_SNAKE_CASE     ,		'''_argument_group_name'''):
               __a						       =				self.add_argument_group(dtype._argument_group_name)
           else:
               __a						       =				self

           try:
               __a						       =				get_type_hints(__SCREAMING_SNAKE_CASE)
           except NameError:
               raise RuntimeError(
                   F'Type resolution failed for {dtype}. Try declaring the class in global scope or '
                   '''removing line of `from __future__ import annotations` which opts in Postponed '''
                   '''Evaluation of Annotations (PEP 563)''')
           except TypeError as ex:
               # Remove this block when we drop Python 3.9 support
               if sys.version_info[:2] < (3, 10) and "unsupported operand type(s) for |" in str(__SCREAMING_SNAKE_CASE):
                   __a						       =				'''.'''.join(map(__SCREAMING_SNAKE_CASE     ,		sys.version_info[:3]))
                   raise RuntimeError(
                       F'Type resolution failed for {dtype} on Python {python_version}. Try removing '
                       '''line of `from __future__ import annotations` which opts in union types as '''
                       '''`X | Y` (PEP 604) via Postponed Evaluation of Annotations (PEP 563). To '''
                       '''support Python versions that lower than 3.10, you need to use '''
                       '''`typing.Union[X, Y]` instead of `X | Y` and `typing.Optional[X]` instead of '''
                       '''`X | None`.''') from ex
               raise

           for field in dataclasses.fields(__SCREAMING_SNAKE_CASE):
               if not field.init:
                   continue
               __a						       =				type_hints[field.name]
               self._parse_dataclass_field(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE)



       def 		_lowerCamelCase			(		self							:     Tuple     ,		__SCREAMING_SNAKE_CASE							:     Optional[int]=None     ,		__SCREAMING_SNAKE_CASE							:     Any=False     ,		__SCREAMING_SNAKE_CASE							:     Any=True     ,		__SCREAMING_SNAKE_CASE							:     Dict=None     ,		__SCREAMING_SNAKE_CASE							:     Optional[int]=None     ,		):


           '''simple docstring'''

           if args_file_flag or args_filename or (look_for_args_file and len(sys.argv)):
               __a						       =				[]

               if args_filename:
                   args_files.append(Path(__SCREAMING_SNAKE_CASE))
               elif look_for_args_file and len(sys.argv):
                   args_files.append(Path(sys.argv[0]).with_suffix('''.args'''))

               # args files specified via command line flag should overwrite default args files so we add them last
               if args_file_flag:
                   # Create special parser just to extract the args_file_flag values
                   __a						       =				ArgumentParser()
                   args_file_parser.add_argument(__SCREAMING_SNAKE_CASE     ,		type=__SCREAMING_SNAKE_CASE     ,		action='''append''')

                   # Use only remaining args for further parsing (remove the args_file_flag)
                   __a       ,   __a						       =				args_file_parser.parse_known_args(args=__SCREAMING_SNAKE_CASE)
                   __a						       =				vars(__SCREAMING_SNAKE_CASE).get(args_file_flag.lstrip('''-''')     ,		__SCREAMING_SNAKE_CASE)

                   if cmd_args_file_paths:
                       args_files.extend([Path(__SCREAMING_SNAKE_CASE) for p in cmd_args_file_paths])

               __a						       =				[]
               for args_file in args_files:
                   if args_file.exists():
                       file_args += args_file.read_text().split()

            # in case of duplicate arguments the last one has precedence
            # args specified via the command line should overwrite args from files, so we add them last
               __a						       =				file_args + args if args is not None else file_args + sys.argv[1:]
           __a       ,   __a						       =				self.parse_known_args(args=__SCREAMING_SNAKE_CASE)
           __a						       =				[]
           for dtype in self.dataclass_types:
               __a						       =				{f.name for f in dataclasses.fields(__SCREAMING_SNAKE_CASE) if f.init}
               __a						       =				{k: v for k, v in vars(__SCREAMING_SNAKE_CASE).items() if k in keys}
               for k in keys:
                   delattr(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE)
               __a						       =				dtype(**__SCREAMING_SNAKE_CASE)
               outputs.append(__SCREAMING_SNAKE_CASE)
           if len(namespace.__dict__) > 0:
               # additional namespace.
               outputs.append(__SCREAMING_SNAKE_CASE)
           if return_remaining_strings:
               return (*outputs, remaining_args)
           else:
               if remaining_args:
                   raise ValueError(F'Some specified arguments are not used by the HfArgumentParser: {remaining_args}')

               return (*outputs,)



       def 		_lowerCamelCase			(		self							:     int     ,		__SCREAMING_SNAKE_CASE							:     Dict[str, Any]     ,		__SCREAMING_SNAKE_CASE							:     bool = False):


           '''simple docstring'''

           __a						       =				set(args.keys())
           __a						       =				[]
           for dtype in self.dataclass_types:
               __a						       =				{f.name for f in dataclasses.fields(__SCREAMING_SNAKE_CASE) if f.init}
               __a						       =				{k: v for k, v in args.items() if k in keys}
               unused_keys.difference_update(inputs.keys())
               __a						       =				dtype(**__SCREAMING_SNAKE_CASE)
               outputs.append(__SCREAMING_SNAKE_CASE)
           if not allow_extra_keys and unused_keys:
               raise ValueError(F'Some keys are not used by the HfArgumentParser: {sorted(__SCREAMING_SNAKE_CASE)}')
           return tuple(__SCREAMING_SNAKE_CASE)



       def 		_lowerCamelCase			(		self							:     int     ,		__SCREAMING_SNAKE_CASE							:     str     ,		__SCREAMING_SNAKE_CASE							:     bool = False):


           '''simple docstring'''

           with open(Path(__SCREAMING_SNAKE_CASE)     ,		encoding='''utf-8''') as open_json_file:
               __a						       =				json.loads(open_json_file.read())
           __a						       =				self.parse_dict(__SCREAMING_SNAKE_CASE     ,		allow_extra_keys=__SCREAMING_SNAKE_CASE)
           return tuple(__SCREAMING_SNAKE_CASE)





       def 		_lowerCamelCase			(		self							:     Tuple     ,		__SCREAMING_SNAKE_CASE							:     str     ,		__SCREAMING_SNAKE_CASE							:     bool = False):


           '''simple docstring'''

           __a						       =				self.parse_dict(yaml.safe_load(Path(__SCREAMING_SNAKE_CASE).read_text())     ,		allow_extra_keys=__SCREAMING_SNAKE_CASE)
           return tuple(__SCREAMING_SNAKE_CASE)










from __future__ import annotations

import random

# Maximum size of the population.  Bigger could be faster but is more memory expensive.
__snake_case						:Optional[int]      		=     200
# Number of elements selected in every generation of evolution. The selection takes
# place from best to worst of that generation and must be smaller than N_POPULATION.
__snake_case						:List[str]      		=     50
# Probability that an element of a generation can mutate, changing one of its genes.
# This will guarantee that all genes will be used during evolution.
__snake_case						:List[Any]      		=     0.4
# Just a seed to improve randomness required by the algorithm.
random.seed(random.randint(0, 1000))





def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase				):
    __a						       =				len([g for position, g in enumerate(_UpperCAmelCase				) if g == main_target[position]]				)
    return (item, float(_UpperCAmelCase				))





def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase				):
    __a						       =				random.randint(0   , len(_UpperCAmelCase				) - 1				)
    __a						       =				parent_a[:random_slice] + parent_a[random_slice:]
    __a						       =				parent_a[:random_slice] + parent_a[random_slice:]
    return (child_a, child_a)





def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase				):
    __a						       =				list(_UpperCAmelCase				)
    if random.uniform(0   , 1				) < MUTATION_PROBABILITY:
        __a						       =				random.choice(_UpperCAmelCase				)
    return "".join(_UpperCAmelCase				)





def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase   , _UpperCAmelCase   , ):
    __a						       =				[]
    # Generate more children proportionally to the fitness score.
    __a						       =				int(parent_a[1] * 100				) + 1
    __a						       =				10 if child_n >= 10 else child_n
    for _ in range(_UpperCAmelCase				):
        __a						       =				population_score[random.randint(0   , _UpperCAmelCase				)][0]

        __a       ,   __a						       =				crossover(parent_a[0]   , _UpperCAmelCase				)
        # Append new string to the population list.
        pop.append(mutate(_UpperCAmelCase   , _UpperCAmelCase				)				)
        pop.append(mutate(_UpperCAmelCase   , _UpperCAmelCase				)				)
    return pop





def      __snake_case	(			_UpperCAmelCase   , _UpperCAmelCase   , _UpperCAmelCase = True				):

    # Verify if N_POPULATION is bigger than N_SELECTED
    if N_POPULATION < N_SELECTED:
        __a						       =				f'{N_POPULATION} must be bigger than {N_SELECTED}'
        raise ValueError(_UpperCAmelCase				)
    # Verify that the target contains no genes besides the ones inside genes variable.
    __a						       =				sorted({c for c in target if c not in genes}				)
    if not_in_genes_list:
        __a						       =				f'{not_in_genes_list} is not in genes list, evolution cannot converge'
        raise ValueError(_UpperCAmelCase				)

    # Generate random starting population.
    __a						       =				[]
    for _ in range(_UpperCAmelCase				):
        population.append(''''''.join([random.choice(_UpperCAmelCase				) for i in range(len(_UpperCAmelCase				)				)]				)				)

    # Just some logs to know what the algorithms is doing.
    __a       ,   __a						       =				0, 0

    # This loop will end when we find a perfect match for our target.
    while True:
        generation += 1
        total_population += len(_UpperCAmelCase				)

        # Random population created. Now it's time to evaluate.

        # Adding a bit of concurrency can make everything faster,
        #
        # import concurrent.futures
        # population_score: list[tuple[str, float]] = []
        # with concurrent.futures.ThreadPoolExecutor(
        #                                   max_workers=NUM_WORKERS) as executor:
        #     futures = {executor.submit(evaluate, item) for item in population}
        #     concurrent.futures.wait(futures)
        #     population_score = [item.result() for item in futures]
        #
        # but with a simple algorithm like this, it will probably be slower.
        # We just need to call evaluate for every item inside the population.
        __a						       =				[evaluate(_UpperCAmelCase   , _UpperCAmelCase				) for item in population]

        # Check if there is a matching evolution.
        __a						       =				sorted(_UpperCAmelCase   , key=lambda _UpperCAmelCase				: x[1]   , reverse=_UpperCAmelCase				)
        if population_score[0][0] == target:
            return (generation, total_population, population_score[0][0])

        # Print the best result every 10 generation.
        # Just to know that the algorithm is working.
        if debug and generation % 10 == 0:
            print(
                f'\nGeneration: {generation}'
                f'\nTotal Population:{total_population}'
                f'\nBest score: {population_score[0][1]}'
                f'\nBest string: {population_score[0][0]}'				)

        # Flush the old population, keeping some of the best evolutions.
        # Keeping this avoid regression of evolution.
        __a						       =				population[: int(N_POPULATION / 3				)]
        population.clear()
        population.extend(_UpperCAmelCase				)
        # Normalize population score to be between 0 and 1.
        __a						       =				[
            (item, score / len(_UpperCAmelCase				)) for item, score in population_score
        ]

        # This is selection
        for i in range(_UpperCAmelCase				):
            population.extend(select(population_score[int(_UpperCAmelCase				)]   , _UpperCAmelCase   , _UpperCAmelCase				)				)
            # Check if the population has already reached the maximum value and if so,
            # break the cycle.  If this check is disabled, the algorithm will take
            # forever to compute large strings, but will also calculate small strings in
            # a far fewer generations.
            if len(_UpperCAmelCase				) > N_POPULATION:
                break


if __name__ == "__main__":
 __snake_case						:Optional[int]      		=     (
     '''This is a genetic algorithm to evaluate, combine, evolve, and mutate a string!'''
 )
 __snake_case						:List[Any]      		=     list(
     ''' ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklm'''
     '''nopqrstuvwxyz.,;!?+-*#@^\'èéòà€ù=)(&%$£/\\'''
 )
 __snake_case		,__snake_case		,__snake_case						:Dict      		=     basic(target_str, genes_list)
 print(
     f'\nGeneration: {generation}\nTotal Population: {population}\nTarget: {target}'
 )





