Add scoped GPI posting controls and fix CBS cache removal

[zayenz]

Posting propagators during search can leave their global propagator information (GPI) allocated after the space is deleted. Repeated posting can therefore retain information for propagators that no longer exist. Space::NoGPI keeps information for newly posted propagators in the space, so it is released with the space.

The matching Space::UseGPI scope enables global information for selected postings inside a NoGPI scope. This lets the open-cp branch run materialization under NoGPI while allowing users to opt in where they need GPI. Both scopes restore the previous setting when they exit, including on exceptions. The materialization call itself is outside this PR.

Propagators posted under NoGPI retain normal IDs and groups, but their AFC stays zero. Cloning copies their information, and group changes stay local to each space. Rewriting preserves the original propagator's information regardless of the active scope. Ordinary GPI posting remains the default, including in newly cloned spaces.

Support::uptrint_t in support/int-type.hpp centralizes unsigned pointer encodings. It selects std::uintptr_t when available, otherwise the unsigned counterpart of ptrdiff_t, with a compile-time width check. The type is used by pointer helpers, tracing, range-list and view-value graph links, compact-table status, and Gist. Actual pointer differences retain signed types, and the existing tag-output API stays compatible. Support::funmark<2>(p) clears both GPI tag bits; existing calls default to one bit.

Unsigned masks follow Core Guidelines ES.101. Tagging still assumes unused low alignment bits in the target's pointer representation, a limitation discussed in WG21's pointer-tagging proposal. The type comment records that assumption; Debug builds also check that joining a tag does not overwrite set pointer bits.

The no_gpi flag sits after the CBS variable counter to use its alignment padding. On the tested arm64 build, this keeps Space at 296 bytes with CBS enabled. Without CBS, the flag increases Space from 288 to 296 bytes.

This PR also fixes the CBS failure. Cache cleanup erased the current unordered_map entry inside a range loop, then incremented the invalid iterator. The loop now continues with the iterator returned by erase. The regression test reproduces the original assertion and checks all 576 solutions of two independent permutations, with and without GPI. Changelog entries cover both changes.

Validation uses the Gecode test infrastructure:

• Release without CBS: 449 check cases passed.
• Debug with CBS, ASan, and UBSan: 450 check cases and 23 fault cases passed.
• Focused AFC and group tests passed with two iterations, plus the CBS regression where enabled: 14 cases without CBS and 15 with CBS.
• Dense and sparse integer brancher tests passed, including AFC selection. Temporary sanitizer checks exercised both integer selections and the pointer helpers; the fallback also passed 14 AFC/group cases with the test sources recompiled against it.
• Gist node.cpp passed Qt syntax checks with both integer selections. The GUI was not exercised. Selected clang-tidy checks produced no new diagnostics; the five tuple-set diagnostics also reproduce on main.

The AFC benchmarks compare ordinary posting against main (8df771e51a) using matching Release builds without CBS. Each case ran serially with one search thread, one warmup pair, and three measured pairs, alternating execution order. Magic square used a one-million-node budget; QCP used 100,000 nodes. Times include model construction and search.

Workload	Decay	Main median (ms)	PR median (ms)	Median paired PR/main ratio
Magic square, size 7	1.0	1822.844	1814.947	0.9949
Magic square, size 7	0.99	1863.326	1854.863	0.9946
QCP 30-374-1	0.99	4075.854	4072.065	0.9980
QCP 30-375-21	0.95	4518.600	4488.103	0.9982

Search statistics matched in every pair, covering 6.6 million nodes per variant across the measured runs. These four cases show no consistent slowdown. Individual paired ratios ranged from 0.9404 to 1.0284; with three pairs per case, the small median differences do not establish a speedup. Timings include the pointer encoding cleanup.

For reproduction, the common options were -mode stat -threads 1 -solutions 0 -interrupt false, with -branching afc-size for magic square and -branching afc for QCP. Instance, decay, and node limits are given above.