Improve querying by skipping blocks

[joaosreis]

No description provided.

[Copilot]

Pull request overview

This PR improves query performance by implementing a block-skipping optimization in the queryEntry function. Instead of reading and parsing all entries sequentially until the target is found, the new implementation skips entire chunks (blocks) that cannot contain the target key by examining only the first entry of each chunk. This leverages the fact that entries within a namespace are stored in sorted order across chunks.

Key changes:

• Rewrote queryEntry to directly iterate through file frames and skip chunks based on first-entry comparisons
• Refactored test assertions from explicit bind syntax to the more idiomatic shouldReturn combinator

Reviewed changes

Copilot reviewed 2 out of 2 changed files in this pull request and generated 1 comment.

File	Description
scls-format/src/Cardano/SCLS/Query.hs	Complete rewrite of queryEntry function to implement block-skipping optimization by examining first entry of each matching namespace chunk and only searching within a chunk when the next chunk's first entry exceeds the target key
scls-format/test/QuerySpec.hs	Refactored all test assertions from result <- action; result \shouldBe` expectedpattern to more idiomaticaction `shouldReturn` expected` syntax for improved readability

---

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

[qnikst]

Approved. Though I've added comments about renaming to things