Sample

pyint-7904aaf673c3-I12

Inline all eligible single-use intermediate local variables

Matched original source

Lines298

Scores

MethodScoreScale
Posnett00–1; higher is more readable
Dorn0.640–1; higher is more readable
Mi0.5980–1; higher is more readable
LLOC145Logical lines; fewer is more readable
DeepSeek V4 Pro170–20; mean of three runs
GPT-6.1 Sol160–20; mean of three runs
BTTF0.5720–1; higher is more readable

Views

Source code

from __future__ import annotations import calendar import copy import time from collections.abc import Iterator, MutableMapping from http.cookiejar import Cookie, CookieJar, CookiePolicy from typing import TYPE_CHECKING, Any, TypeVar, overload from ._internal_utils import to_native_string from ._types import is_prepared as _is_prepared from .compat import Morsel, cookielib, urlparse, urlunparse import threading class RequestsCookieJar(CookieJar, MutableMapping[str, str | None]): # type: ignore[misc] """Compatibility class; is a http.cookiejar.CookieJar, but exposes a dict interface. This is the CookieJar we create by default for requests and sessions that don't specify one, since some clients may expect response.cookies and session.cookies to support dict operations. Requests does not use the dict interface internally; it's just for compatibility with external client code. All requests code should work out of the box with externally provided instances of ``CookieJar``, e.g. ``LWPCookieJar`` and ``FileCookieJar``. Unlike a regular CookieJar, this class is pickleable. .. warning:: dictionary operations that are normally O(1) may be O(n). """ _policy: CookiePolicy def get( # type: ignore[override] self, name: str, default: str | None = None, domain: str | None = None, path: str | None = None, ) -> str | None: """Dict-like get() that also supports optional domain and path args in order to resolve naming collisions from using one cookie jar over multiple domains. .. warning:: operation is O(n), not O(1). """ try: return self._find_no_duplicates(name, domain, path) except KeyError: return default def set( self, name: str, value: str | Morsel[dict[str, str]] | None, **kwargs: Any ) -> Cookie | None: """Dict-like set() that also supports optional domain and path args in order to resolve naming collisions from using one cookie jar over multiple domains. """ # support client code that unsets cookies by assignment of a None value: if value is None: remove_cookie_by_name( self, name, domain=kwargs.get("domain"), path=kwargs.get("path") ) return if isinstance(value, Morsel): c = morsel_to_cookie(value) else: c = create_cookie(name, value, **kwargs) self.set_cookie(c) return c def iterkeys(self) -> Iterator[str]: """Dict-like iterkeys() that returns an iterator of names of cookies from the jar. .. seealso:: itervalues() and iteritems(). """ for cookie in iter(self): yield cookie.name def keys(self) -> list[str]: # type: ignore[override] """Dict-like keys() that returns a list of names of cookies from the jar. .. seealso:: values() and items(). """ return list(self.iterkeys()) def itervalues(self) -> Iterator[str | None]: """Dict-like itervalues() that returns an iterator of values of cookies from the jar. .. seealso:: iterkeys() and iteritems(). """ for cookie in iter(self): yield cookie.value def values(self) -> list[str | None]: # type: ignore[override] """Dict-like values() that returns a list of values of cookies from the jar. .. seealso:: keys() and items(). """ return list(self.itervalues()) def iteritems(self) -> Iterator[tuple[str, str | None]]: """Dict-like iteritems() that returns an iterator of name-value tuples from the jar. .. seealso:: iterkeys() and itervalues(). """ for cookie in iter(self): yield cookie.name, cookie.value def items(self) -> list[tuple[str, str | None]]: # type: ignore[override] """Dict-like items() that returns a list of name-value tuples from the jar. Allows client-code to call ``dict(RequestsCookieJar)`` and get a vanilla python dict of key value pairs. .. seealso:: keys() and values(). """ return list(self.iteritems()) def list_domains(self) -> list[str]: """Utility method to list all the domains in the jar.""" domains: list[str] = [] for cookie in iter(self): if cookie.domain not in domains: domains.append(cookie.domain) return domains def list_paths(self) -> list[str]: """Utility method to list all the paths in the jar.""" paths: list[str] = [] for cookie in iter(self): if cookie.path not in paths: paths.append(cookie.path) return paths def multiple_domains(self) -> bool: """Returns True if there are multiple domains in the jar. Returns False otherwise. :rtype: bool """ domains: list[str] = [] for cookie in iter(self): if cookie.domain is not None and cookie.domain in domains: # type: ignore[reportUnnecessaryComparison] # defensive check return True domains.append(cookie.domain) return False # there is only one domain in jar def get_dict( self, domain: str | None = None, path: str | None = None ) -> dict[str, str | None]: """Takes as an argument an optional domain and path and returns a plain old Python dict of name-value pairs of cookies that meet the requirements. :rtype: dict """ dictionary: dict[str, str | None] = {} for cookie in iter(self): if (domain is None or cookie.domain == domain) and ( path is None or cookie.path == path ): dictionary[cookie.name] = cookie.value return dictionary def __iter__(self) -> Iterator[Cookie]: # type: ignore[override] """RequestCookieJar's __iter__ comes from CookieJar not MutableMapping.""" return super().__iter__() def __contains__(self, name: object) -> bool: try: return super().__contains__(name) except CookieConflictError: return True def __getitem__(self, name: str) -> str | None: """Dict-like __getitem__() for compatibility with client code. Throws exception if there are more than one cookie with name. In that case, use the more explicit get() method instead. .. warning:: operation is O(n), not O(1). """ return self._find_no_duplicates(name) def __setitem__( self, name: str, value: str | Morsel[dict[str, str]] | None ) -> None: """Dict-like __setitem__ for compatibility with client code. Throws exception if there is already a cookie of that name in the jar. In that case, use the more explicit set() method instead. """ self.set(name, value) def __delitem__(self, name: str) -> None: """Deletes a cookie given a name. Wraps ``http.cookiejar.CookieJar``'s ``remove_cookie_by_name()``. """ remove_cookie_by_name(self, name) def set_cookie(self, cookie: Cookie, *args: Any, **kwargs: Any) -> None: if ( (value := cookie.value) is not None and value.startswith('"') and value.endswith('"') ): cookie.value = value.replace('\\"', "") return super().set_cookie(cookie, *args, **kwargs) def update( # type: ignore[override] self, other: CookieJar | SupportsKeysAndGetItem[str, str] ) -> None: """Updates this jar with cookies from another CookieJar or dict-like""" if isinstance(other, cookielib.CookieJar): for cookie in other: self.set_cookie(copy.copy(cookie)) else: super().update(other) def _find( self, name: str, domain: str | None = None, path: str | None = None ) -> str | None: """Requests uses this method internally to get cookie values. If there are conflicting cookies, _find arbitrarily chooses one. See _find_no_duplicates if you want an exception thrown if there are conflicting cookies. :param name: a string containing name of cookie :param domain: (optional) string containing domain of cookie :param path: (optional) string containing path of cookie :return: cookie.value """ for cookie in iter(self): if cookie.name == name: if domain is None or cookie.domain == domain: if path is None or cookie.path == path: return cookie.value raise KeyError(f"name={name!r}, domain={domain!r}, path={path!r}") def _find_no_duplicates( self, name: str, domain: str | None = None, path: str | None = None ) -> str: """Both ``__get_item__`` and ``get`` call this function: it's never used elsewhere in Requests. :param name: a string containing name of cookie :param domain: (optional) string containing domain of cookie :param path: (optional) string containing path of cookie :raises KeyError: if cookie is not found :raises CookieConflictError: if there are multiple cookies that match name and optionally domain and path :return: cookie.value """ toReturn = None for cookie in iter(self): if cookie.name == name: if domain is None or cookie.domain == domain: if path is None or cookie.path == path: if toReturn is not None: # if there are multiple cookies that meet passed in criteria raise CookieConflictError( f"There are multiple cookies with name, {name!r}" ) # we will eventually return this as long as no cookie conflict toReturn = cookie.value if toReturn is not None: return toReturn raise KeyError(f"name={name!r}, domain={domain!r}, path={path!r}") def __getstate__(self) -> dict[str, Any]: """Unlike a normal CookieJar, this class is pickleable.""" state = self.__dict__.copy() # remove the unpickleable RLock object state.pop("_cookies_lock") return state def __setstate__(self, state: dict[str, Any]) -> None: """Unlike a normal CookieJar, this class is pickleable.""" self.__dict__.update(state) if "_cookies_lock" not in self.__dict__: self._cookies_lock = threading.RLock() def copy(self) -> RequestsCookieJar: """Return a copy of this RequestsCookieJar.""" new_cj = RequestsCookieJar() new_cj.set_policy(self.get_policy()) new_cj.update(self) return new_cj def get_policy(self) -> CookiePolicy: """Return the CookiePolicy instance used.""" return self._policy

