int main(int argc, char** argv)
{
struct line_buf read_ahead[READ_AHEAD_SIZE];
int read_ahead_get, read_ahead_put, second_line, eof_reached, try_count;
FILE* fp = 0;
int last_merge_try, rc = -1;
if (argc < 2) {
fprintf(stderr,
"merge_seq - merge sequence (needs presorted file)\n"
"Usage: %s <data_file> | - for stdin [--try 2]\n", argv[0]);
goto xout;
}
if (!strcmp(argv[1], "-"))
fp = stdin;
else {
fp = fopen(argv[1], "r");
if (!fp) {
fprintf(stderr, "Error opening %s.\n", argv[1]);
goto xout;
}
}
// how far to look ahead for mergable sequences
if (argc >= 4 && !strcmp(argv[2], "--try"))
last_merge_try = atoi(argv[3]);
else
last_merge_try = 2;
read_line(fp, &read_ahead[0]);
if (!read_ahead[0].buf[0]) goto out;
read_ahead_get = 0;
read_ahead_put = 1;
eof_reached = 0;
while (1) {
// fill up read ahead buffer
while (!eof_reached
&& read_ahead_put != read_ahead_get) {
read_line(fp, &read_ahead[read_ahead_put]);
if (!read_ahead[read_ahead_put].buf[0]) {
eof_reached = 1;
break;
}
if (++read_ahead_put >= READ_AHEAD_SIZE)
read_ahead_put = 0;
}
// find second line in read ahead buffer
second_line = read_ahead_get;
increment(&second_line, read_ahead, READ_AHEAD_SIZE, read_ahead_put);
if (!read_ahead[second_line].buf[0]) {
// if no more lines, print first one and exit
rc = print_line(&read_ahead[read_ahead_get]);
if (rc) goto xout;
break;
}
try_count = 0;
while (1) {
// try to merge
rc = merge_line(&read_ahead[read_ahead_get], &read_ahead[second_line]);
if (rc) goto xout;
if (!read_ahead[second_line].buf[0]) // merge successful
break;
// try next one
increment(&second_line, read_ahead,
READ_AHEAD_SIZE, read_ahead_put);
if (second_line == read_ahead_put
|| ++try_count >= last_merge_try) {
// read-ahead empty or stop trying
rc = print_line(&read_ahead[read_ahead_get]);
if (rc) goto xout;
read_ahead[read_ahead_get].buf[0] = 0;
increment(&read_ahead_get, read_ahead,
READ_AHEAD_SIZE, read_ahead_put);
break;
}
}
}
out:
return EXIT_SUCCESS;
xout:
return rc;
}
int line_area(struct Map_info *In, int *field, struct Map_info *Tmp,
struct Map_info *Out, struct field_info *Fi,
dbDriver * driver, int operator, int *ofield,
ATTRIBUTES * attr, struct ilist *BList)
{
int line, nlines, ncat;
struct line_pnts *Points;
struct line_cats *Cats, *ACats, *OCats;
char buf[1000];
dbString stmt;
Points = Vect_new_line_struct();
Cats = Vect_new_cats_struct();
ACats = Vect_new_cats_struct();
OCats = Vect_new_cats_struct();
db_init_string(&stmt);
G_message(_("Breaking lines..."));
Vect_break_lines_list(Tmp, NULL, BList, GV_LINE | GV_BOUNDARY, NULL);
/*
G_message(_("Merging lines..."));
Vect_merge_lines(Tmp, GV_LINE, NULL, NULL);
*/
nlines = Vect_get_num_lines(Tmp);
/* Warning!: cleaning process (break) creates new vertices which are usually slightly
* moved (RE), to compare such new vertex with original input is a problem?
*
* TODO?: would it be better to copy centroids also and query output map?
*/
/* Check if the line is inside or outside binput area */
G_message(_("Selecting lines..."));
ncat = 1;
for (line = 1; line <= nlines; line++) {
int ltype;
G_percent(line, nlines, 1); /* must be before any continue */
if (!Vect_line_alive(Tmp, line))
continue;
ltype = Vect_get_line_type(Tmp, line);
if (ltype == GV_BOUNDARY) { /* No more needed */
continue;
}
/* Now the type should be only GV_LINE */
/* Decide if the line is inside or outside the area. In theory:
* 1) All vertices outside
* - easy, first vertex must be outside
* 2) All vertices inside
* 3) All vertices on the boundary, we take it as inside (attention,
* result of Vect_point_in_area() for points on segments between vertices may be both
* inside or outside, because of representation of numbers)
* 4) One or two end vertices on the boundary, all others outside
* 5) One or two end vertices on the boundary, all others inside
*
*/
/* Note/TODO: the test done is quite simple, check the point in the middle of segment.
* If the line overlaps the boundary, the result may be both outside and inside
* this should be solved (check angles?)
* This should not happen if Vect_break_lines_list() works correctly
*/
/* merge here */
merge_line(Tmp, line, Points, Cats);
G_debug(3, "line = %d", line);
point_area(&(In[1]), field[1], (Points->x[0] + Points->x[1]) / 2,
(Points->y[0] + Points->y[1]) / 2, ACats);
if ((ACats->n_cats > 0 && operator == OP_AND) ||
(ACats->n_cats == 0 && operator == OP_NOT)) {
int i;
/* Point is inside */
G_debug(3, "OK, write line, line ncats = %d area ncats = %d",
Cats->n_cats, ACats->n_cats);
Vect_reset_cats(OCats);
if (ofield[0] > 0) {
/* rewrite with all combinations of acat - bcat (-1 in cycle for null) */
for (i = -1; i < Cats->n_cats; i++) { /* line cats */
int j;
if (i == -1 && Cats->n_cats > 0)
continue; /* no need to make null */
for (j = -1; j < ACats->n_cats; j++) {
if (j == -1 && ACats->n_cats > 0)
continue; /* no need to make null */
if (ofield[0] > 0)
Vect_cat_set(OCats, ofield[0], ncat);
/* Attributes */
if (driver) {
ATTR *at;
sprintf(buf, "insert into %s values ( %d", Fi->table,
ncat);
db_set_string(&stmt, buf);
/* cata */
if (i >= 0) {
if (attr[0].columns) {
at = find_attr(&(attr[0]), Cats->cat[i]);
if (!at)
G_fatal_error(_("Attribute not found"));
if (at->values)
db_append_string(&stmt, at->values);
else
db_append_string(&stmt,
attr[0].null_values);
}
else {
sprintf(buf, ", %d", Cats->cat[i]);
db_append_string(&stmt, buf);
}
}
else {
if (attr[0].columns) {
db_append_string(&stmt, attr[0].null_values);
}
else {
sprintf(buf, ", null");
db_append_string(&stmt, buf);
}
}
/* catb */
if (j >= 0) {
if (attr[1].columns) {
at = find_attr(&(attr[1]), ACats->cat[j]);
if (!at)
G_fatal_error(_("Attribute not found"));
if (at->values)
db_append_string(&stmt, at->values);
else
db_append_string(&stmt,
attr[1].null_values);
}
else {
sprintf(buf, ", %d", ACats->cat[j]);
db_append_string(&stmt, buf);
}
}
else {
if (attr[1].columns) {
db_append_string(&stmt, attr[1].null_values);
}
else {
sprintf(buf, ", null");
db_append_string(&stmt, buf);
}
}
db_append_string(&stmt, " )");
G_debug(3, "%s", db_get_string(&stmt));
if (db_execute_immediate(driver, &stmt) != DB_OK)
G_warning(_("Unable to insert new record: '%s'"),
db_get_string(&stmt));
}
ncat++;
}
}
}
/* Add cats from input vectors */
if (ofield[1] > 0 && field[0] > 0) {
for (i = 0; i < Cats->n_cats; i++) {
if (Cats->field[i] == field[0])
Vect_cat_set(OCats, ofield[1], Cats->cat[i]);
}
}
if (ofield[2] > 0 && field[1] > 0 && ofield[1] != ofield[2]) {
for (i = 0; i < ACats->n_cats; i++) {
if (ACats->field[i] == field[1])
Vect_cat_set(OCats, ofield[2], ACats->cat[i]);
}
}
Vect_write_line(Out, ltype, Points, OCats);
}
}
return 0;
}
static int do_edit(int argc, char *argv[])
{
int lastscrcol;
int i;
int linepos;
int c;
if (argc != 2)
return COMMAND_ERROR_USAGE;
screenwidth = 80;
screenheight = 25;
/* check if we are called as "sedit" instead of "edit" */
if (*argv[0] == 's') {
smartscroll = 1;
getwinsize();
}
buffer = NULL;
if(edit_read_file(argv[1]))
return 1;
cursx = 0;
cursy = 0;
textx = 0;
scrcol = 0;
curline = buffer;
scrline = curline;
lastscrline = scrline;
lastscrcol = 0;
printf("%c[2J", 27);
pos(0, -1);
printf("%c[7m %-25s <ctrl-d>: Save and quit <ctrl-c>: quit %c[0m",
27, argv[1], 27);
printf("%c[2;%dr", 27, screenheight);
screenheight--; /* status line */
pos(0, 0);
refresh(1);
while (1) {
int curlen = strlen(curline->data);
if (textx > curlen)
textx = curlen;
if (textx < 1)
textx = 0;
screenline(curline->data, &linepos);
if (linepos > scrcol + screenwidth)
scrcol = linepos - screenwidth;
if (scrcol > linepos)
scrcol = linepos;
cursx = linepos - scrcol;
while (cursy >= screenheight) {
cursy--;
scrline = scrline->next;
}
while (cursy < 0) {
cursy++;
scrline = scrline->prev;
}
if (scrline != lastscrline || scrcol != lastscrcol)
refresh(0);
lastscrcol = scrcol;
lastscrline = scrline;
pos(cursx, cursy);
c = read_key();
switch (c) {
case BB_KEY_UP:
if (!curline->prev)
continue;
curline = curline->prev;
cursy--;
textx = setpos(curline->data, linepos);
break;
case BB_KEY_DOWN:
if (!curline->next)
continue;
curline = curline->next;
cursy++;
textx = setpos(curline->data, linepos);
break;
case BB_KEY_RIGHT:
textx++;
break;
case BB_KEY_LEFT:
textx--;
break;
case BB_KEY_HOME:
textx = 0;
break;
case BB_KEY_END:
textx = curlen;
break;
case BB_KEY_PAGEUP:
for (i = 0; i < screenheight - 1; i++) {
if (!curline->prev)
break;
cursy--;
curline = curline->prev;
}
textx = setpos(curline->data, linepos);
break;
case BB_KEY_PAGEDOWN:
for (i = 0; i < screenheight - 1; i++) {
if (!curline->next)
break;
cursy++;
curline = curline->next;
}
textx = setpos(curline->data, linepos);
break;
case BB_KEY_DEL:
if (textx == curlen) {
if (curline->next)
merge_line(curline);
} else
delete_char(textx);
break;
case 13:
case 10:
split_line();
break;
case 127:
case 8:
if (textx > 0) {
textx--;
delete_char(textx);
} else {
if (!curline->prev)
break;
curline = curline->prev;
cursy--;
textx = strlen(curline->data);
merge_line(curline);
}
break;
case 4:
save_file(argv[1]);
goto out;
case 3:
goto out;
default:
if ((signed char)c != -1)
insert_char(c);
}
}
out:
free_buffer();
printf("%c[2J%c[r", 27, 27);
printf("\n");
return 0;
}
