Share primitive binary operand decoding

[connortsui20]

Rationale for this change

Primitive comparison currently imports PrimitiveOperand through numeric execution. This moves the decoder to the binary module so both implementations depend on a neutral location.

Just thought it was weird where it is now

[codspeed-hq]

Merging this PR will improve performance by 13.05%

⚡ 5 improved benchmarks
✅ 1939 untouched benchmarks
⏩ 85 skipped benchmarks¹

Performance Changes

	Mode	Benchmark	BASE	HEAD	Efficiency
⚡	Simulation	take[small_m/shuffled/primitive/nonnull/chunks=1024/indices=1000]	6.4 ms	5.6 ms	+14.52%
⚡	Simulation	take[small_m/shuffled/primitive/nonnull/chunks=1024/indices=256]	2.4 ms	2.1 ms	+14.34%
⚡	Simulation	take[small_m/shuffled/primitive/nonnull/chunks=16384/indices=1000]	10.8 ms	9.6 ms	+13.03%
⚡	Simulation	take[core/shuffled/primitive/nonnull/chunks=1024/indices=10000]	14.8 ms	13.1 ms	+12.28%
⚡	Simulation	decompress[u64, (1000, 16)]	72.2 µs	64.9 µs	+11.1%

Tip

Curious why this is faster? Comment @codspeedbot explain why this is faster on this PR, or directly use the CodSpeed MCP with your agent.

---

_{Comparing ct/primitive-binary-operands (3c1d820) with develop (5794e7d)}

Footnotes

1. 85 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