| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
| |
queue: Queue now derives from deque directly, which safes one dict lookup as the queue does not need to be accessed through self anymore
pool test improved to better verify threads are started correctly
|
|
|
|
|
|
| |
thread-safe, causing locks to be released multiple times. Now it runs very fast, and very stable apparently.
Now its about putting previous features back in, and studying their results, before more complex task graphs can be examined
|
|
|
|
| |
events only with its queue, with boosts performance into brigt green levels
|
|
|
|
| |
task class
|
|
|
|
| |
havok - lets call this a safe-state
|
|
|
|
| |
least in tests, and with multiple threads. There is still an sync bug in regard to closed channels to be fixed, as the Task.set_done handling is incorrecft
|
|
|
|
|
|
| |
changing tasks
Now processing more items to test performance, in dual-threaded mode as well, and its rather bad, have to figure out the reason for this, probably gil, but queues could help
|
|
|
|
|
|
| |
multiple connected pools
Reduced waiting time in tests to make them complete faster
|
|
|
|
| |
single task for now, but next up are dependent tasks
|
|
|
|
| |
including own tests, their design improved to prepare them for some specifics that would be needed for multiprocessing support
|
|
|
|
|
|
|
| |
is handled by the task system
graph: implemented it including test according to the pools requirements
pool: implemented set_pool_size
|
|
going on. The default implementation uses threads, which ends up being nothing more than async, as they are all locked down by internal and the global interpreter lock
|