f3fi#*dZddlmZmZddlmZmZmZddlm Z m Z m Z ddl m Z ddlmZddlmZe dZe d ZGd d ee eefZeeefZGd d eeefe eZGddee ZGddeeZGddeZy)z**Store** implements the key-value stores and storage helpers. Module provides implementations of various key-value stores that conform to a simple key-value interface. The primary goal of these storages is to support implementation of caching. )ABCabstractmethod) AsyncIteratorIteratorSequence)AnyGenericTypeVar)override)LangChainException)run_in_executorKVcDeZdZdZedeedeedzfdZ deedeedzfdZ edee eefddfdZ dee eefddfd Z edeeddfd Zdeeddfd Zedd d edzdeeeezfdZdd d edzdeeeezfdZy) BaseStoreawAbstract interface for a key-value store. This is an interface that's meant to abstract away the details of different key-value stores. It provides a simple interface for getting, setting, and deleting key-value pairs. The basic methods are `mget`, `mset`, and `mdelete` for getting, setting, and deleting multiple key-value pairs at once. The `yield_keys` method is used to iterate over keys that match a given prefix. The async versions of these methods are also provided, which are meant to be used in async contexts. The async methods are named with an `a` prefix, e.g., `amget`, `amset`, `amdelete`, and `ayield_keys`. By default, the `amget`, `amset`, `amdelete`, and `ayield_keys` methods are implemented using the synchronous methods. If the store can natively support async operations, it should override these methods. By design the methods only accept batches of keys and values, and not single keys or values. This is done to force user code to work with batches which will usually be more efficient by saving on round trips to the store. Examples: ```python from langchain.storage import BaseStore class MyInMemoryStore(BaseStore[str, int]): def __init__(self) -> None: self.store: dict[str, int] = {} def mget(self, keys: Sequence[str]) -> list[int | None]: return [self.store.get(key) for key in keys] def mset(self, key_value_pairs: Sequence[tuple[str, int]]) -> None: for key, value in key_value_pairs: self.store[key] = value def mdelete(self, keys: Sequence[str]) -> None: for key in keys: if key in self.store: del self.store[key] def yield_keys(self, prefix: str | None = None) -> Iterator[str]: if prefix is None: yield from self.store.keys() else: for key in self.store.keys(): if key.startswith(prefix): yield key ``` keysreturnNcy)a Get the values associated with the given keys. Args: keys: A sequence of keys. Returns: A sequence of optional values associated with the keys. If a key is not found, the corresponding value will be `None`. Nselfrs S/var/www/auto_recruiter/arenv/lib/python3.12/site-packages/langchain_core/stores.pymgetzBaseStore.mgetPcLKtd|j|d{S7w)aAsync get the values associated with the given keys. Args: keys: A sequence of keys. Returns: A sequence of optional values associated with the keys. If a key is not found, the corresponding value will be `None`. N)r rrs ramgetzBaseStore.amget\s!%T499d;;;; $"$key_value_pairscy)zvSet the values for the given keys. Args: key_value_pairs: A sequence of key-value pairs. Nrrrs rmsetzBaseStore.msethrrcLKtd|j|d{S7w)z|Async set the values for the given keys. Args: key_value_pairs: A sequence of key-value pairs. N)r r"r!s ramsetzBaseStore.amsetps! %T499oFFFFrcy)zzDelete the given keys and their associated values. Args: keys: A sequence of keys to delete. Nrrs rmdeletezBaseStore.mdeletexrrcLKtd|j|d{S7w)zAsync delete the given keys and their associated values. Args: keys: A sequence of keys to delete. N)r r&rs ramdeletezBaseStore.amdeletes! %T4<<>>>>rprefixr*cy)aYGet an iterator over keys that match the given prefix. Args: prefix: The prefix to match. Yields: An iterator over keys that match the given prefix. This method is allowed to return an iterator over either K or str depending on what makes more sense for the given store. Nr)rr*s r yield_keyszBaseStore.yield_keysrrcKtd|j|d{}t tdfd|d{}|ury|#727w)aRAsync get an iterator over keys that match the given prefix. Args: prefix: The prefix to match. Yields: The keys that match the given prefix. This method is allowed to return an iterator over either K or str depending on what makes more sense for the given store. Nr)ct|SN)next)itdones rz'BaseStore.ayield_keys..s $r4.r)r r,object)rr*iteratoritemr2s @r ayield_keyszBaseStore.ayield_keyss[)tvNNx(/H(SSDt|J OTs!AA"AAAA)__name__ __module__ __qualname____doc__rrrlistrrrtupler"r$r&r(strrr,rr7rrrrrsH3j  !  a$h     < <QX < HU1a4[$9 d  G8E!Q$K+@GTG HQK D  ?8A;?4?15  C$J  (1+QT :U    '+t q M#. .rrc@eZdZdZddZedeedee dzfdZ edeedee dzfdZ edee ee fddfd Z edee ee fddfd Zedeeddfd Zedeeddfd Zdd edzdeefdZdd edzdeefdZy)InMemoryBaseStorez=In-memory implementation of the BaseStore using a dictionary.rNci|_y)zInitialize an empty store.Nstore)rs r__init__zInMemoryBaseStore.__init__s #% rrc^|Dcgc]}|jj|c}Scc}wr/)rCgetrrkeys rrzInMemoryBaseStore.mgets#/34 s#444s"*c,K|j|Swr/)rrs rrzInMemoryBaseStore.amgetsyyrc6|D]\}}||j|<yr/rB)rrrHvalues rr"zInMemoryBaseStore.msets") $JC#DJJsO $rc,K|j|Swr/)r"r!s rr$zInMemoryBaseStore.amsetsyy))rJcJ|D]}||jvs|j|= yr/rBrGs rr&zInMemoryBaseStore.mdeletes( $Cdjj JJsO $rc.K|j|ywr/)r&rs rr(zInMemoryBaseStore.amdeletes Tsr*c#K|#|jjEd{y|jD]}|j|s|y7-w)zGet an iterator over keys that match the given prefix. Args: prefix: The prefix to match. Yields: The keys that match the given prefix. N)rCr startswithrr*rHs rr,zInMemoryBaseStore.yield_keyssJ >zz( ( (zz >>&)I  )s AA%A AcK||jD]}| y|jD]}|j|s|yw)zAsync get an async iterator over keys that match the given prefix. Args: prefix: The prefix to match. Yields: The keys that match the given prefix. N)rCrQrRs rr7zInMemoryBaseStore.ayield_keyssK >zz   zz >>&)I s :AA)rNr/)r8r9r:r;rDr rr>r<rrrr=r"r$r&r(rr,rr7rrrr@r@sGG&5#54D>55 $q4x.$HU36]$;$$$*8E#q&M+B*t**$HSM$d$$ 8C=Ttx} d mC>Prr@ceZdZdZy) InMemoryStoreaIn-memory store for any type of data. Attributes: store: The underlying dictionary that stores the key-value pairs. Examples: ```python from langchain.storage import InMemoryStore store = InMemoryStore() store.mset([("key1", "value1"), ("key2", "value2")]) store.mget(["key1", "key2"]) # ['value1', 'value2'] store.mdelete(["key1"]) list(store.yield_keys()) # ['key2'] list(store.yield_keys(prefix="k")) # ['key2'] ``` Nr8r9r:r;rrrrUrUrrUceZdZdZy)InMemoryByteStoreaIn-memory store for bytes. Attributes: store: The underlying dictionary that stores the key-value pairs. Examples: ```python from langchain.storage import InMemoryByteStore store = InMemoryByteStore() store.mset([("key1", b"value1"), ("key2", b"value2")]) store.mget(["key1", "key2"]) # [b'value1', b'value2'] store.mdelete(["key1"]) list(store.yield_keys()) # ['key2'] list(store.yield_keys(prefix="k")) # ['key2'] ``` NrVrrrrYrY rWrrYceZdZdZy)InvalidKeyExceptionz>Raised when a key is invalid; e.g., uses incorrect characters.NrVrrrr[r[ sHrr[N)r;abcrrcollections.abcrrrtypingrr r typing_extensionsr langchain_core.exceptionsr langchain_core.runnablesr rrrr>bytes ByteStorer@rUrYr[rrrrds$== '84 CL CLNWQT]Nb c5j ! A #q&)71:AH%c*.)%0.I,Ir