X-Git-Url: http://git.asbjorn.biz/?p=swftools.git;a=blobdiff_plain;f=lib%2Fgfxpoly%2Factive.c;h=02638f5cc47b6bb6788dbac98bfd7725f2ebc447;hp=56c7b9086e359e5ad8de58a31e6af86f0afabeb1;hb=de3641737991ed13571eb947068472cf73001032;hpb=f5626be739a1e1b61f89d7a389be3c4b5d4d9128 diff --git a/lib/gfxpoly/active.c b/lib/gfxpoly/active.c index 56c7b90..02638f5 100644 --- a/lib/gfxpoly/active.c +++ b/lib/gfxpoly/active.c @@ -1,4 +1,3 @@ -#include #include "../q.h" #include "active.h" @@ -12,27 +11,44 @@ void actlist_destroy(actlist_t*a) free(a); } -void actlist_verify_and_dump(actlist_t*a, int32_t y) +void actlist_dump(actlist_t*a, int32_t y) { segment_t*s = a->list; - assert(!s || !s->left); double lastx; + char bad = 0; while(s) { if(y) { double x = ((double)s->delta.x*(y-s->a.y)/s->delta.y)+s->a.x; if(s!=a->list) { - if(lastx>x) fprintf(stderr, "?%f<->%f? ", lastx, x); + if(lastx>x) + fprintf(stderr, "?%f<->%f? ", lastx, x); } lastx = x; } - assert(!s->left || s->left->right == s); - assert(!s->right || s->right->left == s); fprintf(stderr, "[%d]", s->nr); s = s->right; if(s) fprintf(stderr, " "); else fprintf(stderr, "\n"); } } +void actlist_verify(actlist_t*a, int32_t y) +{ + segment_t*s = a->list; + assert(!s || !s->left); + double lastx; + while(s) { + if(y) { + double x = ((double)s->delta.x*(y-s->a.y)/s->delta.y)+s->a.x; + if(s!=a->list) { + assert(lastx<=x); + } + lastx = x; + } + assert(!s->left || s->left->right == s); + assert(!s->right || s->right->left == s); + s = s->right; + } +} segment_t* actlist_find(actlist_t*a, point_t p1, point_t p2) { @@ -76,6 +92,7 @@ static void actlist_insert_after(actlist_t*a, segment_t*left, segment_t*s) s->left->right = s; if(s->right) s->right->left = s; + a->size++; } void actlist_insert(actlist_t*a, point_t p, segment_t*s) @@ -95,6 +112,11 @@ void actlist_delete(actlist_t*a, segment_t*s) s->right->left = s->left; } s->left = s->right = 0; + a->size--; +} +int actlist_size(actlist_t*a) +{ + return a->size; } segment_t* actlist_leftmost(actlist_t*a) @@ -102,6 +124,18 @@ segment_t* actlist_leftmost(actlist_t*a) return a->list; } +segment_t* actlist_rightmost(actlist_t*a) +{ + /* this is only used in checks, so it doesn't matter that it's slow */ + segment_t*s = a->list; + segment_t*last = 0; + while(s) { + last = s; + s = s->right; + } + return last; +} + segment_t* actlist_left(actlist_t*a, segment_t*s) { return s->left; @@ -109,7 +143,8 @@ segment_t* actlist_left(actlist_t*a, segment_t*s) segment_t* actlist_right(actlist_t*a, segment_t*s) { - return s->right; + if(s) return s->right; + else return a->list; } void actlist_swap(actlist_t*a, segment_t*s1, segment_t*s2)