OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	02/16/2024 09:01:52 PM	rwxr-xr-x
📄 __init__.py	0 bytes	11/13/2023 09:31:06 PM	rw-r--r--
📁 __pycache__	-	02/16/2024 09:01:52 PM	rwxr-xr-x
📄 _log.py	1015 bytes	03/16/2023 12:55:40 PM	rw-r--r--
📄 appdirs.py	1.32 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 compat.py	9.27 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 compatibility_tags.py	5.31 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 datetime.py	295 bytes	11/13/2023 09:31:06 PM	rw-r--r--
📄 deprecation.py	3.24 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 direct_url_helpers.py	4.26 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 distutils_args.py	1.32 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 egg_link.py	2.07 KB	03/16/2023 12:55:40 PM	rw-r--r--
📄 encoding.py	1.25 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 entrypoints.py	1.19 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 filesystem.py	6.78 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 filetypes.py	571 bytes	11/13/2023 09:31:06 PM	rw-r--r--
📄 glibc.py	3.22 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 hashes.py	4.57 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 inject_securetransport.py	810 bytes	11/13/2023 09:31:06 PM	rw-r--r--
📄 logging.py	12.79 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 misc.py	27.67 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 models.py	1.17 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 packaging.py	2.96 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 parallel.py	3.32 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 pkg_resources.py	1.22 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 setuptools_build.py	4.94 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 subprocess.py	9.69 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 temp_dir.py	8.18 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 typing.py	1.37 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 unpacking.py	9.27 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 urls.py	1.49 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 virtualenv.py	3.62 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 wheel.py	7.13 KB	11/13/2023 09:31:06 PM	rw-r--r--

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.dummy import Pool as ThreadPool

from pip._vendor.requests.adapters import DEFAULT_POOLSIZE
from pip._vendor.six import PY2
from pip._vendor.six.moves import map

from pip._internal.utils.typing import MYPY_CHECK_RUNNING

if MYPY_CHECK_RUNNING:
    from typing import Callable, Iterable, Iterator, Union, TypeVar
    from multiprocessing import pool

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):
    # type: (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, iterable, chunksize=1):
    # type: (Callable[[S], T], Iterable[S], int) -> 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, iterable, chunksize=1):
    # type: (Callable[[S], T], Iterable[S], int) -> 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, iterable, chunksize=1):
    # type: (Callable[[S], T], Iterable[S], int) -> 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 or PY2:
    map_multiprocess = map_multithread = _map_fallback
else:
    map_multiprocess = _map_multiprocess
    map_multithread = _map_multithread