leerho commented on issue #28: URL: https://github.com/apache/datasketches-rust/issues/28#issuecomment-3673057220
1) The CPC sketch uses a custom 12 length-limited Huffman code. Even if you could prove that the byte probabilities would be the same the sequence would be entirely different so a LE platform would not be able to make sense of the output of a BE platform. These algorithms only look at sequences of bytes and ignore multi-byte primitive boundaries. 2) The Theta sketch has a optional compression algorithm based on the number of leading zeros. Of course "leading zeros" are reversed on a BE platform. It would take some hair-tearing work get this to be transparent across LE/BE platforms. -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
