colorsys 0.7.3

A module for color conversion and mutation. Works with RGB(a)( as hexadecimal too), HSL(a), CMYK color models and with ANSI color codes
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

use core::ops::{Add, Index, Sub};

pub(crate) use alpha::Alpha;
pub(crate) use unit::Unit;

use crate::{ApproxEq, DEFAULT_APPROX_EQ_PRECISION};
use crate::common::approx::approx;

mod unit;
mod alpha;
mod into;
pub mod iter;

pub trait GetColorUnits {
  fn get_units(&self) -> &Units;
  fn get_units_mut(&mut self) -> &mut Units;
}


#[derive(Clone, PartialEq, Debug)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct Units {
  pub(crate) len: usize,
  pub(crate) list: [Unit; 4],
  pub(crate) alpha: Alpha,
}

impl Units {
  pub(crate) fn restrict(&mut self) {
    for i in 0..self.len {
      self.list[i].restrict();
    }
  }

  fn add_sub(&self, other: &Units, is_add: bool) -> Self {
    let mut new = self.clone();
    for i in 0..self.len {
      let a = new.list[i];
      let b = other.list[i];
      let x = if is_add { a + b } else { a - b };
      new.list[i] = x;
    }
    new
  }

  pub(crate) fn as_ratio(&self) -> Self {
    let mut new = self.clone();
    for i in 0..new.len {
      new.list[i].turn_into_ratio();
    }
    new
  }

  pub(crate) fn max(&self) -> (f64, usize) {
    self.min_max(true)
  }
  pub(crate) fn min(&self) -> (f64, usize) {
    self.min_max(false)
  }

  fn min_max(&self, need_max: bool) -> (f64, usize) {
    let mut result = self.list[0].value;
    let mut ind = 0;
    if self.len != 1 {
      for i in 1..self.len {
        let v = self.list[i].value;
        let is_fit = if need_max { v > result } else { v < result };
        if is_fit {
          result = v;
          ind = i;
        }
      }
    }
    (result, ind)
  }


  pub(crate) fn new_ratios(values: &[f64]) -> Units {
    if values.len() > 4 { panic!("length of units values is more than 4") }
    let mut ul: [Unit; 4] = Default::default();
    for (ind, v) in values.iter().enumerate() {
      ul[ind].set(*v);
    }
    Units { len: values.len(), list: ul, alpha: Alpha::default() }
  }
}


impl Index<usize> for Units {
  type Output = f64;

  fn index(&self, ind: usize) -> &Self::Output {
    &self.list[ind].value
  }
}

impl<'a> Add<Self> for &'a Units {
  type Output = Units;
  fn add(self, rhs: &'a Units) -> Self::Output {
    self.add_sub(rhs, true)
  }
}

impl<'a> Sub<Self> for &'a Units {
  type Output = Units;
  fn sub(self, rhs: &'a Units) -> Self::Output {
    self.add_sub(rhs, false)
  }
}


impl ApproxEq<Units> for Units {
  fn approx_eq(&self, other: &Units) -> bool {
    self.approx_eq_clarify(other, DEFAULT_APPROX_EQ_PRECISION)
  }

  fn approx_eq_clarify(&self, other: &Units, precision: f64) -> bool {
    if !self.alpha.approx_eq_clarify(&other.alpha, precision) {
      return false;
    }
    for i in 0..self.len {
      if !approx(self.list[i].value, other.list[i].value, precision) {
        return false;
      }
    }
    true
  }
}


#[cfg(test)]
mod test {
  #[test]
  fn test() {}
}