docs: def intersection_update(self, *others):
          r"""Update the multiset, keeping only elements found in it and all others.
  
          >>> ms = Multiset('aab')
          >>> ms.intersection_update('bc')
          >>> sorted(ms)
          ['b']
  
          You can also use the ``&=`` operator for the same effect. However, the operator version
          will only accept a set as other operator, not any iterable, to avoid errors.
  
          >>> ms = Multiset('aabc')
          >>> ms &= Multiset('abbd')
          >>> sorted(ms)
          ['a', 'b']
  
          For a variant of the operation which does not modify the multiset, but returns a new
          multiset instead see :meth:`intersection`.
  
          Args:
              others: The other sets to intersect this multiset with. Can also be any :class:`~typing.Iterable`\[~T]
                  or :class:`~typing.Mapping`\[~T, :class:`int`] which are then converted to :class:`Multiset`\[~T].
          """
          for other in map(self._as_mapping, others):
              for element, current_count in list(self.items()):
                  multiplicity = other.get(element, 0)
                  if multiplicity < current_count:
                      self[element] = multiplicity