perf: further improve performance of precompute

[triceo]

The update queue does deduplicate the updates.
But we can skip iterating the entire collection, if we've already been over it once.

Another small bump in CS performance.

@Christopher-Chianelli Approach this with caution. I have seen this skip the collection more often than it iterates over it, but for that, the performance improvement is very small. There may be something I do not understand about this code.

[zepfred]

I have a few minor suggestions for the hash logic to align it with Objects::hash.

[triceo]

I removed all unrelated hashing changes.

[Copilot]

Pull request overview

This PR introduces a performance optimization for the precompute operation in the Bavet constraint solver by adding deduplication tracking to avoid redundantly iterating over tuple collections when the same object is updated multiple times within a single propagation cycle. Additionally, it includes minor code style improvements and an optimization to remove entries with empty tuple lists rather than storing them.

• Adds alreadyUpdatingMap to track objects already processed in the current update cycle
• Optimizes storage by removing empty mappings instead of storing empty lists
• Standardizes code formatting across method signatures

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

[sonarqubecloud]

Quality Gate passed

Issues
0 New issues
0 Accepted issues

Measures
0 Security Hotspots
100.0% Coverage on New Code
0.0% Duplication on New Code

See analysis details on SonarQube Cloud

[zepfred]

I removed all unrelated hashing changes.

Okay, I'll skip the review then.