2d8f1df293
This minimizes the thread usage, particularly during online actions such as moving items and routing. UpdateRatsnest: Minimized the number of atomics by utilizing future promise. Avoided updating node-less nets. Node-less nets are common in the dynamic ratsnest because the net vector is created from the board nets by value but only populated with a subset. So the dynamic ratsnest calculation always saw every net as dirty and spun up extra threads. searchConnections: ParallelThreadCount is no longer lower bounded. Small item counts are handled inline rather than with a separate thread. |
||
|---|---|---|
| .. | ||
| CMakeLists.txt | ||
| connectivity_algo.cpp | ||
| connectivity_algo.h | ||
| connectivity_data.cpp | ||
| connectivity_data.h | ||
| connectivity_items.cpp | ||
| connectivity_items.h | ||
| connectivity_rtree.h | ||