26
26
27
27
EFFECTIVE_AREAS * initiate_effectivearea ( const POINTARRAY * inpts )
28
28
{
29
- LWDEBUG ( 2 , "Entered initiate_effectivearea" );
29
+ // LWDEBUG( 2, "Entered initiate_effectivearea" );
30
30
EFFECTIVE_AREAS * ea ;
31
31
ea = ( EFFECTIVE_AREAS * )lwalloc ( sizeof ( EFFECTIVE_AREAS ) );
32
32
ea -> initial_arealist = ( areanode * )lwalloc ( inpts -> npoints * sizeof ( areanode ) );
@@ -69,7 +69,7 @@ static double triarea2d( const double *P1, const double *P2, const double *P3 )
69
69
*/
70
70
static double triarea3d ( const double * P1 , const double * P2 , const double * P3 )
71
71
{
72
- LWDEBUG ( 2 , "Entered triarea3d" );
72
+ // LWDEBUG( 2, "Entered triarea3d" );
73
73
double ax , bx , ay , by , az , bz , cx , cy , cz , area ;
74
74
75
75
ax = P1 [0 ] - P2 [0 ];
@@ -110,7 +110,7 @@ static int cmpfunc( const void * a, const void * b )
110
110
*/
111
111
static void down ( MINHEAP * tree , areanode * arealist , int parent )
112
112
{
113
- LWDEBUG ( 2 , "Entered down" );
113
+ // LWDEBUG( 2, "Entered down" );
114
114
areanode * * treearray = tree -> key_array ;
115
115
int left = parent * 2 + 1 ;
116
116
int right = left + 1 ;
@@ -149,9 +149,11 @@ static void down( MINHEAP *tree, areanode *arealist, int parent )
149
149
*/
150
150
static void up ( MINHEAP * tree , areanode * arealist , int c )
151
151
{
152
- LWDEBUG ( 2 , "Entered up" );
152
+ // LWDEBUG( 2, "Entered up" );
153
153
areanode * tmp ;
154
154
155
+ Q_UNUSED ( arealist );
156
+
155
157
areanode * * treearray = tree -> key_array ;
156
158
int parent = ( c - 1 ) / 2 ;
157
159
@@ -175,7 +177,7 @@ static void up( MINHEAP *tree, areanode *arealist, int c )
175
177
*/
176
178
static areanode * minheap_pop ( MINHEAP * tree , areanode * arealist )
177
179
{
178
- LWDEBUG ( 2 , "Entered minheap_pop" );
180
+ // LWDEBUG( 2, "Entered minheap_pop" );
179
181
areanode * res = tree -> key_array [0 ];
180
182
181
183
// put last value first
@@ -206,7 +208,7 @@ static void minheap_update( MINHEAP *tree, areanode *arealist, int idx )
206
208
*/
207
209
static void tune_areas ( EFFECTIVE_AREAS * ea , int avoid_collaps , int set_area , double trshld )
208
210
{
209
- LWDEBUG ( 2 , "Entered tune_areas" );
211
+ // LWDEBUG( 2, "Entered tune_areas" );
210
212
const double * P1 ;
211
213
const double * P2 ;
212
214
const double * P3 ;
@@ -226,7 +228,7 @@ static void tune_areas( EFFECTIVE_AREAS *ea, int avoid_collaps, int set_area, do
226
228
for ( i = 0 ; i < npoints ; i ++ )
227
229
{
228
230
tree .key_array [i ] = ea -> initial_arealist + i ;
229
- LWDEBUGF ( 2 , "add nr %d, with area %lf, and %lf" , i , ea -> initial_arealist [i ].area , tree .key_array [i ]-> area );
231
+ // LWDEBUGF( 2, "add nr %d, with area %lf, and %lf", i, ea->initial_arealist[i].area, tree.key_array[i]->area );
230
232
}
231
233
tree .usedSize = npoints ;
232
234
@@ -237,7 +239,7 @@ static void tune_areas( EFFECTIVE_AREAS *ea, int avoid_collaps, int set_area, do
237
239
for ( i = 0 ; i < npoints ; i ++ )
238
240
{
239
241
(( areanode * )tree .key_array [i ] )-> treeindex = i ;
240
- LWDEBUGF ( 4 , "Check ordering qsort gives, area=%lf and belong to point %d" , (( areanode * )tree .key_array [i ] )-> area , tree .key_array [i ] - ea -> initial_arealist );
242
+ // LWDEBUGF( 4, "Check ordering qsort gives, area=%lf and belong to point %d", (( areanode* )tree.key_array[i] )->area, tree.key_array[i] - ea->initial_arealist );
241
243
}
242
244
243
245
// Ok, now we have a minHeap, just need to keep it
@@ -313,7 +315,7 @@ static void tune_areas( EFFECTIVE_AREAS *ea, int avoid_collaps, int set_area, do
313
315
*/
314
316
void ptarray_calc_areas ( EFFECTIVE_AREAS * ea , int avoid_collaps , int set_area , double trshld )
315
317
{
316
- LWDEBUG ( 2 , "Entered ptarray_calc_areas" );
318
+ // LWDEBUG( 2, "Entered ptarray_calc_areas" );
317
319
int i ;
318
320
int npoints = ea -> inpts -> npoints ;
319
321
int is3d = FLAGS_GET_Z ( ea -> inpts -> flags );
@@ -343,7 +345,7 @@ void ptarray_calc_areas( EFFECTIVE_AREAS *ea, int avoid_collaps, int set_area, d
343
345
else
344
346
area = triarea2d ( P1 , P2 , P3 );
345
347
346
- LWDEBUGF ( 4 , "Write area %lf to point %d on address %p" , area , i , & ( ea -> initial_arealist [i ].area ) );
348
+ // LWDEBUGF( 4, "Write area %lf to point %d on address %p", area, i, &( ea->initial_arealist[i].area ) );
347
349
ea -> initial_arealist [i ].area = area ;
348
350
P1 = P2 ;
349
351
P2 = P3 ;
0 commit comments