perf: Avoid redundant array indexing math in ArenaDictionary probing loop

[myarichuk]

💡 What: Eliminated redundant - 1 calculations inside the ArenaDictionary hash table probing loops. The code now reads the 1-based index from the bucket, subtracts 1 to get the 0-based index (entryIdx), and checks if (entryIdx < 0) to check for empty buckets instead of subtracting 1 multiple times.

🎯 Why: To improve throughput when probing heavily populated maps. Redundant math operations inside tight unrolled inner loops add up.

📊 Measured Improvement: In a local benchmark populating an ArenaDictionary with 500k int64 items and executing 100 iterations of fetching, the runtime dropped from 1529 ms to 1464 ms (~4% improvement), showing a measurable reduction in CPU overhead.

---

PR created automatically by Jules for task 11068783001179753441 started by @myarichuk

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.