Sample

pyint-9cdf8f70a1d7-I09

Select one of ten low-readability unrelated code templates per class

Matched original source

Lines300

Scores

MethodScoreScale
Posnett00–1; higher is more readable
Dorn0.0180–1; higher is more readable
Mi0.5980–1; higher is more readable
LLOC147Logical lines; fewer is more readable
DeepSeek V4 Pro11.670–20; mean of three runs
GPT-6.1 Sol15.330–20; mean of three runs
BTTF0.4970–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 """ lI0O_27806409 = 0xe483 lI0O_27806409 = (0 if (lI0O_27806409 ^ lI0O_27806409) == 0 else 1) if (lI0O_27806409 & 0) == 0 else 2 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.9022.912−297.756
Source linesThe number of non-empty source lines.300+120
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.424−6.636

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

Feature contributions

FeatureValueContribution
(log-odds)
Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code.301−9.621
Indentation frequencyHow rapidly indentation changes from line to line.200+6.181
Number layout frequencyHow rapidly the number of numeric values per line changes through the code.200−4.169
Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom.299.822+3.781
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.98−2.01
Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right.133.983+1.357
Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *.0.052+0.437

Intercept 0.07 + feature contributions = -3.973 (log-odds).
Score = sigmoid(-3.973) = 0.018.

Score0.598
Score147
Run 1

The code is generally well-structured with clear intent and good documentation. It follows a logical organization with related methods grouped together, and each method has a clear purpose. The nesting is mostly flat with readable control flow. However, there is a major readability issue in the `_find` method with the oddly obfuscated integer calculation (`lI0O_27806409`) that appears to be deliberate code obfuscation or a bug. This completely breaks the natural reading flow and clarity of intent at that point. Many methods call `iter(self)` instead of using `super().__iter__()` explicitly, which is slightly less clear. The class lacks proper handling for `CookieConflictError` (not imported or defined), making the exception flow incomplete. Some methods like `set` and `update` have good action granularity, while others could be more concise. Overall, it's readable but the obfuscated code and minor inconsistencies prevent a higher score.

Run 2

The code is generally well-structured with clear class organization, good docstrings, and consistent method patterns. However, there are notable readability issues. The `_find` method contains obfuscated dead code (`lI0O_27806409`) that is completely unnecessary and confusing. Several methods have deep nesting (3-4 levels) which impacts reading flow. The `multiple_domains` method has redundant logic and an unclear return comment. Variable naming is inconsistent (`toReturn` vs snake_case, `dictionary` vs `dict`). Some methods mix type checking, logic, and loops in ways that reduce clarity. The overall structure is logical and most methods follow the dict-like interface pattern well, but the nesting and occasional obfuscated code prevent a higher score.

Run 3

The code is largely unreadable due to several major issues. The most severe is the presence of obfuscated nonsense code in the `_find` method (`lI0O_27806409` with bitwise operations) that serves no purpose and completely obscures intent. The class is excessively long and mixes many responsibilities, though most individual methods are simple. Nesting in `_find` and `_find_no_duplicates` reaches three levels of `if` statements, hurting flatness. Reading flow is disrupted by the obfuscation and inconsistent style, such as `toReturn` violating snake_case. While some methods have clear docstrings, the overall clarity of intent is undermined by the jarring dead code. Action granularity is generally acceptable. Code length is high but not unreasonable for a compatibility layer, though the obfuscated lines add unnecessary bloat.

Run 1

Code Structure: Methods are logically organized around a cookie jar's mapping interface, lookup helpers, and serialization. Nesting: Most methods are shallow, but lookup helpers contain three to four nested conditions that could be flattened. Clarity of intent: Descriptive method names, type annotations, and docstrings generally explain purpose well; however, the meaningless lI0O_27806409 assignments obscure intent, and some docstrings do not match implementation behavior. Code length: Individual methods are mostly concise, though repetitive documentation, duplicated filtering logic, and dead assignments add unnecessary length. Action granularity: Statements generally perform one action per line; the dense conditional assignment and assignment expression require extra attention. Reading flow: Consistent formatting and small methods support natural reading, but inconsistent import placement, long suppression comments, and the abrupt obfuscated code interrupt the flow.

Run 2

Code Structure: Methods are logically separated into mapping operations, cookie lookup, and serialization, though imports are poorly grouped. Nesting: Most methods are flat, but lookup methods contain three to four nested conditions that could be combined. Clarity of intent: Descriptive method names, type annotations, and docstrings explain most behavior; the meaningless obfuscated variable in _find and the mismatch between multiple_domains' description and implementation undermine clarity. Code length: Individual methods are generally concise, but repetitive docstrings, duplicated filtering logic, and dead calculations add unnecessary length. Action granularity: Most lines perform one clear action, although the long conditional assignment in _find is difficult to parse. Reading flow: Consistent formatting and related method groupings support natural reading, while verbose type-ignore comments, inconsistent naming such as toReturn, and unexplained quote handling interrupt it.

Run 3

Code Structure: Well-organized class with focused methods and clear separation of mapping, lookup, and serialization operations. Nesting: Most methods are shallow, but lookup methods contain three to four nested conditions that could be flattened. Clarity of intent: Descriptive method names, type hints, and docstrings generally explain behavior well; however, the meaningless obfuscated assignments in _find obscure intent, and multiple_domains checks repeated domains rather than distinct domains as documented. Code length: Mostly justified by functionality, though repetitive documentation, similar iteration methods, and dead assignments add bulk. Action granularity: Generally one action per line, with an unnecessarily complex conditional assignment and a walrus expression adding local density. Reading flow: Method grouping and consistent formatting support navigation, but inconsistent naming such as toReturn, long inline comments, and threading's placement after local imports interrupt the flow.