&GRBE@sodZddlZddlZddlZddlZddlZddlZddlZddlm Z ej ddkZ e re Z ee ese jZ ne dZe dZe dZeZeZneZeeZZeZeZdd Zd d Zd d ZddZddZGdddZGdddeZGdddeZ dS)z Module yoton.misc Defines a few basic constants, classes and functions. Most importantly, it defines a couple of specific buffer classes that are used for the low-level messaging. N)dequestrZunicodexrangecCsd}|}t|ts-tdni|jd6}xA|jD]3}||krm|||| (protocol, hostname, port) Split address in protocol, hostname and port. The address has the following format: "protocol://hostname:port". If the protocol is omitted, TCP is assumed. The hostname is the name or ip-address of the computer to connect to. One can use "localhost" for a connection that bypasses some network layers (and is not visible from the outside). One can use "publichost" for a connection at the current computers IP address that is visible from the outside. The port can be an integer, or a sting. In the latter case the integer port number is calculated using a hash. One can also use "portname+offset" to specify an integer offset for the port number. zAddress should be a string.:z(Address should be in format 'host:port'.rz://rZtcpZ localhostz 127.0.0.1Z publichost0 NZ 0123456789rz,Invalid index (%i) in public host addresses.+zInvalid offset in addressz(The port must be in the range [0, 2^16>.Z publichost0i) r basestringrsplitlowertuple startswithintsocketZ gethostnameZgethostbyname_ex IndexErrorr2)ZaddressZprotocoltmphostZportindexZhostnamer.rrr split_addresssP      +      rDc@sseZdZdZdZdddZddZdd Zd d Zd d Z ddZ ddZ dS)UIDzH UID Represents an 8-byte (64 bit) Unique Identifier. rNcCsh|dkr7|jd>|_|j|j7_n-t|ttfrX||_n tddS)N z'The id given to UID() should be an int.) _get_time_int_nr_get_random_intr r>longr)selfidrrr__init__s   z UID.__init__cCs.|j}d|dd|ddfS)Nz r&)get_hex)rKhrrr__repr__s z UID.__repr__cCs>t|j}|ddjd}|jdd}|S)z get_hex() Get the hexadecimal representation of this UID. The returned string is 16 characters long. rNLr&r5r8)hexrHrstripljust)rKrOrrrrNsz UID.get_hexcCstjd|jS)zE get_bytes() Get the UID as bytes. ztimerE_last_timestamp)rKZ timestamprrrrGs    zUID._get_time_int) __name__ __module__ __qualname__r rZrMrPrNrVrWrIrGrrrrrEs     rEc@seZdZdZGdddeZdddZddZd d Zd d Z d dZ dddZ dddZ ddZ ddZdS) PackageQueuea] PackageQueue(N, discard_mode='old') A queue implementation that can be used in blocking and non-blocking mode and allows peeking. The queue has a limited size. The user can specify whether old or new messages should be discarted. Uses a deque object for the queue and a threading.Condition for the blocking. c@seZdZddZdS)zPackageQueue.EmptycCstj|ddS)Nzpop from an empty PackageQueue) ExceptionrM)rKrrrrM7szPackageQueue.Empty.__init__N)r[r\r]rMrrrrEmpty6s  r`oldcCsvt|_tj|_t||_|j}|dkrNd|_n$|dkrfd|_n t ddS)Nrar4newrzInvalid discard mode.) r_q threadingZ Condition _conditionr>_maxlenr; _discard_moder)rKN discard_moderrrrM<s      zPackageQueue.__init__cCst||jkS)z full() Returns True if the number of elements is at its maximum right now. Note that in theory, another thread might pop an element right after this function returns. )r*rf)rKrrrfullOszPackageQueue.fullcCst|dkS)z empty() Returns True if the number of elements is zero right now. Note that in theory, another thread might add an element right after this function returns. r)r*)rKrrremptyZszPackageQueue.emptyc Cs|j}|jzw|j}t||jkrN|j||jn;|jdkrw|j|j|n|jdkrnWd|j XdS)z push(item) Add an item to the queue. If the queue is full, the oldest item in the queue, or the given item is discarted. r4rN) reacquirercr*rfappendnotifyrgpopleftrelease)rKx conditionqrrrpushes      zPackageQueue.pushc CsC|j}|jz|jj||jWd|jXdS)a  insert(x) Insert an item at the front of the queue. A call to pop() will get this item first. This should be used in rare circumstances to give an item priority. This method never causes items to be discarted. N)rerlrcZ appendleftrnrp)rKrqrrrrrinserts  zPackageQueue.insertTc Cs|j}|jz|j}|sCt|s|jqn|dkroxrt|sk|jqRWnUt|trt|s|j|t|s|jqqn td|j SWd|j XdS)a pop(block=True) Pop the oldest item from the queue. If there are no items in the queue: * the calling thread is blocked until an item is available (if block=True, default); * an PackageQueue.Empty exception is raised (if block=False); * the calling thread is blocked for 'block' seconds (if block is a float). Tz.Invalid value for block in PackageQueue.pop().N) rerlrcr*r`waitr floatrrorp)rKblockrrrsrrrpops$         zPackageQueue.poprcCs |j|S)ac peek(index=0) Get an item from the queue without popping it. index=0 gets the oldest item, index=-1 gets the newest item. Note that index access slows to O(n) time in the middle of the queue (due to the undelying deque object). Raises an IndexError if the index is out of range. )rc)rKrCrrrpeeks zPackageQueue.peekcCs |jjS)N)rc__len__)rKrrrr{szPackageQueue.__len__c Cs3|jjz|jjWd|jjXdS)zL clear() Remove all items from the queue. N)rerlrcclearrp)rKrrrr|s zPackageQueue.clearN)r[r\r]r r_r`rMrjrkrtruryrzr{r|rrrrr^*s   * r^c@sOeZdZdZddddZddZdd d Zd d Zd S)TinyPackageQueueap TinyPackageQueue(N1, N2, discard_mode='old', timeout=1.0) A queue implementation that can be used in blocking and non-blocking mode and allows peeking. The queue has a tiny-size (N1). When this size is reached, a call to push() blocks for up to timeout seconds. The real size (N2) is the same as in the PackageQueue class. The tinysize mechanism can be used to semi-synchronize a consumer and a producer, while still having a small queue and without having the consumer fully block. Uses a deque object for the queue and a threading.Condition for the blocking. rag?cCs/tj|||t||_||_dS)N)r^rMr>_tinylen_timeout)rKZN1ZN2riZtimeoutrrrrMszTinyPackageQueue.__init__c Cs|j}|jz|j}t|}||jkrT|j||jnj||jkr|j|j |j|n;|j dkr|j |j|n|j dkrnWd|j XdS)z push(item) Add an item to the queue. If the queue has >= n1 values, this function will block timeout seconds, or until an item is popped from another thread. r4rN) rerlrcr*r~rmrnrfrvrrgrorp)rKrqrrrslqrrrrts"       zTinyPackageQueue.pushTc Cs|j}|jz|j}|sCt|s|jqn|dkroxrt|sk|jqRWnUt|trt|s|j|t|s|jqqn tdt||j kr|j n|j SWd|j XdS)a pop(block=True) Pop the oldest item from the queue. If there are no items in the queue: * the calling thread is blocked until an item is available (if block=True, default); * a PackageQueue.Empty exception is raised (if block=False); * the calling thread is blocked for 'block' seconds (if block is a float). Tz.Invalid value for block in PackageQueue.pop().N) rerlrcr*r`rvr rwrr~Z notifyAllrorp)rKrxrrrsrrrrys(          zTinyPackageQueue.popc Csa|jjz?t|j}|jj||jkrK|jjnWd|jjXdS)zL clear() Remove all items from the queue. N)rerlr*rcr|r~rnrp)rKrrrrr|Ms  zTinyPackageQueue.clearN)r[r\r]r rMrtryr|rrrrr}s  #/r})!r osrrYrUr?rdrXZ collectionsr version_infoZV2 __builtins__rr r __dict__bytesrrr9rJr>rangerr%r0r2rDrEobjectr^r}rrrrs8$           "    RI