Created
December 12, 2017 04:29
-
-
Save userqq/6d3578d8e33fcee55ae852f8c37ea40d to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
extern crate bk_tree; | |
use bk_tree::{BKTree, Metric}; | |
pub struct Hamming; | |
impl Metric<i64> for Hamming | |
{ | |
fn distance(&self, a: &i64, b: &i64) -> u64 { | |
let mut dh = 0u64; | |
for i in 0..64 { | |
let mut k = (1 << i); | |
if (a & k) != (b & k) { | |
dh += 1; | |
} | |
} | |
dh | |
} | |
} | |
fn main() { | |
let mut tree: BKTree<i64, Hamming> = BKTree::new(Hamming); | |
tree.add(-3572687289547480823i64); | |
tree.add(-8197022089740803831i64); | |
tree.add(-4132236144266432247i64); | |
tree.add(-3717382884479454973i64); | |
tree.add(-2969170184338595071i64); | |
tree.add(853075759859001988i64); | |
tree.add(-4079676741827119093i64); | |
tree.add(-7591000451928546551i64); | |
tree.add(-3571016074831056637i64); | |
for i in tree.find(&-3572687289547480823i64, 10) { | |
println!("{:?}", i); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment