^fdZddlmZddlmZddlmZddlmZddl m Z dZ dZ Gd d e ZGd d Zd S)z#Logical Clocks and Synchronization.) annotations)islice) itemgetter)Lock)Any) LamportClock timetuplez0_lamport(clock={0}, timestamp={1}, id={2} {3!r})ceZdZdZdZ ddd ZddZddZddZddZ ddZ ddZ e e dZe e dZe e dZe e dZdS) r a`Tuple of event clock information. Can be used as part of a heap to keep events ordered. Arguments: --------- clock (Optional[int]): Event clock value. timestamp (float): Event UNIX timestamp value. id (str): Event host id (e.g. ``hostname:pid``). obj (Any): Optional obj to associate with this event. Nclock int | None timestampfloatidstrobjrreturnc@t|||||fSN)tuple__new__)clsr rrrs >/var/www/html/env/lib/python3.11/site-packages/kombu/clocks.pyrztimetuple.__new__s!}}S5)R"=>>>ctj|Sr)R_CLOCKformatselfs r__repr__ztimetuple.__repr__#s~t$$rrc t|Sr)rrs r__getnewargs__ztimetuple.__getnewargs__&sT{{rotherboolc |d|d}}|r |r||kr|d|dkS||kS|d|dkS#t$r tcYSwxYw)Nr) IndexErrorNotImplemented)rr#ABs r__lt__ztimetuple.__lt__)s "7E!HqA Q 667U1X--1u 7U1X% % " " "! ! ! ! "s+AAAAAc||kSrr rr#s r__gt__ztimetuple.__gt__6s t|rc||k Srr r.s r__le__ztimetuple.__le__9s4<rc||k Srr r.s r__ge__ztimetuple.__ge__<s%<rrr'r&r) r r rrrrrrrr rr)rr)r#rrr$)__name__ __module__ __qualname____doc__ __slots__rr r"r,r/r1r3propertyrr rrrr rrr r s  IGK????? %%%% " " " "         HZZ]] # #EA''I **Q-- B (::a== ! !CCCrr cLeZdZdZdZdefdd Zdd Zdd ZddZ ddZ ddZ dS)raLamport's logical clock. From Wikipedia: A Lamport logical clock is a monotonically incrementing software counter maintained in each process. It follows some simple rules: * A process increments its counter before each event in that process; * When a process sends a message, it includes its counter value with the message; * On receiving a message, the receiver process sets its counter to be greater than the maximum of its own value and the received value before it considers the message received. Conceptually, this logical clock can be thought of as a clock that only has meaning in relation to messages moving between processes. When a process receives a message, it resynchronizes its logical clock with the sender. See Also -------- * `Lamport timestamps`_ * `Lamports distributed mutex`_ .. _`Lamport Timestamps`: https://en.wikipedia.org/wiki/Lamport_timestamps .. _`Lamports distributed mutex`: https://bit.ly/p99ybE *Usage* When sending a message use :meth:`forward` to increment the clock, when receiving a message use :meth:`adjust` to sync with the time stamp of the incoming message. r initial_valueintr type[Lock]rNonec2||_||_dSr)valuemutex)rr=rs r__init__zLamportClock.__init__ms# TVV rr#c|j5t|j|dzx}|_|cdddS#1swxYwYdSNr')rCmaxrB)rr#rBs radjustzLamportClock.adjustss Z  !$TZ!7!7!!; ;EDJ                  s !6::cr|j5|xjdz c_|jcdddS#1swxYwYdSrF)rCrBrs rforwardzLamportClock.forwardxs Z   JJ!OJJ:                  s ,00hlist[tuple[int, str]]tuple[int, str]c<|dd|ddkrwg}t|t|ddD]=}|dd|ddkrn||d>t|ddS|dS)aSort heap of events. List of tuples containing at least two elements, representing an event, where the first element is the event's scalar clock value, and the second element is the id of the process (usually ``"hostname:pid"``): ``sh([(clock, processid, ...?), (...)])`` The list must already be sorted, which is why we refer to it as a heap. The tuple will not be unpacked, so more than two elements can be present. Will return the latest event. rr'Nc|dSrFr )events rz(LamportClock.sort_heap..s %(r)key)ziprappendsorted)rrKsamePNs r sort_heapzLamportClock.sort_heap}s Q47ad1g  D!VAq$//00 # #a58r!uQx''E BqE""""$$:$:;;;A> >t rrc*t|jSr)rrBrs r__str__zLamportClock.__str__s4:rcd|jdS)Nz)rBrs rr zLamportClock.__repr__s.....rN)r=r>rr?rr@)r#r>rr>)rr>)rKrLrrMr5) r6r7r8r9rBrrDrHrJrXrZr r rrrrEs""J E$%   6//////rrN)r9 __future__r itertoolsroperatorr threadingrtypingr__all__rrr rr rrrcs))"""""" ' <3"3"3"3"3"3"3"3"lW/W/W/W/W/W/W/W/W/W/r