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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
#include "poly.h"
edgestyle_t edgestyle_default;
windstate_t windstate_nonfilled = {
is_filled: 0,
wind_nr: 0,
};
// -------------------- even/odd ----------------------
windstate_t evenodd_start(windcontext_t*context)
{
return windstate_nonfilled;
}
windstate_t evenodd_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
{
assert(edge);
left.is_filled ^= 1;
return left;
}
edgestyle_t* evenodd_diff(windstate_t*left, windstate_t*right)
{
if(left->is_filled==right->is_filled)
return 0;
else
return &edgestyle_default;
}
windrule_t windrule_evenodd = {
start: evenodd_start,
add: evenodd_add,
diff: evenodd_diff,
};
// -------------------- circular ----------------------
windstate_t circular_start(windcontext_t*context)
{
return windstate_nonfilled;
}
windstate_t circular_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
{
assert(edge);
/* which one is + and which one - doesn't actually make any difference */
if(dir == DIR_DOWN)
left.wind_nr++;
else
left.wind_nr--;
left.is_filled = left.wind_nr != 0;
return left;
}
edgestyle_t* circular_diff(windstate_t*left, windstate_t*right)
{
if(left->is_filled==right->is_filled)
return 0;
else
return &edgestyle_default;
}
windrule_t windrule_circular = {
start: circular_start,
add: circular_add,
diff: circular_diff,
};
// -------------------- intersect ----------------------
windstate_t intersect_start(windcontext_t*context)
{
return windstate_nonfilled;
}
windstate_t intersect_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
{
assert(master < context->num_polygons);
left.wind_nr ^= 1<<master;
left.is_filled = (left.wind_nr == (1<<context->num_polygons)-1);
return left;
}
edgestyle_t* intersect_diff(windstate_t*left, windstate_t*right)
{
if(left->is_filled==right->is_filled)
return 0;
else
return &edgestyle_default;
}
windrule_t windrule_intersect = {
start: intersect_start,
add: intersect_add,
diff: intersect_diff,
};
// -------------------- union ----------------------
windstate_t union_start(windcontext_t*context)
{
return windstate_nonfilled;
}
windstate_t union_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
{
assert(master<sizeof(left.wind_nr)*8); //up to 32/64 polygons max
left.wind_nr ^= 1<<master;
left.is_filled = (left.wind_nr!=0);
return left;
}
edgestyle_t* union_diff(windstate_t*left, windstate_t*right)
{
if(left->is_filled==right->is_filled)
return 0;
else
return &edgestyle_default;
}
windrule_t windrule_union = {
start: union_start,
add: union_add,
diff: union_diff,
};
/*
} else if (rule == WIND_NONZERO) {
fill = wind!=0;
} else if (rule == WIND_ODDEVEN) {
fill = wind&1;
} else { // rule == WIND_POSITIVE
fill = wind>=1;
}
*/
|
