Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "SkRRect.h" | 8 #include "SkRRect.h" |
| 9 #include "SkMatrix.h" | 9 #include "SkMatrix.h" |
| 10 | 10 |
| (...skipping 445 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 456 if (0 != fRadii[i].fX && 0 != fRadii[i].fY) { | 456 if (0 != fRadii[i].fX && 0 != fRadii[i].fY) { |
| 457 allCornersSquare = false; | 457 allCornersSquare = false; |
| 458 } | 458 } |
| 459 } | 459 } |
| 460 bool patchesOfNine = radii_are_nine_patch(fRadii); | 460 bool patchesOfNine = radii_are_nine_patch(fRadii); |
| 461 | 461 |
| 462 switch (fType) { | 462 switch (fType) { |
| 463 case kEmpty_Type: | 463 case kEmpty_Type: |
| 464 SkASSERT(fRect.isEmpty()); | 464 SkASSERT(fRect.isEmpty()); |
| 465 SkASSERT(allRadiiZero && allRadiiSame && allCornersSquare); | 465 SkASSERT(allRadiiZero && allRadiiSame && allCornersSquare); |
| 466 | 466 |
|
robertphillips
2014/04/03 12:35:55
I don't think this is required at all. The precedi
| |
| 467 SkASSERT(0 == fRect.fLeft && 0 == fRect.fTop && | 467 SkASSERT(fRect.fLeft == fRect.fRight && fRect.fTop == fRect.fBottom) ; |
| 468 0 == fRect.fRight && 0 == fRect.fBottom); | |
| 469 break; | 468 break; |
| 470 case kRect_Type: | 469 case kRect_Type: |
| 471 SkASSERT(!fRect.isEmpty()); | 470 SkASSERT(!fRect.isEmpty()); |
| 472 SkASSERT(allRadiiZero && allRadiiSame && allCornersSquare); | 471 SkASSERT(allRadiiZero && allRadiiSame && allCornersSquare); |
| 473 break; | 472 break; |
| 474 case kOval_Type: | 473 case kOval_Type: |
| 475 SkASSERT(!fRect.isEmpty()); | 474 SkASSERT(!fRect.isEmpty()); |
| 476 SkASSERT(!allRadiiZero && allRadiiSame && !allCornersSquare); | 475 SkASSERT(!allRadiiZero && allRadiiSame && !allCornersSquare); |
| 477 | 476 |
| 478 for (int i = 0; i < 4; ++i) { | 477 for (int i = 0; i < 4; ++i) { |
| (...skipping 16 matching lines...) Expand all Loading... | |
| 495 SkASSERT(!patchesOfNine); | 494 SkASSERT(!patchesOfNine); |
| 496 break; | 495 break; |
| 497 case kUnknown_Type: | 496 case kUnknown_Type: |
| 498 // no limits on this | 497 // no limits on this |
| 499 break; | 498 break; |
| 500 } | 499 } |
| 501 } | 500 } |
| 502 #endif // SK_DEBUG | 501 #endif // SK_DEBUG |
| 503 | 502 |
| 504 /////////////////////////////////////////////////////////////////////////////// | 503 /////////////////////////////////////////////////////////////////////////////// |
| OLD | NEW |