




'''simple docstring'''



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






class 							_a				(			SCREAMING_SNAKE_CASE ):





       '''simple docstring'''






       def __init__(      self  ):







             '''simple docstring'''







             self.test()







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						0
             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						False
             while not completed:
                   if counter == 1:
                         self.reset()
                   SCREAMING_SNAKE_CASE   :      str    					=						self.advance()
                   if not self.does_advance(A  ):
                         raise Exception(
                             'Custom Constraint is not defined correctly. self.does_advance(self.advance()) must be true.'  )

                   SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						self.update(A  )
                   counter += 1

                   if counter > 10_000:
                         raise Exception('update() does not fulfill the constraint.'  )

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







       @abstractmethod
       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







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







       @abstractmethod
       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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







       @abstractmethod
       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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







       @abstractmethod
       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







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







       @abstractmethod
       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







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







       @abstractmethod
       def        UpperCamelCase_							(      self,							A=False  ):







             '''simple docstring'''







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






class 							_a				(			SCREAMING_SNAKE_CASE ):





       '''simple docstring'''






       def __init__(      self,							A  ):







             '''simple docstring'''







             super(A,							self  ).__init__()

             if not isinstance(A,							A  ) or len(A  ) == 0:
                   raise ValueError(F"`token_ids` has to be a non-empty list, but is {token_ids}."  )
             if any((not isinstance(A,							A  ) 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}."  )

             SCREAMING_SNAKE_CASE   :      Tuple    					=						token_ids

             SCREAMING_SNAKE_CASE   :      Tuple    					=						len(self.token_ids  )
             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						-1  # the index of the currently fulfilled step
             SCREAMING_SNAKE_CASE   :      Any    					=						False







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







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







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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

             if self.completed:
                   return False

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







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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

             SCREAMING_SNAKE_CASE   :      Dict    					=						False
             SCREAMING_SNAKE_CASE   :      str    					=						False
             SCREAMING_SNAKE_CASE   :      int    					=						False

             if self.does_advance(A  ):
                   self.fulfilled_idx += 1
                   SCREAMING_SNAKE_CASE   :      int    					=						True
                   if self.fulfilled_idx == (self.seqlen - 1):
                         SCREAMING_SNAKE_CASE   :      Optional[int]    					=						True
                   SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						completed
             else:
                   # failed to make progress.
                   SCREAMING_SNAKE_CASE   :      int    					=						True
                   self.reset()
             return stepped, completed, reset







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						False
             SCREAMING_SNAKE_CASE   :      Dict    					=						0







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







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







       def        UpperCamelCase_							(      self,							A=False  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      str    					=						PhrasalConstraint(self.token_ids  )

             if stateful:
                   SCREAMING_SNAKE_CASE   :      str    					=						self.seqlen
                   SCREAMING_SNAKE_CASE   :      List[Any]    					=						self.fulfilled_idx
                   SCREAMING_SNAKE_CASE   :      List[Any]    					=						self.completed

             return new_constraint






class 							_a				:





       '''simple docstring'''






       def __init__(      self,							A,							A=True  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      Any    					=						max([len(A  ) for one in nested_token_ids]  )

             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						{}
             for token_ids in nested_token_ids:
                   SCREAMING_SNAKE_CASE   :      Dict    					=						root
                   for tidx, token_id in enumerate(A  ):
                         if token_id not in level:
                               SCREAMING_SNAKE_CASE   :      Dict    					=						{}

                         SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						level[token_id]

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

             SCREAMING_SNAKE_CASE   :      Any    					=						root







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[Any]    					=						self.trie

             for current_token in current_seq:
                   SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						start[current_token]

             SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						list(start.keys()  )

             return next_tokens







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[str]    					=						self.next_tokens(A  )

             return len(A  ) == 0







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[Any]    					=						list(root.values()  )
             if len(A  ) == 0:
                   return 1
             else:
                   return sum([self.count_leaves(A  ) for nn in next_nodes]  )







       def        UpperCamelCase_							(      self,							A,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      str    					=						self.count_leaves(A  )
             return len(A  ) != leaf_count






class 							_a				(			SCREAMING_SNAKE_CASE ):





       '''simple docstring'''






       def __init__(      self,							A  ):







             '''simple docstring'''







             super(A,							self  ).__init__()

             if not isinstance(A,							A  ) or len(A  ) == 0:
                   raise ValueError(F"`nested_token_ids` has to be a non-empty list, but is {nested_token_ids}."  )
             if any(not isinstance(A,							A  ) 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(A,							A  ) 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}."  )

             SCREAMING_SNAKE_CASE   :      Dict    					=						DisjunctiveTrie(A  )
             SCREAMING_SNAKE_CASE   :      int    					=						nested_token_ids

             SCREAMING_SNAKE_CASE   :      int    					=						self.trie.max_height
             SCREAMING_SNAKE_CASE   :      str    					=						[]
             SCREAMING_SNAKE_CASE   :      List[str]    					=						False







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      str    					=						self.trie.next_tokens(self.current_seq  )

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







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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

             SCREAMING_SNAKE_CASE   :      List[str]    					=						self.trie.next_tokens(self.current_seq  )

             return token_id in next_tokens







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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

             SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						False
             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						False
             SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						False

             if self.does_advance(A  ):
                   self.current_seq.append(A  )
                   SCREAMING_SNAKE_CASE   :      Tuple    					=						True
             else:
                   SCREAMING_SNAKE_CASE   :      Dict    					=						True
                   self.reset()

             SCREAMING_SNAKE_CASE   :      int    					=						self.trie.reached_leaf(self.current_seq  )
             SCREAMING_SNAKE_CASE   :      List[str]    					=						completed

             return stepped, completed, reset







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[str]    					=						False
             SCREAMING_SNAKE_CASE   :      Optional[int]    					=						[]







       def        UpperCamelCase_							(      self  ):







             '''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,							A=False  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      str    					=						DisjunctiveConstraint(self.token_ids  )

             if stateful:
                   SCREAMING_SNAKE_CASE   :      Tuple    					=						self.seqlen
                   SCREAMING_SNAKE_CASE   :      Dict    					=						self.current_seq
                   SCREAMING_SNAKE_CASE   :      str    					=						self.completed

             return new_constraint






class 							_a				:





       '''simple docstring'''






       def __init__(      self,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      str    					=						constraints

             # max # of steps required to fulfill a given constraint
             SCREAMING_SNAKE_CASE   :      List[str]    					=						max([c.seqlen for c in constraints]  )
             SCREAMING_SNAKE_CASE   :      str    					=						len(A  )
             SCREAMING_SNAKE_CASE   :      Any    					=						False

             self.init_state()







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[Any]    					=						[]
             SCREAMING_SNAKE_CASE   :      Any    					=						None
             SCREAMING_SNAKE_CASE   :      str    					=						[constraint.copy(stateful=A  ) for constraint in self.constraints]







       def        UpperCamelCase_							(      self  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[Any]    					=						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  ):







             '''simple docstring'''







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

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







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







             self.init_state()

             if token_ids is not None:
                   for token in token_ids:
                         # completes or steps **one** constraint
                         SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						self.add(A  )

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







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







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

             SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      List[Any]    					=						False, False

             if self.completed:
                   SCREAMING_SNAKE_CASE   :      Tuple    					=						True
                   SCREAMING_SNAKE_CASE   :      Dict    					=						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

                   SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      Optional[int]    					=						self.inprogress_constraint.update(A  )
                   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=A  )  )
                         SCREAMING_SNAKE_CASE   :      Dict    					=						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  )
                         SCREAMING_SNAKE_CASE   :      Any    					=						None

                         if len(self.pending_constraints  ) == 0:
                               # we're done!
                               SCREAMING_SNAKE_CASE   :      Optional[int]    					=						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(A  ):
                               SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      Dict    					=						pending_constraint.update(A  )

                               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(A  )
                                     SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						None

                               if not complete and stepped:
                                     SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						pending_constraint

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

                                     SCREAMING_SNAKE_CASE   :      Any    					=						(
                                         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.

                                           SCREAMING_SNAKE_CASE   :      Dict    					=						True

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

             return complete, stepped







       def        UpperCamelCase_							(      self,							A=True  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      List[str]    					=						ConstraintListState(self.constraints  )  # we actually never though self.constraints objects
             # throughout this process. So it's at initialization state.

             if stateful:
                   SCREAMING_SNAKE_CASE   :      int    					=						[
                       constraint.copy(stateful=A  ) for constraint in self.complete_constraints
                   ]
                   if self.inprogress_constraint is not None:
                         SCREAMING_SNAKE_CASE   :      List[str]    					=						self.inprogress_constraint.copy(stateful=A  )
                   SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						[constraint.copy() for constraint in self.pending_constraints]

             return new_state










'''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
__lowerCAmelCase									=   object()

# For specifying empty leaf dict `{}`
__lowerCAmelCase									=   object()





def 		_UpperCAmelCase (				__A				: List[str]    ,		__A				: Tuple   ):
				a_		:	List[Any]									=   tuple((re.compile(x + '''$'''   ) for x in qs)   )
				for i in range(len(__A   ) - len(__A   ) + 1   ):
								a_		:	Union[str, Any]									=   [x.match(__A   ) for x, y in zip(__A    ,		ks[i:]   )]
								if matches and all(__A   ):
												return True
				return False





def 		_UpperCAmelCase (				__A				: List[str]   ):
				def replace(__A				: int    ,		__A				: Union[str, Any]   ):
								for rule, replacement in rules:
												if _match(__A    ,		__A   ):
																return replacement
								return val

				return replace





def 		_UpperCAmelCase (				):
				return [
				    # embeddings
				    (("transformer", "wpe", "embedding"), P('''mp'''    ,		__A   )),
				    (("transformer", "wte", "embedding"), P('''mp'''    ,		__A   )),
				    # atention
				    (("attention", "(q_proj|k_proj|v_proj)", "kernel"), P(__A    ,		'''mp'''   )),
				    (("attention", "out_proj", "kernel"), P('''mp'''    ,		__A   )),
				    (("attention", "out_proj", "bias"), None),
				    # mlp
				    (("mlp", "c_fc", "kernel"), P(__A    ,		'''mp'''   )),
				    (("mlp", "c_fc", "bias"), P('''mp'''   )),
				    (("mlp", "c_proj", "kernel"), P('''mp'''    ,		__A   )),
				    (("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 (				__A				: Union[str, Any]   ):
				a_		:	Tuple									=   _get_partition_rules()
				a_		:	Tuple									=   _replacement_rules(__A   )
				a_		:	Optional[Any]									=   {k: _unmatched for k in flatten_dict(__A   )}
				a_		:	Optional[Any]									=   {k: replace(__A    ,		__A   ) for k, v in initd.items()}
				assert _unmatched not in result.values(), "Incomplete partition spec."
				return freeze(unflatten_dict(__A   )   )




