X7ROOT File Manager
Current Path:
/opt/alt/python311/lib/python3.11/site-packages/pip/_internal/utils
opt
/
alt
/
python311
/
lib
/
python3.11
/
site-packages
/
pip
/
_internal
/
utils
/
ðŸ“
..
📄
__init__.py
(0 B)
ðŸ“
__pycache__
📄
_log.py
(1015 B)
📄
appdirs.py
(1.63 KB)
📄
compat.py
(1.84 KB)
📄
compatibility_tags.py
(5.25 KB)
📄
datetime.py
(242 B)
📄
deprecation.py
(3.54 KB)
📄
direct_url_helpers.py
(3.13 KB)
📄
distutils_args.py
(1.22 KB)
📄
egg_link.py
(2.15 KB)
📄
encoding.py
(1.14 KB)
📄
entrypoints.py
(1.1 KB)
📄
filesystem.py
(5.75 KB)
📄
filetypes.py
(716 B)
📄
glibc.py
(3.04 KB)
📄
hashes.py
(4.7 KB)
📄
inject_securetransport.py
(795 B)
📄
logging.py
(11.26 KB)
📄
misc.py
(20.29 KB)
📄
models.py
(1.17 KB)
📄
packaging.py
(2.88 KB)
📄
parallel.py
(3.12 KB)
📄
pkg_resources.py
(987 B)
📄
setuptools_build.py
(4.59 KB)
📄
subprocess.py
(9.82 KB)
📄
temp_dir.py
(7.48 KB)
📄
unpacking.py
(8.7 KB)
📄
urls.py
(1.72 KB)
📄
virtualenv.py
(3.38 KB)
📄
wheel.py
(6.02 KB)
Editing: parallel.py
"""Convenient parallelization of higher order functions. This module provides two helper functions, with appropriate fallbacks on Python 2 and on systems lacking support for synchronization mechanisms: - map_multiprocess - map_multithread These helpers work like Python 3's map, with two differences: - They don't guarantee the order of processing of the elements of the iterable. - The underlying process/thread pools chop the iterable into a number of chunks, so that for very long iterables using a large value for chunksize can make the job complete much faster than using the default value of 1. """ __all__ = ["map_multiprocess", "map_multithread"] from contextlib import contextmanager from multiprocessing import Pool as ProcessPool from multiprocessing import pool from multiprocessing.dummy import Pool as ThreadPool from typing import Callable, Iterable, Iterator, TypeVar, Union from pip._vendor.requests.adapters import DEFAULT_POOLSIZE Pool = Union[pool.Pool, pool.ThreadPool] S = TypeVar("S") T = TypeVar("T") # On platforms without sem_open, multiprocessing[.dummy] Pool # cannot be created. try: import multiprocessing.synchronize # noqa except ImportError: LACK_SEM_OPEN = True else: LACK_SEM_OPEN = False # Incredibly large timeout to work around bpo-8296 on Python 2. TIMEOUT = 2000000 @contextmanager def closing(pool: Pool) -> Iterator[Pool]: """Return a context manager making sure the pool closes properly.""" try: yield pool finally: # For Pool.imap*, close and join are needed # for the returned iterator to begin yielding. pool.close() pool.join() pool.terminate() def _map_fallback( func: Callable[[S], T], iterable: Iterable[S], chunksize: int = 1 ) -> Iterator[T]: """Make an iterator applying func to each element in iterable. This function is the sequential fallback either on Python 2 where Pool.imap* doesn't react to KeyboardInterrupt or when sem_open is unavailable. """ return map(func, iterable) def _map_multiprocess( func: Callable[[S], T], iterable: Iterable[S], chunksize: int = 1 ) -> Iterator[T]: """Chop iterable into chunks and submit them to a process pool. For very long iterables using a large value for chunksize can make the job complete much faster than using the default value of 1. Return an unordered iterator of the results. """ with closing(ProcessPool()) as pool: return pool.imap_unordered(func, iterable, chunksize) def _map_multithread( func: Callable[[S], T], iterable: Iterable[S], chunksize: int = 1 ) -> Iterator[T]: """Chop iterable into chunks and submit them to a thread pool. For very long iterables using a large value for chunksize can make the job complete much faster than using the default value of 1. Return an unordered iterator of the results. """ with closing(ThreadPool(DEFAULT_POOLSIZE)) as pool: return pool.imap_unordered(func, iterable, chunksize) if LACK_SEM_OPEN: map_multiprocess = map_multithread = _map_fallback else: map_multiprocess = _map_multiprocess map_multithread = _map_multithread
Upload File
Create Folder