"""simple docstring"""



from ...processing_utils import ProcessorMixin






class 				snake_case__     (   snake_case_   ):
 _snake_case   :			List[str]           =		"""WhisperFeatureExtractor"""
 _snake_case   :			Any           =		"""WhisperTokenizer"""


 def __init__(				self  ,						lowerCamelCase  ,						lowerCamelCase		):
        super().__init__(lowerCamelCase  ,						lowerCamelCase		)
        __a     				=  self.feature_extractor
        __a     				=  False


 def 		a__ (				self  ,						lowerCamelCase=None  ,						lowerCamelCase=None  ,						lowerCamelCase=True		):
        return self.tokenizer.get_decoder_prompt_ids(task=lowerCamelCase  ,						language=lowerCamelCase  ,						no_timestamps=lowerCamelCase		)


 def __call__(				self  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        # For backward compatibility
        if self._in_target_context_manager:
               return self.current_processor(*lowerCamelCase  ,						**lowerCamelCase		)

        __a     				=  kwargs.pop("audio"  ,						lowerCamelCase		)
        __a     				=  kwargs.pop("sampling_rate"  ,						lowerCamelCase		)
        __a     				=  kwargs.pop("text"  ,						lowerCamelCase		)
        if len(lowerCamelCase		) > 0:
               __a     				=  args[0]
               __a     				=  args[1:]

        if audio is None and text is None:
               raise ValueError("You need to specify either an `audio` or `text` input to process."		)

        if audio is not None:
               __a     				=  self.feature_extractor(lowerCamelCase  ,						*lowerCamelCase  ,						sampling_rate=lowerCamelCase  ,						**lowerCamelCase		)
        if text is not None:
               __a     				=  self.tokenizer(lowerCamelCase  ,						**lowerCamelCase		)

        if text is None:
               return inputs

        elif audio is None:
               return encodings
        else:
               __a     				=  encodings["input_ids"]
               return inputs


 def 		a__ (				self  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        return self.tokenizer.batch_decode(*lowerCamelCase  ,						**lowerCamelCase		)


 def 		a__ (				self  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        return self.tokenizer.decode(*lowerCamelCase  ,						**lowerCamelCase		)






 def 		a__ (				self  ,						lowerCamelCase  ,						lowerCamelCase="np"		):
        return self.tokenizer.get_prompt_ids(lowerCamelCase  ,						return_tensors=lowerCamelCase		)

"""simple docstring"""



from __future__ import annotations



def 					_lowerCamelCase(					a ,  a ,  a ,  a ,  a ,  ):
       __a     				=  len(a							)

       # If row is equal to the size of the board it means there are a queen in each row in
       # the current board (possible_board)
       if row == n:
              # We convert the variable possible_board that looks like this: [1, 3, 0, 2] to
              # this: ['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
              boards.append([". " * i + "Q " + ". " * (n - 1 - i) for i in possible_board]							)
              return

       # We iterate each column in the row to find all possible results in each row
       for col in range(a							):
              # We apply that we learned previously. First we check that in the current board
              # (possible_board) there are not other same value because if there is it means
              # that there are a collision in vertical. Then we apply the two formulas we
              # learned before:
              #
              # 45º: y - x = b or 45: row - col = b
              # 135º: y + x = b or row + col = b.
              #
              # And we verify if the results of this two formulas not exist in their variables
              # respectively.  (diagonal_right_collisions, diagonal_left_collisions)
              #
              # If any or these are True it means there is a collision so we continue to the
              # next value in the for loop.
              if (
                  col in possible_board
                  or row - col in diagonal_right_collisions
                  or row + col in diagonal_left_collisions
              ):
                     continue

              # If it is False we call dfs function again and we update the inputs
              depth_first_search(
                  [*possible_board, col] ,  [*diagonal_right_collisions, row - col] ,  [*diagonal_left_collisions, row + col] ,  a ,  a ,  )



def 					_lowerCamelCase(					a							):
       __a     				=  []
       depth_first_search([] ,  [] ,  [] ,  a ,  a							)

       # Print all the boards
       for board in boards:
              for column in board:
                     print(a							)
              print(""							)

       print(len(a							) ,  "solutions were found."							)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   n_queens_solution(4)
