import os
from argparse import ArgumentParser
from pathlib import Path
from shutil import copyfile, rmtree
from typing import Generator

import datasets.config
from datasets.builder import DatasetBuilder
from datasets.commands import BaseDatasetsCLICommand
from datasets.download.download_manager import DownloadMode
from datasets.load import dataset_module_factory, import_main_class
from datasets.utils.filelock import logger as fl_logger
from datasets.utils.info_utils import VerificationMode
from datasets.utils.logging import ERROR, get_logger


lowerCAmelCase__      		=					get_logger(__name__)






def  __lowerCamelCase						(		lowerCAmelCase__      ):
       return TestCommand(
           args.dataset      ,    args.name      ,    args.cache_dir      ,    args.data_dir      ,    args.all_configs      ,    args.save_info or args.save_infos      ,    args.ignore_verifications      ,    args.force_redownload      ,    args.clear_cache      ,    )



class 							a_					(		SCREAMING_SNAKE_CASE		):






 '''simple docstring'''






 UpperCAmelCase_      					=   False  # to tell pytest it's not a test class




 @staticmethod
 def 						__snake_case		(     lowercase__   :    ArgumentParser):







        '''simple docstring'''



        lowerCAmelCase__	      =   parser.add_parser('test'     ,       help='Test dataset implementation.')
        test_parser.add_argument('--name'     ,       type=lowercase__     ,       default=lowercase__     ,       help='Dataset processing name')
        test_parser.add_argument(
            '--cache_dir'     ,       type=lowercase__     ,       default=lowercase__     ,       help='Cache directory where the datasets are stored.'     ,       )
        test_parser.add_argument(
            '--data_dir'     ,       type=lowercase__     ,       default=lowercase__     ,       help='Can be used to specify a manual directory to get the files from.'     ,       )
        test_parser.add_argument('--all_configs'     ,       action='store_true'     ,       help='Test all dataset configurations')
        test_parser.add_argument(
            '--save_info'     ,       action='store_true'     ,       help='Save the dataset infos in the dataset card (README.md)')
        test_parser.add_argument(
            '--ignore_verifications'     ,       action='store_true'     ,       help='Run the test without checksums and splits checks.'     ,       )
        test_parser.add_argument('--force_redownload'     ,       action='store_true'     ,       help='Force dataset redownload')
        test_parser.add_argument(
            '--clear_cache'     ,       action='store_true'     ,       help='Remove downloaded files and cached datasets after each config test'     ,       )
        # aliases
        test_parser.add_argument('--save_infos'     ,       action='store_true'     ,       help='alias to save_info')
        test_parser.add_argument('dataset'     ,       type=lowercase__     ,       help='Name of the dataset to download')
        test_parser.set_defaults(func=_test_command_factory)




 def __init__(     self   :    Tuple     ,       lowercase__   :    str     ,       lowercase__   :    str     ,       lowercase__   :    str     ,       lowercase__   :    str     ,       lowercase__   :    bool     ,       lowercase__   :    bool     ,       lowercase__   :    bool     ,       lowercase__   :    bool     ,       lowercase__   :    bool     ,       ):







        '''simple docstring'''



        lowerCAmelCase__	      =   dataset
        lowerCAmelCase__	      =   name
        lowerCAmelCase__	      =   cache_dir
        lowerCAmelCase__	      =   data_dir
        lowerCAmelCase__	      =   all_configs
        lowerCAmelCase__	      =   save_infos
        lowerCAmelCase__	      =   ignore_verifications
        lowerCAmelCase__	      =   force_redownload
        lowerCAmelCase__	      =   clear_cache
        if clear_cache and not cache_dir:
               print(
                   'When --clear_cache is used, specifying a cache directory is mandatory.\n'
                   'The \'download\' folder of the cache directory and the dataset builder cache will be deleted after each configuration test.\n'
                   'Please provide a --cache_dir that will be used to test the dataset script.')
               exit(1)
        if save_infos:
               lowerCAmelCase__	      =   True




 def 						__snake_case		(     self   :    Optional[Any]):







        '''simple docstring'''



        fl_logger().setLevel(lowercase__)
        if self._name is not None and self._all_configs:
               print('Both parameters `config` and `all_configs` can\'t be used at once.')
               exit(1)
        lowerCAmelCase__      ,   lowerCAmelCase__	      =   self._dataset, self._name
        lowerCAmelCase__	      =   dataset_module_factory(lowercase__)
        lowerCAmelCase__	      =   import_main_class(module.module_path)
        lowerCAmelCase__	      =   len(builder_cls.BUILDER_CONFIGS) if self._all_configs and builder_cls.BUILDER_CONFIGS else 1

        def get_builders() -> Generator[DatasetBuilder, None, None]:
               if self._all_configs and builder_cls.BUILDER_CONFIGS:
                      for i, config in enumerate(builder_cls.BUILDER_CONFIGS):
                             if "config_name" in module.builder_kwargs:
                                    yield builder_cls(
                                        cache_dir=self._cache_dir     ,       data_dir=self._data_dir     ,       **module.builder_kwargs     ,       )
                             else:
                                    yield builder_cls(
                                        config_name=config.name     ,       cache_dir=self._cache_dir     ,       data_dir=self._data_dir     ,       **module.builder_kwargs     ,       )
               else:
                      if "config_name" in module.builder_kwargs:
                             yield builder_cls(cache_dir=self._cache_dir     ,       data_dir=self._data_dir     ,       **module.builder_kwargs)
                      else:
                             yield builder_cls(
                                 config_name=lowercase__     ,       cache_dir=self._cache_dir     ,       data_dir=self._data_dir     ,       **module.builder_kwargs     ,       )

        for j, builder in enumerate(get_builders()):
               print(F"""Testing builder '{builder.config.name}' ({j + 1}/{n_builders})""")
               lowerCAmelCase__	      =   os.path.exists(
                   os.path.join(builder.get_imported_module_dir()     ,       datasets.config.DATASETDICT_INFOS_FILENAME))  # record checksums only if we need to update a (deprecated) dataset_infos.json
               builder.download_and_prepare(
                   download_mode=DownloadMode.REUSE_CACHE_IF_EXISTS
                   if not self._force_redownload
                   else DownloadMode.FORCE_REDOWNLOAD     ,       verification_mode=VerificationMode.NO_CHECKS
                   if self._ignore_verifications
                   else VerificationMode.ALL_CHECKS     ,       try_from_hf_gcs=lowercase__     ,       )
               builder.as_dataset()
               if self._save_infos:
                      builder._save_infos()

               # If save_infos=True, the dataset card (README.md) is created next to the loaded module file.
               # The dataset_infos are saved in the YAML part of the README.md

               # Let's move it to the original directory of the dataset script, to allow the user to
               # upload them on S3 at the same time afterwards.
               if self._save_infos:
                      lowerCAmelCase__	      =   os.path.join(builder_cls.get_imported_module_dir()     ,       'README.md')
                      lowerCAmelCase__	      =   Path(lowercase__).name + '.py'
                      lowerCAmelCase__	      =   os.path.join(lowercase__     ,       lowercase__)
                      if os.path.isfile(lowercase__):
                             lowerCAmelCase__	      =   os.path.dirname(lowercase__)
                      elif os.path.isfile(lowercase__):
                             lowerCAmelCase__	      =   path
                      elif os.path.isdir(lowercase__):  # for local directories containing only data files
                             lowerCAmelCase__	      =   path
                      else:  # in case of a remote dataset
                             lowerCAmelCase__	      =   None
                             print(F"""Dataset card saved at {dataset_readme_path}""")

                      # Move dataset_info back to the user
                      if dataset_dir is not None:
                             lowerCAmelCase__	      =   os.path.join(lowercase__     ,       'README.md')
                             copyfile(lowercase__     ,       lowercase__)
                             print(F"""Dataset card saved at {user_dataset_readme_path}""")

            # If clear_cache=True, the download folder and the dataset builder cache directory are deleted
               if self._clear_cache:
                      if os.path.isdir(builder._cache_dir):
                             logger.warning(F"""Clearing cache at {builder._cache_dir}""")
                             rmtree(builder._cache_dir)
                      lowerCAmelCase__	      =   os.path.join(self._cache_dir     ,       datasets.config.DOWNLOADED_DATASETS_DIR)
                      if os.path.isdir(lowercase__):
                             logger.warning(F"""Clearing cache at {download_dir}""")
                             rmtree(lowercase__)

        print('Test successful.')

