blob: 87a5073e14655744571ebfcf5bfbddbb6e4558d7 [file] [log] [blame]
vandebo@chromium.org28be72b2010-11-11 21:37:00 +00001/*
epoger@google.comec3ed6a2011-07-28 14:26:00 +00002 * Copyright 2010 The Android Open Source Project
vandebo@chromium.org28be72b2010-11-11 21:37:00 +00003 *
epoger@google.comec3ed6a2011-07-28 14:26:00 +00004 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7
vandebo@chromium.org28be72b2010-11-11 21:37:00 +00008
tomhudson@google.comc12e1b12011-09-27 18:03:23 +00009#include "SkMath.h"
vandebo@chromium.org28be72b2010-11-11 21:37:00 +000010#include "SkScalar.h"
11
12SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[],
13 const SkScalar values[], int length) {
14 SkASSERT(length > 0);
halcanary96fcdcc2015-08-27 07:41:13 -070015 SkASSERT(keys != nullptr);
16 SkASSERT(values != nullptr);
vandebo@chromium.org28be72b2010-11-11 21:37:00 +000017#ifdef SK_DEBUG
18 for (int i = 1; i < length; i++)
19 SkASSERT(keys[i] >= keys[i-1]);
20#endif
21 int right = 0;
22 while (right < length && searchKey > keys[right])
23 right++;
24 // Could use sentinel values to eliminate conditionals, but since the
25 // tables are taken as input, a simpler format is better.
26 if (length == right)
27 return values[length-1];
28 if (0 == right)
29 return values[0];
30 // Otherwise, interpolate between right - 1 and right.
31 SkScalar rightKey = keys[right];
32 SkScalar leftKey = keys[right-1];
reed80ea19c2015-05-12 10:37:34 -070033 SkScalar fract = (searchKey - leftKey) / (rightKey - leftKey);
vandebo@chromium.org28be72b2010-11-11 21:37:00 +000034 return SkScalarInterp(values[right-1], values[right], fract);
35}