Searched defs:coin (Results 1 - 10 of 10) sorted by relevance

/external/skia/tests/
H A DPathOpsConicIntersectionTest.cpp30 bool coin) {
35 if (coin && intersections.used() != 2) {
38 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
29 oneOff(skiatest::Reporter* reporter, const SkDConic& c1, const SkDConic& c2, bool coin) argument
H A DPathOpsCubicIntersectionTest.cpp380 bool coin) {
402 if (coin && intersections.used() != 2) {
405 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
379 oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, bool coin) argument
H A DPathOpsDebug.cpp943 const SkOpSpanBase* coin = this->coinEnd(); local
944 if (this != coin) {
945 SkDebugf(" coinEnd seg/span=%d/%d", coin->segment()->debugID(), coin->debugID());
979 SkOpSpan* coin = fCoincident; local
980 if (this != coin) {
981 SkDebugf(" coinStart seg/span=%d/%d", coin->segment()->debugID(), coin->debugID());
994 return this != coin;
/external/clang/test/Analysis/
H A Doperator-calls.cpp81 void test(int coin) { argument
84 clang_analyzer_eval(+(coin ? getSmallOpaque() : getSmallOpaque())); // expected-warning{{UNKNOWN}}
85 clang_analyzer_eval(+(coin ? getLargeOpaque() : getLargeOpaque())); // expected-warning{{UNKNOWN}}
/external/skia/src/pathops/
H A DSkOpCoincidence.cpp177 SkCoincidentSpans* coin = fHead; local
178 if (!coin) {
182 if (coin->fCoinPtTStart == coinPtTStart && coin->fCoinPtTEnd == coinPtTEnd
183 && coin->fOppPtTStart == oppPtTStart && coin->fOppPtTEnd == oppPtTEnd
184 && coin->fFlipped == flipped) {
187 } while ((coin = coin->fNext));
193 SkCoincidentSpans* coin local
301 SkCoincidentSpans* coin = fHead; local
320 SkCoincidentSpans* coin = fHead; local
350 SkCoincidentSpans* coin = fHead; local
383 SkCoincidentSpans* coin = fHead; local
[all...]
H A DSkPathOpsPostSect.cpp363 SkCoincidentSpans* coin = fHead; local
364 if (!coin) {
368 if (coin->fCoinPtTStart == coinPtTStart && coin->fCoinPtTEnd == coinPtTEnd
369 && coin->fOppPtTStart == oppPtTStart && coin->fOppPtTEnd == oppPtTEnd
370 && coin->fFlipped == flipped) {
373 } while ((coin = coin->fNext));
379 SkCoincidentSpans* coin local
471 SkCoincidentSpans* coin = fHead; local
[all...]
H A DSkOpSpan.h155 bool containsCoinEnd(const SkOpSpanBase* coin) const {
156 SkASSERT(this != coin);
159 if (next == coin) {
205 void insertCoinEnd(SkOpSpanBase* coin) { argument
206 if (containsCoinEnd(coin)) {
207 SkASSERT(coin->containsCoinEnd(this));
211 SkASSERT(this != coin);
212 SkOpSpanBase* coinNext = coin->fCoinEnd;
213 coin->fCoinEnd = this->fCoinEnd;
347 bool containsCoincidence(const SkOpSpan* coin) cons
370 insertCoincidence(SkOpSpan* coin) argument
[all...]
H A DSkPathOpsTSect.h1102 // FIXME: incomplete : if we're not at the end, find end of coin
1444 SkTCoincident<TCurve, OppCurve> coin; local
1445 coin.setPerp(fCurve, midT, midPt, sect2->fCurve);
1446 if (coin.isCoincident()) {
/external/replicaisland/src/com/replica/replicaisland/
H A DHudSystem.java198 public void setCollectableDrawables(DrawableBitmap coin, DrawableBitmap ruby) { argument
199 mCoinDrawable = coin;
/external/zopfli/src/zopflipng/lodepng/
H A Dlodepng.cpp646 A coin, this is the terminology used for the package-merge algorithm and the
647 coin collector's problem. This is used to generate the huffman tree.
648 A coin can be multiple coins (when they're merged)
653 float weight; /*the sum of all weights in this coin*/
761 /*Package-Merge algorithm represented by coin collector's problem
799 /*merge prev_row[i] and prev_row[i + 1] into new coin*/
800 Coin* coin = &coins[numcoins++]; local
801 coin_copy(coin, &prev_row[i]);
802 add_coins(coin, &prev_row[i + 1]);
816 /*calculate the lenghts of each symbol, as the amount of times a coin o
819 Coin* coin = &coins[i]; local
[all...]

Completed in 418 milliseconds