Lines Matching defs:thresholds
150 // simplification is worth it. It is assumed thresholds are provided in increasing value,
249 const SkScalar* thresholds) {
280 uniform half4 thresholds[%d];
287 // Choose a chunk from thresholds via binary search in a loop.
292 if (t < thresholds[chunk].w) {
302 if (t < thresholds[chunk].y) {
303 pos = (t < thresholds[chunk].x) ? 0 : 1;
305 pos = (t < thresholds[chunk].z) ? 2 : 3;
312 )", /* thresholds: */ intervalChunks,
328 "thresholds", SkMakeSpan((const SkV4*)thresholds, intervalChunks),
333 // Converts an input array of {colors, positions} into an array of {scales, biases, thresholds}.
387 SkScalar thresholds[kMaxUnrolledIntervalCount] = {};
389 kMaxUnrolledIntervalCount, scales, biases, thresholds);
394 SkRect thresholds1_7 = {thresholds[0], thresholds[1], thresholds[2], thresholds[3]},
395 thresholds9_13 = {thresholds[4], thresholds[5], thresholds[6], 0.0};
410 SkScalar thresholds[kMaxLoopingIntervalCount] = {};
412 kMaxLoopingIntervalCount, scales, biases, thresholds);
423 thresholds[intervalCount] = thresholds[intervalCount - 1];
428 return make_looping_colorizer(intervalCount, scales, biases, thresholds);
466 // quite large when thresholds are close (but still outside the hardstop limit). If float
467 // isn't 32-bit, output can be incorrect if the thresholds are too close together. However,
469 // hardware when the thresholds are not ill-conditioned.
471 // Could run into problems. Check if thresholds are close together (with a limit of .01,