wait () # The wait method releases the internal lock and the thread is suspended. It is not difficult to understand the synchronization primitive mechanism, design the logic sequence of program execution (where blocking occurs and where wake up) self.

_ queue) = 0: # When the number of data in the queue is 0, it is not difficult to block the thread and implement the thread-Safe Container.

every y () # Wake up a suspended thread self. The default structure is the small top heap self. condition () def push (self, item, priority): self. name) class PriorityQueue: def _ init _ (self): self. name = name def _ repr _ (self): return 'item ()'. Based on this synchronization primitive, I implemented a simple thread-safe priority queue: Import heapqimport threading # import timeclass Item: def _ init _ (self, name): self. In fact, it is just a simple method to call the corresponding methods of the internal wretched objects. Condition also provides the acquire and release methods, which have the same meaning as the wretched acquire and release methods.

It can be passed as a parameter when a Condigtion object is created. Condition maintains a wretched object internally (RLock by default). It provides more advanced features than Lock and RLock, allowing us to control complicated thread synchronization problems. Conditional-based thread-safe priority queue (implemented in python) and conditionpythonĬondiftion can be understood as an advanced feature.

Priority queue python thread safe