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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* objects.c
*
* Colloquium - A tiny presentation program
*
* Copyright (c) 2011 Thomas White <taw@bitwiz.org.uk>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "presentation.h"
#include "objects.h"
static struct object *new_object(enum objtype t)
{
struct object *new;
new = calloc(1, sizeof(struct object));
if ( new == NULL ) return NULL;
new->type = t;
new->empty = 1;
new->parent = NULL;
new->layout = NULL;
new->fontdesc = NULL;
return new;
}
static void free_object(struct object *o)
{
if ( o->layout != NULL ) g_object_unref(o->layout);
if ( o->fontdesc != NULL ) pango_font_description_free(o->fontdesc);
free(o);
}
struct object *add_text_object(struct slide *s, double x, double y)
{
struct object *new;
new = new_object(TEXT);
if ( add_object_to_slide(s, new) ) {
free_object(new);
return NULL;
}
new->x = x; new->y = y;
new->bb_width = 10.0;
new->bb_height = 40.0;
new->text = malloc(1);
new->text[0] = '\0';
new->text_len = 1;
new->insertion_point = 0;
s->object_seq++;
return new;
}
void insert_text(struct object *o, char *t)
{
char *tmp;
size_t tlen, olen;
int i;
assert(o->type == TEXT);
tlen = strlen(t);
olen = strlen(o->text);
if ( tlen + olen + 1 > o->text_len ) {
char *try;
try = realloc(o->text, o->text_len + tlen + 64);
if ( try == NULL ) return; /* Failed to insert */
o->text = try;
o->text_len += 64;
o->text_len += tlen;
}
tmp = malloc(o->text_len);
if ( tmp == NULL ) return;
for ( i=0; i<o->insertion_point; i++ ) {
tmp[i] = o->text[i];
}
for ( i=0; i<tlen; i++ ) {
tmp[i+o->insertion_point] = t[i];
}
for ( i=0; i<olen-o->insertion_point; i++ ) {
tmp[i+o->insertion_point+tlen] = o->text[i+o->insertion_point];
}
tmp[olen+tlen] = '\0';
memcpy(o->text, tmp, o->text_len);
free(tmp);
o->insertion_point += tlen;
o->parent->object_seq++;
o->empty = 0;
}
static int find_prev_index(const char *t, int p)
{
int i, nback;
if ( p == 0 ) return 0;
if ( !(t[p-1] & 0x80) ) {
nback = 1;
} else {
nback = 0;
for ( i=1; i<=6; i++ ) {
if ( p-i == 0 ) return 0;
if ( !(t[p-i] & 0xC0) ) nback++;
}
}
return p - nback;
}
static int find_next_index(const char *t, int p)
{
int i, nfor;
if ( t[p] == '\0' ) return p;
if ( !(t[p+1] & 0x80) ) {
nfor = 1;
} else {
nfor = 0;
for ( i=1; i<=6; i++ ) {
if ( t[p+i] == '\0' ) return p+i;
if ( !(t[p+i] & 0xC0) ) nfor++;
}
}
return p + nfor;
}
void handle_text_backspace(struct object *o)
{
int prev_index;
assert(o->type == TEXT);
if ( o->insertion_point == 0 ) return; /* Nothing to delete */
prev_index = find_prev_index(o->text, o->insertion_point);
memmove(o->text+prev_index, o->text+o->insertion_point,
o->text_len-o->insertion_point);
o->insertion_point = prev_index;
if ( strlen(o->text) == 0 ) o->empty = 1;
o->parent->object_seq++;
}
void move_cursor_left(struct object *o)
{
o->insertion_point = find_prev_index(o->text, o->insertion_point);
}
void move_cursor_right(struct object *o)
{
o->insertion_point = find_next_index(o->text, o->insertion_point);
}
void delete_object(struct object *o)
{
remove_object_from_slide(o->parent, o);
free_object(o);
}
|
