


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		:	Union[str, Any]     ,  lowercase_		:	NestedDataStructureLike[PathLike]     ,  lowercase_		:	Optional[NamedSplit] = None     ,  lowercase_		:	Optional[Features] = None     ,  lowercase_		:	str = None     ,  lowercase_		:	bool = False     ,  lowercase_		:	bool = False     ,  lowercase_		:	Optional[int] = None     ,  **lowercase_		:	Optional[int]     ,  )   ->		Union[str, Any]:
             """simple docstring"""




             super().__init__(
                 lowercase_     ,  split=lowercase_     ,  features=lowercase_     ,  cache_dir=lowercase_     ,  keep_in_memory=lowercase_     ,  streaming=lowercase_     ,  num_proc=lowercase_     ,  **lowercase_     ,  )
             _lowerCamelCase			:						Optional[int]            =path_or_paths if isinstance(lowercase_     ,  lowercase_					) else {self.split: path_or_paths}
             _lowerCamelCase			:						int            =Text(
                 cache_dir=lowercase_     ,  data_files=lowercase_     ,  features=lowercase_     ,  **lowercase_     ,  )






      def 			lowerCamelCase			(   self		:	Optional[Any]					)   ->		Dict:
             """simple docstring"""




             if self.streaming:
                    _lowerCamelCase			:						Optional[Any]            =self.builder.as_streaming_dataset(split=self.split					)
             # Build regular (map-style) dataset
             else:
                    _lowerCamelCase			:						List[str]            =None
                    _lowerCamelCase			:						int            =None
                    _lowerCamelCase			:						Optional[Any]            =None
                    _lowerCamelCase			:						Any            =None

                    self.builder.download_and_prepare(
                        download_config=lowercase_     ,  download_mode=lowercase_     ,  verification_mode=lowercase_     ,  base_path=lowercase_     ,  num_proc=self.num_proc     ,  )
                    _lowerCamelCase			:						Tuple            =self.builder.as_dataset(
                        split=self.split     ,  verification_mode=lowercase_     ,  in_memory=self.keep_in_memory					)
             return dataset






from timeit import timeit

lowerCamelCase		   =			{
    'MALAYALAM': True,
    'String': False,
    'rotor': True,
    'level': True,
    'A': True,
    'BB': True,
    'ABC': False,
    'amanaplanacanalpanama': True,  # "a man a plan a canal panama"
}
# Ensure our test data is valid
assert all((key == key[::-1]) is value for key, value in test_data.items())




def       a_ (       SCREAMING_SNAKE_CASE__   : str	):
       '''simple docstring'''





       _lowerCamelCase			:						Optional[int]            =0
       _lowerCamelCase			:						Union[str, Any]            =len(SCREAMING_SNAKE_CASE__	) - 1
       while start_i < end_i:
              if s[start_i] == s[end_i]:
                     start_i += 1
                     end_i -= 1
              else:
                     return False
       return True




def       a_ (       SCREAMING_SNAKE_CASE__   : str	):
       '''simple docstring'''





       _lowerCamelCase			:						List[str]            =len(SCREAMING_SNAKE_CASE__	) // 2
       _lowerCamelCase			:						Optional[Any]            =len(SCREAMING_SNAKE_CASE__	)

       # We need to traverse till half of the length of string
       # as we can get access of the i'th last element from
       # i'th index.
       # eg: [0,1,2,3,4,5] => 4th index can be accessed
       # with the help of 1st index (i==n-i-1)
       # where n is length of string
       return all(s[i] == s[n - i - 1] for i in range(SCREAMING_SNAKE_CASE__	)	)




def       a_ (       SCREAMING_SNAKE_CASE__   : str	):
       '''simple docstring'''





       if len(SCREAMING_SNAKE_CASE__	) <= 2:
              return True
       if s[0] == s[len(SCREAMING_SNAKE_CASE__	) - 1]:
              return is_palindrome_recursive(s[1:-1]	)
       else:
              return False




def       a_ (       SCREAMING_SNAKE_CASE__   : str	):
       '''simple docstring'''





       return s == s[::-1]




def       a_ (       SCREAMING_SNAKE_CASE__   : str	):
       '''simple docstring'''





       _lowerCamelCase			:						Optional[int]            =F'''all({name}(key) is value for key, value in test_data.items())'''
       _lowerCamelCase			:						List[Any]            =F'''from __main__ import test_data, {name}'''
       _lowerCamelCase			:						Any            =500_000
       _lowerCamelCase			:						Dict            =timeit(stmt=SCREAMING_SNAKE_CASE__						,     setup=SCREAMING_SNAKE_CASE__						,     number=SCREAMING_SNAKE_CASE__	)
       print(F'''{name:<35} finished {number:,} runs in {result:.5f} seconds'''	)


if __name__ == "__main__":
 for key, value in test_data.items():
  assert is_palindrome(key) is is_palindrome_recursive(key)
  assert is_palindrome(key) is is_palindrome_slice(key)
  print(F"""{key:21} {value}""")
 print('a man a plan a canal panama')

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function('is_palindrome_slice')
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function('is_palindrome')
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function('is_palindrome_recursive')
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function('is_palindrome_traversal')


