gfx/skia/trunk/src/core/SkScalar.cpp

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1
michael@0 2 /*
michael@0 3 * Copyright 2010 The Android Open Source Project
michael@0 4 *
michael@0 5 * Use of this source code is governed by a BSD-style license that can be
michael@0 6 * found in the LICENSE file.
michael@0 7 */
michael@0 8
michael@0 9
michael@0 10 #include "SkMath.h"
michael@0 11 #include "SkScalar.h"
michael@0 12
michael@0 13 SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[],
michael@0 14 const SkScalar values[], int length) {
michael@0 15 SkASSERT(length > 0);
michael@0 16 SkASSERT(keys != NULL);
michael@0 17 SkASSERT(values != NULL);
michael@0 18 #ifdef SK_DEBUG
michael@0 19 for (int i = 1; i < length; i++)
michael@0 20 SkASSERT(keys[i] >= keys[i-1]);
michael@0 21 #endif
michael@0 22 int right = 0;
michael@0 23 while (right < length && searchKey > keys[right])
michael@0 24 right++;
michael@0 25 // Could use sentinel values to eliminate conditionals, but since the
michael@0 26 // tables are taken as input, a simpler format is better.
michael@0 27 if (length == right)
michael@0 28 return values[length-1];
michael@0 29 if (0 == right)
michael@0 30 return values[0];
michael@0 31 // Otherwise, interpolate between right - 1 and right.
michael@0 32 SkScalar rightKey = keys[right];
michael@0 33 SkScalar leftKey = keys[right-1];
michael@0 34 SkScalar fract = SkScalarDiv(searchKey-leftKey,rightKey-leftKey);
michael@0 35 return SkScalarInterp(values[right-1], values[right], fract);
michael@0 36 }

mercurial