






'''simple docstring'''



import re

from flax.core.frozen_dict import freeze
from flax.traverse_util import flatten_dict, unflatten_dict
from jax.experimental import PartitionSpec as P


# Sentinels
__UpperCamelCase   :							Any         =   object()

# For specifying empty leaf dict `{}`
__UpperCamelCase   :							int         =   object()



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						Tuple,       SCREAMING_SNAKE_CASE__:						List[str]     )	->      Dict:

   """simple docstring"""
   __a					  =     tuple((re.compile(x + '$'     ) for x in qs)     )
   for i in range(len(SCREAMING_SNAKE_CASE__     ) - len(SCREAMING_SNAKE_CASE__     ) + 1     ):
      __a					  =     [x.match(SCREAMING_SNAKE_CASE__     ) for x, y in zip(SCREAMING_SNAKE_CASE__,       ks[i:]     )]
      if matches and all(SCREAMING_SNAKE_CASE__     ):
         return True
   return False



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						Dict     )	->      Union[str, Any]:

   """simple docstring"""
   def replace(SCREAMING_SNAKE_CASE__:						List[Any],       SCREAMING_SNAKE_CASE__:						Dict     ):
      for rule, replacement in rules:
         if _match(SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__     ):
            return replacement
      return val

   return replace



def  __UpperCAmelCase						(					)	->      str:

   """simple docstring"""
   return [
       # embeddings
       (("transformer", "wpe", "embedding"), P('mp',       SCREAMING_SNAKE_CASE__     )),
       (("transformer", "wte", "embedding"), P('mp',       SCREAMING_SNAKE_CASE__     )),
       # atention
       (("attention", "(q_proj|k_proj|v_proj)", "kernel"), P(SCREAMING_SNAKE_CASE__,       'mp'     )),
       (("attention", "out_proj", "kernel"), P('mp',       SCREAMING_SNAKE_CASE__     )),
       (("attention", "out_proj", "bias"), None),
       # mlp
       (("mlp", "c_fc", "kernel"), P(SCREAMING_SNAKE_CASE__,       'mp'     )),
       (("mlp", "c_fc", "bias"), P('mp'     )),
       (("mlp", "c_proj", "kernel"), P('mp',       SCREAMING_SNAKE_CASE__     )),
       (("mlp", "c_proj", "bias"), None),
       # layer norms
       ((r"ln_\d+", "bias"), None),
       ((r"\d+", r"ln_\d+", "scale"), None),
       (("ln_f", "bias"), None),
       (("ln_f", "scale"), None),
   ]



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						List[Any]     )	->      Optional[int]:

   """simple docstring"""
   __a					  =     _get_partition_rules()
   __a					  =     _replacement_rules(SCREAMING_SNAKE_CASE__     )
   __a					  =     {k: _unmatched for k in flatten_dict(SCREAMING_SNAKE_CASE__     )}
   __a					  =     {k: replace(SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__     ) for k, v in initd.items()}
   assert _unmatched not in result.values(), "Incomplete partition spec."
   return freeze(unflatten_dict(SCREAMING_SNAKE_CASE__     )     )







'''simple docstring'''



from multiprocessing import Lock, Pipe, Process

# lock used to ensure that two processes do not access a pipe at the same time
__UpperCamelCase   :							Optional[int]         =   Lock()



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						Tuple,       SCREAMING_SNAKE_CASE__:						Any,       SCREAMING_SNAKE_CASE__:						Tuple,       SCREAMING_SNAKE_CASE__:						str,       SCREAMING_SNAKE_CASE__:						Optional[Any],       SCREAMING_SNAKE_CASE__:						Any,       SCREAMING_SNAKE_CASE__:						List[Any]     )	->      int:

   """simple docstring"""
   global process_lock

   # we perform n swaps since after n swaps we know we are sorted
   # we *could* stop early if we are sorted already, but it takes as long to
   # find out we are sorted as it does to sort the list with this algorithm
   for i in range(0,       10     ):
      if (i + position) % 2 == 0 and r_send is not None:
         # send your value to your right neighbor
         process_lock.acquire()
         r_send[1].send(SCREAMING_SNAKE_CASE__     )
         process_lock.release()

         # receive your right neighbor's value
         process_lock.acquire()
         __a					  =     rr_cv[0].recv()
         process_lock.release()

         # take the lower value since you are on the left
         __a					  =     min(SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__     )
      elif (i + position) % 2 != 0 and l_send is not None:
         # send your value to your left neighbor
         process_lock.acquire()
         l_send[1].send(SCREAMING_SNAKE_CASE__     )
         process_lock.release()

         # receive your left neighbor's value
         process_lock.acquire()
         __a					  =     lr_cv[0].recv()
         process_lock.release()

         # take the higher value since you are on the right
         __a					  =     max(SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__     )
    # after all swaps are performed, send the values back to main
   result_pipe[1].send(SCREAMING_SNAKE_CASE__     )



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						Tuple     )	->      Optional[Any]:

   """simple docstring"""
   __a					  =     []
   __a					  =     []
   # initialize the list of pipes where the values will be retrieved
   for _ in arr:
      result_pipe.append(Pipe()     )
   # creates the processes
   # the first and last process only have one neighbor so they are made outside
   # of the loop
   __a					  =     Pipe()
   __a					  =     Pipe()
   process_array_.append(
       Process(
           target=SCREAMING_SNAKE_CASE__,       args=(0, arr[0], None, temp_rs, None, temp_rr, result_pipe[0]),       )     )
   __a					  =     temp_rs
   __a					  =     temp_rr

   for i in range(1,       len(SCREAMING_SNAKE_CASE__     ) - 1     ):
      __a					  =     Pipe()
      __a					  =     Pipe()
      process_array_.append(
          Process(
              target=SCREAMING_SNAKE_CASE__,       args=(i, arr[i], temp_ls, temp_rs, temp_lr, temp_rr, result_pipe[i]),       )     )
      __a					  =     temp_rs
      __a					  =     temp_rr

   process_array_.append(
       Process(
           target=SCREAMING_SNAKE_CASE__,       args=(
               len(SCREAMING_SNAKE_CASE__     ) - 1,
               arr[len(SCREAMING_SNAKE_CASE__     ) - 1],
               temp_ls,
               None,
               temp_lr,
               None,
               result_pipe[len(SCREAMING_SNAKE_CASE__     ) - 1],
           ),       )     )

   # start the processes
   for p in process_array_:
      p.start()

   # wait for the processes to end and write their values to the list
   for p in range(0,       len(SCREAMING_SNAKE_CASE__     )     ):
      __a					  =     result_pipe[p][0].recv()
      process_array_[p].join()
   return arr



def  __UpperCAmelCase						(					)	->      Any:

   """simple docstring"""
   __a					  =     list(range(10,       0,       -1     )     )
   print('Initial List'     )
   print(*SCREAMING_SNAKE_CASE__     )
   __a					  =     odd_even_transposition(SCREAMING_SNAKE_CASE__     )
   print('Sorted List\n'     )
   print(*SCREAMING_SNAKE_CASE__     )


if __name__ == "__main__":
 main()