/dports/devel/py-bidict/bidict-0.21.4/bidict/ |
H A D | _mut.py | 48 def __delitem__(self, key: KT) -> None: 52 def __setitem__(self, key: KT, val: VT) -> None: 80 def put(self, key: KT, val: VT, on_dup: OnDup = ON_DUP_RAISE) -> None: 106 def forceput(self, key: KT, val: VT) -> None: 120 def pop(self, key: KT) -> VT: ... 122 def pop(self, key: KT, default: VDT = ...) -> VDT: ... 123 def pop(self, key: KT, default: VDT = _NONE) -> VDT: 151 def update(self, __arg: _t.Mapping[KT, VT], **kw: VT) -> None: ... 153 def update(self, __arg: IterItems[KT, VT], **kw: VT) -> None: ... 156 def update(self, *args: MapOrIterItems[KT, VT], **kw: VT) -> None: [all …]
|
H A D | _iter.py | 21 def _iteritems_mapping_or_iterable(arg: MapOrIterItems[KT, VT]) -> IterItems[KT, VT]: 30 def _iteritems_args_kw(*args: MapOrIterItems[KT, VT], **kw: VT) -> IterItems[KT, VT]: 50 def inverted(arg: _t.Mapping[KT, VT]) -> IterItems[VT, KT]: ... 52 def inverted(arg: IterItems[KT, VT]) -> IterItems[VT, KT]: ... 53 def inverted(arg: MapOrIterItems[KT, VT]) -> IterItems[VT, KT]:
|
H A D | _base.py | 88 def __init__(self, __arg: _t.Mapping[KT, VT], **kw: VT) -> None: ... 90 def __init__(self, __arg: IterItems[KT, VT], **kw: VT) -> None: ... 93 def __init__(self, *args: MapOrIterItems[KT, VT], **kw: VT) -> None: 216 def _pop(self, key: KT) -> VT: 221 def _put(self, key: KT, val: VT, on_dup: OnDup) -> None: 226 def _dedup_item(self, key: KT, val: VT, on_dup: OnDup) -> _t.Optional[_DedupResult]: 280 def _already_have(key: KT, val: VT, oldkey: OKT, oldval: OVT) -> bool: 286 def _write_item(self, key: KT, val: VT, dedup_result: _DedupResult) -> _WriteResult: 299 def _update(self, init: bool, on_dup: OnDup, *args: MapOrIterItems[KT, VT], **kw: VT) -> None: 313 def _update_no_dup_check(self, other: BidirectionalMapping[KT, VT]) -> None: [all …]
|
H A D | _orderedbase.py | 146 def __init__(self, __arg: _t.Mapping[KT, VT], **kw: VT) -> None: ... 148 def __init__(self, __arg: IterItems[KT, VT], **kw: VT) -> None: ... 151 def __init__(self, *args: MapOrIterItems[KT, VT], **kw: VT) -> None: 203 def __getitem__(self, key: KT) -> VT: 208 def _pop(self, key: KT) -> VT: 216 …def _already_have(key: KT, val: VT, nodeinv: _Node, nodefwd: _Node) -> bool: # type: ignore [over… 220 def _write_item(self, key: KT, val: VT, dedup_result: _DedupResult) -> _WriteResult:
|
H A D | _typing.py | 14 KT = _t.TypeVar('KT') variable
|
/dports/net-im/py-matrix-synapse/synapse-1.50.2/synapse/util/caches/ |
H A D | ttlcache.py | 29 KT = TypeVar("KT") variable 47 def set(self, key: KT, value: VT, ttl: float) -> None: 67 def get(self, key: KT, default: T = SENTINEL) -> Union[VT, T]: 89 def get_with_expiry(self, key: KT) -> Tuple[VT, float, float]: 110 def pop(self, key: KT, default: T = SENTINEL) -> Union[VT, T]: # type: ignore 136 def __getitem__(self, key: KT) -> VT: 139 def __delitem__(self, key: KT) -> None: 142 def __contains__(self, key: KT) -> bool:
|
H A D | lrucache.py | 82 KT = TypeVar("KT") variable 191 key: KT, 454 def delete_node(node: _Node[KT, VT]) -> int: 471 key: KT, 480 key: KT, 489 key: KT, 564 def cache_del_multi(key: KT) -> None: 599 def cache_contains(key: KT) -> bool: 617 def __getitem__(self, key: KT) -> VT: 624 def __setitem__(self, key: KT, value: VT) -> None: [all …]
|
H A D | expiringcache.py | 36 KT = TypeVar("KT") variable 93 def __setitem__(self, key: KT, value: VT) -> None: 107 def __getitem__(self, key: KT) -> VT: 120 def pop(self, key: KT, default: T = SENTINEL) -> Union[VT, T]: 138 def __contains__(self, key: KT) -> bool: 142 def get(self, key: KT, default: Literal[None] = None) -> Optional[VT]: 146 def get(self, key: KT, default: T) -> Union[VT, T]: 149 def get(self, key: KT, default: Optional[T] = None) -> Union[VT, Optional[T]]: 155 def setdefault(self, key: KT, value: VT) -> VT:
|
H A D | dictionary_cache.py | 27 KT = TypeVar("KT") variable 88 self, key: KT, dict_keys: Optional[Iterable[DKT]] = None 115 def invalidate(self, key: KT) -> None: 131 key: KT, 158 self, key: KT, value: Dict[DKT, DV], known_absent: Iterable[DKT] 168 def _insert(self, key: KT, value: Dict[DKT, DV], known_absent: Set[DKT]) -> None:
|
H A D | deferred_cache.py | 48 KT = TypeVar("KT") variable 138 key: KT, 180 self, key: KT, default: T, update_metrics: bool = True 187 key: KT, 294 self, key: KT, value: VT, callback: Optional[Callable[[], None]] = None 299 def invalidate(self, key: KT) -> None:
|
/dports/devel/py-immutables/immutables-0.16/immutables/ |
H A D | _protocols.py | 24 KT = TypeVar('KT', bound=Hashable) variable 52 def set(self, key: KT, val: VT) -> None: ... 56 def __delitem__(self, key: KT) -> None: ... 57 def __setitem__(self, key: KT, val: VT) -> None: ... 59 def pop(self, __key: KT) -> VT: ... 61 def pop(self, __key: KT, __default: T) -> Union[VT, T]: ... 63 def get(self, key: KT) -> Optional[VT]: ... 65 def get(self, key: KT, default: Union[VT, T]) -> Union[VT, T]: ... 66 def __getitem__(self, key: KT) -> VT: ... 72 __col: Union[IterableItems[KT, VT], Iterable[Tuple[KT, VT]]] [all …]
|
/dports/www/mitmproxy/mitmproxy-7.0.4/mitmproxy/coretypes/ |
H A D | multidict.py | 12 KT = TypeVar('KT') variable 46 def _kconv(key: KT) -> KT: 52 def __getitem__(self, key: KT) -> VT: 58 def __setitem__(self, key: KT, value: VT) -> None: 61 def __delitem__(self, key: KT) -> None: 86 def get_all(self, key: KT) -> List[VT]: 98 def set_all(self, key: KT, values: List[VT]) -> None: 119 def add(self, key: KT, value: VT) -> None: 125 def insert(self, index: int, key: KT, value: VT) -> None:
|
/dports/math/parmetis/parmetis-4.0.3/metis/GKlib/ |
H A D | gk_mkpqueue.h | 15 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 413 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 16 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 203 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/GKlib/ |
H A D | gk_mkpqueue.h | 15 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 413 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 16 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 203 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/GKlib/ |
H A D | gk_mkpqueue.h | 15 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 413 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 16 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 203 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/GKlib/ |
H A D | gk_mkpqueue.h | 15 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 413 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 16 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 203 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/GKlib/ |
H A D | gk_mkpqueue.h | 14 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 412 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 15 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 202 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/math/metis/metis-5.1.0/GKlib/ |
H A D | gk_mkpqueue.h | 15 #define GK_MKPQUEUE(FPRFX, PQT, KVT, KT, VT, KVMALLOC, KMAX, KEY_LT)\ argument 413 #define GK_MKPQUEUE_PROTO(FPRFX, PQT, KT, VT)\ argument
|
H A D | gk_mkpqueue2.h | 16 #define GK_MKPQUEUE2(FPRFX, PQT, KT, VT, KMALLOC, VMALLOC, KMAX, KEY_LT)\ argument 203 #define GK_MKPQUEUE2_PROTO(FPRFX, PQT, KT, VT)\ argument
|
/dports/devel/py-pyrsistent/pyrsistent-0.14.11/pyrsistent/ |
H A D | typing.py | 28 KT = TypeVar('KT') variable
|