



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

class     _A       (	__UpperCAmelCase    ):



       def __init__(		self							:     Optional[int]):


           '''simple docstring'''

           self.test()



       def 		_lowerCamelCase			(		self							:     int):


           '''simple docstring'''

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

               __a       ,   __a       ,   __a						       =				self.update(__SCREAMING_SNAKE_CASE)
               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 		_lowerCamelCase			(		self							:     Tuple):


           '''simple docstring'''

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



       @abstractmethod
       def 		_lowerCamelCase			(		self							:     List[str]     ,		__SCREAMING_SNAKE_CASE							:     int):


           '''simple docstring'''

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



       @abstractmethod
       def 		_lowerCamelCase			(		self							:     Any     ,		__SCREAMING_SNAKE_CASE							:     int):


           '''simple docstring'''

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



       @abstractmethod
       def 		_lowerCamelCase			(		self							:     Dict):


           '''simple docstring'''

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



       @abstractmethod
       def 		_lowerCamelCase			(		self							:     Optional[Any]):


           '''simple docstring'''

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





       @abstractmethod
       def 		_lowerCamelCase			(		self							:     Optional[int]     ,		__SCREAMING_SNAKE_CASE							:     Union[str, Any]=False):


           '''simple docstring'''

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


class     _A       (	__UpperCAmelCase    ):



       def __init__(		self							:     List[Any]     ,		__SCREAMING_SNAKE_CASE							:     List[int]):


           '''simple docstring'''

           super(__SCREAMING_SNAKE_CASE     ,		self).__init__()

           if not isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE) or len(__SCREAMING_SNAKE_CASE) == 0:
               raise ValueError(F'`token_ids` has to be a non-empty list, but is {token_ids}.')
           if any((not isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE) 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 		_lowerCamelCase			(		self							:     Union[str, Any]):


           '''simple docstring'''

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



       def 		_lowerCamelCase			(		self							:     List[Any]     ,		__SCREAMING_SNAKE_CASE							:     int):


           '''simple docstring'''

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

           if self.completed:
               return False

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



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


           '''simple docstring'''

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

           __a						       =				False
           __a						       =				False
           __a						       =				False

           if self.does_advance(__SCREAMING_SNAKE_CASE):
               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 		_lowerCamelCase			(		self							:     List[str]):


           '''simple docstring'''

           __a						       =				False
           __a						       =				0



       def 		_lowerCamelCase			(		self							:     str):


           '''simple docstring'''

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





       def 		_lowerCamelCase			(		self							:     List[str]     ,		__SCREAMING_SNAKE_CASE							:     Any=False):


           '''simple docstring'''

           __a						       =				PhrasalConstraint(self.token_ids)

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

           return new_constraint


class     _A       :



       def __init__(		self							:     int     ,		__SCREAMING_SNAKE_CASE							:     List[List[int]]     ,		__SCREAMING_SNAKE_CASE							:     Dict=True):


           '''simple docstring'''

           __a						       =				max([len(__SCREAMING_SNAKE_CASE) for one in nested_token_ids])

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

                   __a						       =				level[token_id]

           if no_subsets and self.has_subsets(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
               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 		_lowerCamelCase			(		self							:     List[Any]     ,		__SCREAMING_SNAKE_CASE							:     Any):


           '''simple docstring'''

           __a						       =				self.trie

           for current_token in current_seq:
               __a						       =				start[current_token]

           __a						       =				list(start.keys())

           return next_tokens



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


           '''simple docstring'''

           __a						       =				self.next_tokens(__SCREAMING_SNAKE_CASE)

           return len(__SCREAMING_SNAKE_CASE) == 0



       def 		_lowerCamelCase			(		self							:     List[str]     ,		__SCREAMING_SNAKE_CASE							:     List[Any]):


           '''simple docstring'''

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





       def 		_lowerCamelCase			(		self							:     Any     ,		__SCREAMING_SNAKE_CASE							:     List[str]     ,		__SCREAMING_SNAKE_CASE							:     Any):


           '''simple docstring'''

           __a						       =				self.count_leaves(__SCREAMING_SNAKE_CASE)
           return len(__SCREAMING_SNAKE_CASE) != leaf_count


class     _A       (	__UpperCAmelCase    ):



       def __init__(		self							:     Tuple     ,		__SCREAMING_SNAKE_CASE							:     List[List[int]]):


           '''simple docstring'''

           super(__SCREAMING_SNAKE_CASE     ,		self).__init__()

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

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



       def 		_lowerCamelCase			(		self							:     Optional[Any]):


           '''simple docstring'''

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

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



       def 		_lowerCamelCase			(		self							:     Optional[int]     ,		__SCREAMING_SNAKE_CASE							:     int):


           '''simple docstring'''

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

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

           return token_id in next_tokens



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


           '''simple docstring'''

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

           __a						       =				False
           __a						       =				False
           __a						       =				False

           if self.does_advance(__SCREAMING_SNAKE_CASE):
               self.current_seq.append(__SCREAMING_SNAKE_CASE)
               __a						       =				True
           else:
               __a						       =				True
               self.reset()

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

           return stepped, completed, reset



       def 		_lowerCamelCase			(		self							:     Optional[int]):


           '''simple docstring'''

           __a						       =				False
           __a						       =				[]



       def 		_lowerCamelCase			(		self							:     Union[str, 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 		_lowerCamelCase			(		self							:     List[Any]     ,		__SCREAMING_SNAKE_CASE							:     str=False):


           '''simple docstring'''

           __a						       =				DisjunctiveConstraint(self.token_ids)

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

           return new_constraint


class     _A       :



       def __init__(		self							:     Tuple     ,		__SCREAMING_SNAKE_CASE							:     List[Constraint]):


           '''simple docstring'''

           __a						       =				constraints

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

           self.init_state()



       def 		_lowerCamelCase			(		self							:     List[Any]):


           '''simple docstring'''

           __a						       =				[]
           __a						       =				None
           __a						       =				[constraint.copy(stateful=__SCREAMING_SNAKE_CASE) for constraint in self.constraints]



       def 		_lowerCamelCase			(		self							:     List[str]):


           '''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 		_lowerCamelCase			(		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(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
                       token_list.append(__SCREAMING_SNAKE_CASE)
                   elif isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
                       token_list.extend(__SCREAMING_SNAKE_CASE)
           else:
               __a						       =				self.inprogress_constraint.advance()
               if isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
                   token_list.append(__SCREAMING_SNAKE_CASE)
               elif isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
                   token_list.extend(__SCREAMING_SNAKE_CASE)

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



       def 		_lowerCamelCase			(		self							:     int     ,		__SCREAMING_SNAKE_CASE							:     Optional[List[int]]):


           '''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(__SCREAMING_SNAKE_CASE)

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



       def 		_lowerCamelCase			(		self							:     Optional[int]     ,		__SCREAMING_SNAKE_CASE							:     int):


           '''simple docstring'''

           if not isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE):
               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(__SCREAMING_SNAKE_CASE)
               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=__SCREAMING_SNAKE_CASE))
                   __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(__SCREAMING_SNAKE_CASE):
                       __a       ,   __a       ,   __a						       =				pending_constraint.update(__SCREAMING_SNAKE_CASE)

                       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(__SCREAMING_SNAKE_CASE)
                           __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 		_lowerCamelCase			(		self							:     List[str]     ,		__SCREAMING_SNAKE_CASE							:     int=True):


           '''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=__SCREAMING_SNAKE_CASE) for constraint in self.complete_constraints
               ]
               if self.inprogress_constraint is not None:
                   __a						       =				self.inprogress_constraint.copy(stateful=__SCREAMING_SNAKE_CASE)
               __a						       =				[constraint.copy() for constraint in self.pending_constraints]

           return new_state










from typing import Optional

from .. import Features, NamedSplit
from ..packaged_modules.text.text import Text
from ..utils.typing import NestedDataStructureLike, PathLike
from .abc import AbstractDatasetReader

class     _A       (	__UpperCAmelCase    ):



       def __init__(		self							:     Optional[int]     ,		__SCREAMING_SNAKE_CASE							:     NestedDataStructureLike[PathLike]     ,		__SCREAMING_SNAKE_CASE							:     Optional[NamedSplit] = None     ,		__SCREAMING_SNAKE_CASE							:     Optional[Features] = None     ,		__SCREAMING_SNAKE_CASE							:     str = None     ,		__SCREAMING_SNAKE_CASE							:     bool = False     ,		__SCREAMING_SNAKE_CASE							:     bool = False     ,		__SCREAMING_SNAKE_CASE							:     Optional[int] = None     ,		**__SCREAMING_SNAKE_CASE							:     List[str]     ,		):


           '''simple docstring'''

           super().__init__(
               __SCREAMING_SNAKE_CASE     ,		split=__SCREAMING_SNAKE_CASE     ,		features=__SCREAMING_SNAKE_CASE     ,		cache_dir=__SCREAMING_SNAKE_CASE     ,		keep_in_memory=__SCREAMING_SNAKE_CASE     ,		streaming=__SCREAMING_SNAKE_CASE     ,		num_proc=__SCREAMING_SNAKE_CASE     ,		**__SCREAMING_SNAKE_CASE     ,		)
           __a						       =				path_or_paths if isinstance(__SCREAMING_SNAKE_CASE     ,		__SCREAMING_SNAKE_CASE) else {self.split: path_or_paths}
           __a						       =				Text(
               cache_dir=__SCREAMING_SNAKE_CASE     ,		data_files=__SCREAMING_SNAKE_CASE     ,		features=__SCREAMING_SNAKE_CASE     ,		**__SCREAMING_SNAKE_CASE     ,		)





       def 		_lowerCamelCase			(		self							:     List[str]):


           '''simple docstring'''

           if self.streaming:
               __a						       =				self.builder.as_streaming_dataset(split=self.split)
           # Build regular (map-style) dataset
           else:
               __a						       =				None
               __a						       =				None
               __a						       =				None
               __a						       =				None

               self.builder.download_and_prepare(
                   download_config=__SCREAMING_SNAKE_CASE     ,		download_mode=__SCREAMING_SNAKE_CASE     ,		verification_mode=__SCREAMING_SNAKE_CASE     ,		base_path=__SCREAMING_SNAKE_CASE     ,		num_proc=self.num_proc     ,		)
               __a						       =				self.builder.as_dataset(
                   split=self.split     ,		verification_mode=__SCREAMING_SNAKE_CASE     ,		in_memory=self.keep_in_memory)
           return dataset





