about summary refs log tree commit diff
diff options
context:
space:
mode:
-rw-r--r--Cargo.toml4
-rw-r--r--README.md6
-rw-r--r--squash/Cargo.toml4
-rw-r--r--squash/src/cli.rs51
-rw-r--r--squash/src/image.rs2
-rw-r--r--squash/src/main.rs24
-rw-r--r--src/lib.rs187
-rw-r--r--src/selection.rs141
8 files changed, 268 insertions, 151 deletions
diff --git a/Cargo.toml b/Cargo.toml
index 34b1d85..a877168 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -1,7 +1,7 @@
 [package]
 name = "colorsquash"
-version = "0.1.0"
-authors = ["gennyble <gen@nyble.dev>"]
+version = "0.2.0"
+authors = ["gennyble <gen@nyble.dev>", "novedevo <devon@nove.dev>"]
 edition = "2021"
 license = "ISC"
 description = "A crate for quantizing colours with preference to the most frequently occuring"
diff --git a/README.md b/README.md
index ef9ce84..3601c3a 100644
--- a/README.md
+++ b/README.md
@@ -13,6 +13,12 @@ and takes the top N colours that are sufficiently different.
 
 [^1]: [wikipedia: color quantization](https://en.wikipedia.org/wiki/Color_quantization)
 
+**features**
+
+**`kmeans`** - use kmeans for palette selection instead of sort & select.  
+**`gifed`** - adds the `Squasher::palette_gifed()` method allowing you to
+directly get a gifed's Palette struct.
+
 ### squash
 A CLI tool to quantize colours :D
 
diff --git a/squash/Cargo.toml b/squash/Cargo.toml
index 760dcaf..a1583b3 100644
--- a/squash/Cargo.toml
+++ b/squash/Cargo.toml
@@ -1,6 +1,6 @@
 [package]
 name = "squash"
-version = "0.2.0"
+version = "0.3.0"
 authors = ["gennyble <gen@nyble.dev>"]
 edition = "2021"
 license = "ISC"
@@ -11,7 +11,7 @@ repository = "https://github.com/gennyble/colorsquash/tree/main/squash"
 
 [dependencies]
 # the meat 'o the thing! the meaning behind it all
-colorsquash = { path = "..", version = "0.1.0", features = ["gifed"] }
+colorsquash = { path = "..", version = "0.1.0", features = ["gifed", "kmeans"] }
 
 # just useful tools for writing binaries
 anyhow = "1.0.75"
diff --git a/squash/src/cli.rs b/squash/src/cli.rs
index dec36fa..ba1658a 100644
--- a/squash/src/cli.rs
+++ b/squash/src/cli.rs
@@ -1,6 +1,7 @@
 use std::cmp::Ordering;
 
 use camino::Utf8PathBuf;
+use colorsquash::difference::{self, DiffFn};
 
 const NAME: &str = env!("CARGO_PKG_NAME");
 const VERSION: &str = env!("CARGO_PKG_VERSION");
@@ -9,7 +10,8 @@ const AUTHORS: &str = env!("CARGO_PKG_AUTHORS");
 pub struct Cli {
 	pub color_count: u8,
 	pub tolerance: Option<f32>,
-	pub difference: DifferenceFn,
+	pub selector: Selector,
+	pub difference: &'static DiffFn,
 	pub input: Utf8PathBuf,
 	pub in_type: InType,
 	pub output: Utf8PathBuf,
@@ -23,6 +25,7 @@ struct BuildingCli {
 	pub color_count: Option<u8>,
 	pub tolerance: Option<f32>,
 	pub difference: DifferenceFn,
+	pub selector: Selector,
 }
 
 impl BuildingCli {
@@ -58,10 +61,16 @@ impl BuildingCli {
 			}
 		};
 
+		let difference = match self.difference {
+			DifferenceFn::Rgb => &difference::rgb as &DiffFn,
+			DifferenceFn::Redmean => &difference::redmean as &DiffFn,
+		};
+
 		Cli {
 			color_count: self.color_count.unwrap_or(Self::DEFAULT_COLORS),
 			tolerance: self.tolerance,
-			difference: self.difference,
+			selector: self.selector,
+			difference,
 			input,
 			in_type,
 			output,
@@ -87,6 +96,13 @@ pub enum DifferenceFn {
 	Redmean,
 }
 
+#[derive(Debug, Default)]
+pub enum Selector {
+	#[default]
+	SortSelect,
+	Kmeans,
+}
+
 pub fn build() -> Cli {
 	let mut free = vec![];
 	let mut building = BuildingCli::default();
@@ -142,7 +158,16 @@ pub fn build() -> Cli {
 					std::process::exit(1);
 				}
 			},
+			Some(("selector", sel)) | Some(("sel", sel)) => match sel {
+				"sort/select" => building.selector = Selector::SortSelect,
+				"kmeans" => building.selector = Selector::Kmeans,
+				_ => {
+					eprintln!("'{sel}' is not recognized as a selector. See help=selectors");
+					std::process::exit(1);
+				}
+			},
 			Some(("help", "algorithms")) => print_help_algorithms(),
+			Some(("help", "selectors")) => print_help_selectors(),
 			Some(("help", _)) => print_help(),
 			Some(("version", _)) => print_version(),
 			Some((key, _)) => {
@@ -174,12 +199,16 @@ fn print_help() -> ! {
 	println!("        the number of colours the final image should contain");
 	println!("        a whole number more than 0 and less than, or equal, 256");
 	println!("        [Default 256]\n");
-	println!("    difference=<algorithm> | did=<algorithm>");
+	println!("    difference=<algorithm> | dif=<algorithm>");
 	println!("        the color comparison function to use. one of: rgb, redmean");
-	println!("        for more details use help=algorithms. [Default rgb]");
+	println!("        for more details use help=algorithms. [Default rgb]\n");
+	println!("    selection=<selector> | sel=<selector>");
+	println!("        the algorithm for picking the palette. one of: means, sort/select");
+	println!("        for more details use help=selectors. [Default sort/select]");
 	println!("    tolerance=<float> | tol=<float>");
 	println!("        how different colours should be to be added to the palette");
-	println!("        a number > 0 and <= 100\n");
+	println!("        only sort/select usese this value.");
+	println!("        a number > 0 and <= 100 [Default 3]\n");
 	println!("    help= | -h | --help");
 	println!("        print this message and exit\n");
 	println!("    version= | -V | --version");
@@ -199,6 +228,18 @@ fn print_help_algorithms() -> ! {
 	std::process::exit(0)
 }
 
+fn print_help_selectors() -> ! {
+	println!("SELECTORS:");
+	println!("sort/select:");
+	println!("    the original colorsquash algorithm. sorts colors from most to least");
+	println!("    frequent and then picks the most frequent colors so long as they are");
+	println!("    sufficiently different (configurable with tolerance=)\n");
+	println!("kmeans:");
+	println!("    uses the kmeans clustering algorithm to select colours.");
+	println!("    Ignores tolerance=");
+	std::process::exit(0)
+}
+
 fn print_version() -> ! {
 	println!("squash version {VERSION}");
 	println!("written by {AUTHORS}");
diff --git a/squash/src/image.rs b/squash/src/image.rs
index 5c7b45a..ff6650f 100644
--- a/squash/src/image.rs
+++ b/squash/src/image.rs
@@ -2,7 +2,7 @@ use std::{fs::File, io::BufWriter};
 
 use anyhow::{anyhow, bail};
 use camino::{Utf8Path, Utf8PathBuf};
-use colorsquash::Squasher;
+use colorsquash::{selection::SortSelect, Squasher};
 use gifed::{writer::ImageBuilder, Gif};
 use png::{ColorType, Decoder, Encoder};
 use zune_jpeg::{zune_core::colorspace::ColorSpace, JpegDecoder};
diff --git a/squash/src/main.rs b/squash/src/main.rs
index 8e3a79b..b443f57 100644
--- a/squash/src/main.rs
+++ b/squash/src/main.rs
@@ -1,5 +1,8 @@
 use cli::DifferenceFn;
-use colorsquash::SquasherBuilder;
+use colorsquash::{
+	selection::{Kmeans, Selector, SortSelect},
+	SquasherBuilder,
+};
 
 use crate::cli::{InType, OutType};
 
@@ -16,15 +19,20 @@ fn main() -> Result<(), anyhow::Error> {
 		InType::Jpeg => image::get_jpg(cli.input)?,
 	};
 
-	let mut builder = SquasherBuilder::default().max_colors(cli.color_count);
+	let mut builder = SquasherBuilder::new()
+		.max_colors(cli.color_count)
+		.mapper_difference(cli.difference);
 
-	if let Some(tol) = cli.tolerance {
-		builder = builder.tolerance(tol);
-	}
+	match cli.selector {
+		cli::Selector::SortSelect => {
+			let mut sorsel = SortSelect::default().difference(cli.difference);
+			if let Some(tol) = cli.tolerance {
+				sorsel = sorsel.tolerance(tol)
+			}
 
-	builder = match cli.difference {
-		DifferenceFn::Rgb => builder.difference(&colorsquash::difference::rgb),
-		DifferenceFn::Redmean => builder.difference(&colorsquash::difference::redmean),
+			builder = builder.selector(sorsel);
+		}
+		cli::Selector::Kmeans => builder = builder.selector(Kmeans),
 	};
 
 	let mut squasher = builder.build(&image.data);
diff --git a/src/lib.rs b/src/lib.rs
index 38f8e1a..dfd8ef2 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -1,44 +1,52 @@
+use std::collections::HashSet;
+
 #[cfg(kmeans)]
 use kmeans::{KMeans, KMeansConfig};
 use rgb::{ComponentBytes, FromSlice, RGB8};
-use std::collections::HashMap;
 
 pub mod difference;
+pub mod selection;
 
 use difference::DiffFn;
+use selection::Selector;
 
-pub struct SquasherBuilder<T> {
+pub struct SquasherBuilder<T: Count> {
 	max_colours: T,
 	difference_fn: Box<DiffFn>,
-	tolerance: f32,
+	selector: Option<Box<dyn Selector + 'static>>,
 }
 
 impl<T: Count> SquasherBuilder<T> {
+	// I don't want a default here because, to me anyway, Default implies a
+	// working struct and this would panic build()
+	#[allow(clippy::new_without_default)]
 	pub fn new() -> Self {
-		Self::default()
+		Self {
+			max_colours: T::zero(),
+			difference_fn: Box::new(difference::rgb),
+			selector: None,
+		}
 	}
 
 	/// The max number of colors selected for the palette, minus one.
 	///
 	/// `max_colors(255)` will attempt to make a 256 color palette
-	pub fn max_colors(mut self, max_minus_one: T) -> SquasherBuilder<T> {
+	pub fn max_colors(mut self, max_minus_one: T) -> Self {
 		self.max_colours = max_minus_one;
 		self
 	}
 
-	/// The function to use to compare colours.
+	/// The function to use to compare colours while mapping the image.
 	///
 	/// see the [difference] module for functions included with the crate and
 	/// information on implementing your own.
-	pub fn difference(mut self, difference: &'static DiffFn) -> SquasherBuilder<T> {
+	pub fn mapper_difference(mut self, difference: &'static DiffFn) -> Self {
 		self.difference_fn = Box::new(difference);
 		self
 	}
 
-	/// Percent colours have to differ by to be included into the palette.
-	/// between and including 0.0 to 100.0
-	pub fn tolerance(mut self, percent: f32) -> SquasherBuilder<T> {
-		self.tolerance = percent;
+	pub fn selector(mut self, selector: impl Selector + 'static) -> Self {
+		self.selector = Some(Box::new(selector));
 		self
 	}
 
@@ -47,41 +55,39 @@ impl<T: Count> SquasherBuilder<T> {
 		Img: Into<ImageData<'a>>,
 	{
 		let mut squasher =
-			Squasher::from_parts(self.max_colours, self.difference_fn, self.tolerance);
+			Squasher::from_parts(self.max_colours, self.difference_fn, self.selector.unwrap());
 		squasher.recolor(image);
 
 		squasher
 	}
 }
 
-impl<T: Count> Default for SquasherBuilder<T> {
-	fn default() -> Self {
-		Self {
-			max_colours: T::from_usize(255),
-			difference_fn: Box::new(difference::rgb),
-			tolerance: 1.0,
-		}
-	}
-}
-
 pub struct Squasher<T> {
 	// one less than the max colours as you can't have a zero colour image.
 	max_colours_min1: T,
 	palette: Vec<RGB8>,
 	map: Vec<T>,
+	selector: Box<dyn Selector + 'static>,
 	difference_fn: Box<DiffFn>,
-	tolerance_percent: f32,
 }
 
 impl<T: Count> Squasher<T> {
 	/// Creates a new squasher and allocates a new color map. A color map
 	/// contains every 24-bit color and ends up with an amount of memory
 	/// equal to `16MB * std::mem::size_of(T)`.
-	pub fn new<'a, Img>(max_colors_minus_one: T, buffer: Img) -> Self
+	pub fn new<'a, Img>(
+		max_colors_minus_one: T,
+		selector: impl Selector + 'static,
+		buffer: Img,
+	) -> Self
 	where
 		Img: Into<ImageData<'a>>,
 	{
-		let mut this = Self::from_parts(max_colors_minus_one, Box::new(difference::rgb), 1.0);
+		let mut this = Self::from_parts(
+			max_colors_minus_one,
+			Box::new(difference::rgb),
+			Box::new(selector),
+		);
 		this.recolor(buffer);
 
 		this
@@ -91,61 +97,28 @@ impl<T: Count> Squasher<T> {
 		SquasherBuilder::new()
 	}
 
-	/// Set the tolerance
-	pub fn set_tolerance(&mut self, percent: f32) {
-		self.tolerance_percent = percent;
-	}
-
 	/// Create a new palette from the colours in the given image.
-	#[cfg(not(kmeans))]
-	pub fn recolor<'a, Img>(&mut self, image: Img)
-	where
-		Img: Into<ImageData<'a>>,
-	{
-		let sorted = Self::unique_and_sort(image);
-		let selected = self.select_colors(sorted);
-		self.palette = selected;
-	}
-
-	#[cfg(kmeans)]
 	pub fn recolor<'a, Img>(&mut self, image: Img)
 	where
 		Img: Into<ImageData<'a>>,
 	{
-		let ImageData(rgb) = image.into();
-
-		let kmean = KMeans::new(
-			rgb.as_bytes()
-				.iter()
-				.map(|u| *u as f32)
-				.collect::<Vec<f32>>(),
-			rgb.as_bytes().len() / 3,
-			3,
-		);
-		let k = self.max_colours_min1.as_usize() + 1;
-		let result =
-			kmean.kmeans_lloyd(k, 100, KMeans::init_kmeanplusplus, &KMeansConfig::default());
-		self.palette = result
-			.centroids
-			.chunks_exact(3)
-			.map(|rgb| {
-				RGB8::new(
-					rgb[0].round() as u8,
-					rgb[1].round() as u8,
-					rgb[2].round() as u8,
-				)
-			})
-			.collect();
+		self.palette = self
+			.selector
+			.select(self.max_colours_min1.as_usize() + 1, image.into());
 	}
 
 	/// Create a Squasher from parts. Noteably, this leave your palette empty
-	fn from_parts(max_colours_min1: T, difference_fn: Box<DiffFn>, tolerance: f32) -> Self {
+	fn from_parts(
+		max_colours_min1: T,
+		difference_fn: Box<DiffFn>,
+		selector: Box<dyn Selector>,
+	) -> Self {
 		Self {
 			max_colours_min1,
 			palette: vec![],
 			map: vec![T::zero(); 256 * 256 * 256],
 			difference_fn,
-			tolerance_percent: tolerance,
+			selector,
 		}
 	}
 
@@ -164,8 +137,8 @@ impl<T: Count> Squasher<T> {
 
 		// We have to map the colours of this image now because it might contain
 		// colours not present in the first image.
-		let sorted = Self::unique_and_sort(rgb);
-		self.map_selected(&sorted);
+		let unique = Self::unique_colors(rgb);
+		self.map_selected(&unique);
 
 		for (idx, color) in rgb.iter().enumerate() {
 			buffer[idx] = self.map[color_index(color)];
@@ -206,64 +179,9 @@ impl<T: Count> Squasher<T> {
 		self.palette.as_bytes().to_owned()
 	}
 
-	/// Takes an image buffer of RGB data and fill the color map
-	fn unique_and_sort<'a, Img>(buffer: Img) -> Vec<RGB8>
-	where
-		Img: Into<ImageData<'a>>,
-	{
-		let ImageData(rgb) = buffer.into();
-		let mut colors: HashMap<RGB8, usize> = HashMap::default();
-
-		//count pixels
-		for px in rgb {
-			match colors.get_mut(px) {
-				None => {
-					colors.insert(*px, 1);
-				}
-				Some(n) => *n += 1,
-			}
-		}
-
-		Self::sort(colors)
-	}
-
-	fn sort(map: HashMap<RGB8, usize>) -> Vec<RGB8> {
-		let mut sorted: Vec<(RGB8, usize)> = map.into_iter().collect();
-		sorted.sort_by(|(colour1, freq1), (colour2, freq2)| {
-			freq2
-				.cmp(freq1)
-				.then(colour2.r.cmp(&colour1.r))
-				.then(colour2.g.cmp(&colour1.g))
-				.then(colour2.b.cmp(&colour1.b))
-		});
-
-		sorted.into_iter().map(|(color, _count)| color).collect()
-	}
-
-	/// Pick the colors in the palette from a Vec of colors sorted by number
-	/// of times they occur, high to low.
-	#[cfg(not(kmeans))]
-	fn select_colors(&self, sorted: Vec<RGB8>) -> Vec<RGB8> {
-		let tolerance = (self.tolerance_percent / 100.0) * 765.0;
-		let max_colours = self.max_colours_min1.as_usize() + 1;
-		let mut selected_colors: Vec<RGB8> = Vec::with_capacity(max_colours);
-
-		for sorted_color in sorted {
-			if max_colours <= selected_colors.len() {
-				break;
-			} else if selected_colors.iter().all(|selected_color| {
-				(self.difference_fn)(selected_color, &sorted_color) > tolerance
-			}) {
-				selected_colors.push(sorted_color);
-			}
-		}
-
-		selected_colors
-	}
-
 	/// Pick the closest colour in the palette for each unique color in the image
-	fn map_selected(&mut self, sorted: &[RGB8]) {
-		for colour in sorted {
+	fn map_selected(&mut self, unique: &[RGB8]) {
+		for colour in unique {
 			let mut min_diff = f32::MAX;
 			let mut min_index = usize::MAX;
 
@@ -279,6 +197,14 @@ impl<T: Count> Squasher<T> {
 			self.map[color_index(colour)] = T::from_usize(min_index);
 		}
 	}
+
+	fn unique_colors(image: &[RGB8]) -> Vec<RGB8> {
+		let mut unique: HashSet<RGB8> = HashSet::new();
+		for px in image {
+			unique.insert(*px);
+		}
+		unique.into_iter().collect()
+	}
 }
 
 impl Squasher<u8> {
@@ -288,15 +214,10 @@ impl Squasher<u8> {
 	/// # Returns
 	/// The new size of the image
 	pub fn map_over(&mut self, image: &mut [u8]) -> usize {
-		// "redundant slicing" here is to drop the mut on the reference because
-		// ImageData doesn't have a From<&mut [u8]> and I don't particularly want
-		// it to
-		#[allow(clippy::redundant_slicing)]
-		let sorted = Self::unique_and_sort(&image[..]);
-
 		// We have to map the colours of this image now because it might contain
 		// colours not present in the first image.
-		self.map_selected(&sorted);
+		let unique = Self::unique_colors(image.as_rgb());
+		self.map_selected(&unique);
 
 		for idx in 0..(image.len() / 3) {
 			let rgb_idx = idx * 3;
diff --git a/src/selection.rs b/src/selection.rs
new file mode 100644
index 0000000..8215fbf
--- /dev/null
+++ b/src/selection.rs
@@ -0,0 +1,141 @@
+use std::collections::HashMap;
+
+#[cfg(feature = "kmeans")]
+use kmeans::{KMeans, KMeansConfig};
+use rgb::{ComponentBytes, RGB8};
+
+use crate::{
+	difference::{self, DiffFn},
+	ImageData,
+};
+
+pub trait Selector {
+	fn select<'a>(&mut self, max_colors: usize, image: ImageData<'a>) -> Vec<RGB8>;
+}
+
+pub struct SortSelect {
+	tolerance: f32,
+	difference_fn: Box<DiffFn>,
+}
+
+impl Selector for SortSelect {
+	/// Pick the colors in the palette from a Vec of colors sorted by number
+	/// of times they occur, high to low.
+	fn select<'a>(&mut self, max_colours: usize, image: ImageData<'a>) -> Vec<RGB8> {
+		let sorted = Self::unique_and_sort(image);
+		let tolerance = (self.tolerance / 100.0) * 765.0;
+		let mut selected_colors: Vec<RGB8> = Vec::with_capacity(max_colours);
+
+		for sorted_color in sorted {
+			if max_colours <= selected_colors.len() {
+				break;
+			} else if selected_colors.iter().all(|selected_color| {
+				(self.difference_fn)(selected_color, &sorted_color) > tolerance
+			}) {
+				selected_colors.push(sorted_color);
+			}
+		}
+
+		selected_colors
+	}
+}
+
+impl SortSelect {
+	/// How different colours have to be to enter the palette. Should be between
+	/// 0.0 and 100.0, but is unchecked.
+	pub fn tolerance(mut self, percent: f32) -> Self {
+		self.tolerance = percent;
+		self
+	}
+
+	/// The function to use to compare colours while selecting the palette.
+	///
+	/// see the [difference] module for functions included with the crate and
+	/// information on implementing your own.
+	pub fn difference(mut self, diff_fn: &'static DiffFn) -> Self {
+		self.difference_fn = Box::new(diff_fn);
+		self
+	}
+
+	/// Takes an image buffer of RGB data and fill the color map
+	fn unique_and_sort<'a, Img>(buffer: Img) -> Vec<RGB8>
+	where
+		Img: Into<ImageData<'a>>,
+	{
+		let ImageData(rgb) = buffer.into();
+		let mut colors: HashMap<RGB8, usize> = HashMap::default();
+
+		//count pixels
+		for px in rgb {
+			match colors.get_mut(px) {
+				None => {
+					colors.insert(*px, 1);
+				}
+				Some(n) => *n += 1,
+			}
+		}
+
+		Self::sort(colors)
+	}
+
+	fn sort(map: HashMap<RGB8, usize>) -> Vec<RGB8> {
+		let mut sorted: Vec<(RGB8, usize)> = map.into_iter().collect();
+		sorted.sort_by(|(colour1, freq1), (colour2, freq2)| {
+			freq2
+				.cmp(freq1)
+				.then(colour2.r.cmp(&colour1.r))
+				.then(colour2.g.cmp(&colour1.g))
+				.then(colour2.b.cmp(&colour1.b))
+		});
+
+		sorted.into_iter().map(|(color, _count)| color).collect()
+	}
+}
+
+impl Default for SortSelect {
+	fn default() -> Self {
+		Self {
+			tolerance: 3.0,
+			difference_fn: Box::new(difference::rgb),
+		}
+	}
+}
+
+#[cfg(feature = "kmeans")]
+#[derive(Debug, Default)]
+pub struct Kmeans;
+
+#[cfg(feature = "kmeans")]
+impl Selector for Kmeans {
+	fn select<'a>(&mut self, max_colors: usize, image: ImageData<'a>) -> Vec<RGB8> {
+		let ImageData(rgb) = image.into();
+
+		let kmean = KMeans::new(
+			rgb.as_bytes()
+				.iter()
+				.map(|u| *u as f32)
+				.collect::<Vec<f32>>(),
+			rgb.as_bytes().len() / 3,
+			3,
+		);
+
+		let result = kmean.kmeans_lloyd(
+			max_colors,
+			100,
+			KMeans::init_kmeanplusplus,
+			&KMeansConfig::default(),
+		);
+
+		result
+			.centroids
+			.chunks_exact(3)
+			.map(|rgb| {
+				RGB8::new(
+					rgb[0].round() as u8,
+					rgb[1].round() as u8,
+					rgb[2].round() as u8,
+				)
+			})
+			.collect()
+	}
+}