largestFeasibleChroma()

template<typename Feasible>

i32 fl::anonymous_namespace{gamut_map.cpp.hpp}::largestFeasibleChroma	(	const i32(&)	lab[3],
		i32	lightness,
		Feasible	feasible )

Largest chroma factor the hull accepts, by a fixed count of halvings.

Shared by both mappers so the search cannot drift between them; only the feasibility predicate differs. low is the largest factor known to be feasible, high the smallest known not to be.

Definition at line 156 of file gamut_map.cpp.hpp.

                                                          {
    i32 low = 0;
    i32 high = kGamutFullDrive;
    for (int step = 0; step < kGamutMapHalvings; ++step) {
        const i32 factor = (low + high) >> 1;
        i32 candidate_xyz[3];
        chromaCandidateXyz(lab, lightness, factor, candidate_xyz);
        if (feasible(candidate_xyz)) {
            low = factor;
        } else {
            high = factor;
        }
    }
    return low;
}

References chromaCandidateXyz(), fl::FL_NO_EXCEPT, kGamutFullDrive, fl::kGamutMapHalvings, largestFeasibleChroma(), and fl::step().

Referenced by largestFeasibleChroma().

Here is the call graph for this function:

Here is the caller graph for this function: