Lines Matching refs:index
40 int index;
41 for (index = 0;; ++index) {
42 if (value <= base[index]) {
43 if (value < base[index]) {
44 index = ~index; // not found
49 return index;
55 int index;
57 index = 1;
58 if (value < base[index]) {
59 index = ~index;
62 index = count - 2;
63 if (value > base[index]) {
64 index = ~(index + 1);
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);
72 if (value >= base[index]) {
73 for (;; ++index) {
74 if (value <= base[index]) {
75 if (value < base[index]) {
76 index = ~index; // not found
82 for (--index;; --index) {
83 SkASSERT(index >= 0);
84 if (value >= base[index]) {
85 if (value > base[index]) {
86 index = ~(index + 1);
93 return index;
98 int index;
100 index = find_simple(fK32.begin(), count, unichar);
102 index = find_with_slope(fK32.begin(), count, unichar, fDenom);
104 if (index >= 0) {
105 return fV16[index];
107 return index;
110 void SkCharToGlyphCache::insertCharAndGlyph(int index, SkUnichar unichar, SkGlyphID glyph) {
112 SkASSERT((unsigned)index < fK32.size());
113 SkASSERT(unichar < fK32[index]);
115 *fK32.insert(index) = unichar;
116 *fV16.insert(index) = glyph;
120 if (count >= kMinCountForSlope && (index == 1 || index == count - 2)) {
121 SkASSERT(index >= 1 && index <= count - 2);