Loading feature diagnosis…

Source regions

Feature contributions

Feature contributions

FeatureValueContribution
(log-odds)
Halstead volumeHow much symbolic information the code contains. It combines the total number of operators and values with the number of distinct ones.8743.824−288.546
Source linesThe number of non-empty source lines.298+119.2
Byte entropyHow varied the bytes in the source text are. Repeated bytes give a lower value; a more even mixture gives a higher value.4.384−6.576

Intercept 8.87 + feature contributions = -167.052 (log-odds).
Score = sigmoid(-167.052) = 0.

Feature contributions

FeatureValueContribution
(log-odds)
Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code.299−9.55
Indentation frequencyHow rapidly indentation changes from line to line.198+6.111
Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom.297.822+3.753
Identifier layout (horizontal)How rapidly the visual pattern of identifier characters changes from left to right. It measures spatial frequency, not the meaning of the names.133.973−2.009
Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right.133.99+1.357
Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *.0.051+0.443
Number layout frequencyHow rapidly the number of numeric values per line changes through the code.1+0.398

Intercept 0.07 + feature contributions = 0.573 (log-odds).
Score = sigmoid(0.573) = 0.64.

Score0.598
Score145
Run 1

The code is highly readable with clear structure, comprehensive docstrings, and logical organization. It uses flat nesting (maximum 2-3 levels), maintains one action per line, and follows natural reading flow. Type hints are used consistently, and methods are appropriately named (get, set, keys, values, items). The main strength is the excellent documentation explaining the 'why' behind methods. Minor deductions: some methods like multiple_domains could be simplified using set operations, and a few comments contain defensive redundancies. Overall, this represents production-quality code with very high clarity of intent.

