algs4 0.7.0

Algorithms, 4ed. MOOC in Coursera. in Rust.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

// http://coursera.cs.princeton.edu/algs4/assignments/kdtree.html
extern crate algs4;
extern crate rand;

use std::io::prelude::*;
use std::io;

use algs4::fundamentals::primitive::{Point2D, PointSet, RectHV};
use algs4::searching::ST;
// FIXME: fails under input1M.txt
use algs4::geometric_search::kd_tree::KdTree;


fn run() {
    let mut pset = PointSet::new();
    let mut kt: KdTree<Point2D,()> = KdTree::new();

    let npoints = io::BufReader::new(io::stdin())
        .lines()
        .map(|line| line.unwrap().split(' ')
             .map(|xy| xy.parse::<f64>().unwrap())
             .collect::<Vec<f64>>())
        .map(|pt| {
            pset.insert(Point2D::new(pt[0], pt[1]));
            kt.insert(Point2D::new(pt[0], pt[1]));
        })
        .count();

    println!("got {} points", npoints);
    let point: Point2D = Point2D::new(0.9, 0.6);
    let rect = RectHV::new(0.4, 0.4, 0.6, 0.6);

    println!("in rect {}", rect);
    println!("PointSet => {}", pset.range_count(rect));
    println!("KdTree   => {}",   kt.range_count(rect));

    println!("nearest to {}", point);
    println!("PointSet => {:?} d = {}", pset.nearest(point), pset.nearest(point).unwrap().distance_to(point));
    println!("KdTree   => {:?} d = {}", kt.nearest(point), kt.nearest(point).unwrap().distance_to(point));
}


fn main() {
    run();
}