Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions docs/multidict.rst
Original file line number Diff line number Diff line change
Expand Up @@ -354,7 +354,7 @@ CIMultiDictProxy

Raises :exc:`TypeError` if *multidict* is not :class:`CIMultiDict` instance.

The class is inherited from :class:`MultiDict`.
The class is inherited from :class:`MultiDictProxy`.


Version
Expand Down Expand Up @@ -387,7 +387,7 @@ For more effective processing it should know if the *key* is already
case-folded to skip the :meth:`~str.lower()` call.

The performant code may create
case-folded string keys explicitly hand, e.g::
case-folded string keys explicitly by hand, e.g::

>>> key = istr('Key')
>>> key
Expand Down
10 changes: 5 additions & 5 deletions multidict/_multidict_py.py
Original file line number Diff line number Diff line change
Expand Up @@ -720,7 +720,7 @@ def keys(self) -> KeysView[str]:
return _KeysView(self)

def items(self) -> ItemsView[str, _V]:
"""Return a new view of the dictionary's items *(key, value) pairs)."""
"""Return a new view of the dictionary's items ((key, value) pairs)."""
return _ItemsView(self)

def values(self) -> _ValuesView[_V]:
Expand Down Expand Up @@ -831,7 +831,7 @@ def _parse_args(
for pos, item in enumerate(arg):
if not len(item) == 2:
raise ValueError(
f"multidict update sequence element #{pos}"
f"multidict update sequence element #{pos} "
f"has length {len(item)}; 2 is required"
)
identity = identity_func(item[0])
Expand Down Expand Up @@ -993,7 +993,7 @@ def update(self, arg: MDArg[_V] = None, /, **kwargs: _V) -> None:
log2_size = estimate_log2_keysize(newsize)
if log2_size > 17: # pragma: no cover
# Don't overallocate really huge keys space in update,
# duplicate keys could reduce the resulting anount of entries
# duplicate keys could reduce the resulting amount of entries
log2_size = 17
if log2_size > self._keys.log2_size:
self._resize(log2_size, False)
Expand Down Expand Up @@ -1044,7 +1044,7 @@ def merge(self, arg: MDArg[_V] = None, /, **kwargs: _V) -> None:
log2_size = estimate_log2_keysize(newsize)
if log2_size > 17: # pragma: no cover
# Don't overallocate really huge keys space in update,
# duplicate keys could reduce the resulting anount of entries
# duplicate keys could reduce the resulting amount of entries
log2_size = 17
if log2_size > self._keys.log2_size:
self._resize(log2_size, False)
Expand Down Expand Up @@ -1194,7 +1194,7 @@ def keys(self) -> KeysView[str]:
return self._md.keys()

def items(self) -> ItemsView[str, _V]:
"""Return a new view of the dictionary's items *(key, value) pairs)."""
"""Return a new view of the dictionary's items ((key, value) pairs)."""
return self._md.items()

def values(self) -> _ValuesView[_V]:
Expand Down
Loading