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
|
#include <stdlib.h>
#include <stdio.h>
#include <memory.h>
#include "../mem.h"
#include "xrow.h"
#include "poly.h"
xrow_t* xrow_new()
{
xrow_t*r = rfx_calloc(sizeof(xrow_t));
r->size = 16;
r->x = rfx_alloc(sizeof(r->x[0])*r->size);
return r;
}
void xrow_add(xrow_t*r, int32_t x)
{
if(r->num && r->lastx==x)
return;
r->lastx = x;
if(r->num >= r->size) {
r->size *= 2;
r->x = rfx_realloc(r->x, sizeof(r->x[0])*r->size);
}
r->x[r->num++]=x;
}
int compare_int32(const void*_i1,const void*_i2)
{
int32_t*i1 = (int32_t*)_i1;
int32_t*i2 = (int32_t*)_i2;
return *i1-*i2;
}
void xrow_sort(xrow_t*r)
{
if(!r->num)
return;
qsort(r->x, r->num, sizeof(r->x[0]), compare_int32);
int t;
int pos = 1;
int32_t lastx=r->x[0];
for(t=1;t<r->num;t++) {
if(r->x[t]!=lastx) {
r->x[pos++] = lastx = r->x[t];
}
}
r->num = pos;
}
int xrow_find(xrow_t*r, int32_t x)
{
int min, max, i, l;
for(min=0, max=r->num, i=r->num/2, l=r->num; i != l; l=i, i=(min+max)/2) {
if(x < r->x[i]) max=i;
else min=i;
}
#ifdef CHECKS
int t;
for(t=0;t<r->num;t++) {
if(x < r->x[t])
break;
}
assert(max == t);
#endif
return max;
}
char xrow_contains(xrow_t*r, int32_t x)
{
int pos = xrow_find(r,x) - 1;
return (pos>=0 && r->x[pos]==x);
}
void xrow_reset(xrow_t*r)
{
r->num = 0;
}
void xrow_dump(xrow_t*xrow, double gridsize)
{
fprintf(stderr, "x: ");
int t;
for(t=0;t<xrow->num;t++) {
if(t)
fprintf(stderr, ", ");
fprintf(stderr, "%.2f", xrow->x[t] * gridsize);
}
fprintf(stderr, "\n");
}
void xrow_destroy(xrow_t*r)
{
if(r->x) {
free(r->x);r->x = 0;
}
free(r);
}
|