from __future__ import annotations

from collections.abc import Iterable
class 							a_					:






 '''simple docstring'''






 def __init__(     self   :    int     ,       lowercase__   :    Optional[int]     ,       lowercase__   :    List[str]):







        '''simple docstring'''



        lowerCAmelCase__      ,   lowerCAmelCase__	      =   float(lowercase__), float(lowercase__)




 def __eq__(     self   :    int     ,       lowercase__   :    int):







        '''simple docstring'''



        return self.x == other.x and self.y == other.y




 def __ne__(     self   :    Tuple     ,       lowercase__   :    List[Any]):







        '''simple docstring'''



        return not self == other




 def __gt__(     self   :    Optional[Any]     ,       lowercase__   :    List[Any]):







        '''simple docstring'''



        if self.x > other.x:
               return True
        elif self.x == other.x:
               return self.y > other.y
        return False




 def __lt__(     self   :    str     ,       lowercase__   :    List[str]):







        '''simple docstring'''



        return not self > other




 def __ge__(     self   :    List[Any]     ,       lowercase__   :    Any):







        '''simple docstring'''



        if self.x > other.x:
               return True
        elif self.x == other.x:
               return self.y >= other.y
        return False




 def __le__(     self   :    Dict     ,       lowercase__   :    str):







        '''simple docstring'''



        if self.x < other.x:
               return True
        elif self.x == other.x:
               return self.y <= other.y
        return False




 def __repr__(     self   :    List[str]):







        '''simple docstring'''



        return F"""({self.x}, {self.y})"""




 def __hash__(     self   :    Dict):







        '''simple docstring'''



        return hash(self.x)






