

'''simple docstring'''






# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


lowerCAmelCase__   		=      {
    '''configuration_mgp_str''': ['''MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''MgpstrConfig'''],
    '''processing_mgp_str''': ['''MgpstrProcessor'''],
    '''tokenization_mgp_str''': ['''MgpstrTokenizer'''],
}

try:
 if not is_torch_available():
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 pass
else:
 lowerCAmelCase__   		=      [
     '''MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST''',
     '''MgpstrModel''',
     '''MgpstrPreTrainedModel''',
     '''MgpstrForSceneTextRecognition''',
 ]

if TYPE_CHECKING:
 from .configuration_mgp_str import MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP, MgpstrConfig
 from .processing_mgp_str import MgpstrProcessor
 from .tokenization_mgp_str import MgpstrTokenizer

 try:
  if not is_torch_available():
   raise OptionalDependencyNotAvailable()
 except OptionalDependencyNotAvailable:
  pass
 else:
  from .modeling_mgp_str import (
      MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST,
      MgpstrForSceneTextRecognition,
      MgpstrModel,
      MgpstrPreTrainedModel,
  )
else:
 import sys

 lowerCAmelCase__   		=      _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)





from __future__ import annotations






def 					UpperCamelCase   (      __magic_name__	:				list[int]	)  ->    list[int]:  # This function is recursive
		"""simple docstring"""




		lowercase__	     =						len(__magic_name__	)
		# If the array contains only one element, we return it (it's the stop condition of
		# recursion)
		if array_length <= 1:
				return array
				# Else
		lowercase__	     =						array[0]
		lowercase__	     =						False
		lowercase__	     =						1
		lowercase__	     =						[]
		while not is_found and i < array_length:
				if array[i] < pivot:
						lowercase__	     =						True
						lowercase__	     =						[element for element in array[i:] if element >= array[i]]
						lowercase__	     =						longest_subsequence(__magic_name__	)
						if len(__magic_name__	) > len(__magic_name__	):
								lowercase__	     =						temp_array
				else:
						i += 1

		lowercase__	     =						[element for element in array[1:] if element >= pivot]
		lowercase__	     =						[pivot, *longest_subsequence(__magic_name__	)]
		if len(__magic_name__	) > len(__magic_name__	):
				return temp_array
		else:
				return longest_subseq


if __name__ == "__main__":
	import doctest

	doctest.testmod()

