You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@iceberg.apache.org by "JeonDaehong (via GitHub)" <gi...@apache.org> on 2026/10/04 11:51:09 UTC

Re: [PR] Core: Interleave Z-order bits a byte at a time with a lookup table [iceberg]

JeonDaehong commented on PR #17774:
URL: https://github.com/apache/iceberg/pull/17774#issuecomment-5979630199

   Since you mentioned having some doubts about the math, I compared this PR against the old bit-at-a-time implementation from `main` in a throwaway test.
   
   * **Every single-bit input:** 1–10 columns, 1–16 bytes per input, and every possible output size. Since both implementations move each input bit to exactly one output bit, this covers the complete mapping space. **4,607,680 cases, 0 differences.**
   * **Random and patterned bytes** (`0x00`, `0xFF`, `0x80`, etc.): 1–10 columns, 1–17 bytes, every truncated output size, with a reused buffer pre-filled with garbage. **504,900 cases, 0 differences.**
   
   Hope this helps.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@iceberg.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@iceberg.apache.org
For additional commands, e-mail: issues-help@iceberg.apache.org