





import argparse
from pathlib import Path

from transformers import AutoConfig, AutoTokenizer, RagConfig, RagSequenceForGeneration, RagTokenForGeneration



def _a				(	lowerCamelCase:   int					,				lowerCamelCase:   str					,				lowerCamelCase:   str					,				lowerCamelCase:   Path					,				lowerCamelCase:   str = None					,				lowerCamelCase:   str = None					,				lowerCamelCase:   str = None					,				)	->						Union[str, Any]:







      '''simple docstring'''






      if config_name_or_path is None:
            __A          =				'''facebook/rag-token-base''' if model_type == '''rag_token''' else '''facebook/rag-sequence-base'''

      if generator_tokenizer_name_or_path is None:
            __A          =				generator_name_or_path

      if question_encoder_tokenizer_name_or_path is None:
            __A          =				question_encoder_name_or_path

      __A          =				RagTokenForGeneration if model_type == '''rag_token''' else RagSequenceForGeneration

      # Save model.
      __A          =				RagConfig.from_pretrained(lowerCamelCase )
      __A          =				AutoConfig.from_pretrained(lowerCamelCase )
      __A          =				AutoConfig.from_pretrained(lowerCamelCase )

      __A          =				gen_config
      __A          =				question_encoder_config

      __A          =				model_class.from_pretrained_question_encoder_generator(
          lowerCamelCase					,				lowerCamelCase					,				config=lowerCamelCase )
      rag_model.save_pretrained(lowerCamelCase )

      # Sanity check.
      model_class.from_pretrained(lowerCamelCase )

      # Save tokenizers.
      __A          =				AutoTokenizer.from_pretrained(lowerCamelCase )
      gen_tokenizer.save_pretrained(dest_dir / '''generator_tokenizer/''' )
      __A          =				AutoTokenizer.from_pretrained(lowerCamelCase )
      question_encoder_tokenizer.save_pretrained(dest_dir / '''question_encoder_tokenizer/''' )


if __name__ == "__main__":
       snake_case__					:							int													=     argparse.ArgumentParser()
       parser.add_argument(
           '--model_type',
           choices=['rag_sequence', 'rag_token'],
           required=True,
           type=str,
           help='RAG model type: rag_sequence, rag_token',
       )
       parser.add_argument('--dest', type=str, required=True, help='Path to the output checkpoint directory.')
       parser.add_argument('--generator_name_or_path', type=str, required=True, help='Generator model identifier')
       parser.add_argument(
           '--question_encoder_name_or_path', type=str, required=True, help='Question encoder model identifier'
       )

       parser.add_argument(
           '--generator_tokenizer_name_or_path',
           type=str,
           help='Generator tokenizer identifier, if not specified, resolves to ``generator_name_or_path``',
       )
       parser.add_argument(
           '--question_encoder_tokenizer_name_or_path',
           type=str,
           help='Question encoder tokenizer identifier, if not specified, resolves to ``question_encoder_name_or_path``',
       )
       parser.add_argument(
           '--config_name_or_path',
           type=str,
           help=(
               'Identifier of the model config to use, if not provided, resolves to a base config for a given'
               ' ``model_type``'
           ),
       )

       snake_case__					:							int													=     parser.parse_args()

       snake_case__					:							Dict													=     Path(args.dest)
       dest_dir.mkdir(exist_ok=True)

       consolidate(
           args.model_type,
           args.generator_name_or_path,
           args.question_encoder_name_or_path,
           dest_dir,
           args.config_name_or_path,
           args.generator_tokenizer_name_or_path,
           args.question_encoder_tokenizer_name_or_path,
       )












import numpy as np
from PIL import Image



def _a				(	lowerCamelCase:   np.ndarray					,				lowerCamelCase:   int					,				lowerCamelCase:   int )	->						np.ndarray:







      '''simple docstring'''






      __A          =				np.array(lowerCamelCase )
      if arr.shape[0] != arr.shape[1]:
            raise ValueError('''The input array is not a square matrix''' )
      __A          =				0
      __A          =				0
      __A          =				0
      __A          =				0

      # compute the shape of the output matrix
      __A          =				(arr.shape[0] - size) // stride + 1
      # initialize the output matrix with zeros of shape maxpool_shape
      __A          =				np.zeros((maxpool_shape, maxpool_shape) )

      while i < arr.shape[0]:
            if i + size > arr.shape[0]:
                  # if the end of the matrix is reached, break
                  break
            while j < arr.shape[1]:
                  # if the end of the matrix is reached, break
                  if j + size > arr.shape[1]:
                        break
                  # compute the maximum of the pooling matrix
                  __A          =				np.max(arr[i : i + size, j : j + size] )
                  # shift the pooling matrix by stride of column pixels
                  j += stride
                  mat_j += 1

            # shift the pooling matrix by stride of row pixels
            i += stride
            mat_i += 1

            # reset the column index to 0
            __A          =				0
            __A          =				0

      return updated_arr



def _a				(	lowerCamelCase:   np.ndarray					,				lowerCamelCase:   int					,				lowerCamelCase:   int )	->						np.ndarray:







      '''simple docstring'''






      __A          =				np.array(lowerCamelCase )
      if arr.shape[0] != arr.shape[1]:
            raise ValueError('''The input array is not a square matrix''' )
      __A          =				0
      __A          =				0
      __A          =				0
      __A          =				0

      # compute the shape of the output matrix
      __A          =				(arr.shape[0] - size) // stride + 1
      # initialize the output matrix with zeros of shape avgpool_shape
      __A          =				np.zeros((avgpool_shape, avgpool_shape) )

      while i < arr.shape[0]:
            # if the end of the matrix is reached, break
            if i + size > arr.shape[0]:
                  break
            while j < arr.shape[1]:
                  # if the end of the matrix is reached, break
                  if j + size > arr.shape[1]:
                        break
                  # compute the average of the pooling matrix
                  __A          =				int(np.average(arr[i : i + size, j : j + size] ) )
                  # shift the pooling matrix by stride of column pixels
                  j += stride
                  mat_j += 1

            # shift the pooling matrix by stride of row pixels
            i += stride
            mat_i += 1
            # reset the column index to 0
            __A          =				0
            __A          =				0

      return updated_arr


# Main Function
if __name__ == "__main__":
       from doctest import testmod

       testmod(name='avgpooling', verbose=True)

       # Loading the image
       snake_case__					:							Optional[Any]													=     Image.open('path_to_image')

       # Converting the image to numpy array and maxpooling, displaying the result
       # Ensure that the image is a square matrix

       Image.fromarray(maxpooling(np.array(image), size=3, stride=2)).show()

       # Converting the image to numpy array and averagepooling, displaying the result
       # Ensure that the image is a square matrix

       Image.fromarray(avgpooling(np.array(image), size=3, stride=2)).show()





