1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
#ifndef __active_h__
#define __active_h__
#include "poly.h"
typedef struct _actlist
{
segment_t*list;
int size;
#ifdef SPLAY
segment_t*root;
#endif
} actlist_t;
#define actlist_left(a,s) ((s)->left)
#define actlist_right(a,s) ((s)?(s)->right:(a)->list)
actlist_t* actlist_new();
void actlist_destroy(actlist_t*a);
int actlist_size(actlist_t*a);
void actlist_verify(actlist_t*a, int32_t y);
void actlist_dump(actlist_t*a, int32_t y, double gridsize);
segment_t* actlist_find(actlist_t*a, point_t p1, point_t p2); // finds segment immediately to the left of p1 (breaking ties w/ p2)
void actlist_insert(actlist_t*a, point_t p1, point_t p2, segment_t*s);
void actlist_delete(actlist_t*a, segment_t*s);
void actlist_swap(actlist_t*a, segment_t*s1, segment_t*s2);
segment_t* actlist_leftmost(actlist_t*a);
segment_t* actlist_rightmost(actlist_t*a);
#endif
|
