diff options
| author | Matthew Lugg <mlugg@mlugg.co.uk> | 2025-10-20 11:00:24 +0100 |
|---|---|---|
| committer | Matthew Lugg <mlugg@mlugg.co.uk> | 2025-10-29 05:34:19 +0000 |
| commit | 8907dc8a4fbec951e4a4d3266aded9d751f07c4e (patch) | |
| tree | 0f17d870bde7af4438d1f93ee11fcd904713e204 /lib/std/Thread/RwLock.zig | |
| parent | 4e9dd099c5d624b101222bfc4e6f415b5375f8d7 (diff) | |
| download | zig-8907dc8a4fbec951e4a4d3266aded9d751f07c4e.tar.gz zig-8907dc8a4fbec951e4a4d3266aded9d751f07c4e.zip | |
Zcu: use shortest reference trace
The logic for computing reference traces was unintentionally finding the
*longest* possible trace (approximately). I think I already tried to fix
this before, but misunderstood how my own code works. Here, we fix it
properly: by slightly reworking the logic to use one ArrayHashMap for
both the result and the traversal queue, we trivially get a proper
breadth-first traversal so that we can find the shortest possible
reference trace for every referenced unit.
Diffstat (limited to 'lib/std/Thread/RwLock.zig')
0 files changed, 0 insertions, 0 deletions