Method discard

uritemplate/orderedset.py:49–55

(self, key: str)

            last.next = root.prev = weakref.proxy(link)

    def discard(self, key: str) -> None:
        # Remove an existing item using self.__map to find the link which is
        # then removed by updating the links in the predecessor and successors.
        if key in self.__map:
            link = self.__map.pop(key)
            link.prev.next = link.next
            link.next.prev = link.prev

    def __iter__(self) -> t.Generator[str, None, None]:
        # Traverse the linked list in order.