pub struct KDTree { /* fields omitted */ }
3-dimentional KDTree which is used to quickly find nearest (euclidian distance)
color from the palette.
Reference: k-d tree
Create k-d tree from the list of colors
Find nearest neighbour color (euclidian distance) in the palette
Render k-d tree as graphviz digraph (for debugging)
impl<T> Any for T where
T: 'static + ?Sized,
[src]
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
impl<T, U> Into<U> for T where
U: From<T>,
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
The type returned in the event of a conversion error.
The type returned in the event of a conversion error.