vizkit 0.1.3

A rendering-agnostic kit for data visualization
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

use std::mem::swap;

use super::{
    continuous::Transformer,
    ticks::{Tick, tick_increment, ticks},
};

/// Linear transformation
#[derive(Clone, Copy)]
pub struct Linear;
impl Transformer for Linear {
    #[inline]
    fn transform(&self, x: f32) -> f32 {
        x
    }

    #[inline]
    fn untransform(&self, y: f32) -> f32 {
        y
    }
}

impl Tick for Linear {
    fn ticks(&self, domain: &[f32; 2], count: usize) -> Vec<f32> {
        ticks(domain[0], domain[1], count)
    }

    fn nice(&self, domain: &[f32; 2], count: usize) -> [f32; 2] {
        let &[mut start, mut stop] = domain;
        let mut prestep = None;

        let reverse = stop < start;
        if reverse {
            swap(&mut start, &mut stop);
        }

        let mut max_iter = 10;
        while max_iter > 0 {
            let step = tick_increment(start, stop, count);
            if Some(step) == prestep {
                if reverse {
                    swap(&mut start, &mut stop);
                }
                return [start, stop];
            } else if step > 0. {
                start = (start / step).floor() * step;
                stop = (stop / step).ceil() * step;
            } else if step < 0. {
                start = (start * step).ceil() / step;
                stop = (stop * step).floor() / step;
            } else {
                break;
            }
            prestep = Some(step);
            max_iter -= 1;
        }
        if reverse {
            swap(&mut start, &mut stop);
        }
        [start, stop]
    }
}