def  __lowerCamelCase						(		lowerCAmelCase__      ,    ):
       lowerCAmelCase__	      =   []
       if list_of_tuples:
              for p in list_of_tuples:
                     if isinstance(lowerCAmelCase__      ,    lowerCAmelCase__      ):
                            points.append(lowerCAmelCase__      )
                     else:
                            try:
                                   points.append(Point(p[0]      ,    p[1]      )      )
                            except (IndexError, TypeError):
                                   print(
                                       F"""Ignoring deformed point {p}. All points"""
                                       ' must have at least 2 coordinates.'      )
       return points






def  __lowerCamelCase						(		lowerCAmelCase__      ):

       if not hasattr(lowerCAmelCase__      ,    '__iter__'      ):
              lowerCAmelCase__	      =   F"""Expecting an iterable object but got an non-iterable type {points}"""
              raise ValueError(lowerCAmelCase__      )

       if not points:
              lowerCAmelCase__	      =   F"""Expecting a list of points but got {points}"""
              raise ValueError(lowerCAmelCase__      )

       return _construct_points(lowerCAmelCase__      )






def  __lowerCamelCase						(		lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ):
       lowerCAmelCase__	      =   (a.x * b.y + b.x * c.y + c.x * a.y) - (a.y * b.x + b.y * c.x + c.y * a.x)
       return det






def  __lowerCamelCase						(		lowerCAmelCase__      ):
       lowerCAmelCase__	      =   sorted(_validate_input(lowerCAmelCase__      )      )
       lowerCAmelCase__	      =   len(lowerCAmelCase__      )
       lowerCAmelCase__	      =   set()

       for i in range(n - 1      ):
              for j in range(i + 1      ,    lowerCAmelCase__      ):
                     lowerCAmelCase__	      =   lowerCAmelCase__	      =   False
                     lowerCAmelCase__	      =   True
                     for k in range(lowerCAmelCase__      ):
                            if k != i and k != j:
                                   lowerCAmelCase__	      =   _det(points[i]      ,    points[j]      ,    points[k]      )

                                   if det_k > 0:
                                          lowerCAmelCase__	      =   True
                                   elif det_k < 0:
                                          lowerCAmelCase__	      =   True
                                   else:
                                          # point[i], point[j], point[k] all lie on a straight line
                                          # if point[k] is to the left of point[i] or it's to the
                                          # right of point[j], then point[i], point[j] cannot be
                                          # part of the convex hull of A
                                          if points[k] < points[i] or points[k] > points[j]:
                                                 lowerCAmelCase__	      =   False
                                                 break

                            if points_left_of_ij and points_right_of_ij:
                                   lowerCAmelCase__	      =   False
                                   break

                     if ij_part_of_convex_hull:
                            convex_set.update([points[i], points[j]]      )

       return sorted(lowerCAmelCase__      )






