Searched refs:endCount (Results 1 – 5 of 5) sorted by relevance
41 assertThat(listener.endCount).isEqualTo(1); in normal()55 assertThat(listener.endCount).isEqualTo(1); in canceled()67 assertThat(listener.endCount).isEqualTo(1); in delayed()82 assertThat(listener.endCount).isEqualTo(0); in neverStartedCanceled()85 assertThat(listener.endCount).isEqualTo(1); in neverStartedCanceled()100 assertThat(listener.endCount).isEqualTo(1); in neverStartedEnded()103 assertThat(listener.endCount).isEqualTo(1); in neverStartedEnded()119 assertThat(listener.endCount).isEqualTo(1); in doubleCanceled()133 assertThat(listener.endCount).isEqualTo(1); in doubleEnded()156 assertThat(listener.endCount).isEqualTo(1); in delayedAndCanceled()[all …]
212 int endCount = fEndPtTs.count(); // all starts and ends in assemble() local213 SkASSERT(endCount > 0); in assemble()214 SkASSERT(endCount == fPartials.count() * 2); in assemble()216 for (int index = 0; index < endCount; index += 2) { in assemble()226 for (int pIndex = 0; pIndex < endCount; pIndex++) { in assemble()269 int linkCount = endCount / 2; // number of partial contours in assemble()276 const int entries = endCount * (endCount - 1) / 2; // folded triangle in assemble()282 for (rIndex = 0; rIndex < endCount - 1; ++rIndex) { in assemble()284 for (iIndex = rIndex + 1; iIndex < endCount; ++iIndex) { in assemble()293 rRow += endCount; in assemble()[all …]
209 int endCount = fEndPtTs.count(); // all starts and ends in assemble() local210 SkASSERT(endCount > 0); in assemble()211 SkASSERT(endCount == fPartials.count() * 2); in assemble()213 for (int index = 0; index < endCount; index += 2) { in assemble()223 for (int pIndex = 0; pIndex < endCount; pIndex++) { in assemble()266 int linkCount = endCount / 2; // number of partial contours in assemble()273 const int entries = endCount * (endCount - 1) / 2; // folded triangle in assemble()279 for (rIndex = 0; rIndex < endCount - 1; ++rIndex) { in assemble()281 for (iIndex = rIndex + 1; iIndex < endCount; ++iIndex) { in assemble()290 rRow += endCount; in assemble()[all …]
283 endCount = subtable->values.arrayZ; in init()284 startCount = endCount + segCount + 1; in init()297 const HBUINT16 *endCount = this->endCount; in get_glyph() local304 else if (codepoint > endCount[mid]) in get_glyph()346 hb_codepoint_t end = this->endCount[i]; in collect_unicodes()374 const HBUINT16 *endCount; member430 HBUINT16 endCount[segCount]; /* End characterCode for each segment,
1488 stbtt_uint32 endCount = index_map + 14; in stbtt_FindGlyphIndex() local1489 stbtt_uint32 search = endCount; in stbtt_FindGlyphIndex()1513 stbtt_uint16 item = (stbtt_uint16) ((search - endCount) >> 1); in stbtt_FindGlyphIndex()1515 STBTT_assert(unicode_codepoint <= ttUSHORT(data + endCount + 2*item)); in stbtt_FindGlyphIndex()