2015-10-16 20:31:04 +00:00
|
|
|
/*
|
|
|
|
* Mr. 4th Dimention - Allen Webster
|
|
|
|
* Four Tech
|
|
|
|
*
|
2015-10-19 01:13:15 +00:00
|
|
|
* public domain -- no warranty is offered or implied; use this code at your own risk
|
|
|
|
*
|
2015-10-16 20:31:04 +00:00
|
|
|
* 16.10.2015
|
|
|
|
*
|
|
|
|
* Buffer data object
|
|
|
|
* type - Golden Array
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2015-10-19 01:13:15 +00:00
|
|
|
// TOP
|
|
|
|
|
2015-10-16 20:31:04 +00:00
|
|
|
typedef struct{
|
|
|
|
char *data;
|
|
|
|
int size, max;
|
2015-10-19 01:13:15 +00:00
|
|
|
|
|
|
|
int *line_starts;
|
2015-10-24 22:14:33 +00:00
|
|
|
float *line_widths;
|
2015-10-19 01:13:15 +00:00
|
|
|
int line_count;
|
|
|
|
int line_max;
|
|
|
|
int widths_max;
|
2015-10-16 20:31:04 +00:00
|
|
|
} Buffer;
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
inline_4tech int
|
|
|
|
buffer_size(Buffer *buffer){
|
|
|
|
return buffer->size;
|
|
|
|
}
|
|
|
|
|
2015-10-16 20:31:04 +00:00
|
|
|
typedef struct{
|
|
|
|
Buffer *buffer;
|
2015-10-22 03:23:59 +00:00
|
|
|
char *data, *end;
|
2015-10-24 22:14:33 +00:00
|
|
|
int absolute_pos;
|
2015-10-16 20:31:04 +00:00
|
|
|
int size;
|
2015-10-22 03:23:59 +00:00
|
|
|
int page_size;
|
2015-10-19 01:13:15 +00:00
|
|
|
} Buffer_Stringify_Loop;
|
|
|
|
|
|
|
|
inline_4tech Buffer_Stringify_Loop
|
2015-10-22 03:23:59 +00:00
|
|
|
buffer_stringify_loop(Buffer *buffer, int start, int end, int page_size){
|
2015-10-19 01:13:15 +00:00
|
|
|
Buffer_Stringify_Loop result;
|
2015-10-22 03:23:59 +00:00
|
|
|
if (0 <= start && start < end && end <= buffer->size){
|
2015-10-19 01:13:15 +00:00
|
|
|
result.buffer = buffer;
|
2015-10-24 22:14:33 +00:00
|
|
|
result.absolute_pos = start;
|
2015-10-19 01:13:15 +00:00
|
|
|
result.data = buffer->data + start;
|
|
|
|
result.size = end - start;
|
2015-10-22 03:23:59 +00:00
|
|
|
result.end = buffer->data + end;
|
|
|
|
result.page_size = page_size;
|
|
|
|
if (result.size > page_size) result.size = page_size;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
else result.buffer = 0;
|
2015-10-16 20:31:04 +00:00
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline_4tech int
|
2015-10-19 01:13:15 +00:00
|
|
|
buffer_stringify_good(Buffer_Stringify_Loop *loop){
|
2015-10-16 20:31:04 +00:00
|
|
|
int result;
|
|
|
|
result = (loop->buffer != 0);
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline_4tech void
|
2015-10-19 01:13:15 +00:00
|
|
|
buffer_stringify_next(Buffer_Stringify_Loop *loop){
|
2015-10-22 03:23:59 +00:00
|
|
|
if (loop->data + loop->size == loop->end) loop->buffer = 0;
|
|
|
|
else{
|
|
|
|
loop->data += loop->page_size;
|
2015-10-24 22:14:33 +00:00
|
|
|
loop->absolute_pos += loop->page_size;
|
2015-10-22 03:23:59 +00:00
|
|
|
loop->size = (int)(loop->end - loop->data);
|
|
|
|
if (loop->size > loop->page_size) loop->size = loop->page_size;
|
|
|
|
}
|
2015-10-16 20:31:04 +00:00
|
|
|
}
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
typedef struct{
|
|
|
|
Buffer *buffer;
|
|
|
|
char *data, *end;
|
|
|
|
int absolute_pos;
|
|
|
|
int size;
|
|
|
|
int page_size;
|
|
|
|
} Buffer_Backify_Loop;
|
2015-10-19 01:13:15 +00:00
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
inline_4tech Buffer_Backify_Loop
|
|
|
|
buffer_backify_loop(Buffer *buffer, int start, int end, int page_size){
|
|
|
|
Buffer_Backify_Loop result;
|
|
|
|
if (0 <= end && end < start && start <= buffer->size){
|
|
|
|
result.buffer = buffer;
|
|
|
|
result.end = buffer->data + end;
|
|
|
|
result.page_size = page_size;
|
|
|
|
result.size = start - end;
|
|
|
|
if (result.size > page_size) result.size = page_size;
|
|
|
|
result.absolute_pos = start - result.size;
|
|
|
|
result.data = buffer->data + result.absolute_pos;
|
2015-10-16 20:31:04 +00:00
|
|
|
}
|
2015-10-24 22:14:33 +00:00
|
|
|
else result.buffer = 0;
|
|
|
|
return(result);
|
2015-10-16 20:31:04 +00:00
|
|
|
}
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
inline_4tech int
|
|
|
|
buffer_backify_good(Buffer_Backify_Loop *loop){
|
2015-10-16 20:31:04 +00:00
|
|
|
int result;
|
2015-10-24 22:14:33 +00:00
|
|
|
result = (loop->buffer != 0);
|
2015-10-19 01:13:15 +00:00
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
inline_4tech void
|
|
|
|
buffer_backify_next(Buffer_Backify_Loop *loop){
|
|
|
|
char *old_data;
|
|
|
|
if (loop->data == loop->end) loop->buffer = 0;
|
|
|
|
else{
|
|
|
|
old_data = loop->data;
|
|
|
|
loop->data -= loop->page_size;
|
|
|
|
loop->absolute_pos -= loop->page_size;
|
|
|
|
if (loop->data < loop->end){
|
|
|
|
loop->size = (int)(old_data - loop->end);
|
|
|
|
loop->data = loop->end;
|
|
|
|
loop->absolute_pos = 0;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
inline_4tech void
|
|
|
|
buffer_stringify(Buffer *buffer, int start, int end, char *out){
|
|
|
|
for (Buffer_Stringify_Loop loop = buffer_stringify_loop(buffer, start, end, end - start);
|
|
|
|
buffer_stringify_good(&loop);
|
|
|
|
buffer_stringify_next(&loop)){
|
|
|
|
memcpy_4tech(out, loop.data, loop.size);
|
|
|
|
out += loop.size;
|
2015-10-22 03:23:59 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
#if 0
|
2015-10-19 20:30:25 +00:00
|
|
|
internal_4tech void
|
2015-10-24 22:14:33 +00:00
|
|
|
buffer_measure_wrap_y(Buffer *buffer, float *wraps,
|
|
|
|
float font_height, float max_width){
|
2015-10-19 20:30:25 +00:00
|
|
|
float *widths;
|
2015-10-24 22:14:33 +00:00
|
|
|
float y_pos;
|
|
|
|
int i, line_count;
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
line_count = buffer->line_count;
|
2015-10-24 22:14:33 +00:00
|
|
|
widths = buffer->line_widths;
|
|
|
|
y_pos = 0;
|
2015-10-22 03:23:59 +00:00
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
for (i = 0; i < line_count; ++i){
|
|
|
|
wraps[i] = y_pos;
|
|
|
|
if (widths[i] == 0) y_pos += font_height;
|
|
|
|
else y_pos += font_height*ceil_4tech(widths[i]/max_width);
|
2015-10-19 20:30:25 +00:00
|
|
|
}
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
2015-10-24 22:14:33 +00:00
|
|
|
#endif
|
2015-10-19 01:13:15 +00:00
|
|
|
|
|
|
|
internal_4tech int
|
|
|
|
buffer_replace_range(Buffer *buffer, int start, int end, char *str, int len, int *shift_amount){
|
|
|
|
char *data;
|
|
|
|
int result;
|
|
|
|
|
|
|
|
*shift_amount = (len - (end - start));
|
|
|
|
if (*shift_amount + buffer->size + 1 <= buffer->max){
|
|
|
|
data = (char*)buffer->data;
|
|
|
|
memmove_4tech(data + end + *shift_amount, data + end, buffer->size - end);
|
|
|
|
buffer->size += *shift_amount;
|
|
|
|
data[buffer->size] = 0;
|
|
|
|
if (len != 0) memcpy_4tech(data + start, str, len);
|
|
|
|
|
|
|
|
result = 0;
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
result = *shift_amount + buffer->size + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct{
|
|
|
|
int pos, index;
|
|
|
|
} Cursor_With_Index;
|
|
|
|
|
|
|
|
inline_4tech void
|
|
|
|
write_cursor_with_index(Cursor_With_Index *positions, int *count, int pos){
|
|
|
|
positions[*count].index = *count;
|
|
|
|
positions[*count].pos = pos;
|
|
|
|
++*count;
|
2015-10-16 20:31:04 +00:00
|
|
|
}
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
#define CursorSwap__(a,b) { Cursor_With_Index t = a; a = b; b = t; }
|
|
|
|
|
|
|
|
internal_4tech void
|
|
|
|
buffer_quick_sort_cursors(Cursor_With_Index *positions, int start, int pivot){
|
|
|
|
int i, mid;
|
2015-10-19 01:13:15 +00:00
|
|
|
int pivot_pos;
|
2015-10-19 20:30:25 +00:00
|
|
|
|
|
|
|
mid = start;
|
2015-10-19 01:13:15 +00:00
|
|
|
pivot_pos = positions[pivot].pos;
|
2015-10-19 20:30:25 +00:00
|
|
|
for (i = mid; i < pivot; ++i){
|
2015-10-19 01:13:15 +00:00
|
|
|
if (positions[i].pos < pivot_pos){
|
2015-10-19 20:30:25 +00:00
|
|
|
CursorSwap__(positions[mid], positions[i]);
|
|
|
|
++mid;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
}
|
2015-10-19 20:30:25 +00:00
|
|
|
CursorSwap__(positions[mid], positions[pivot]);
|
|
|
|
|
2015-10-19 01:13:15 +00:00
|
|
|
if (start < mid - 1) buffer_quick_sort_cursors(positions, start, mid - 1);
|
|
|
|
if (mid + 1 < pivot) buffer_quick_sort_cursors(positions, mid + 1, pivot);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline_4tech void
|
|
|
|
buffer_sort_cursors(Cursor_With_Index *positions, int count){
|
2015-10-22 03:23:59 +00:00
|
|
|
assert_4tech(count > 0);
|
2015-10-19 01:13:15 +00:00
|
|
|
buffer_quick_sort_cursors(positions, 0, count-1);
|
|
|
|
}
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
internal_4tech void
|
|
|
|
buffer_quick_unsort_cursors(Cursor_With_Index *positions, int start, int pivot){
|
|
|
|
int i, mid;
|
2015-10-19 01:13:15 +00:00
|
|
|
int pivot_index;
|
2015-10-19 20:30:25 +00:00
|
|
|
|
|
|
|
mid = start;
|
2015-10-19 01:13:15 +00:00
|
|
|
pivot_index = positions[pivot].index;
|
2015-10-19 20:30:25 +00:00
|
|
|
for (i = mid; i < pivot; ++i){
|
2015-10-19 01:13:15 +00:00
|
|
|
if (positions[i].index < pivot_index){
|
2015-10-19 20:30:25 +00:00
|
|
|
CursorSwap__(positions[mid], positions[i]);
|
|
|
|
++mid;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
}
|
2015-10-19 20:30:25 +00:00
|
|
|
CursorSwap__(positions[mid], positions[pivot]);
|
|
|
|
|
2015-10-19 01:13:15 +00:00
|
|
|
if (start < mid - 1) buffer_quick_unsort_cursors(positions, start, mid - 1);
|
|
|
|
if (mid + 1 < pivot) buffer_quick_unsort_cursors(positions, mid + 1, pivot);
|
|
|
|
}
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
#undef CursorSwap__
|
|
|
|
|
2015-10-19 01:13:15 +00:00
|
|
|
inline_4tech void
|
|
|
|
buffer_unsort_cursors(Cursor_With_Index *positions, int count){
|
2015-10-22 03:23:59 +00:00
|
|
|
assert_4tech(count > 0);
|
2015-10-19 01:13:15 +00:00
|
|
|
buffer_quick_unsort_cursors(positions, 0, count-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech void
|
|
|
|
buffer_update_cursors(Cursor_With_Index *sorted_positions, int count, int start, int end, int len){
|
2015-10-19 20:30:25 +00:00
|
|
|
Cursor_With_Index *position;
|
2015-10-19 01:13:15 +00:00
|
|
|
int shift_amount;
|
|
|
|
|
|
|
|
shift_amount = (len - (end - start));
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
position = sorted_positions + count - 1;
|
|
|
|
for (; position >= sorted_positions && position->pos >= end; --position) position->pos += shift_amount;
|
|
|
|
for (; position >= sorted_positions && position->pos >= start; --position) position->pos = start;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech Full_Cursor
|
2015-10-23 01:42:50 +00:00
|
|
|
buffer_cursor_seek(Buffer *buffer, Buffer_Seek seek, float max_width, float font_height,
|
|
|
|
void *advance_data, int stride, Full_Cursor cursor){
|
2015-10-24 22:14:33 +00:00
|
|
|
char *data;
|
2015-10-19 01:13:15 +00:00
|
|
|
int size;
|
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
Seek_State state;
|
|
|
|
char *advances;
|
|
|
|
char ch;
|
2015-10-19 01:13:15 +00:00
|
|
|
int xy_seek;
|
2015-10-24 22:14:33 +00:00
|
|
|
int result;
|
2015-10-19 01:13:15 +00:00
|
|
|
|
|
|
|
data = buffer->data;
|
|
|
|
size = buffer->size;
|
2015-10-22 03:23:59 +00:00
|
|
|
assert_4tech(size < buffer->max);
|
2015-10-19 01:13:15 +00:00
|
|
|
data[size] = 0;
|
|
|
|
|
2015-10-22 03:23:59 +00:00
|
|
|
advances = (char*)advance_data;
|
2015-10-19 01:13:15 +00:00
|
|
|
xy_seek = (seek.type == buffer_seek_wrapped_xy || seek.type == buffer_seek_unwrapped_xy);
|
2015-10-24 22:14:33 +00:00
|
|
|
state.cursor = cursor;
|
2015-10-19 01:13:15 +00:00
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
do{
|
|
|
|
ch = data[state.cursor.pos];
|
|
|
|
result = cursor_seek_step(&state, seek, xy_seek, max_width, font_height,
|
|
|
|
advances, stride, size, ch);
|
|
|
|
}while(result);
|
2015-10-19 01:13:15 +00:00
|
|
|
|
2015-10-24 22:14:33 +00:00
|
|
|
return(state.cursor);
|
2015-10-23 01:42:50 +00:00
|
|
|
}
|
|
|
|
|
2015-10-22 03:23:59 +00:00
|
|
|
internal_4tech void
|
|
|
|
buffer_invert_edit_shift(Buffer *buffer, Buffer_Edit edit, Buffer_Edit *inverse, char *strings, int *str_pos, int max, int shift_amount){
|
|
|
|
int pos;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
pos = *str_pos;
|
|
|
|
len = edit.end - edit.start;
|
|
|
|
assert_4tech(pos + len <= max);
|
|
|
|
*str_pos = pos + len;
|
|
|
|
|
|
|
|
inverse->str_start = pos;
|
|
|
|
inverse->len = len;
|
|
|
|
inverse->start = edit.start + shift_amount;
|
|
|
|
inverse->end = edit.start + edit.len + shift_amount;
|
|
|
|
memcpy_4tech(strings + pos, buffer->data + edit.start, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline_4tech void
|
|
|
|
buffer_invert_edit(Buffer *buffer, Buffer_Edit edit, Buffer_Edit *inverse, char *strings, int *str_pos, int max){
|
|
|
|
buffer_invert_edit_shift(buffer, edit, inverse, strings, str_pos, max, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct{
|
|
|
|
int i;
|
|
|
|
int shift_amount;
|
|
|
|
int len;
|
|
|
|
} Buffer_Invert_Batch;
|
|
|
|
|
|
|
|
internal_4tech int
|
|
|
|
buffer_invert_batch(Buffer_Invert_Batch *state, Buffer *buffer, Buffer_Edit *edits, int count,
|
|
|
|
Buffer_Edit *inverse, char *strings, int *str_pos, int max){
|
|
|
|
Buffer_Edit *edit, *inv_edit;
|
|
|
|
int shift_amount;
|
|
|
|
int result;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
result = 0;
|
|
|
|
i = state->i;
|
|
|
|
shift_amount = state->shift_amount;
|
|
|
|
|
|
|
|
edit = edits + i;
|
|
|
|
inv_edit = inverse + i;
|
|
|
|
|
|
|
|
for (; i < count; ++i, ++edit, ++inv_edit){
|
|
|
|
if (*str_pos + edit->end - edit->start <= max){
|
|
|
|
buffer_invert_edit_shift(buffer, *edit, inv_edit, strings, str_pos, max, shift_amount);
|
|
|
|
shift_amount += (edit->len - (edit->end - edit->start));
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
result = 1;
|
|
|
|
state->len = edit->end - edit->start;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
state->i = i;
|
|
|
|
state->shift_amount = shift_amount;
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
2015-10-19 01:13:15 +00:00
|
|
|
internal_4tech int
|
|
|
|
buffer_batch_debug_sort_check(Buffer_Edit *sorted_edits, int edit_count){
|
|
|
|
Buffer_Edit *edit;
|
|
|
|
int i, result, start_point;
|
|
|
|
|
|
|
|
result = 1;
|
|
|
|
start_point = 0;
|
|
|
|
|
|
|
|
edit = sorted_edits;
|
|
|
|
for (i = 0; i < edit_count; ++i, ++edit){
|
|
|
|
if (start_point > edit->start){
|
|
|
|
result = 0; break;
|
|
|
|
}
|
2015-10-19 20:30:25 +00:00
|
|
|
start_point = (edit->end < edit->start + 1)?edit->start + 1:edit->end;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech int
|
|
|
|
buffer_batch_edit_max_shift(Buffer_Edit *sorted_edits, int edit_count){
|
|
|
|
Buffer_Edit *edit;
|
|
|
|
int i, result;
|
|
|
|
int shift_total, shift_max;
|
|
|
|
|
|
|
|
result = 0;
|
|
|
|
shift_total = 0;
|
|
|
|
shift_max = 0;
|
|
|
|
|
|
|
|
edit = sorted_edits;
|
|
|
|
for (i = 0; i < edit_count; ++i, ++edit){
|
|
|
|
shift_total += (edit->len - (edit->end - edit->start));
|
|
|
|
if (shift_total > shift_max) shift_max = shift_total;
|
|
|
|
}
|
|
|
|
|
2015-10-22 03:23:59 +00:00
|
|
|
return(shift_max);
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct{
|
|
|
|
int i;
|
|
|
|
int shift_total;
|
|
|
|
} Buffer_Batch_State;
|
|
|
|
|
|
|
|
internal_4tech int
|
2015-10-22 03:23:59 +00:00
|
|
|
buffer_batch_edit_step(Buffer_Batch_State *state, Buffer *buffer, Buffer_Edit *sorted_edits, char *strings, int edit_count){
|
2015-10-19 01:13:15 +00:00
|
|
|
Buffer_Edit *edit;
|
|
|
|
int i, result;
|
|
|
|
int shift_total, shift_amount;
|
|
|
|
|
|
|
|
result = 0;
|
|
|
|
shift_total = state->shift_total;
|
|
|
|
i = state->i;
|
|
|
|
|
|
|
|
edit = sorted_edits + i;
|
|
|
|
for (; i < edit_count; ++i, ++edit){
|
|
|
|
result = buffer_replace_range(buffer, edit->start + shift_total, edit->end + shift_total,
|
2015-10-22 03:23:59 +00:00
|
|
|
strings + edit->str_start, edit->len, &shift_amount);
|
2015-10-19 01:13:15 +00:00
|
|
|
if (result) break;
|
|
|
|
shift_total += shift_amount;
|
|
|
|
}
|
|
|
|
|
|
|
|
state->shift_total = shift_total;
|
|
|
|
state->i = i;
|
|
|
|
|
2015-10-22 03:23:59 +00:00
|
|
|
return(result);
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech void
|
2015-10-22 03:23:59 +00:00
|
|
|
buffer_batch_edit(Buffer *buffer, Buffer_Edit *sorted_edits, char *strings, int edit_count){
|
2015-10-19 01:13:15 +00:00
|
|
|
Buffer_Batch_State state;
|
2015-10-19 20:30:25 +00:00
|
|
|
debug_4tech(int result);
|
2015-10-19 01:13:15 +00:00
|
|
|
|
|
|
|
state.i = 0;
|
|
|
|
state.shift_total = 0;
|
|
|
|
|
2015-10-19 20:30:25 +00:00
|
|
|
debug_4tech(result =)
|
2015-10-22 03:23:59 +00:00
|
|
|
buffer_batch_edit_step(&state, buffer, sorted_edits, strings, edit_count);
|
|
|
|
assert_4tech(result == 0);
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech void
|
|
|
|
buffer_batch_edit_update_cursors(Cursor_With_Index *sorted_positions, int count, Buffer_Edit *sorted_edits, int edit_count){
|
|
|
|
Cursor_With_Index *position, *end_position;
|
|
|
|
Buffer_Edit *edit, *end_edit;
|
|
|
|
int start, end;
|
|
|
|
int shift_amount;
|
|
|
|
|
|
|
|
position = sorted_positions;
|
|
|
|
end_position = sorted_positions + count;
|
|
|
|
|
|
|
|
edit = sorted_edits;
|
|
|
|
end_edit = sorted_edits + edit_count;
|
|
|
|
|
|
|
|
shift_amount = 0;
|
|
|
|
|
|
|
|
for (; edit < end_edit && position < end_position; ++edit){
|
|
|
|
start = edit->start;
|
|
|
|
end = edit->end;
|
|
|
|
|
|
|
|
for (; position->pos < start && position < end_position; ++position){
|
|
|
|
position->pos += shift_amount;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; position->pos < end && position < end_position; ++position){
|
|
|
|
position->pos = start + shift_amount;
|
|
|
|
}
|
|
|
|
|
|
|
|
shift_amount += (edit->len - (end - start));
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; position < end_position; ++position){
|
|
|
|
position->pos += shift_amount;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech int
|
|
|
|
buffer_find_hard_start(Buffer *buffer, int line_start, int *all_whitespace, int *all_space,
|
|
|
|
int *preferred_indent, int tab_width){
|
|
|
|
char *data;
|
|
|
|
int size;
|
|
|
|
int result;
|
|
|
|
char c;
|
|
|
|
|
2015-10-22 03:23:59 +00:00
|
|
|
*all_space = 1;
|
2015-10-19 01:13:15 +00:00
|
|
|
*preferred_indent = 0;
|
|
|
|
|
|
|
|
data = buffer->data;
|
|
|
|
size = buffer->size;
|
|
|
|
|
|
|
|
tab_width -= 1;
|
|
|
|
|
|
|
|
for (result = line_start; result < size; ++result){
|
|
|
|
c = data[result];
|
|
|
|
if (c == '\n' || c == 0){
|
|
|
|
*all_whitespace = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (c >= '!' && c <= '~') break;
|
|
|
|
if (c == '\t') *preferred_indent += tab_width;
|
|
|
|
if (c != ' ') *all_space = 0;
|
|
|
|
*preferred_indent += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech void
|
|
|
|
buffer_eol_convert_in(Buffer *buffer){
|
|
|
|
char *data;
|
|
|
|
int size;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
data = buffer->data;
|
|
|
|
size = buffer->size;
|
2015-10-22 03:23:59 +00:00
|
|
|
assert_4tech(size < buffer->max);
|
2015-10-19 01:13:15 +00:00
|
|
|
data[size] = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < size; ++i){
|
|
|
|
if (data[i] == '\r' && data[i+1] == '\n'){
|
|
|
|
memmove_4tech(data + i, data + i + 1, size - i);
|
|
|
|
size -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer->size = size;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline_4tech int
|
|
|
|
buffer_eol_convert_out_size(Buffer *buffer){
|
|
|
|
int size;
|
|
|
|
size = buffer->size + buffer->line_count;
|
|
|
|
return(size);
|
|
|
|
}
|
|
|
|
|
|
|
|
internal_4tech void
|
|
|
|
buffer_eol_convert_out(Buffer *buffer){
|
|
|
|
char *data;
|
|
|
|
int size;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
data = buffer->data;
|
|
|
|
size = buffer->size;
|
2015-10-22 03:23:59 +00:00
|
|
|
assert_4tech(buffer_eol_convert_out_size(buffer) < buffer->max);
|
2015-10-19 01:13:15 +00:00
|
|
|
|
|
|
|
for (i = 0; i < size; ++i){
|
|
|
|
if (data[i] == '\n'){
|
2015-10-22 03:23:59 +00:00
|
|
|
memmove_4tech(data + i + 1, data + i, size - i);
|
2015-10-19 01:13:15 +00:00
|
|
|
data[i] = '\r';
|
|
|
|
++i;
|
2015-10-22 03:23:59 +00:00
|
|
|
++size;
|
2015-10-19 01:13:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer->size = size;
|
|
|
|
}
|
|
|
|
|
|
|
|
// BOTTOM
|
|
|
|
|