String dims fall back to a deterministic hash bucket. Hilbert/Z-order over strings is inherently lossy — preserves equality, not ordering. Future work may swap in dictionary-based sort-preserving codes.
(v: &str, max: u64)
| 123 | /// over strings is inherently lossy — preserves equality, not ordering. |
| 124 | /// Future work may swap in dictionary-based sort-preserving codes. |
| 125 | fn map_string(v: &str, max: u64) -> u64 { |
| 126 | super::string_hash::hash_string_masked(v, max) |
| 127 | } |
| 128 | |
| 129 | #[cfg(test)] |
| 130 | mod tests { |
no test coverage detected