MCPcopy Create free account
hub / github.com/ImageOptim/libimagequant / refine_palette

Function refine_palette

src/quant.rs:428–454  ·  view source on GitHub ↗
(palette: &mut PalF, attr: &Attributes, hist: &mut HistogramInternal, max_mse: Option<f64>, palette_error: &mut Option<f64>)

Source from the content-addressed store, hash-verified

426
427
428fn refine_palette(palette: &mut PalF, attr: &Attributes, hist: &mut HistogramInternal, max_mse: Option<f64>, palette_error: &mut Option<f64>) -> Result<(), Error> {
429 let (iterations, iteration_limit) = attr.kmeans_iterations(hist.items.len(), palette_error.is_some());
430 if iterations > 0 {
431 attr.verbose_print(" moving colormap towards local minimum");
432 let mut i = 0;
433 while i < iterations {
434 let stage_done = f32::from(i) / f32::from(iterations);
435 let overall_done = (stage_done * f32::from(attr.progress_stage3)).mul_add(0.89, f32::from(attr.progress_stage1) + f32::from(attr.progress_stage2));
436 if attr.progress(overall_done) {
437 break;
438 }
439
440 let pal_err = Kmeans::iteration(hist, palette, false)?;
441 debug_assert!(pal_err < 1e20);
442 let previous_palette_error = *palette_error;
443 *palette_error = Some(pal_err);
444
445 if let Some(previous_palette_error) = previous_palette_error {
446 if (previous_palette_error - pal_err).abs() < iteration_limit {
447 break;
448 }
449 }
450 i += if pal_err > max_mse.unwrap_or(1e20) * 1.5 { 2 } else { 1 };
451 }
452 }
453 Ok(())
454}
455
456#[cold]
457fn palette_from_histogram(hist: &HistogramInternal, max_colors: PalLen) -> (PalF, Option<f64>) {

Callers 1

find_best_paletteFunction · 0.85

Calls 4

kmeans_iterationsMethod · 0.80
verbose_printMethod · 0.80
progressMethod · 0.80
lenMethod · 0.45

Tested by

no test coverage detected