Helper: compute character bigrams for Jaccard similarity
(s: &str)
| 644 | |
| 645 | // Helper: compute character bigrams for Jaccard similarity |
| 646 | fn bigrams(s: &str) -> HashSet<(u8, u8)> { |
| 647 | let bytes = s.trim().as_bytes(); |
| 648 | let mut set = HashSet::new(); |
| 649 | if bytes.len() >= 2 { |
| 650 | for w in bytes.windows(2) { |
| 651 | set.insert((w[0], w[1])); |
| 652 | } |
| 653 | } |
| 654 | set |
| 655 | } |
| 656 | |
| 657 | fn jaccard(a: &HashSet<(u8, u8)>, b: &HashSet<(u8, u8)>) -> f64 { |
| 658 | if a.is_empty() && b.is_empty() { |