Searched defs:coin (Results 1 - 5 of 5) sorted by relevance
/external/clang/test/Analysis/ |
H A D | operator-calls.cpp | 81 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/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 311 bool coin) { 345 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); 310 oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, bool coin) argument
|
/external/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 311 bool coin) { 345 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); 310 oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, bool coin) argument
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | HudSystem.java | 198 public void setCollectableDrawables(DrawableBitmap coin, DrawableBitmap ruby) { argument 199 mCoinDrawable = coin;
|
/external/zopfli/src/zopflipng/lodepng/ |
H A D | 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) 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 174 milliseconds