g3fix) dZddlmZddlmZmZmZmZmZm Z ddl m Z ddl m Z ddlmZmZmZmZmZddlmZddlmZed ZeZed d efd eedeezdeeezdzfdZGddZd eedeedeeede edeedff dZGddeeZeZ Gdde Z!de"deedeeefdZ#y)zAsynchronous iterator utilities. Adapted from https://github.com/maxfischer2781/asyncstdlib/blob/master/asyncstdlib/itertools.py MIT License. )deque)AsyncGenerator AsyncIterable AsyncIterator AwaitableCallableIterator)AbstractAsyncContextManager) TracebackType)AnyGenericTypeVarcastoverload)override) deprecatedTz1.1.2z2.0.0)sinceremovaliteratordefaultreturnNc tdtjt urSdt tzffd }|S#t$r}d}t ||d}~wwxYw)aPure-Python implementation of anext() for testing purposes. Closely matches the builtin anext() C implementation. Can be used to compare the built-in implementation of the inner coroutines machinery to C-implementation of __anext__() and send() or throw() on the returned generator. Args: iterator: The async iterator to advance. default: The value to return if the iterator is exhausted. If not provided, a StopAsyncIteration exception is raised. Returns: The next value from the iterator, or the default value if the iterator is exhausted. Raises: TypeError: If the iterator is not an async iterator. z*Callable[[AsyncIterator[T]], Awaitable[T]]z is not an async iteratorNrcTK d{S7#t$rcYSwxYwwN)StopAsyncIteration) __anext__rrsX/var/www/auto_recruiter/arenv/lib/python3.12/site-packages/langchain_core/utils/aiter.py anext_implzpy_anext..anext_implGs2  #8,, ,,! N s(( ( %(%()rtyperAttributeError TypeError _no_defaultrr )rremsgrrs`` @rpy_anextr&%s{.$ 8$x.:R:R +"" a#g  <% $ 56n!#$sA A/A**A/cHeZdZdZd dZdeedzdedzdedzdefdZ y) NoLockz@Dummy lock that provides the proper interface but no protection.rNc Kyw)z Do nothing.Nselfs r __aenter__zNoLock.__aenter__Xsexc_typeexc_valexc_tbc Kyw)z'Return False, exception not suppressed.Fr*r,r/r0r1s r __aexit__zNoLock.__aexit__[s r.rN) __name__ __module__ __qualname____doc__r-r BaseExceptionr boolr4r*rr(r(UsIJ}%,%$   r<r(bufferpeerslockc K |s\|4d{|r dddd{" t|d{}|D]}|j| dddd{|jr7i7X7E#t$rYdddd{7nwxYw7>#1d{7swYNxYw |4d{7t |D]\}}||us |j |n|s%t |dr|jd{7dddd{7y#1d{7swYyxYw#|4d{7t |D]\}}||us |j |n|s%t |dr|jd{7dddd{7w#1d{7swYwxYwxYww)aAn individual iterator of a `tee`. This function is a generator that yields items from the shared iterator `iterator`. It buffers items until the least advanced iterator has yielded them as well. The buffer is shared with all other peers. Args: iterator: The shared iterator. buffer: The buffer for this peer. peers: The buffers of all peers. lock: The lock to synchronise access to the shared buffers. Yields: The next item from the shared iterator. Naclose)anextappendrpopleft enumeratepophasattrrA)rr=r>r?item peer_bufferidxs rtee_peerrKes.(55 555 5%*8_4,15K'..t4555".." "'55 5-55555555& ( ($-e$4  [&(IIcN  WXx8oo''' ( ( ( ( (4 ( ($-e$4  [&(IIcN  WXx8oo''' ( ( ( ( (sPG D9A7D9B D9A9D9A=A;A=B D9BD99D9;A== BB D9BD9BBD9B1%B( &B1-D95G;B><GD$5D$ D D$ GD G$D6*D- +D62G9F>E F>F)5F)F F) F>"F%#F>)F; /F20F; 7F>>Gc eZdZdZ ddddeededeedzfdZ defd Z e d edeefd Z e d e deeed ffd Z d ee zdeeeeed fzfdZ deeefdZddZdeedzdedzdedzdefdZddZy)TeeaCreate `n` separate asynchronous iterators over `iterable`. This splits a single `iterable` into multiple iterators, each providing the same items in the same order. All child iterators may advance separately but share the same items from `iterable` -- when the most advanced iterator retrieves an item, it is buffered until the least advanced iterator has yielded it as well. A `tee` works lazily and can handle an infinite `iterable`, provided that all iterators advance. ```python async def derivative(sensor_data): previous, current = a.tee(sensor_data, n=2) await a.anext(previous) # advance one iterator return a.map(operator.sub, previous, current) ``` Unlike `itertools.tee`, `.tee` returns a custom type instead of a :py`tuple`. Like a tuple, it can be indexed, iterated and unpacked to get the child iterators. In addition, its `.tee.aclose` method immediately closes all children, and it can be used in an `async with` context for the same effect. If `iterable` is an iterator and read elsewhere, `tee` will *not* provide these items. Also, `tee` must internally buffer each item until the last iterator has yielded it; if the most and least advanced iterator differ by most data, using a :py`list` is more efficient (but not lazy). If the underlying iterable is concurrency safe (`anext` may be awaited concurrently) the resulting iterators are concurrency safe as well. Otherwise, the iterators are safe if there is only ever one single "most advanced" iterator. To enforce sequential use of `anext`, provide a `lock` - e.g. an :py`asyncio.Lock` instance in an :py:mod:`asyncio` application - and access is automatically synchronised. N)r?iterablenr?c|j_t|Dcgc] }tc}_t fdjD_ycc}w)zCreate a `tee`. Args: iterable: The iterable to split. n: The number of iterators to create. lock: The lock to synchronise access to the shared buffers. c3|K|]3}tj|jn t5yw)N)rr=r>r?)rK _iterator_buffersr().0r=r?r,s r zTee.__init__..sB  mm!-T68    s9<N) __aiter__rRrangerrStuple _children)r,rNrOr?_s` ` r__init__z Tee.__init__sR"++-:?((CQ(C  --  )DsA#rc,t|jS)z%Return the number of child iterators.)lenrYr+s r__len__z Tee.__len__s4>>""r<rHcyrr*r,rHs r __getitem__zTee.__getitem__s:=r<.cyrr*r`s rrazTee.__getitem__sHKr<c |j|S)z:Return the child iterator(s) for the given index or slice.rYr`s rrazTee.__getitem__s~~d##r<c#8K|jEd{y7w)z\Iterate over the child iterators. Yields: The child iterators. Nrdr+s r__iter__z Tee.__iter__s >>!!s cK|Sw)zReturn the tee instance.r*r+s rr-zTee.__aenter__s  sr/r0r1c@K|jd{y7w)zcClose all child iterators. Returns: False, exceptions not suppressed. NF)rAr3s rr4z Tee.__aexit__skkm s cbK|jD]}|jd{y7w)z Async close all child iterators.N)rYrA)r,childs rrAz Tee.acloses+^^ !E,,.  ! s #/-/))rzTee[T]r5)r6r7r8r9rrintr r r[r^rraslicerXr rfr-r r:r r;r4rAr*r<rrMrMs*#P 9=  "   *#.5  6##== a(8== KK% a0@#0E*FKK$%K$ q E-"2C"78 8$ "(=#34" }%, % $   !r<rMc eZdZdZdeeefeezddfdZedeeefeezfdZ ede e dzde dzd e dzddfd Z y) aclosingaiAsync context manager to wrap an AsyncGenerator that has a `aclose()` method. Code like this: ```python async with aclosing(.fetch()) as agen: ``` is equivalent to this: ```python agen = .fetch() try: finally: await agen.aclose() ``` thingrNc||_y)z\Create the context manager. Args: thing: The resource to wrap. Nrp)r,rps rr[zaclosing.__init__'s  r<c"K|jSwrrrr+s rr-zaclosing.__aenter__/szzs r/ exc_value tracebackcKt|jdr#|jjd{yy7w)NrA)rGrprA)r,r/rtrus rr4zaclosing.__aexit__3s4 4::x (**##% % % ) %s 4?=?)r6r7r8r9rr rr[rr-r r:r r4r*r<rroros*nS#X6s9KKPT.c":]3=O"O&}%,&!4'&!4' &  &&r<rosizerNcKg}|23d{}t||kr|j|t||k\s7|g}?7:6|r|yyw)zUtility batching function for async iterables. Args: size: The size of the batch. iterable: The async iterable to batch. Yields: The batches. N)r]rC)rwrNbatchelements rabatch_iterater{>saE!g u:  LL ! u: KE    s*AAAA.AAA A)$r9 collectionsrcollections.abcrrrrrr contextlibr typesr typingr r rrrtyping_extensionsrlangchain_core._api.deprecationrrobjectr#r&r(listrKrMateerorlr{r*r<rrsB3'6 CLh  '7+3>,A,)*S,q3w~,,,^   5(A5( !H5( a> 5( &c * 5(AtG5(pn!'!*n!b *&**&Z &q)47r<