def  __lowerCamelCase						(		lowerCAmelCase__      ):
       lowerCAmelCase__	      =   sorted(_validate_input(lowerCAmelCase__      )      )
       lowerCAmelCase__	      =   len(lowerCAmelCase__      )

       # divide all the points into an upper hull and a lower hull
       # the left most point and the right most point are definitely
       # members of the convex hull by definition.
       # use these two anchors to divide all the points into two hulls,
       # an upper hull and a lower hull.

       # all points to the left (above) the line joining the extreme points belong to the
       # upper hull
       # all points to the right (below) the line joining the extreme points below to the
       # lower hull
       # ignore all points on the line joining the extreme points since they cannot be
       # part of the convex hull

       lowerCAmelCase__	      =   points[0]
       lowerCAmelCase__	      =   points[n - 1]

       lowerCAmelCase__	      =   {left_most_point, right_most_point}
       lowerCAmelCase__	      =   []
       lowerCAmelCase__	      =   []

       for i in range(1      ,    n - 1      ):
              lowerCAmelCase__	      =   _det(lowerCAmelCase__      ,    lowerCAmelCase__      ,    points[i]      )

              if det > 0:
                     upper_hull.append(points[i]      )
              elif det < 0:
                     lower_hull.append(points[i]      )

       _construct_hull(lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      )
       _construct_hull(lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      )

       return sorted(lowerCAmelCase__      )






def  __lowerCamelCase						(		lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ):
       if points:
              lowerCAmelCase__	      =   None
              lowerCAmelCase__	      =   float('-inf'      )
              lowerCAmelCase__	      =   []

              for p in points:
                     lowerCAmelCase__	      =   _det(lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      )

                     if det > 0:
                            candidate_points.append(lowerCAmelCase__      )

                            if det > extreme_point_distance:
                                   lowerCAmelCase__	      =   det
                                   lowerCAmelCase__	      =   p

              if extreme_point:
                     _construct_hull(lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      )
                     convex_set.add(lowerCAmelCase__      )
                     _construct_hull(lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      ,    lowerCAmelCase__      )






def  __lowerCamelCase						(		lowerCAmelCase__      ):
       lowerCAmelCase__	      =   sorted(_validate_input(lowerCAmelCase__      )      )
       lowerCAmelCase__	      =   len(lowerCAmelCase__      )

       lowerCAmelCase__	      =   points[:2]
       for i in range(2      ,    lowerCAmelCase__      ):
              lowerCAmelCase__	      =   _det(convex_hull[1]      ,    convex_hull[0]      ,    points[i]      )
              if det > 0:
                     convex_hull.insert(0      ,    points[i]      )
                     break
              elif det < 0:
                     convex_hull.append(points[i]      )
                     break
              else:
                     lowerCAmelCase__	      =   points[i]
       i += 1

       for j in range(lowerCAmelCase__      ,    lowerCAmelCase__      ):
              if (
                  _det(convex_hull[0]      ,    convex_hull[-1]      ,    points[j]      ) > 0
                  and _det(convex_hull[-1]      ,    convex_hull[0]      ,    points[1]      ) < 0
              ):
                     # The point lies within the convex hull
                     continue

              convex_hull.insert(0      ,    points[j]      )
              convex_hull.append(points[j]      )
              while _det(convex_hull[0]      ,    convex_hull[1]      ,    convex_hull[2]      ) >= 0:
                     del convex_hull[1]
              while _det(convex_hull[-1]      ,    convex_hull[-2]      ,    convex_hull[-3]      ) <= 0:
                     del convex_hull[-2]

    # `convex_hull` is contains the convex hull in circular order
       return sorted(convex_hull[1:] if len(lowerCAmelCase__      ) > 3 else convex_hull      )






def  __lowerCamelCase						(		):
       lowerCAmelCase__	      =   [
           (0, 3),
           (2, 2),
           (1, 1),
           (2, 1),
           (3, 0),
           (0, 0),
           (3, 3),
           (2, -1),
           (2, -4),
           (1, -3),
       ]
       # the convex set of points is
       # [(0, 0), (0, 3), (1, -3), (2, -4), (3, 0), (3, 3)]
       lowerCAmelCase__	      =   convex_hull_bf(lowerCAmelCase__      )

       lowerCAmelCase__	      =   convex_hull_recursive(lowerCAmelCase__      )
       assert results_bf == results_recursive

       lowerCAmelCase__	      =   convex_hull_melkman(lowerCAmelCase__      )
       assert results_bf == results_melkman

       print(lowerCAmelCase__      )


if __name__ == "__main__":
    main()
