Lines Matching defs:count
39 static int find_simple(const SkUnichar base[], int count, SkUnichar value) {
52 static int find_with_slope(const SkUnichar base[], int count, SkUnichar value, double denom) {
53 SkASSERT(count >= kMinCountForSlope);
61 } else if (value >= base[count - 2]) {
62 index = count - 2;
68 // index = 1 + (int64_t)(count - 2) * (value - base[1]) / (base[count - 2] - base[1]);
69 index = 1 + (int)(denom * (count - 2) * (value - base[1]));
70 SkASSERT(index >= 1 && index <= count - 2);
97 const int count = fK32.count();
99 if (count <= kSmallCountLimit) {
100 index = find_simple(fK32.begin(), count, unichar);
102 index = find_with_slope(fK32.begin(), count, unichar, fDenom);
118 // if we've changed the first [1] or last [count-2] entry, recompute our slope
119 const int count = fK32.count();
120 if (count >= kMinCountForSlope && (index == 1 || index == count - 2)) {
121 SkASSERT(index >= 1 && index <= count - 2);
122 fDenom = 1.0 / ((double)fK32[count - 2] - fK32[1]);
126 for (int i = 1; i < fK32.count(); ++i) {