HomeSort by relevance Sort by last modified time
    Searched defs:coin (Results 1 - 10 of 10) sorted by null

  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/
RepresentTest.java 71 CustomBean coin = (CustomBean) data; local
72 String value = coin.getPrefix() + "d" + coin.getSuffix();
  /external/skia/tests/
PathOpsDebug.cpp 251 const SkOpAngle* SkPathOpsDebug::DebugCoincidenceAngle(SkOpCoincidence* coin, int id) {
252 return coin->debugAngle(id);
255 SkOpContour* SkPathOpsDebug::DebugCoincidenceContour(SkOpCoincidence* coin, int id) {
256 return coin->debugContour(id);
259 const SkOpPtT* SkPathOpsDebug::DebugCoincidencePtT(SkOpCoincidence* coin, int id) {
260 return coin->debugPtT(id);
263 const SkOpSegment* SkPathOpsDebug::DebugCoincidenceSegment(SkOpCoincidence* coin, int id) {
264 return coin->debugSegment(id);
267 const SkOpSpanBase* SkPathOpsDebug::DebugCoincidenceSpan(SkOpCoincidence* coin, int id) {
268 return coin->debugSpan(id)
1069 const SkOpSpanBase* coin = this->coinEnd(); local
1105 SkOpSpan* coin = fCoincident; local
    [all...]
  /external/skqp/tests/
PathOpsDebug.cpp 251 const SkOpAngle* SkPathOpsDebug::DebugCoincidenceAngle(SkOpCoincidence* coin, int id) {
252 return coin->debugAngle(id);
255 SkOpContour* SkPathOpsDebug::DebugCoincidenceContour(SkOpCoincidence* coin, int id) {
256 return coin->debugContour(id);
259 const SkOpPtT* SkPathOpsDebug::DebugCoincidencePtT(SkOpCoincidence* coin, int id) {
260 return coin->debugPtT(id);
263 const SkOpSegment* SkPathOpsDebug::DebugCoincidenceSegment(SkOpCoincidence* coin, int id) {
264 return coin->debugSegment(id);
267 const SkOpSpanBase* SkPathOpsDebug::DebugCoincidenceSpan(SkOpCoincidence* coin, int id) {
268 return coin->debugSpan(id)
1069 const SkOpSpanBase* coin = this->coinEnd(); local
1105 SkOpSpan* coin = fCoincident; local
    [all...]
  /external/skia/src/pathops/
SkOpCoincidence.cpp 429 SkCoincidentSpans* coin = this->fHead; local
430 if (!coin) {
434 const SkOpPtT* startPtT = coin->coinPtTStart();
435 const SkOpPtT* oStartPtT = coin->oppPtTStart();
439 SkOPASSERT(coin->coinPtTEnd()->contains(coin->oppPtTEnd()));
442 const SkOpSpanBase* end = coin->coinPtTEnd()->span();
443 const SkOpSpanBase* oEnd = coin->oppPtTEnd()->span();
447 FAIL_IF(!coin->flipped() && !oStart->upCastable());
448 const SkOpSpanBase* oTest = coin->flipped() ? oStart->prev() : oStart->upCast()->next()
985 SkCoincidentSpans* coin = fHead; local
997 SkCoincidentSpans* coin = fHead; local
1202 SkCoincidentSpans* coin = fHead; local
1311 SkCoincidentSpans* coin = fHead; local
1409 SkCoincidentSpans* coin = fHead; local
    [all...]
SkPathOpsTSect.h 1655 SkTCoincident<TCurve, OppCurve> coin; local
    [all...]
SkPathOpsDebug.cpp 25 #define FAIL_IF(cond, coin) \
26 do { if (cond) log->record(SkPathOpsDebug::kFail_Glitch, coin); } while (false)
135 void record(GlitchType type, const SkCoincidentSpans* coin,
138 glitch->fCoinSpan = coin->coinPtTStart();
139 glitch->fEndSpan = coin->coinPtTEnd();
163 void record(GlitchType type, const SkCoincidentSpans* coin,
166 glitch->fCoinSpan = coin->coinPtTStart();
167 glitch->fEndSpan = coin->coinPtTEnd();
173 void record(GlitchType type, const SkCoincidentSpans* coin,
177 glitch->fCoinSpan = coin->coinPtTStart()
1632 const SkCoincidentSpans* coin = this->fHead; local
1996 const SkCoincidentSpans* coin = fHead; local
2013 const SkCoincidentSpans* coin = fHead; local
2041 const SkCoincidentSpans* coin = fHead; local
2267 const SkCoincidentSpans* coin = head; local
2307 const SkCoincidentSpans* coin = fHead; local
    [all...]
  /external/skqp/src/pathops/
SkOpCoincidence.cpp 429 SkCoincidentSpans* coin = this->fHead; local
430 if (!coin) {
434 const SkOpPtT* startPtT = coin->coinPtTStart();
435 const SkOpPtT* oStartPtT = coin->oppPtTStart();
439 SkOPASSERT(coin->coinPtTEnd()->contains(coin->oppPtTEnd()));
442 const SkOpSpanBase* end = coin->coinPtTEnd()->span();
443 const SkOpSpanBase* oEnd = coin->oppPtTEnd()->span();
447 FAIL_IF(!coin->flipped() && !oStart->upCastable());
448 const SkOpSpanBase* oTest = coin->flipped() ? oStart->prev() : oStart->upCast()->next()
985 SkCoincidentSpans* coin = fHead; local
997 SkCoincidentSpans* coin = fHead; local
1202 SkCoincidentSpans* coin = fHead; local
1311 SkCoincidentSpans* coin = fHead; local
1409 SkCoincidentSpans* coin = fHead; local
    [all...]
SkPathOpsTSect.h 1655 SkTCoincident<TCurve, OppCurve> coin; local
    [all...]
SkPathOpsDebug.cpp 25 #define FAIL_IF(cond, coin) \
26 do { if (cond) log->record(SkPathOpsDebug::kFail_Glitch, coin); } while (false)
135 void record(GlitchType type, const SkCoincidentSpans* coin,
138 glitch->fCoinSpan = coin->coinPtTStart();
139 glitch->fEndSpan = coin->coinPtTEnd();
163 void record(GlitchType type, const SkCoincidentSpans* coin,
166 glitch->fCoinSpan = coin->coinPtTStart();
167 glitch->fEndSpan = coin->coinPtTEnd();
173 void record(GlitchType type, const SkCoincidentSpans* coin,
177 glitch->fCoinSpan = coin->coinPtTStart()
1632 const SkCoincidentSpans* coin = this->fHead; local
1996 const SkCoincidentSpans* coin = fHead; local
2013 const SkCoincidentSpans* coin = fHead; local
2041 const SkCoincidentSpans* coin = fHead; local
2267 const SkCoincidentSpans* coin = head; local
2307 const SkCoincidentSpans* coin = fHead; local
    [all...]
  /external/zopfli/src/zopflipng/lodepng/
lodepng.cpp 646 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)
650 typedef struct Coin
653 float weight; /*the sum of all weights in this coin*/
654 } Coin;
656 static void coin_init(Coin* c)
664 uivector_cleanup(&((Coin*)c)->symbols);
667 static void coin_copy(Coin* c1, const Coin* c2
800 Coin* coin = &coins[numcoins++]; local
819 Coin* coin = &coins[i]; local
    [all...]

Completed in 838 milliseconds