decluster 1.0.18

Iteratively declusters and replaces a randomised set of 2D points until a set is discovered where each point is separated by at least the specified minimum distance.
Documentation 
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

//! A 2D point representing a location in a results space.

use rand::Rng;
/// A 2D point representing a location in a results space.
pub struct Point {
    pub x: f64,
    pub y: f64,
    pub retain: bool,
}

impl Point {
    /**

    Generate a randomised vector of Points constrained by the current window size

    # Arguments

    * - `window_size` - The size of the current window. This sets the upper limit for the x and y values
    * - `count` - the number of points in the vector
    */
    pub fn rnd_vec(window_size: [f64; 2], count: usize) -> Vec<Point> {
        (0..count).map(|_| Point::rnd(window_size)).collect()
    }

    /**

    Generate a single random Point constrained by the the current window size
    # Arguments

    * - `window_size` - The size of the current window. This sets the upper limit for the x and y values
    */
    pub fn rnd(window_size: [f64; 2]) -> Point {
        let mut rng = rand::thread_rng();
        Point {
            retain: true,
            x: rng.gen_range(0..window_size[0] as i32) as f64,
            y: rng.gen_range(0..window_size[1] as i32) as f64,
        }
    }
}