Run 2

The code is well-structured and readable, with clear class organization and documented methods. It uses type hints, flat nesting, and concise helper methods. Minor issues include some unused imports and a slight inconsistency in variable naming (`toReturn`), but overall it follows logical flow and maintains a natural reading pattern.

Run 3

The code is highly readable with a clear class structure and consistent method organization. Each method has a single responsibility and is well-documented with docstrings. Nesting is generally shallow, though the `_find` and `_find_no_duplicates` methods have three levels of conditionals that could be simplified. Intent is clear throughout, with descriptive method names and type hints enhancing comprehension. The code is somewhat longer than necessary due to extensive docstrings, but this is appropriate for a library API. Action granularity is excellent—one operation per line in most cases. Reading flow is natural, with related methods grouped logically (dict-like operations, utility methods, internal helpers, pickling support). Minor deductions for the nested conditionals in `_find` methods and slight verbosity in docstrings.

Run 1

Code Structure: Methods are logically separated into mapping operations, cookie lookup, serialization, and copying, though imports are inconsistently ordered. Nesting: Most methods are shallow, but _find and _find_no_duplicates contain unnecessarily deep conditional chains. Clarity of intent: Descriptive method names, type annotations, and extensive docstrings make the purpose clear; however, toReturn is vague and inconsistently styled, and multiple_domains checks repeated domains rather than distinct ones, contradicting its description. Code length: Individual methods are generally concise, but repetitive iterator wrappers and verbose, occasionally inaccurate docstrings add bulk. Action granularity: Almost every statement performs one clear action; the assignment expression in set_cookie slightly increases cognitive load. Reading flow: Consistent formatting and short methods support natural reading, while long inline suppression comments, repeated filtering logic, and references to helpers not shown interrupt it.

Run 2

Code Structure: Methods are logically grouped around dictionary compatibility, cookie lookup, and serialization, with small, focused responsibilities. Nesting: Most methods are shallow, but _find and _find_no_duplicates contain unnecessarily deep conditional chains. Clarity of intent: Descriptive method names, type annotations, and extensive docstrings explain most behavior well; however, multiple_domains checks repeated domains rather than distinct domains, and some docstrings do not match implementation behavior. Code length: Generally appropriate for the interface, though repetitive documentation and similar lookup logic add bulk. Action granularity: Almost every statement performs one action; the assignment expression in set_cookie slightly increases parsing effort. Reading flow: Consistent formatting and straightforward control flow make navigation easy, but inconsistent naming such as toReturn, lengthy type-ignore comments, and the misplaced threading import introduce minor distractions.

Run 3

Code Structure: Methods are logically grouped around dictionary compatibility, cookie lookup, and serialization, with mostly focused responsibilities. Nesting: Most methods are shallow, but _find and _find_no_duplicates contain several nested conditions that could be flattened. Clarity of intent: Descriptive names, type annotations, and extensive docstrings explain most behavior well; however, multiple_domains checks for repeated domains rather than distinct domains, and some documentation does not match implementation. Code length: Generally appropriate for the interface, though repetitive wrappers, docstrings, and lookup logic add bulk. Action granularity: Almost every statement performs one action; the assignment expression in set_cookie slightly increases cognitive load. Reading flow: Consistent formatting and small methods support natural reading, but inconsistent naming such as toReturn and new_cj, lengthy inline type-ignore comments, and poorly grouped imports introduce minor distractions.