Lines Matching defs:angle
12 /* Angles are sorted counterclockwise. The smallest angle has a positive x and the smallest
13 positive y. The largest angle has a positive x and a zero y. */
31 /* quarter angle values for sector
35 1 x > 0, y > 0, x > y nearer horizontal angle
37 3 x > 0, y > 0, x == y 45 angle
39 5 x > 0, y > 0, x < y nearer vertical angle
154 // FIXME : once this is verified to work, remove one opposite angle call
383 // the original angle is too short to get meaningful sector information
732 // OPTIMIZE: if this loops to only one other angle, after first compare fails, insert on other side
734 bool SkOpAngle::insert(SkOpAngle* angle) {
735 if (angle->fNext) {
736 if (loopCount() >= angle->loopCount()) {
737 if (!merge(angle)) {
741 if (!angle->merge(this)) {
745 angle->insert(this);
755 if (singleton || angle->after(this)) {
756 this->fNext = angle;
757 angle->fNext = next;
759 next->fNext = angle;
760 angle->fNext = this;
769 if (angle->after(last) ^ (angle->tangentsAmbiguous() & flipAmbiguity)) {
770 last->fNext = angle;
771 angle->fNext = next;
796 bool SkOpAngle::loopContains(const SkOpAngle* angle) const {
802 const SkOpSegment* tSegment = angle->fStart->segment();
803 double tStart = angle->fStart->t();
804 double tEnd = angle->fEnd->t();
833 bool SkOpAngle::merge(SkOpAngle* angle) {
835 SkASSERT(angle->fNext);
836 SkOpAngle* working = angle;
842 } while (working != angle);
848 } while (working != angle);
1086 && (fSectorStart & 3) != 3) { // if the sector has no span, it can't be an exact angle
1122 // straight angle when : v2.x * (dq1.y - q1[0].y) == v2.y * (dq1.x - q1[0].x)