1157
|
1 /* Code for doing intervals.
|
20706
|
2 Copyright (C) 1993, 1994, 1995, 1997, 1998 Free Software Foundation, Inc.
|
1157
|
3
|
|
4 This file is part of GNU Emacs.
|
|
5
|
|
6 GNU Emacs is free software; you can redistribute it and/or modify
|
|
7 it under the terms of the GNU General Public License as published by
|
4383
|
8 the Free Software Foundation; either version 2, or (at your option)
|
1157
|
9 any later version.
|
|
10
|
|
11 GNU Emacs is distributed in the hope that it will be useful,
|
|
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
14 GNU General Public License for more details.
|
|
15
|
|
16 You should have received a copy of the GNU General Public License
|
|
17 along with GNU Emacs; see the file COPYING. If not, write to
|
14186
|
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
19 Boston, MA 02111-1307, USA. */
|
1157
|
20
|
|
21
|
|
22 /* NOTES:
|
|
23
|
|
24 Have to ensure that we can't put symbol nil on a plist, or some
|
|
25 functions may work incorrectly.
|
|
26
|
|
27 An idea: Have the owner of the tree keep count of splits and/or
|
|
28 insertion lengths (in intervals), and balance after every N.
|
|
29
|
|
30 Need to call *_left_hook when buffer is killed.
|
|
31
|
|
32 Scan for zero-length, or 0-length to see notes about handling
|
|
33 zero length interval-markers.
|
|
34
|
|
35 There are comments around about freeing intervals. It might be
|
|
36 faster to explicitly free them (put them on the free list) than
|
|
37 to GC them.
|
|
38
|
|
39 */
|
|
40
|
|
41
|
4696
|
42 #include <config.h>
|
1157
|
43 #include "lisp.h"
|
|
44 #include "intervals.h"
|
|
45 #include "buffer.h"
|
4962
|
46 #include "puresize.h"
|
8897
|
47 #include "keyboard.h"
|
39697
|
48 #include "keymap.h"
|
1157
|
49
|
5768
|
50 /* Test for membership, allowing for t (actually any non-cons) to mean the
|
|
51 universal set. */
|
|
52
|
|
53 #define TMEM(sym, set) (CONSP (set) ? ! NILP (Fmemq (sym, set)) : ! NILP (set))
|
|
54
|
5173
|
55 Lisp_Object merge_properties_sticky ();
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
56 static INTERVAL reproduce_tree P_ ((INTERVAL, INTERVAL));
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
57 static INTERVAL reproduce_tree_obj P_ ((INTERVAL, Lisp_Object));
|
1157
|
58
|
4383
|
59 /* Utility functions for intervals. */
|
1157
|
60
|
|
61
|
4383
|
62 /* Create the root interval of some object, a buffer or string. */
|
1157
|
63
|
|
64 INTERVAL
|
|
65 create_root_interval (parent)
|
|
66 Lisp_Object parent;
|
|
67 {
|
4962
|
68 INTERVAL new;
|
|
69
|
|
70 CHECK_IMPURE (parent);
|
|
71
|
|
72 new = make_interval ();
|
1157
|
73
|
9125
a78f02f76f03
(create_root_interval, balance_possible_root_interval, delete_interval): Use
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
74 if (BUFFERP (parent))
|
1157
|
75 {
|
4135
|
76 new->total_length = (BUF_Z (XBUFFER (parent))
|
|
77 - BUF_BEG (XBUFFER (parent)));
|
10313
|
78 BUF_INTERVALS (XBUFFER (parent)) = new;
|
22343
|
79 new->position = 1;
|
1157
|
80 }
|
9125
a78f02f76f03
(create_root_interval, balance_possible_root_interval, delete_interval): Use
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
81 else if (STRINGP (parent))
|
1157
|
82 {
|
|
83 new->total_length = XSTRING (parent)->size;
|
|
84 XSTRING (parent)->intervals = new;
|
22343
|
85 new->position = 0;
|
1157
|
86 }
|
|
87
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
88 SET_INTERVAL_OBJECT (new, parent);
|
1157
|
89
|
|
90 return new;
|
|
91 }
|
|
92
|
|
93 /* Make the interval TARGET have exactly the properties of SOURCE */
|
|
94
|
|
95 void
|
|
96 copy_properties (source, target)
|
|
97 register INTERVAL source, target;
|
|
98 {
|
|
99 if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target))
|
|
100 return;
|
|
101
|
|
102 COPY_INTERVAL_CACHE (source, target);
|
|
103 target->plist = Fcopy_sequence (source->plist);
|
|
104 }
|
|
105
|
|
106 /* Merge the properties of interval SOURCE into the properties
|
1964
|
107 of interval TARGET. That is to say, each property in SOURCE
|
|
108 is added to TARGET if TARGET has no such property as yet. */
|
1157
|
109
|
|
110 static void
|
|
111 merge_properties (source, target)
|
|
112 register INTERVAL source, target;
|
|
113 {
|
|
114 register Lisp_Object o, sym, val;
|
|
115
|
|
116 if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target))
|
|
117 return;
|
|
118
|
|
119 MERGE_INTERVAL_CACHE (source, target);
|
|
120
|
|
121 o = source->plist;
|
|
122 while (! EQ (o, Qnil))
|
|
123 {
|
|
124 sym = Fcar (o);
|
|
125 val = Fmemq (sym, target->plist);
|
|
126
|
|
127 if (NILP (val))
|
|
128 {
|
|
129 o = Fcdr (o);
|
|
130 val = Fcar (o);
|
|
131 target->plist = Fcons (sym, Fcons (val, target->plist));
|
|
132 o = Fcdr (o);
|
|
133 }
|
|
134 else
|
|
135 o = Fcdr (Fcdr (o));
|
|
136 }
|
|
137 }
|
|
138
|
|
139 /* Return 1 if the two intervals have the same properties,
|
4383
|
140 0 otherwise. */
|
1157
|
141
|
|
142 int
|
|
143 intervals_equal (i0, i1)
|
|
144 INTERVAL i0, i1;
|
|
145 {
|
|
146 register Lisp_Object i0_cdr, i0_sym, i1_val;
|
21514
|
147 register int i1_len;
|
1157
|
148
|
|
149 if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1))
|
|
150 return 1;
|
|
151
|
1964
|
152 if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1))
|
|
153 return 0;
|
|
154
|
1157
|
155 i1_len = XFASTINT (Flength (i1->plist));
|
|
156 if (i1_len & 0x1) /* Paranoia -- plists are always even */
|
|
157 abort ();
|
|
158 i1_len /= 2;
|
|
159 i0_cdr = i0->plist;
|
|
160 while (!NILP (i0_cdr))
|
|
161 {
|
4383
|
162 /* Lengths of the two plists were unequal. */
|
1157
|
163 if (i1_len == 0)
|
|
164 return 0;
|
|
165
|
|
166 i0_sym = Fcar (i0_cdr);
|
|
167 i1_val = Fmemq (i0_sym, i1->plist);
|
|
168
|
4383
|
169 /* i0 has something i1 doesn't. */
|
1157
|
170 if (EQ (i1_val, Qnil))
|
|
171 return 0;
|
|
172
|
4383
|
173 /* i0 and i1 both have sym, but it has different values in each. */
|
1157
|
174 i0_cdr = Fcdr (i0_cdr);
|
4383
|
175 if (! EQ (Fcar (Fcdr (i1_val)), Fcar (i0_cdr)))
|
1157
|
176 return 0;
|
|
177
|
|
178 i0_cdr = Fcdr (i0_cdr);
|
|
179 i1_len--;
|
|
180 }
|
|
181
|
4383
|
182 /* Lengths of the two plists were unequal. */
|
1157
|
183 if (i1_len > 0)
|
|
184 return 0;
|
|
185
|
|
186 return 1;
|
|
187 }
|
|
188
|
|
189
|
|
190 /* Traverse an interval tree TREE, performing FUNCTION on each node.
|
39851
|
191 No guarantee is made about the order of traversal.
|
|
192 Pass FUNCTION two args: an interval, and ARG. */
|
|
193
|
|
194 void
|
|
195 traverse_intervals_noorder (tree, function, arg)
|
|
196 INTERVAL tree;
|
|
197 void (* function) P_ ((INTERVAL, Lisp_Object));
|
|
198 Lisp_Object arg;
|
|
199 {
|
|
200 /* Minimize stack usage. */
|
|
201 while (!NULL_INTERVAL_P (tree))
|
|
202 {
|
|
203 (*function) (tree, arg);
|
|
204 if (NULL_INTERVAL_P (tree->right))
|
|
205 tree = tree->left;
|
|
206 else
|
|
207 {
|
|
208 traverse_intervals_noorder (tree->left, function, arg);
|
|
209 tree = tree->right;
|
|
210 }
|
|
211 }
|
|
212 }
|
|
213
|
|
214 /* Traverse an interval tree TREE, performing FUNCTION on each node.
|
1958
|
215 Pass FUNCTION two args: an interval, and ARG. */
|
1157
|
216
|
|
217 void
|
39854
|
218 traverse_intervals (tree, position, function, arg)
|
1157
|
219 INTERVAL tree;
|
39854
|
220 int position;
|
20317
|
221 void (* function) P_ ((INTERVAL, Lisp_Object));
|
1958
|
222 Lisp_Object arg;
|
1157
|
223 {
|
39851
|
224 while (!NULL_INTERVAL_P (tree))
|
|
225 {
|
39854
|
226 traverse_intervals (tree->left, position, function, arg);
|
39851
|
227 position += LEFT_TOTAL_LENGTH (tree);
|
|
228 tree->position = position;
|
|
229 (*function) (tree, arg);
|
39854
|
230 position += LENGTH (tree); tree = tree->right;
|
39851
|
231 }
|
1157
|
232 }
|
|
233
|
|
234 #if 0
|
25747
|
235
|
|
236 static int icount;
|
|
237 static int idepth;
|
|
238 static int zero_length;
|
|
239
|
4383
|
240 /* These functions are temporary, for debugging purposes only. */
|
1157
|
241
|
|
242 INTERVAL search_interval, found_interval;
|
|
243
|
|
244 void
|
|
245 check_for_interval (i)
|
|
246 register INTERVAL i;
|
|
247 {
|
|
248 if (i == search_interval)
|
|
249 {
|
|
250 found_interval = i;
|
|
251 icount++;
|
|
252 }
|
|
253 }
|
|
254
|
|
255 INTERVAL
|
|
256 search_for_interval (i, tree)
|
|
257 register INTERVAL i, tree;
|
|
258 {
|
|
259 icount = 0;
|
|
260 search_interval = i;
|
|
261 found_interval = NULL_INTERVAL;
|
39851
|
262 traverse_intervals_noorder (tree, &check_for_interval, Qnil);
|
1157
|
263 return found_interval;
|
|
264 }
|
|
265
|
|
266 static void
|
|
267 inc_interval_count (i)
|
|
268 INTERVAL i;
|
|
269 {
|
|
270 icount++;
|
|
271 if (LENGTH (i) == 0)
|
|
272 zero_length++;
|
|
273 if (depth > idepth)
|
|
274 idepth = depth;
|
|
275 }
|
|
276
|
|
277 int
|
|
278 count_intervals (i)
|
|
279 register INTERVAL i;
|
|
280 {
|
|
281 icount = 0;
|
|
282 idepth = 0;
|
|
283 zero_length = 0;
|
39851
|
284 traverse_intervals_noorder (i, &inc_interval_count, Qnil);
|
1157
|
285
|
|
286 return icount;
|
|
287 }
|
|
288
|
|
289 static INTERVAL
|
|
290 root_interval (interval)
|
|
291 INTERVAL interval;
|
|
292 {
|
|
293 register INTERVAL i = interval;
|
|
294
|
|
295 while (! ROOT_INTERVAL_P (i))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
296 i = INTERVAL_PARENT (i);
|
1157
|
297
|
|
298 return i;
|
|
299 }
|
|
300 #endif
|
|
301
|
|
302 /* Assuming that a left child exists, perform the following operation:
|
|
303
|
|
304 A B
|
|
305 / \ / \
|
|
306 B => A
|
|
307 / \ / \
|
|
308 c c
|
|
309 */
|
|
310
|
39851
|
311 static INLINE INTERVAL
|
1157
|
312 rotate_right (interval)
|
|
313 INTERVAL interval;
|
|
314 {
|
|
315 INTERVAL i;
|
|
316 INTERVAL B = interval->left;
|
5415
|
317 int old_total = interval->total_length;
|
1157
|
318
|
4383
|
319 /* Deal with any Parent of A; make it point to B. */
|
1157
|
320 if (! ROOT_INTERVAL_P (interval))
|
25747
|
321 {
|
|
322 if (AM_LEFT_CHILD (interval))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
323 INTERVAL_PARENT (interval)->left = B;
|
25747
|
324 else
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
325 INTERVAL_PARENT (interval)->right = B;
|
25747
|
326 }
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
327 COPY_INTERVAL_PARENT (B, interval);
|
1157
|
328
|
5415
|
329 /* Make B the parent of A */
|
|
330 i = B->right;
|
|
331 B->right = interval;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
332 SET_INTERVAL_PARENT (interval, B);
|
1157
|
333
|
5415
|
334 /* Make A point to c */
|
1157
|
335 interval->left = i;
|
|
336 if (! NULL_INTERVAL_P (i))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
337 SET_INTERVAL_PARENT (i, interval);
|
5415
|
338
|
5760
|
339 /* A's total length is decreased by the length of B and its left child. */
|
5415
|
340 interval->total_length -= B->total_length - LEFT_TOTAL_LENGTH (interval);
|
|
341
|
|
342 /* B must have the same total length of A. */
|
|
343 B->total_length = old_total;
|
1157
|
344
|
|
345 return B;
|
|
346 }
|
5415
|
347
|
1157
|
348 /* Assuming that a right child exists, perform the following operation:
|
|
349
|
|
350 A B
|
|
351 / \ / \
|
|
352 B => A
|
|
353 / \ / \
|
|
354 c c
|
|
355 */
|
|
356
|
39851
|
357 static INLINE INTERVAL
|
1157
|
358 rotate_left (interval)
|
|
359 INTERVAL interval;
|
|
360 {
|
|
361 INTERVAL i;
|
|
362 INTERVAL B = interval->right;
|
5415
|
363 int old_total = interval->total_length;
|
1157
|
364
|
5415
|
365 /* Deal with any parent of A; make it point to B. */
|
1157
|
366 if (! ROOT_INTERVAL_P (interval))
|
25747
|
367 {
|
|
368 if (AM_LEFT_CHILD (interval))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
369 INTERVAL_PARENT (interval)->left = B;
|
25747
|
370 else
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
371 INTERVAL_PARENT (interval)->right = B;
|
25747
|
372 }
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
373 COPY_INTERVAL_PARENT (B, interval);
|
1157
|
374
|
|
375 /* Make B the parent of A */
|
5415
|
376 i = B->left;
|
|
377 B->left = interval;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
378 SET_INTERVAL_PARENT (interval, B);
|
1157
|
379
|
|
380 /* Make A point to c */
|
|
381 interval->right = i;
|
|
382 if (! NULL_INTERVAL_P (i))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
383 SET_INTERVAL_PARENT (i, interval);
|
5415
|
384
|
5760
|
385 /* A's total length is decreased by the length of B and its right child. */
|
5415
|
386 interval->total_length -= B->total_length - RIGHT_TOTAL_LENGTH (interval);
|
|
387
|
|
388 /* B must have the same total length of A. */
|
|
389 B->total_length = old_total;
|
1157
|
390
|
|
391 return B;
|
|
392 }
|
|
393
|
5415
|
394 /* Balance an interval tree with the assumption that the subtrees
|
|
395 themselves are already balanced. */
|
|
396
|
|
397 static INTERVAL
|
|
398 balance_an_interval (i)
|
|
399 INTERVAL i;
|
|
400 {
|
|
401 register int old_diff, new_diff;
|
|
402
|
|
403 while (1)
|
|
404 {
|
|
405 old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i);
|
|
406 if (old_diff > 0)
|
|
407 {
|
|
408 new_diff = i->total_length - i->left->total_length
|
|
409 + RIGHT_TOTAL_LENGTH (i->left) - LEFT_TOTAL_LENGTH (i->left);
|
|
410 if (abs (new_diff) >= old_diff)
|
|
411 break;
|
|
412 i = rotate_right (i);
|
|
413 balance_an_interval (i->right);
|
|
414 }
|
|
415 else if (old_diff < 0)
|
|
416 {
|
|
417 new_diff = i->total_length - i->right->total_length
|
|
418 + LEFT_TOTAL_LENGTH (i->right) - RIGHT_TOTAL_LENGTH (i->right);
|
|
419 if (abs (new_diff) >= -old_diff)
|
|
420 break;
|
|
421 i = rotate_left (i);
|
|
422 balance_an_interval (i->left);
|
|
423 }
|
|
424 else
|
|
425 break;
|
|
426 }
|
|
427 return i;
|
|
428 }
|
|
429
|
|
430 /* Balance INTERVAL, potentially stuffing it back into its parent
|
|
431 Lisp Object. */
|
|
432
|
|
433 static INLINE INTERVAL
|
|
434 balance_possible_root_interval (interval)
|
|
435 register INTERVAL interval;
|
|
436 {
|
|
437 Lisp_Object parent;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
438 int have_parent = 0;
|
5415
|
439
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
440 if (!INTERVAL_HAS_OBJECT (interval) && !INTERVAL_HAS_PARENT (interval))
|
5415
|
441 return interval;
|
|
442
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
443 if (INTERVAL_HAS_OBJECT (interval))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
444 {
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
445 have_parent = 1;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
446 GET_INTERVAL_OBJECT (parent, interval);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
447 }
|
5415
|
448 interval = balance_an_interval (interval);
|
|
449
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
450 if (have_parent)
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
451 {
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
452 if (BUFFERP (parent))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
453 BUF_INTERVALS (XBUFFER (parent)) = interval;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
454 else if (STRINGP (parent))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
455 XSTRING (parent)->intervals = interval;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
456 }
|
5415
|
457
|
|
458 return interval;
|
|
459 }
|
|
460
|
|
461 /* Balance the interval tree TREE. Balancing is by weight
|
|
462 (the amount of text). */
|
|
463
|
|
464 static INTERVAL
|
|
465 balance_intervals_internal (tree)
|
|
466 register INTERVAL tree;
|
|
467 {
|
|
468 /* Balance within each side. */
|
|
469 if (tree->left)
|
15734
|
470 balance_intervals_internal (tree->left);
|
5415
|
471 if (tree->right)
|
15734
|
472 balance_intervals_internal (tree->right);
|
5415
|
473 return balance_an_interval (tree);
|
|
474 }
|
|
475
|
|
476 /* Advertised interface to balance intervals. */
|
|
477
|
|
478 INTERVAL
|
|
479 balance_intervals (tree)
|
|
480 INTERVAL tree;
|
|
481 {
|
|
482 if (tree == NULL_INTERVAL)
|
|
483 return NULL_INTERVAL;
|
|
484
|
|
485 return balance_intervals_internal (tree);
|
|
486 }
|
|
487
|
4135
|
488 /* Split INTERVAL into two pieces, starting the second piece at
|
|
489 character position OFFSET (counting from 0), relative to INTERVAL.
|
|
490 INTERVAL becomes the left-hand piece, and the right-hand piece
|
|
491 (second, lexicographically) is returned.
|
1164
|
492
|
|
493 The size and position fields of the two intervals are set based upon
|
|
494 those of the original interval. The property list of the new interval
|
|
495 is reset, thus it is up to the caller to do the right thing with the
|
|
496 result.
|
1157
|
497
|
|
498 Note that this does not change the position of INTERVAL; if it is a root,
|
4383
|
499 it is still a root after this operation. */
|
1157
|
500
|
|
501 INTERVAL
|
1164
|
502 split_interval_right (interval, offset)
|
1157
|
503 INTERVAL interval;
|
1164
|
504 int offset;
|
1157
|
505 {
|
|
506 INTERVAL new = make_interval ();
|
|
507 int position = interval->position;
|
4135
|
508 int new_length = LENGTH (interval) - offset;
|
1157
|
509
|
4135
|
510 new->position = position + offset;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
511 SET_INTERVAL_PARENT (new, interval);
|
1157
|
512
|
5415
|
513 if (NULL_RIGHT_CHILD (interval))
|
1157
|
514 {
|
|
515 interval->right = new;
|
|
516 new->total_length = new_length;
|
|
517 }
|
20908
|
518 else
|
|
519 {
|
|
520 /* Insert the new node between INTERVAL and its right child. */
|
|
521 new->right = interval->right;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
522 SET_INTERVAL_PARENT (interval->right, new);
|
20908
|
523 interval->right = new;
|
|
524 new->total_length = new_length + new->right->total_length;
|
|
525 balance_an_interval (new);
|
|
526 }
|
|
527
|
5415
|
528 balance_possible_root_interval (interval);
|
1157
|
529
|
|
530 return new;
|
|
531 }
|
|
532
|
4135
|
533 /* Split INTERVAL into two pieces, starting the second piece at
|
|
534 character position OFFSET (counting from 0), relative to INTERVAL.
|
|
535 INTERVAL becomes the right-hand piece, and the left-hand piece
|
|
536 (first, lexicographically) is returned.
|
1157
|
537
|
1164
|
538 The size and position fields of the two intervals are set based upon
|
|
539 those of the original interval. The property list of the new interval
|
|
540 is reset, thus it is up to the caller to do the right thing with the
|
|
541 result.
|
|
542
|
|
543 Note that this does not change the position of INTERVAL; if it is a root,
|
4383
|
544 it is still a root after this operation. */
|
1157
|
545
|
|
546 INTERVAL
|
1164
|
547 split_interval_left (interval, offset)
|
1157
|
548 INTERVAL interval;
|
1164
|
549 int offset;
|
1157
|
550 {
|
|
551 INTERVAL new = make_interval ();
|
4135
|
552 int new_length = offset;
|
1157
|
553
|
|
554 new->position = interval->position;
|
4135
|
555 interval->position = interval->position + offset;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
556 SET_INTERVAL_PARENT (new, interval);
|
1157
|
557
|
|
558 if (NULL_LEFT_CHILD (interval))
|
|
559 {
|
|
560 interval->left = new;
|
|
561 new->total_length = new_length;
|
|
562 }
|
20908
|
563 else
|
|
564 {
|
|
565 /* Insert the new node between INTERVAL and its left child. */
|
|
566 new->left = interval->left;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
567 SET_INTERVAL_PARENT (new->left, new);
|
20908
|
568 interval->left = new;
|
|
569 new->total_length = new_length + new->left->total_length;
|
|
570 balance_an_interval (new);
|
|
571 }
|
|
572
|
5415
|
573 balance_possible_root_interval (interval);
|
1157
|
574
|
|
575 return new;
|
|
576 }
|
|
577
|
22343
|
578 /* Return the proper position for the first character
|
|
579 described by the interval tree SOURCE.
|
|
580 This is 1 if the parent is a buffer,
|
|
581 0 if the parent is a string or if there is no parent.
|
|
582
|
|
583 Don't use this function on an interval which is the child
|
|
584 of another interval! */
|
|
585
|
|
586 int
|
|
587 interval_start_pos (source)
|
|
588 INTERVAL source;
|
|
589 {
|
|
590 Lisp_Object parent;
|
|
591
|
|
592 if (NULL_INTERVAL_P (source))
|
|
593 return 0;
|
|
594
|
28406
451721e784a8
Stop assuming interval pointers and lisp objects can be distinguished by
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
595 if (! INTERVAL_HAS_OBJECT (source))
|
451721e784a8
Stop assuming interval pointers and lisp objects can be distinguished by
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
596 return 0;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
597 GET_INTERVAL_OBJECT (parent, source);
|
22343
|
598 if (BUFFERP (parent))
|
|
599 return BUF_BEG (XBUFFER (parent));
|
|
600 return 0;
|
|
601 }
|
|
602
|
1164
|
603 /* Find the interval containing text position POSITION in the text
|
4005
|
604 represented by the interval tree TREE. POSITION is a buffer
|
22343
|
605 position (starting from 1) or a string index (starting from 0).
|
|
606 If POSITION is at the end of the buffer or string,
|
|
607 return the interval containing the last character.
|
1157
|
608
|
1164
|
609 The `position' field, which is a cache of an interval's position,
|
|
610 is updated in the interval found. Other functions (e.g., next_interval)
|
4383
|
611 will update this cache based on the result of find_interval. */
|
1164
|
612
|
18125
|
613 INTERVAL
|
1157
|
614 find_interval (tree, position)
|
|
615 register INTERVAL tree;
|
|
616 register int position;
|
|
617 {
|
4005
|
618 /* The distance from the left edge of the subtree at TREE
|
|
619 to POSITION. */
|
22343
|
620 register int relative_position;
|
1157
|
621
|
|
622 if (NULL_INTERVAL_P (tree))
|
|
623 return NULL_INTERVAL;
|
|
624
|
22343
|
625 relative_position = position;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
626 if (INTERVAL_HAS_OBJECT (tree))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
627 {
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
628 Lisp_Object parent;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
629 GET_INTERVAL_OBJECT (parent, tree);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
630 if (BUFFERP (parent))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
631 relative_position -= BUF_BEG (XBUFFER (parent));
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
632 }
|
22343
|
633
|
4005
|
634 if (relative_position > TOTAL_LENGTH (tree))
|
1157
|
635 abort (); /* Paranoia */
|
|
636
|
37328
9a801971bd7e
(find_interval): Don't rebalance during signal handling.
Stefan Monnier <monnier@iro.umontreal.ca>
diff
changeset
|
637 if (!handling_signal)
|
9a801971bd7e
(find_interval): Don't rebalance during signal handling.
Stefan Monnier <monnier@iro.umontreal.ca>
diff
changeset
|
638 tree = balance_possible_root_interval (tree);
|
5415
|
639
|
1157
|
640 while (1)
|
|
641 {
|
4005
|
642 if (relative_position < LEFT_TOTAL_LENGTH (tree))
|
1157
|
643 {
|
|
644 tree = tree->left;
|
|
645 }
|
4005
|
646 else if (! NULL_RIGHT_CHILD (tree)
|
|
647 && relative_position >= (TOTAL_LENGTH (tree)
|
|
648 - RIGHT_TOTAL_LENGTH (tree)))
|
1157
|
649 {
|
|
650 relative_position -= (TOTAL_LENGTH (tree)
|
|
651 - RIGHT_TOTAL_LENGTH (tree));
|
|
652 tree = tree->right;
|
|
653 }
|
|
654 else
|
|
655 {
|
22343
|
656 tree->position
|
|
657 = (position - relative_position /* the left edge of *tree */
|
|
658 + LEFT_TOTAL_LENGTH (tree)); /* the left edge of this interval */
|
4005
|
659
|
1157
|
660 return tree;
|
|
661 }
|
|
662 }
|
|
663 }
|
|
664
|
|
665 /* Find the succeeding interval (lexicographically) to INTERVAL.
|
1164
|
666 Sets the `position' field based on that of INTERVAL (see
|
4383
|
667 find_interval). */
|
1157
|
668
|
|
669 INTERVAL
|
|
670 next_interval (interval)
|
|
671 register INTERVAL interval;
|
|
672 {
|
|
673 register INTERVAL i = interval;
|
|
674 register int next_position;
|
|
675
|
|
676 if (NULL_INTERVAL_P (i))
|
|
677 return NULL_INTERVAL;
|
|
678 next_position = interval->position + LENGTH (interval);
|
|
679
|
|
680 if (! NULL_RIGHT_CHILD (i))
|
|
681 {
|
|
682 i = i->right;
|
|
683 while (! NULL_LEFT_CHILD (i))
|
|
684 i = i->left;
|
|
685
|
|
686 i->position = next_position;
|
|
687 return i;
|
|
688 }
|
|
689
|
|
690 while (! NULL_PARENT (i))
|
|
691 {
|
|
692 if (AM_LEFT_CHILD (i))
|
|
693 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
694 i = INTERVAL_PARENT (i);
|
1157
|
695 i->position = next_position;
|
|
696 return i;
|
|
697 }
|
|
698
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
699 i = INTERVAL_PARENT (i);
|
1157
|
700 }
|
|
701
|
|
702 return NULL_INTERVAL;
|
|
703 }
|
|
704
|
|
705 /* Find the preceding interval (lexicographically) to INTERVAL.
|
1164
|
706 Sets the `position' field based on that of INTERVAL (see
|
4383
|
707 find_interval). */
|
1157
|
708
|
|
709 INTERVAL
|
|
710 previous_interval (interval)
|
|
711 register INTERVAL interval;
|
|
712 {
|
|
713 register INTERVAL i;
|
|
714
|
|
715 if (NULL_INTERVAL_P (interval))
|
|
716 return NULL_INTERVAL;
|
|
717
|
|
718 if (! NULL_LEFT_CHILD (interval))
|
|
719 {
|
|
720 i = interval->left;
|
|
721 while (! NULL_RIGHT_CHILD (i))
|
|
722 i = i->right;
|
|
723
|
|
724 i->position = interval->position - LENGTH (i);
|
|
725 return i;
|
|
726 }
|
|
727
|
|
728 i = interval;
|
|
729 while (! NULL_PARENT (i))
|
|
730 {
|
|
731 if (AM_RIGHT_CHILD (i))
|
|
732 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
733 i = INTERVAL_PARENT (i);
|
1157
|
734
|
|
735 i->position = interval->position - LENGTH (i);
|
|
736 return i;
|
|
737 }
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
738 i = INTERVAL_PARENT (i);
|
1157
|
739 }
|
|
740
|
|
741 return NULL_INTERVAL;
|
|
742 }
|
17461
|
743
|
|
744 /* Find the interval containing POS given some non-NULL INTERVAL
|
21012
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
745 in the same tree. Note that we need to update interval->position
|
37328
9a801971bd7e
(find_interval): Don't rebalance during signal handling.
Stefan Monnier <monnier@iro.umontreal.ca>
diff
changeset
|
746 if we go down the tree.
|
9a801971bd7e
(find_interval): Don't rebalance during signal handling.
Stefan Monnier <monnier@iro.umontreal.ca>
diff
changeset
|
747 To speed up the process, we assume that the ->position of
|
9a801971bd7e
(find_interval): Don't rebalance during signal handling.
Stefan Monnier <monnier@iro.umontreal.ca>
diff
changeset
|
748 I and all its parents is already uptodate. */
|
17461
|
749 INTERVAL
|
|
750 update_interval (i, pos)
|
|
751 register INTERVAL i;
|
|
752 int pos;
|
|
753 {
|
|
754 if (NULL_INTERVAL_P (i))
|
|
755 return NULL_INTERVAL;
|
|
756
|
|
757 while (1)
|
|
758 {
|
|
759 if (pos < i->position)
|
|
760 {
|
|
761 /* Move left. */
|
21012
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
762 if (pos >= i->position - TOTAL_LENGTH (i->left))
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
763 {
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
764 i->left->position = i->position - TOTAL_LENGTH (i->left)
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
765 + LEFT_TOTAL_LENGTH (i->left);
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
766 i = i->left; /* Move to the left child */
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
767 }
|
17461
|
768 else if (NULL_PARENT (i))
|
|
769 error ("Point before start of properties");
|
21012
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
770 else
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
771 i = INTERVAL_PARENT (i);
|
17461
|
772 continue;
|
|
773 }
|
|
774 else if (pos >= INTERVAL_LAST_POS (i))
|
|
775 {
|
|
776 /* Move right. */
|
21012
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
777 if (pos < INTERVAL_LAST_POS (i) + TOTAL_LENGTH (i->right))
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
778 {
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
779 i->right->position = INTERVAL_LAST_POS (i) +
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
780 LEFT_TOTAL_LENGTH (i->right);
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
781 i = i->right; /* Move to the right child */
|
22c48e547cb0
(update_interval): Properly update `position' field of used intervals.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
782 }
|
17461
|
783 else if (NULL_PARENT (i))
|
|
784 error ("Point after end of properties");
|
|
785 else
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
786 i = INTERVAL_PARENT (i);
|
17461
|
787 continue;
|
|
788 }
|
|
789 else
|
|
790 return i;
|
|
791 }
|
|
792 }
|
|
793
|
1157
|
794
|
1164
|
795 #if 0
|
1157
|
796 /* Traverse a path down the interval tree TREE to the interval
|
|
797 containing POSITION, adjusting all nodes on the path for
|
|
798 an addition of LENGTH characters. Insertion between two intervals
|
|
799 (i.e., point == i->position, where i is second interval) means
|
|
800 text goes into second interval.
|
|
801
|
|
802 Modifications are needed to handle the hungry bits -- after simply
|
|
803 finding the interval at position (don't add length going down),
|
|
804 if it's the beginning of the interval, get the previous interval
|
14036
|
805 and check the hungry bits of both. Then add the length going back up
|
4383
|
806 to the root. */
|
1157
|
807
|
|
808 static INTERVAL
|
|
809 adjust_intervals_for_insertion (tree, position, length)
|
|
810 INTERVAL tree;
|
|
811 int position, length;
|
|
812 {
|
|
813 register int relative_position;
|
|
814 register INTERVAL this;
|
|
815
|
|
816 if (TOTAL_LENGTH (tree) == 0) /* Paranoia */
|
|
817 abort ();
|
|
818
|
|
819 /* If inserting at point-max of a buffer, that position
|
|
820 will be out of range */
|
|
821 if (position > TOTAL_LENGTH (tree))
|
|
822 position = TOTAL_LENGTH (tree);
|
|
823 relative_position = position;
|
|
824 this = tree;
|
|
825
|
|
826 while (1)
|
|
827 {
|
|
828 if (relative_position <= LEFT_TOTAL_LENGTH (this))
|
|
829 {
|
|
830 this->total_length += length;
|
|
831 this = this->left;
|
|
832 }
|
|
833 else if (relative_position > (TOTAL_LENGTH (this)
|
|
834 - RIGHT_TOTAL_LENGTH (this)))
|
|
835 {
|
|
836 relative_position -= (TOTAL_LENGTH (this)
|
|
837 - RIGHT_TOTAL_LENGTH (this));
|
|
838 this->total_length += length;
|
|
839 this = this->right;
|
|
840 }
|
|
841 else
|
|
842 {
|
|
843 /* If we are to use zero-length intervals as buffer pointers,
|
4383
|
844 then this code will have to change. */
|
1157
|
845 this->total_length += length;
|
|
846 this->position = LEFT_TOTAL_LENGTH (this)
|
|
847 + position - relative_position + 1;
|
|
848 return tree;
|
|
849 }
|
|
850 }
|
|
851 }
|
1164
|
852 #endif
|
|
853
|
|
854 /* Effect an adjustment corresponding to the addition of LENGTH characters
|
|
855 of text. Do this by finding the interval containing POSITION in the
|
5760
|
856 interval tree TREE, and then adjusting all of its ancestors by adding
|
1164
|
857 LENGTH to them.
|
|
858
|
|
859 If POSITION is the first character of an interval, meaning that point
|
|
860 is actually between the two intervals, make the new text belong to
|
|
861 the interval which is "sticky".
|
|
862
|
1189
|
863 If both intervals are "sticky", then make them belong to the left-most
|
1164
|
864 interval. Another possibility would be to create a new interval for
|
4383
|
865 this text, and make it have the merged properties of both ends. */
|
1164
|
866
|
|
867 static INTERVAL
|
|
868 adjust_intervals_for_insertion (tree, position, length)
|
|
869 INTERVAL tree;
|
|
870 int position, length;
|
|
871 {
|
|
872 register INTERVAL i;
|
4383
|
873 register INTERVAL temp;
|
|
874 int eobp = 0;
|
22343
|
875 Lisp_Object parent;
|
|
876 int offset;
|
4383
|
877
|
1164
|
878 if (TOTAL_LENGTH (tree) == 0) /* Paranoia */
|
|
879 abort ();
|
|
880
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
881 GET_INTERVAL_OBJECT (parent, tree);
|
22343
|
882 offset = (BUFFERP (parent) ? BUF_BEG (XBUFFER (parent)) : 0);
|
|
883
|
4005
|
884 /* If inserting at point-max of a buffer, that position will be out
|
|
885 of range. Remember that buffer positions are 1-based. */
|
22343
|
886 if (position >= TOTAL_LENGTH (tree) + offset)
|
|
887 {
|
|
888 position = TOTAL_LENGTH (tree) + offset;
|
|
889 eobp = 1;
|
|
890 }
|
1164
|
891
|
|
892 i = find_interval (tree, position);
|
4383
|
893
|
4638
|
894 /* If in middle of an interval which is not sticky either way,
|
|
895 we must not just give its properties to the insertion.
|
26862
|
896 So split this interval at the insertion point.
|
|
897
|
|
898 Originally, the if condition here was this:
|
|
899 (! (position == i->position || eobp)
|
|
900 && END_NONSTICKY_P (i)
|
|
901 && FRONT_NONSTICKY_P (i))
|
|
902 But, these macros are now unreliable because of introduction of
|
|
903 Vtext_property_default_nonsticky. So, we always check properties
|
|
904 one by one if POSITION is in middle of an interval. */
|
|
905 if (! (position == i->position || eobp))
|
4638
|
906 {
|
16740
|
907 Lisp_Object tail;
|
|
908 Lisp_Object front, rear;
|
|
909
|
26862
|
910 tail = i->plist;
|
16740
|
911
|
26862
|
912 /* Properties font-sticky and rear-nonsticky override
|
|
913 Vtext_property_default_nonsticky. So, if they are t, we can
|
|
914 skip one by one checking of properties. */
|
|
915 rear = textget (i->plist, Qrear_nonsticky);
|
|
916 if (! CONSP (rear) && ! NILP (rear))
|
16740
|
917 {
|
26862
|
918 /* All properties are nonsticky. We split the interval. */
|
|
919 goto check_done;
|
|
920 }
|
|
921 front = textget (i->plist, Qfront_sticky);
|
|
922 if (! CONSP (front) && ! NILP (front))
|
|
923 {
|
|
924 /* All properties are sticky. We don't split the interval. */
|
|
925 tail = Qnil;
|
|
926 goto check_done;
|
|
927 }
|
|
928
|
|
929 /* Does any actual property pose an actual problem? We break
|
|
930 the loop if we find a nonsticky property. */
|
|
931 for (; CONSP (tail); tail = Fcdr (XCDR (tail)))
|
|
932 {
|
|
933 Lisp_Object prop, tmp;
|
25662
0a7261c1d487
Use XCAR, XCDR, and XFLOAT_DATA instead of explicit member access.
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
934 prop = XCAR (tail);
|
16740
|
935
|
26862
|
936 /* Is this particular property front-sticky? */
|
16740
|
937 if (CONSP (front) && ! NILP (Fmemq (prop, front)))
|
|
938 continue;
|
|
939
|
26862
|
940 /* Is this particular property rear-nonsticky? */
|
|
941 if (CONSP (rear) && ! NILP (Fmemq (prop, rear)))
|
|
942 break;
|
|
943
|
|
944 /* Is this particular property recorded as sticky or
|
|
945 nonsticky in Vtext_property_default_nonsticky? */
|
|
946 tmp = Fassq (prop, Vtext_property_default_nonsticky);
|
|
947 if (CONSP (tmp))
|
|
948 {
|
|
949 if (NILP (tmp))
|
|
950 continue;
|
|
951 break;
|
|
952 }
|
|
953
|
|
954 /* By default, a text property is rear-sticky, thus we
|
|
955 continue the loop. */
|
16740
|
956 }
|
|
957
|
26862
|
958 check_done:
|
16740
|
959 /* If any property is a real problem, split the interval. */
|
|
960 if (! NILP (tail))
|
|
961 {
|
|
962 temp = split_interval_right (i, position - i->position);
|
|
963 copy_properties (i, temp);
|
|
964 i = temp;
|
|
965 }
|
4638
|
966 }
|
|
967
|
1164
|
968 /* If we are positioned between intervals, check the stickiness of
|
4383
|
969 both of them. We have to do this too, if we are at BEG or Z. */
|
|
970 if (position == i->position || eobp)
|
1164
|
971 {
|
4383
|
972 register INTERVAL prev;
|
|
973
|
|
974 if (position == BEG)
|
|
975 prev = 0;
|
|
976 else if (eobp)
|
|
977 {
|
|
978 prev = i;
|
|
979 i = 0;
|
|
980 }
|
|
981 else
|
|
982 prev = previous_interval (i);
|
|
983
|
|
984 /* Even if we are positioned between intervals, we default
|
|
985 to the left one if it exists. We extend it now and split
|
14036
|
986 off a part later, if stickiness demands it. */
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
987 for (temp = prev ? prev : i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
|
5415
|
988 {
|
|
989 temp->total_length += length;
|
|
990 temp = balance_possible_root_interval (temp);
|
|
991 }
|
4383
|
992
|
|
993 /* If at least one interval has sticky properties,
|
26862
|
994 we check the stickiness property by property.
|
|
995
|
|
996 Originally, the if condition here was this:
|
|
997 (END_NONSTICKY_P (prev) || FRONT_STICKY_P (i))
|
|
998 But, these macros are now unreliable because of introduction
|
|
999 of Vtext_property_default_nonsticky. So, we always have to
|
|
1000 check stickiness of properties one by one. If cache of
|
|
1001 stickiness is implemented in the future, we may be able to
|
|
1002 use those macros again. */
|
|
1003 if (1)
|
4383
|
1004 {
|
6501
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1005 Lisp_Object pleft, pright;
|
4383
|
1006 struct interval newi;
|
1164
|
1007
|
6501
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1008 pleft = NULL_INTERVAL_P (prev) ? Qnil : prev->plist;
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1009 pright = NULL_INTERVAL_P (i) ? Qnil : i->plist;
|
4383
|
1010 newi.plist = merge_properties_sticky (pleft, pright);
|
|
1011
|
20557
|
1012 if (! prev) /* i.e. position == BEG */
|
4383
|
1013 {
|
|
1014 if (! intervals_equal (i, &newi))
|
|
1015 {
|
|
1016 i = split_interval_left (i, length);
|
|
1017 i->plist = newi.plist;
|
|
1018 }
|
|
1019 }
|
|
1020 else if (! intervals_equal (prev, &newi))
|
|
1021 {
|
|
1022 prev = split_interval_right (prev,
|
|
1023 position - prev->position);
|
|
1024 prev->plist = newi.plist;
|
|
1025 if (! NULL_INTERVAL_P (i)
|
|
1026 && intervals_equal (prev, i))
|
|
1027 merge_interval_right (prev);
|
|
1028 }
|
|
1029
|
|
1030 /* We will need to update the cache here later. */
|
|
1031 }
|
|
1032 else if (! prev && ! NILP (i->plist))
|
|
1033 {
|
|
1034 /* Just split off a new interval at the left.
|
|
1035 Since I wasn't front-sticky, the empty plist is ok. */
|
|
1036 i = split_interval_left (i, length);
|
|
1037 }
|
1164
|
1038 }
|
|
1039
|
4383
|
1040 /* Otherwise just extend the interval. */
|
|
1041 else
|
1164
|
1042 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1043 for (temp = i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
|
5415
|
1044 {
|
|
1045 temp->total_length += length;
|
|
1046 temp = balance_possible_root_interval (temp);
|
|
1047 }
|
1164
|
1048 }
|
4383
|
1049
|
1164
|
1050 return tree;
|
|
1051 }
|
4383
|
1052
|
5768
|
1053 /* Any property might be front-sticky on the left, rear-sticky on the left,
|
|
1054 front-sticky on the right, or rear-sticky on the right; the 16 combinations
|
|
1055 can be arranged in a matrix with rows denoting the left conditions and
|
|
1056 columns denoting the right conditions:
|
|
1057 _ __ _
|
|
1058 _ FR FR FR FR
|
|
1059 FR__ 0 1 2 3
|
|
1060 _FR 4 5 6 7
|
|
1061 FR 8 9 A B
|
|
1062 FR C D E F
|
|
1063
|
|
1064 left-props = '(front-sticky (p8 p9 pa pb pc pd pe pf)
|
|
1065 rear-nonsticky (p4 p5 p6 p7 p8 p9 pa pb)
|
|
1066 p0 L p1 L p2 L p3 L p4 L p5 L p6 L p7 L
|
|
1067 p8 L p9 L pa L pb L pc L pd L pe L pf L)
|
|
1068 right-props = '(front-sticky (p2 p3 p6 p7 pa pb pe pf)
|
|
1069 rear-nonsticky (p1 p2 p5 p6 p9 pa pd pe)
|
|
1070 p0 R p1 R p2 R p3 R p4 R p5 R p6 R p7 R
|
|
1071 p8 R p9 R pa R pb R pc R pd R pe R pf R)
|
|
1072
|
|
1073 We inherit from whoever has a sticky side facing us. If both sides
|
|
1074 do (cases 2, 3, E, and F), then we inherit from whichever side has a
|
|
1075 non-nil value for the current property. If both sides do, then we take
|
|
1076 from the left.
|
|
1077
|
|
1078 When we inherit a property, we get its stickiness as well as its value.
|
|
1079 So, when we merge the above two lists, we expect to get this:
|
|
1080
|
|
1081 result = '(front-sticky (p6 p7 pa pb pc pd pe pf)
|
|
1082 rear-nonsticky (p6 pa)
|
|
1083 p0 L p1 L p2 L p3 L p6 R p7 R
|
|
1084 pa R pb R pc L pd L pe L pf L)
|
|
1085
|
|
1086 The optimizable special cases are:
|
|
1087 left rear-nonsticky = nil, right front-sticky = nil (inherit left)
|
|
1088 left rear-nonsticky = t, right front-sticky = t (inherit right)
|
|
1089 left rear-nonsticky = t, right front-sticky = nil (inherit none)
|
|
1090 */
|
|
1091
|
4383
|
1092 Lisp_Object
|
|
1093 merge_properties_sticky (pleft, pright)
|
|
1094 Lisp_Object pleft, pright;
|
|
1095 {
|
6501
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1096 register Lisp_Object props, front, rear;
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1097 Lisp_Object lfront, lrear, rfront, rrear;
|
16708
|
1098 register Lisp_Object tail1, tail2, sym, lval, rval, cat;
|
5768
|
1099 int use_left, use_right;
|
16708
|
1100 int lpresent;
|
4383
|
1101
|
6501
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1102 props = Qnil;
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1103 front = Qnil;
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1104 rear = Qnil;
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1105 lfront = textget (pleft, Qfront_sticky);
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1106 lrear = textget (pleft, Qrear_nonsticky);
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1107 rfront = textget (pright, Qfront_sticky);
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1108 rrear = textget (pright, Qrear_nonsticky);
|
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1109
|
5768
|
1110 /* Go through each element of PRIGHT. */
|
26862
|
1111 for (tail1 = pright; CONSP (tail1); tail1 = Fcdr (Fcdr (tail1)))
|
4383
|
1112 {
|
26862
|
1113 Lisp_Object tmp;
|
|
1114
|
4383
|
1115 sym = Fcar (tail1);
|
|
1116
|
|
1117 /* Sticky properties get special treatment. */
|
|
1118 if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky))
|
|
1119 continue;
|
5768
|
1120
|
|
1121 rval = Fcar (Fcdr (tail1));
|
26862
|
1122 for (tail2 = pleft; CONSP (tail2); tail2 = Fcdr (Fcdr (tail2)))
|
5768
|
1123 if (EQ (sym, Fcar (tail2)))
|
|
1124 break;
|
|
1125
|
16708
|
1126 /* Indicate whether the property is explicitly defined on the left.
|
|
1127 (We know it is defined explicitly on the right
|
|
1128 because otherwise we don't get here.) */
|
|
1129 lpresent = ! NILP (tail2);
|
|
1130 lval = (NILP (tail2) ? Qnil : Fcar (Fcdr (tail2)));
|
|
1131
|
26862
|
1132 /* Even if lrear or rfront say nothing about the stickiness of
|
|
1133 SYM, Vtext_property_default_nonsticky may give default
|
|
1134 stickiness to SYM. */
|
|
1135 tmp = Fassq (sym, Vtext_property_default_nonsticky);
|
|
1136 use_left = (lpresent
|
|
1137 && ! (TMEM (sym, lrear)
|
|
1138 || CONSP (tmp) && ! NILP (XCDR (tmp))));
|
|
1139 use_right = (TMEM (sym, rfront)
|
|
1140 || (CONSP (tmp) && NILP (XCDR (tmp))));
|
5768
|
1141 if (use_left && use_right)
|
4383
|
1142 {
|
16708
|
1143 if (NILP (lval))
|
|
1144 use_left = 0;
|
|
1145 else if (NILP (rval))
|
|
1146 use_right = 0;
|
4383
|
1147 }
|
5768
|
1148 if (use_left)
|
4383
|
1149 {
|
5768
|
1150 /* We build props as (value sym ...) rather than (sym value ...)
|
|
1151 because we plan to nreverse it when we're done. */
|
16708
|
1152 props = Fcons (lval, Fcons (sym, props));
|
5768
|
1153 if (TMEM (sym, lfront))
|
|
1154 front = Fcons (sym, front);
|
|
1155 if (TMEM (sym, lrear))
|
|
1156 rear = Fcons (sym, rear);
|
|
1157 }
|
|
1158 else if (use_right)
|
|
1159 {
|
16708
|
1160 props = Fcons (rval, Fcons (sym, props));
|
5768
|
1161 if (TMEM (sym, rfront))
|
|
1162 front = Fcons (sym, front);
|
|
1163 if (TMEM (sym, rrear))
|
|
1164 rear = Fcons (sym, rear);
|
4383
|
1165 }
|
|
1166 }
|
5768
|
1167
|
|
1168 /* Now go through each element of PLEFT. */
|
26862
|
1169 for (tail2 = pleft; CONSP (tail2); tail2 = Fcdr (Fcdr (tail2)))
|
4383
|
1170 {
|
26862
|
1171 Lisp_Object tmp;
|
|
1172
|
4383
|
1173 sym = Fcar (tail2);
|
|
1174
|
|
1175 /* Sticky properties get special treatment. */
|
|
1176 if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky))
|
|
1177 continue;
|
|
1178
|
5768
|
1179 /* If sym is in PRIGHT, we've already considered it. */
|
26862
|
1180 for (tail1 = pright; CONSP (tail1); tail1 = Fcdr (Fcdr (tail1)))
|
4383
|
1181 if (EQ (sym, Fcar (tail1)))
|
|
1182 break;
|
5768
|
1183 if (! NILP (tail1))
|
|
1184 continue;
|
|
1185
|
|
1186 lval = Fcar (Fcdr (tail2));
|
|
1187
|
26862
|
1188 /* Even if lrear or rfront say nothing about the stickiness of
|
|
1189 SYM, Vtext_property_default_nonsticky may give default
|
|
1190 stickiness to SYM. */
|
|
1191 tmp = Fassq (sym, Vtext_property_default_nonsticky);
|
|
1192
|
5768
|
1193 /* Since rval is known to be nil in this loop, the test simplifies. */
|
26862
|
1194 if (! (TMEM (sym, lrear) || (CONSP (tmp) && ! NILP (XCDR (tmp)))))
|
4383
|
1195 {
|
16708
|
1196 props = Fcons (lval, Fcons (sym, props));
|
5768
|
1197 if (TMEM (sym, lfront))
|
|
1198 front = Fcons (sym, front);
|
|
1199 }
|
26862
|
1200 else if (TMEM (sym, rfront) || (CONSP (tmp) && NILP (XCDR (tmp))))
|
5768
|
1201 {
|
|
1202 /* The value is nil, but we still inherit the stickiness
|
|
1203 from the right. */
|
4383
|
1204 front = Fcons (sym, front);
|
5768
|
1205 if (TMEM (sym, rrear))
|
4383
|
1206 rear = Fcons (sym, rear);
|
|
1207 }
|
|
1208 }
|
5760
|
1209 props = Fnreverse (props);
|
5768
|
1210 if (! NILP (rear))
|
|
1211 props = Fcons (Qrear_nonsticky, Fcons (Fnreverse (rear), props));
|
16708
|
1212
|
|
1213 cat = textget (props, Qcategory);
|
|
1214 if (! NILP (front)
|
|
1215 &&
|
|
1216 /* If we have inherited a front-stick category property that is t,
|
|
1217 we don't need to set up a detailed one. */
|
|
1218 ! (! NILP (cat) && SYMBOLP (cat)
|
|
1219 && EQ (Fget (cat, Qfront_sticky), Qt)))
|
5760
|
1220 props = Fcons (Qfront_sticky, Fcons (Fnreverse (front), props));
|
4383
|
1221 return props;
|
|
1222 }
|
|
1223
|
1157
|
1224
|
1164
|
1225 /* Delete an node I from its interval tree by merging its subtrees
|
|
1226 into one subtree which is then returned. Caller is responsible for
|
4383
|
1227 storing the resulting subtree into its parent. */
|
1157
|
1228
|
|
1229 static INTERVAL
|
|
1230 delete_node (i)
|
|
1231 register INTERVAL i;
|
|
1232 {
|
|
1233 register INTERVAL migrate, this;
|
|
1234 register int migrate_amt;
|
|
1235
|
|
1236 if (NULL_INTERVAL_P (i->left))
|
|
1237 return i->right;
|
|
1238 if (NULL_INTERVAL_P (i->right))
|
|
1239 return i->left;
|
|
1240
|
|
1241 migrate = i->left;
|
|
1242 migrate_amt = i->left->total_length;
|
|
1243 this = i->right;
|
|
1244 this->total_length += migrate_amt;
|
|
1245 while (! NULL_INTERVAL_P (this->left))
|
|
1246 {
|
|
1247 this = this->left;
|
|
1248 this->total_length += migrate_amt;
|
|
1249 }
|
|
1250 this->left = migrate;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1251 SET_INTERVAL_PARENT (migrate, this);
|
1157
|
1252
|
|
1253 return i->right;
|
|
1254 }
|
|
1255
|
|
1256 /* Delete interval I from its tree by calling `delete_node'
|
|
1257 and properly connecting the resultant subtree.
|
|
1258
|
|
1259 I is presumed to be empty; that is, no adjustments are made
|
4383
|
1260 for the length of I. */
|
1157
|
1261
|
|
1262 void
|
|
1263 delete_interval (i)
|
|
1264 register INTERVAL i;
|
|
1265 {
|
|
1266 register INTERVAL parent;
|
|
1267 int amt = LENGTH (i);
|
|
1268
|
4383
|
1269 if (amt > 0) /* Only used on zero-length intervals now. */
|
1157
|
1270 abort ();
|
|
1271
|
|
1272 if (ROOT_INTERVAL_P (i))
|
|
1273 {
|
6501
d7ac9a417f87
(adjust_intervals_for_insertion, merge_properties_sticky, delete_interval):
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1274 Lisp_Object owner;
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1275 GET_INTERVAL_OBJECT (owner, i);
|
1157
|
1276 parent = delete_node (i);
|
|
1277 if (! NULL_INTERVAL_P (parent))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1278 SET_INTERVAL_OBJECT (parent, owner);
|
1157
|
1279
|
9125
a78f02f76f03
(create_root_interval, balance_possible_root_interval, delete_interval): Use
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1280 if (BUFFERP (owner))
|
10313
|
1281 BUF_INTERVALS (XBUFFER (owner)) = parent;
|
9125
a78f02f76f03
(create_root_interval, balance_possible_root_interval, delete_interval): Use
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1282 else if (STRINGP (owner))
|
1157
|
1283 XSTRING (owner)->intervals = parent;
|
|
1284 else
|
|
1285 abort ();
|
|
1286
|
|
1287 return;
|
|
1288 }
|
|
1289
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1290 parent = INTERVAL_PARENT (i);
|
1157
|
1291 if (AM_LEFT_CHILD (i))
|
|
1292 {
|
|
1293 parent->left = delete_node (i);
|
|
1294 if (! NULL_INTERVAL_P (parent->left))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1295 SET_INTERVAL_PARENT (parent->left, parent);
|
1157
|
1296 }
|
|
1297 else
|
|
1298 {
|
|
1299 parent->right = delete_node (i);
|
|
1300 if (! NULL_INTERVAL_P (parent->right))
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1301 SET_INTERVAL_PARENT (parent->right, parent);
|
1157
|
1302 }
|
|
1303 }
|
|
1304
|
4005
|
1305 /* Find the interval in TREE corresponding to the relative position
|
|
1306 FROM and delete as much as possible of AMOUNT from that interval.
|
|
1307 Return the amount actually deleted, and if the interval was
|
|
1308 zeroed-out, delete that interval node from the tree.
|
|
1309
|
|
1310 Note that FROM is actually origin zero, aka relative to the
|
|
1311 leftmost edge of tree. This is appropriate since we call ourselves
|
|
1312 recursively on subtrees.
|
1157
|
1313
|
1189
|
1314 Do this by recursing down TREE to the interval in question, and
|
4383
|
1315 deleting the appropriate amount of text. */
|
1157
|
1316
|
|
1317 static int
|
|
1318 interval_deletion_adjustment (tree, from, amount)
|
|
1319 register INTERVAL tree;
|
|
1320 register int from, amount;
|
|
1321 {
|
|
1322 register int relative_position = from;
|
|
1323
|
|
1324 if (NULL_INTERVAL_P (tree))
|
|
1325 return 0;
|
|
1326
|
|
1327 /* Left branch */
|
4005
|
1328 if (relative_position < LEFT_TOTAL_LENGTH (tree))
|
1157
|
1329 {
|
|
1330 int subtract = interval_deletion_adjustment (tree->left,
|
|
1331 relative_position,
|
|
1332 amount);
|
|
1333 tree->total_length -= subtract;
|
|
1334 return subtract;
|
|
1335 }
|
|
1336 /* Right branch */
|
4005
|
1337 else if (relative_position >= (TOTAL_LENGTH (tree)
|
|
1338 - RIGHT_TOTAL_LENGTH (tree)))
|
1157
|
1339 {
|
|
1340 int subtract;
|
|
1341
|
|
1342 relative_position -= (tree->total_length
|
|
1343 - RIGHT_TOTAL_LENGTH (tree));
|
|
1344 subtract = interval_deletion_adjustment (tree->right,
|
|
1345 relative_position,
|
|
1346 amount);
|
|
1347 tree->total_length -= subtract;
|
|
1348 return subtract;
|
|
1349 }
|
4383
|
1350 /* Here -- this node. */
|
1157
|
1351 else
|
|
1352 {
|
4005
|
1353 /* How much can we delete from this interval? */
|
|
1354 int my_amount = ((tree->total_length
|
|
1355 - RIGHT_TOTAL_LENGTH (tree))
|
|
1356 - relative_position);
|
1157
|
1357
|
4005
|
1358 if (amount > my_amount)
|
|
1359 amount = my_amount;
|
1157
|
1360
|
4005
|
1361 tree->total_length -= amount;
|
|
1362 if (LENGTH (tree) == 0)
|
|
1363 delete_interval (tree);
|
|
1364
|
|
1365 return amount;
|
1157
|
1366 }
|
|
1367
|
4383
|
1368 /* Never reach here. */
|
1157
|
1369 }
|
|
1370
|
4005
|
1371 /* Effect the adjustments necessary to the interval tree of BUFFER to
|
|
1372 correspond to the deletion of LENGTH characters from that buffer
|
|
1373 text. The deletion is effected at position START (which is a
|
4383
|
1374 buffer position, i.e. origin 1). */
|
1189
|
1375
|
1157
|
1376 static void
|
|
1377 adjust_intervals_for_deletion (buffer, start, length)
|
|
1378 struct buffer *buffer;
|
|
1379 int start, length;
|
|
1380 {
|
|
1381 register int left_to_delete = length;
|
10313
|
1382 register INTERVAL tree = BUF_INTERVALS (buffer);
|
22343
|
1383 Lisp_Object parent;
|
|
1384 int offset;
|
|
1385
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1386 GET_INTERVAL_OBJECT (parent, tree);
|
22343
|
1387 offset = (BUFFERP (parent) ? BUF_BEG (XBUFFER (parent)) : 0);
|
1157
|
1388
|
|
1389 if (NULL_INTERVAL_P (tree))
|
|
1390 return;
|
|
1391
|
22343
|
1392 if (start > offset + TOTAL_LENGTH (tree)
|
|
1393 || start + length > offset + TOTAL_LENGTH (tree))
|
4005
|
1394 abort ();
|
|
1395
|
1157
|
1396 if (length == TOTAL_LENGTH (tree))
|
|
1397 {
|
10313
|
1398 BUF_INTERVALS (buffer) = NULL_INTERVAL;
|
1157
|
1399 return;
|
|
1400 }
|
|
1401
|
|
1402 if (ONLY_INTERVAL_P (tree))
|
|
1403 {
|
|
1404 tree->total_length -= length;
|
|
1405 return;
|
|
1406 }
|
|
1407
|
22343
|
1408 if (start > offset + TOTAL_LENGTH (tree))
|
|
1409 start = offset + TOTAL_LENGTH (tree);
|
1157
|
1410 while (left_to_delete > 0)
|
|
1411 {
|
22343
|
1412 left_to_delete -= interval_deletion_adjustment (tree, start - offset,
|
1157
|
1413 left_to_delete);
|
10313
|
1414 tree = BUF_INTERVALS (buffer);
|
1157
|
1415 if (left_to_delete == tree->total_length)
|
|
1416 {
|
10313
|
1417 BUF_INTERVALS (buffer) = NULL_INTERVAL;
|
1157
|
1418 return;
|
|
1419 }
|
|
1420 }
|
|
1421 }
|
|
1422
|
3591
|
1423 /* Make the adjustments necessary to the interval tree of BUFFER to
|
1189
|
1424 represent an addition or deletion of LENGTH characters starting
|
|
1425 at position START. Addition or deletion is indicated by the sign
|
4383
|
1426 of LENGTH. */
|
1157
|
1427
|
|
1428 INLINE void
|
|
1429 offset_intervals (buffer, start, length)
|
|
1430 struct buffer *buffer;
|
|
1431 int start, length;
|
|
1432 {
|
10313
|
1433 if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) || length == 0)
|
1157
|
1434 return;
|
|
1435
|
|
1436 if (length > 0)
|
10313
|
1437 adjust_intervals_for_insertion (BUF_INTERVALS (buffer), start, length);
|
1157
|
1438 else
|
|
1439 adjust_intervals_for_deletion (buffer, start, -length);
|
|
1440 }
|
1211
|
1441
|
|
1442 /* Merge interval I with its lexicographic successor. The resulting
|
|
1443 interval is returned, and has the properties of the original
|
|
1444 successor. The properties of I are lost. I is removed from the
|
|
1445 interval tree.
|
1157
|
1446
|
1211
|
1447 IMPORTANT:
|
|
1448 The caller must verify that this is not the last (rightmost)
|
4383
|
1449 interval. */
|
1211
|
1450
|
|
1451 INTERVAL
|
|
1452 merge_interval_right (i)
|
|
1453 register INTERVAL i;
|
|
1454 {
|
|
1455 register int absorb = LENGTH (i);
|
|
1456 register INTERVAL successor;
|
|
1457
|
4383
|
1458 /* Zero out this interval. */
|
1211
|
1459 i->total_length -= absorb;
|
|
1460
|
4383
|
1461 /* Find the succeeding interval. */
|
1211
|
1462 if (! NULL_RIGHT_CHILD (i)) /* It's below us. Add absorb
|
4383
|
1463 as we descend. */
|
1211
|
1464 {
|
|
1465 successor = i->right;
|
|
1466 while (! NULL_LEFT_CHILD (successor))
|
|
1467 {
|
|
1468 successor->total_length += absorb;
|
|
1469 successor = successor->left;
|
|
1470 }
|
|
1471
|
|
1472 successor->total_length += absorb;
|
|
1473 delete_interval (i);
|
|
1474 return successor;
|
|
1475 }
|
|
1476
|
|
1477 successor = i;
|
|
1478 while (! NULL_PARENT (successor)) /* It's above us. Subtract as
|
4383
|
1479 we ascend. */
|
1211
|
1480 {
|
|
1481 if (AM_LEFT_CHILD (successor))
|
|
1482 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1483 successor = INTERVAL_PARENT (successor);
|
1211
|
1484 delete_interval (i);
|
|
1485 return successor;
|
|
1486 }
|
|
1487
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1488 successor = INTERVAL_PARENT (successor);
|
1211
|
1489 successor->total_length -= absorb;
|
|
1490 }
|
|
1491
|
|
1492 /* This must be the rightmost or last interval and cannot
|
4383
|
1493 be merged right. The caller should have known. */
|
1211
|
1494 abort ();
|
|
1495 }
|
|
1496
|
|
1497 /* Merge interval I with its lexicographic predecessor. The resulting
|
|
1498 interval is returned, and has the properties of the original predecessor.
|
|
1499 The properties of I are lost. Interval node I is removed from the tree.
|
|
1500
|
|
1501 IMPORTANT:
|
4383
|
1502 The caller must verify that this is not the first (leftmost) interval. */
|
1211
|
1503
|
|
1504 INTERVAL
|
|
1505 merge_interval_left (i)
|
|
1506 register INTERVAL i;
|
|
1507 {
|
|
1508 register int absorb = LENGTH (i);
|
|
1509 register INTERVAL predecessor;
|
|
1510
|
4383
|
1511 /* Zero out this interval. */
|
1211
|
1512 i->total_length -= absorb;
|
|
1513
|
4383
|
1514 /* Find the preceding interval. */
|
1211
|
1515 if (! NULL_LEFT_CHILD (i)) /* It's below us. Go down,
|
4383
|
1516 adding ABSORB as we go. */
|
1211
|
1517 {
|
|
1518 predecessor = i->left;
|
|
1519 while (! NULL_RIGHT_CHILD (predecessor))
|
|
1520 {
|
|
1521 predecessor->total_length += absorb;
|
|
1522 predecessor = predecessor->right;
|
|
1523 }
|
|
1524
|
|
1525 predecessor->total_length += absorb;
|
|
1526 delete_interval (i);
|
|
1527 return predecessor;
|
|
1528 }
|
|
1529
|
|
1530 predecessor = i;
|
|
1531 while (! NULL_PARENT (predecessor)) /* It's above us. Go up,
|
4383
|
1532 subtracting ABSORB. */
|
1211
|
1533 {
|
|
1534 if (AM_RIGHT_CHILD (predecessor))
|
|
1535 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1536 predecessor = INTERVAL_PARENT (predecessor);
|
1211
|
1537 delete_interval (i);
|
|
1538 return predecessor;
|
|
1539 }
|
|
1540
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1541 predecessor = INTERVAL_PARENT (predecessor);
|
1211
|
1542 predecessor->total_length -= absorb;
|
|
1543 }
|
|
1544
|
|
1545 /* This must be the leftmost or first interval and cannot
|
4383
|
1546 be merged left. The caller should have known. */
|
1211
|
1547 abort ();
|
|
1548 }
|
|
1549
|
1189
|
1550 /* Make an exact copy of interval tree SOURCE which descends from
|
|
1551 PARENT. This is done by recursing through SOURCE, copying
|
|
1552 the current interval and its properties, and then adjusting
|
4383
|
1553 the pointers of the copy. */
|
1189
|
1554
|
1157
|
1555 static INTERVAL
|
|
1556 reproduce_tree (source, parent)
|
|
1557 INTERVAL source, parent;
|
|
1558 {
|
|
1559 register INTERVAL t = make_interval ();
|
|
1560
|
|
1561 bcopy (source, t, INTERVAL_SIZE);
|
|
1562 copy_properties (source, t);
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1563 SET_INTERVAL_PARENT (t, parent);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1564 if (! NULL_LEFT_CHILD (source))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1565 t->left = reproduce_tree (source->left, t);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1566 if (! NULL_RIGHT_CHILD (source))
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1567 t->right = reproduce_tree (source->right, t);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1568
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1569 return t;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1570 }
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1571
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1572 static INTERVAL
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1573 reproduce_tree_obj (source, parent)
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1574 INTERVAL source;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1575 Lisp_Object parent;
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1576 {
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1577 register INTERVAL t = make_interval ();
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1578
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1579 bcopy (source, t, INTERVAL_SIZE);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1580 copy_properties (source, t);
|
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1581 SET_INTERVAL_OBJECT (t, parent);
|
1157
|
1582 if (! NULL_LEFT_CHILD (source))
|
|
1583 t->left = reproduce_tree (source->left, t);
|
|
1584 if (! NULL_RIGHT_CHILD (source))
|
|
1585 t->right = reproduce_tree (source->right, t);
|
|
1586
|
|
1587 return t;
|
|
1588 }
|
|
1589
|
4005
|
1590 #if 0
|
|
1591 /* Nobody calls this. Perhaps it's a vestige of an earlier design. */
|
|
1592
|
1189
|
1593 /* Make a new interval of length LENGTH starting at START in the
|
|
1594 group of intervals INTERVALS, which is actually an interval tree.
|
|
1595 Returns the new interval.
|
|
1596
|
|
1597 Generate an error if the new positions would overlap an existing
|
4383
|
1598 interval. */
|
1189
|
1599
|
1157
|
1600 static INTERVAL
|
|
1601 make_new_interval (intervals, start, length)
|
|
1602 INTERVAL intervals;
|
|
1603 int start, length;
|
|
1604 {
|
|
1605 INTERVAL slot;
|
|
1606
|
|
1607 slot = find_interval (intervals, start);
|
|
1608 if (start + length > slot->position + LENGTH (slot))
|
|
1609 error ("Interval would overlap");
|
|
1610
|
|
1611 if (start == slot->position && length == LENGTH (slot))
|
|
1612 return slot;
|
|
1613
|
|
1614 if (slot->position == start)
|
|
1615 {
|
4383
|
1616 /* New right node. */
|
4135
|
1617 split_interval_right (slot, length);
|
1157
|
1618 return slot;
|
|
1619 }
|
|
1620
|
|
1621 if (slot->position + LENGTH (slot) == start + length)
|
|
1622 {
|
4383
|
1623 /* New left node. */
|
4135
|
1624 split_interval_left (slot, LENGTH (slot) - length);
|
1157
|
1625 return slot;
|
|
1626 }
|
|
1627
|
4383
|
1628 /* Convert interval SLOT into three intervals. */
|
4135
|
1629 split_interval_left (slot, start - slot->position);
|
|
1630 split_interval_right (slot, length);
|
1157
|
1631 return slot;
|
|
1632 }
|
4005
|
1633 #endif
|
2052
|
1634
|
1211
|
1635 /* Insert the intervals of SOURCE into BUFFER at POSITION.
|
5169
|
1636 LENGTH is the length of the text in SOURCE.
|
1157
|
1637
|
22343
|
1638 The `position' field of the SOURCE intervals is assumed to be
|
|
1639 consistent with its parent; therefore, SOURCE must be an
|
|
1640 interval tree made with copy_interval or must be the whole
|
|
1641 tree of a buffer or a string.
|
|
1642
|
4135
|
1643 This is used in insdel.c when inserting Lisp_Strings into the
|
|
1644 buffer. The text corresponding to SOURCE is already in the buffer
|
|
1645 when this is called. The intervals of new tree are a copy of those
|
|
1646 belonging to the string being inserted; intervals are never
|
|
1647 shared.
|
1157
|
1648
|
5169
|
1649 If the inserted text had no intervals associated, and we don't
|
|
1650 want to inherit the surrounding text's properties, this function
|
1157
|
1651 simply returns -- offset_intervals should handle placing the
|
1164
|
1652 text in the correct interval, depending on the sticky bits.
|
1157
|
1653
|
|
1654 If the inserted text had properties (intervals), then there are two
|
|
1655 cases -- either insertion happened in the middle of some interval,
|
|
1656 or between two intervals.
|
|
1657
|
|
1658 If the text goes into the middle of an interval, then new
|
|
1659 intervals are created in the middle with only the properties of
|
|
1660 the new text, *unless* the macro MERGE_INSERTIONS is true, in
|
|
1661 which case the new text has the union of its properties and those
|
|
1662 of the text into which it was inserted.
|
|
1663
|
|
1664 If the text goes between two intervals, then if neither interval
|
1164
|
1665 had its appropriate sticky property set (front_sticky, rear_sticky),
|
|
1666 the new text has only its properties. If one of the sticky properties
|
1157
|
1667 is set, then the new text "sticks" to that region and its properties
|
3591
|
1668 depend on merging as above. If both the preceding and succeeding
|
1164
|
1669 intervals to the new text are "sticky", then the new text retains
|
|
1670 only its properties, as if neither sticky property were set. Perhaps
|
1157
|
1671 we should consider merging all three sets of properties onto the new
|
4383
|
1672 text... */
|
1157
|
1673
|
|
1674 void
|
5169
|
1675 graft_intervals_into_buffer (source, position, length, buffer, inherit)
|
1211
|
1676 INTERVAL source;
|
5169
|
1677 int position, length;
|
1211
|
1678 struct buffer *buffer;
|
4718
|
1679 int inherit;
|
1157
|
1680 {
|
1964
|
1681 register INTERVAL under, over, this, prev;
|
10313
|
1682 register INTERVAL tree;
|
1157
|
1683
|
10313
|
1684 tree = BUF_INTERVALS (buffer);
|
|
1685
|
40920
|
1686 /* If the new text has no properties, then with inheritance it
|
|
1687 becomes part of whatever interval it was inserted into.
|
|
1688 To prevent inheritance, we must clear out the properties
|
|
1689 of the newly inserted text. */
|
1211
|
1690 if (NULL_INTERVAL_P (source))
|
5169
|
1691 {
|
|
1692 Lisp_Object buf;
|
41531
|
1693 if (!inherit && !NULL_INTERVAL_P (tree) && length > 0)
|
5169
|
1694 {
|
9271
1971a6a8cdc0
(graft_intervals_into_buffer): Use new accessor macros instead of calling XSET
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1695 XSETBUFFER (buf, buffer);
|
40920
|
1696 set_text_properties_1 (make_number (position),
|
|
1697 make_number (position + length),
|
|
1698 Qnil, buf, 0);
|
5169
|
1699 }
|
10313
|
1700 if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer)))
|
|
1701 BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer));
|
5169
|
1702 return;
|
|
1703 }
|
1157
|
1704
|
|
1705 if (NULL_INTERVAL_P (tree))
|
|
1706 {
|
|
1707 /* The inserted text constitutes the whole buffer, so
|
4383
|
1708 simply copy over the interval structure. */
|
4135
|
1709 if ((BUF_Z (buffer) - BUF_BEG (buffer)) == TOTAL_LENGTH (source))
|
1157
|
1710 {
|
4223
|
1711 Lisp_Object buf;
|
9271
1971a6a8cdc0
(graft_intervals_into_buffer): Use new accessor macros instead of calling XSET
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1712 XSETBUFFER (buf, buffer);
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1713 BUF_INTERVALS (buffer) = reproduce_tree_obj (source, buf);
|
22343
|
1714 BUF_INTERVALS (buffer)->position = 1;
|
|
1715
|
|
1716 /* Explicitly free the old tree here? */
|
1157
|
1717
|
|
1718 return;
|
|
1719 }
|
|
1720
|
|
1721 /* Create an interval tree in which to place a copy
|
4383
|
1722 of the intervals of the inserted string. */
|
1157
|
1723 {
|
1307
|
1724 Lisp_Object buf;
|
9271
1971a6a8cdc0
(graft_intervals_into_buffer): Use new accessor macros instead of calling XSET
Karl Heuer <kwzh@gnu.org>
diff
changeset
|
1725 XSETBUFFER (buf, buffer);
|
1964
|
1726 tree = create_root_interval (buf);
|
1157
|
1727 }
|
|
1728 }
|
4718
|
1729 else if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source))
|
|
1730 /* If the buffer contains only the new string, but
|
|
1731 there was already some interval tree there, then it may be
|
|
1732 some zero length intervals. Eventually, do something clever
|
|
1733 about inserting properly. For now, just waste the old intervals. */
|
|
1734 {
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
1735 BUF_INTERVALS (buffer) = reproduce_tree (source, INTERVAL_PARENT (tree));
|
22343
|
1736 BUF_INTERVALS (buffer)->position = 1;
|
4718
|
1737 /* Explicitly free the old tree here. */
|
1157
|
1738
|
4718
|
1739 return;
|
|
1740 }
|
|
1741 /* Paranoia -- the text has already been added, so this buffer
|
|
1742 should be of non-zero length. */
|
|
1743 else if (TOTAL_LENGTH (tree) == 0)
|
|
1744 abort ();
|
1157
|
1745
|
|
1746 this = under = find_interval (tree, position);
|
|
1747 if (NULL_INTERVAL_P (under)) /* Paranoia */
|
|
1748 abort ();
|
22343
|
1749 over = find_interval (source, interval_start_pos (source));
|
1157
|
1750
|
1964
|
1751 /* Here for insertion in the middle of an interval.
|
|
1752 Split off an equivalent interval to the right,
|
|
1753 then don't bother with it any more. */
|
1157
|
1754
|
1964
|
1755 if (position > under->position)
|
|
1756 {
|
|
1757 INTERVAL end_unchanged
|
4135
|
1758 = split_interval_left (this, position - under->position);
|
1964
|
1759 copy_properties (under, end_unchanged);
|
|
1760 under->position = position;
|
|
1761 }
|
|
1762 else
|
|
1763 {
|
26862
|
1764 /* This call may have some effect because previous_interval may
|
|
1765 update `position' fields of intervals. Thus, don't ignore it
|
|
1766 for the moment. Someone please tell me the truth (K.Handa). */
|
1964
|
1767 prev = previous_interval (under);
|
26862
|
1768 #if 0
|
|
1769 /* But, this code surely has no effect. And, anyway,
|
|
1770 END_NONSTICKY_P is unreliable now. */
|
4383
|
1771 if (prev && !END_NONSTICKY_P (prev))
|
1964
|
1772 prev = 0;
|
26862
|
1773 #endif /* 0 */
|
1157
|
1774 }
|
|
1775
|
1964
|
1776 /* Insertion is now at beginning of UNDER. */
|
1157
|
1777
|
1964
|
1778 /* The inserted text "sticks" to the interval `under',
|
4383
|
1779 which means it gets those properties.
|
|
1780 The properties of under are the result of
|
14036
|
1781 adjust_intervals_for_insertion, so stickiness has
|
4383
|
1782 already been taken care of. */
|
|
1783
|
1157
|
1784 while (! NULL_INTERVAL_P (over))
|
|
1785 {
|
5666
|
1786 if (LENGTH (over) < LENGTH (under))
|
4383
|
1787 {
|
|
1788 this = split_interval_left (under, LENGTH (over));
|
|
1789 copy_properties (under, this);
|
|
1790 }
|
1964
|
1791 else
|
|
1792 this = under;
|
1157
|
1793 copy_properties (over, this);
|
4718
|
1794 if (inherit)
|
4383
|
1795 merge_properties (over, this);
|
|
1796 else
|
|
1797 copy_properties (over, this);
|
1157
|
1798 over = next_interval (over);
|
|
1799 }
|
|
1800
|
10313
|
1801 if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer)))
|
|
1802 BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer));
|
1157
|
1803 return;
|
|
1804 }
|
|
1805
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1806 /* Get the value of property PROP from PLIST,
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1807 which is the plist of an interval.
|
10927
|
1808 We check for direct properties, for categories with property PROP,
|
11133
119880025e8f
(Vdefault_text_properties): name changed from Vdefault_properties.
Boris Goldowsky <boris@gnu.org>
diff
changeset
|
1809 and for PROP appearing on the default-text-properties list. */
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1810
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1811 Lisp_Object
|
1964
|
1812 textget (plist, prop)
|
|
1813 Lisp_Object plist;
|
|
1814 register Lisp_Object prop;
|
|
1815 {
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1816 register Lisp_Object tail, fallback;
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1817 fallback = Qnil;
|
1964
|
1818
|
|
1819 for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail)))
|
|
1820 {
|
|
1821 register Lisp_Object tem;
|
|
1822 tem = Fcar (tail);
|
|
1823 if (EQ (prop, tem))
|
|
1824 return Fcar (Fcdr (tail));
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1825 if (EQ (tem, Qcategory))
|
8611
|
1826 {
|
|
1827 tem = Fcar (Fcdr (tail));
|
|
1828 if (SYMBOLP (tem))
|
|
1829 fallback = Fget (tem, prop);
|
|
1830 }
|
1964
|
1831 }
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1832
|
10927
|
1833 if (! NILP (fallback))
|
|
1834 return fallback;
|
11133
119880025e8f
(Vdefault_text_properties): name changed from Vdefault_properties.
Boris Goldowsky <boris@gnu.org>
diff
changeset
|
1835 if (CONSP (Vdefault_text_properties))
|
119880025e8f
(Vdefault_text_properties): name changed from Vdefault_properties.
Boris Goldowsky <boris@gnu.org>
diff
changeset
|
1836 return Fplist_get (Vdefault_text_properties, prop);
|
10927
|
1837 return Qnil;
|
1964
|
1838 }
|
4383
|
1839
|
2052
|
1840
|
20557
|
1841 /* Set point "temporarily", without checking any text properties. */
|
|
1842
|
|
1843 INLINE void
|
|
1844 temp_set_point (buffer, charpos)
|
|
1845 struct buffer *buffer;
|
|
1846 int charpos;
|
|
1847 {
|
|
1848 temp_set_point_both (buffer, charpos,
|
|
1849 buf_charpos_to_bytepos (buffer, charpos));
|
|
1850 }
|
|
1851
|
|
1852 /* Set point in BUFFER "temporarily" to CHARPOS, which corresponds to
|
|
1853 byte position BYTEPOS. */
|
|
1854
|
|
1855 INLINE void
|
|
1856 temp_set_point_both (buffer, charpos, bytepos)
|
20936
|
1857 int charpos, bytepos;
|
20557
|
1858 struct buffer *buffer;
|
|
1859 {
|
|
1860 /* In a single-byte buffer, the two positions must be equal. */
|
|
1861 if (BUF_ZV (buffer) == BUF_ZV_BYTE (buffer)
|
|
1862 && charpos != bytepos)
|
|
1863 abort ();
|
|
1864
|
|
1865 if (charpos > bytepos)
|
|
1866 abort ();
|
|
1867
|
|
1868 if (charpos > BUF_ZV (buffer) || charpos < BUF_BEGV (buffer))
|
|
1869 abort ();
|
|
1870
|
|
1871 BUF_PT_BYTE (buffer) = bytepos;
|
|
1872 BUF_PT (buffer) = charpos;
|
|
1873 }
|
|
1874
|
|
1875 /* Set point in BUFFER to CHARPOS. If the target position is
|
7104
|
1876 before an intangible character, move to an ok place. */
|
1157
|
1877
|
|
1878 void
|
20557
|
1879 set_point (buffer, charpos)
|
1157
|
1880 register struct buffer *buffer;
|
20557
|
1881 register int charpos;
|
|
1882 {
|
|
1883 set_point_both (buffer, charpos, buf_charpos_to_bytepos (buffer, charpos));
|
|
1884 }
|
|
1885
|
|
1886 /* Set point in BUFFER to CHARPOS, which corresponds to byte
|
|
1887 position BYTEPOS. If the target position is
|
|
1888 before an intangible character, move to an ok place. */
|
|
1889
|
|
1890 void
|
|
1891 set_point_both (buffer, charpos, bytepos)
|
|
1892 register struct buffer *buffer;
|
20936
|
1893 register int charpos, bytepos;
|
1157
|
1894 {
|
25747
|
1895 register INTERVAL to, from, toprev, fromprev;
|
1157
|
1896 int buffer_point;
|
10313
|
1897 int old_position = BUF_PT (buffer);
|
20557
|
1898 int backwards = (charpos < old_position ? 1 : 0);
|
16680
|
1899 int have_overlays;
|
|
1900 int original_position;
|
1157
|
1901
|
10563
|
1902 buffer->point_before_scroll = Qnil;
|
|
1903
|
20557
|
1904 if (charpos == BUF_PT (buffer))
|
1157
|
1905 return;
|
|
1906
|
20557
|
1907 /* In a single-byte buffer, the two positions must be equal. */
|
|
1908 if (BUF_ZV (buffer) == BUF_ZV_BYTE (buffer)
|
|
1909 && charpos != bytepos)
|
|
1910 abort ();
|
|
1911
|
2779
|
1912 /* Check this now, before checking if the buffer has any intervals.
|
|
1913 That way, we can catch conditions which break this sanity check
|
|
1914 whether or not there are intervals in the buffer. */
|
20557
|
1915 if (charpos > BUF_ZV (buffer) || charpos < BUF_BEGV (buffer))
|
2779
|
1916 abort ();
|
|
1917
|
16680
|
1918 have_overlays = (! NILP (buffer->overlays_before)
|
|
1919 || ! NILP (buffer->overlays_after));
|
|
1920
|
|
1921 /* If we have no text properties and overlays,
|
|
1922 then we can do it quickly. */
|
|
1923 if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) && ! have_overlays)
|
1157
|
1924 {
|
20557
|
1925 temp_set_point_both (buffer, charpos, bytepos);
|
1157
|
1926 return;
|
|
1927 }
|
|
1928
|
20557
|
1929 /* Set TO to the interval containing the char after CHARPOS,
|
|
1930 and TOPREV to the interval containing the char before CHARPOS.
|
1964
|
1931 Either one may be null. They may be equal. */
|
20557
|
1932 to = find_interval (BUF_INTERVALS (buffer), charpos);
|
|
1933 if (charpos == BUF_BEGV (buffer))
|
2052
|
1934 toprev = 0;
|
20557
|
1935 else if (to && to->position == charpos)
|
1964
|
1936 toprev = previous_interval (to);
|
|
1937 else
|
|
1938 toprev = to;
|
1211
|
1939
|
2052
|
1940 buffer_point = (BUF_PT (buffer) == BUF_ZV (buffer)
|
|
1941 ? BUF_ZV (buffer) - 1
|
1964
|
1942 : BUF_PT (buffer));
|
|
1943
|
|
1944 /* Set FROM to the interval containing the char after PT,
|
|
1945 and FROMPREV to the interval containing the char before PT.
|
|
1946 Either one may be null. They may be equal. */
|
4383
|
1947 /* We could cache this and save time. */
|
10313
|
1948 from = find_interval (BUF_INTERVALS (buffer), buffer_point);
|
4383
|
1949 if (buffer_point == BUF_BEGV (buffer))
|
2052
|
1950 fromprev = 0;
|
16680
|
1951 else if (from && from->position == BUF_PT (buffer))
|
1964
|
1952 fromprev = previous_interval (from);
|
|
1953 else if (buffer_point != BUF_PT (buffer))
|
|
1954 fromprev = from, from = 0;
|
|
1955 else
|
|
1956 fromprev = from;
|
1157
|
1957
|
4383
|
1958 /* Moving within an interval. */
|
16680
|
1959 if (to == from && toprev == fromprev && INTERVAL_VISIBLE_P (to)
|
|
1960 && ! have_overlays)
|
1157
|
1961 {
|
20557
|
1962 temp_set_point_both (buffer, charpos, bytepos);
|
1157
|
1963 return;
|
|
1964 }
|
|
1965
|
20557
|
1966 original_position = charpos;
|
16680
|
1967
|
11327
|
1968 /* If the new position is between two intangible characters
|
|
1969 with the same intangible property value,
|
|
1970 move forward or backward until a change in that property. */
|
16680
|
1971 if (NILP (Vinhibit_point_motion_hooks)
|
|
1972 && ((! NULL_INTERVAL_P (to) && ! NULL_INTERVAL_P (toprev))
|
16716
|
1973 || have_overlays)
|
|
1974 /* Intangibility never stops us from positioning at the beginning
|
|
1975 or end of the buffer, so don't bother checking in that case. */
|
20557
|
1976 && charpos != BEGV && charpos != ZV)
|
1157
|
1977 {
|
16680
|
1978 Lisp_Object intangible_propval;
|
|
1979 Lisp_Object pos;
|
|
1980
|
20557
|
1981 XSETINT (pos, charpos);
|
16680
|
1982
|
9072
21517199cfae
(set_point): If Vinhibit_point_motion_hooks, ignore intangible properties.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1983 if (backwards)
|
21517199cfae
(set_point): If Vinhibit_point_motion_hooks, ignore intangible properties.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1984 {
|
20557
|
1985 intangible_propval = Fget_char_property (make_number (charpos),
|
16680
|
1986 Qintangible, Qnil);
|
11327
|
1987
|
|
1988 /* If following char is intangible,
|
|
1989 skip back over all chars with matching intangible property. */
|
|
1990 if (! NILP (intangible_propval))
|
16680
|
1991 while (XINT (pos) > BUF_BEGV (buffer)
|
|
1992 && EQ (Fget_char_property (make_number (XINT (pos) - 1),
|
|
1993 Qintangible, Qnil),
|
|
1994 intangible_propval))
|
|
1995 pos = Fprevious_char_property_change (pos, Qnil);
|
9072
21517199cfae
(set_point): If Vinhibit_point_motion_hooks, ignore intangible properties.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1996 }
|
3734
|
1997 else
|
9072
21517199cfae
(set_point): If Vinhibit_point_motion_hooks, ignore intangible properties.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
1998 {
|
20557
|
1999 intangible_propval = Fget_char_property (make_number (charpos - 1),
|
16680
|
2000 Qintangible, Qnil);
|
11327
|
2001
|
16680
|
2002 /* If following char is intangible,
|
24910
|
2003 skip forward over all chars with matching intangible property. */
|
11327
|
2004 if (! NILP (intangible_propval))
|
16680
|
2005 while (XINT (pos) < BUF_ZV (buffer)
|
|
2006 && EQ (Fget_char_property (pos, Qintangible, Qnil),
|
|
2007 intangible_propval))
|
|
2008 pos = Fnext_char_property_change (pos, Qnil);
|
|
2009
|
9072
21517199cfae
(set_point): If Vinhibit_point_motion_hooks, ignore intangible properties.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2010 }
|
16680
|
2011
|
20557
|
2012 charpos = XINT (pos);
|
|
2013 bytepos = buf_charpos_to_bytepos (buffer, charpos);
|
16680
|
2014 }
|
|
2015
|
20557
|
2016 if (charpos != original_position)
|
16680
|
2017 {
|
20557
|
2018 /* Set TO to the interval containing the char after CHARPOS,
|
|
2019 and TOPREV to the interval containing the char before CHARPOS.
|
16680
|
2020 Either one may be null. They may be equal. */
|
20557
|
2021 to = find_interval (BUF_INTERVALS (buffer), charpos);
|
|
2022 if (charpos == BUF_BEGV (buffer))
|
16680
|
2023 toprev = 0;
|
20557
|
2024 else if (to && to->position == charpos)
|
16680
|
2025 toprev = previous_interval (to);
|
|
2026 else
|
|
2027 toprev = to;
|
1157
|
2028 }
|
1964
|
2029
|
11327
|
2030 /* Here TO is the interval after the stopping point
|
|
2031 and TOPREV is the interval before the stopping point.
|
|
2032 One or the other may be null. */
|
|
2033
|
20557
|
2034 temp_set_point_both (buffer, charpos, bytepos);
|
1157
|
2035
|
1288
|
2036 /* We run point-left and point-entered hooks here, iff the
|
|
2037 two intervals are not equivalent. These hooks take
|
1964
|
2038 (old_point, new_point) as arguments. */
|
4243
|
2039 if (NILP (Vinhibit_point_motion_hooks)
|
|
2040 && (! intervals_equal (from, to)
|
|
2041 || ! intervals_equal (fromprev, toprev)))
|
1211
|
2042 {
|
1964
|
2043 Lisp_Object leave_after, leave_before, enter_after, enter_before;
|
|
2044
|
|
2045 if (fromprev)
|
|
2046 leave_after = textget (fromprev->plist, Qpoint_left);
|
|
2047 else
|
|
2048 leave_after = Qnil;
|
|
2049 if (from)
|
|
2050 leave_before = textget (from->plist, Qpoint_left);
|
|
2051 else
|
|
2052 leave_before = Qnil;
|
1211
|
2053
|
1964
|
2054 if (toprev)
|
|
2055 enter_after = textget (toprev->plist, Qpoint_entered);
|
|
2056 else
|
|
2057 enter_after = Qnil;
|
|
2058 if (to)
|
|
2059 enter_before = textget (to->plist, Qpoint_entered);
|
|
2060 else
|
|
2061 enter_before = Qnil;
|
1211
|
2062
|
1964
|
2063 if (! EQ (leave_before, enter_before) && !NILP (leave_before))
|
18743
|
2064 call2 (leave_before, make_number (old_position),
|
20557
|
2065 make_number (charpos));
|
1964
|
2066 if (! EQ (leave_after, enter_after) && !NILP (leave_after))
|
18743
|
2067 call2 (leave_after, make_number (old_position),
|
20557
|
2068 make_number (charpos));
|
1964
|
2069
|
|
2070 if (! EQ (enter_before, leave_before) && !NILP (enter_before))
|
18743
|
2071 call2 (enter_before, make_number (old_position),
|
20557
|
2072 make_number (charpos));
|
1964
|
2073 if (! EQ (enter_after, leave_after) && !NILP (enter_after))
|
18743
|
2074 call2 (enter_after, make_number (old_position),
|
20557
|
2075 make_number (charpos));
|
1211
|
2076 }
|
1157
|
2077 }
|
2052
|
2078
|
18076
|
2079 /* Move point to POSITION, unless POSITION is inside an intangible
|
|
2080 segment that reaches all the way to point. */
|
|
2081
|
|
2082 void
|
|
2083 move_if_not_intangible (position)
|
|
2084 int position;
|
|
2085 {
|
|
2086 Lisp_Object pos;
|
|
2087 Lisp_Object intangible_propval;
|
|
2088
|
|
2089 XSETINT (pos, position);
|
|
2090
|
|
2091 if (! NILP (Vinhibit_point_motion_hooks))
|
|
2092 /* If intangible is inhibited, always move point to POSITION. */
|
|
2093 ;
|
18613
|
2094 else if (PT < position && XINT (pos) < ZV)
|
18076
|
2095 {
|
|
2096 /* We want to move forward, so check the text before POSITION. */
|
|
2097
|
|
2098 intangible_propval = Fget_char_property (pos,
|
|
2099 Qintangible, Qnil);
|
|
2100
|
|
2101 /* If following char is intangible,
|
|
2102 skip back over all chars with matching intangible property. */
|
|
2103 if (! NILP (intangible_propval))
|
|
2104 while (XINT (pos) > BEGV
|
|
2105 && EQ (Fget_char_property (make_number (XINT (pos) - 1),
|
|
2106 Qintangible, Qnil),
|
|
2107 intangible_propval))
|
|
2108 pos = Fprevious_char_property_change (pos, Qnil);
|
|
2109 }
|
18613
|
2110 else if (XINT (pos) > BEGV)
|
18076
|
2111 {
|
|
2112 /* We want to move backward, so check the text after POSITION. */
|
|
2113
|
|
2114 intangible_propval = Fget_char_property (make_number (XINT (pos) - 1),
|
|
2115 Qintangible, Qnil);
|
|
2116
|
|
2117 /* If following char is intangible,
|
24910
|
2118 skip forward over all chars with matching intangible property. */
|
18076
|
2119 if (! NILP (intangible_propval))
|
|
2120 while (XINT (pos) < ZV
|
|
2121 && EQ (Fget_char_property (pos, Qintangible, Qnil),
|
|
2122 intangible_propval))
|
|
2123 pos = Fnext_char_property_change (pos, Qnil);
|
|
2124
|
|
2125 }
|
|
2126
|
|
2127 /* If the whole stretch between PT and POSITION isn't intangible,
|
|
2128 try moving to POSITION (which means we actually move farther
|
|
2129 if POSITION is inside of intangible text). */
|
|
2130
|
|
2131 if (XINT (pos) != PT)
|
|
2132 SET_PT (position);
|
|
2133 }
|
|
2134
|
26862
|
2135 /* If text at position POS has property PROP, set *VAL to the property
|
|
2136 value, *START and *END to the beginning and end of a region that
|
|
2137 has the same property, and return 1. Otherwise return 0.
|
|
2138
|
|
2139 OBJECT is the string or buffer to look for the property in;
|
|
2140 nil means the current buffer. */
|
|
2141
|
|
2142 int
|
|
2143 get_property_and_range (pos, prop, val, start, end, object)
|
|
2144 int pos;
|
|
2145 Lisp_Object prop, *val;
|
|
2146 int *start, *end;
|
|
2147 Lisp_Object object;
|
|
2148 {
|
|
2149 INTERVAL i, prev, next;
|
|
2150
|
|
2151 if (NILP (object))
|
|
2152 i = find_interval (BUF_INTERVALS (current_buffer), pos);
|
|
2153 else if (BUFFERP (object))
|
|
2154 i = find_interval (BUF_INTERVALS (XBUFFER (object)), pos);
|
|
2155 else if (STRINGP (object))
|
|
2156 i = find_interval (XSTRING (object)->intervals, pos);
|
|
2157 else
|
|
2158 abort ();
|
|
2159
|
|
2160 if (NULL_INTERVAL_P (i) || (i->position + LENGTH (i) <= pos))
|
|
2161 return 0;
|
|
2162 *val = textget (i->plist, prop);
|
|
2163 if (NILP (*val))
|
|
2164 return 0;
|
|
2165
|
|
2166 next = i; /* remember it in advance */
|
|
2167 prev = previous_interval (i);
|
|
2168 while (! NULL_INTERVAL_P (prev)
|
|
2169 && EQ (*val, textget (prev->plist, prop)))
|
|
2170 i = prev, prev = previous_interval (prev);
|
|
2171 *start = i->position;
|
|
2172
|
|
2173 next = next_interval (i);
|
|
2174 while (! NULL_INTERVAL_P (next)
|
|
2175 && EQ (*val, textget (next->plist, prop)))
|
|
2176 i = next, next = next_interval (next);
|
|
2177 *end = i->position + LENGTH (i);
|
|
2178
|
|
2179 return 1;
|
|
2180 }
|
|
2181
|
35256
|
2182 /* Return the proper local keymap TYPE for position POSITION in
|
|
2183 BUFFER; TYPE should be one of `keymap' or `local-map'. Use the map
|
|
2184 specified by the PROP property, if any. Otherwise, if TYPE is
|
|
2185 `local-map' use BUFFER's local map. */
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2186
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2187 Lisp_Object
|
29278
|
2188 get_local_map (position, buffer, type)
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2189 register int position;
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2190 register struct buffer *buffer;
|
35256
|
2191 Lisp_Object type;
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2192 {
|
34959
|
2193 Lisp_Object prop, lispy_position, lispy_buffer;
|
20557
|
2194 int old_begv, old_zv, old_begv_byte, old_zv_byte;
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2195
|
4383
|
2196 /* Perhaps we should just change `position' to the limit. */
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2197 if (position > BUF_Z (buffer) || position < BUF_BEG (buffer))
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2198 abort ();
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2199
|
11660
|
2200 /* Ignore narrowing, so that a local map continues to be valid even if
|
|
2201 the visible region contains no characters and hence no properties. */
|
|
2202 old_begv = BUF_BEGV (buffer);
|
|
2203 old_zv = BUF_ZV (buffer);
|
20557
|
2204 old_begv_byte = BUF_BEGV_BYTE (buffer);
|
|
2205 old_zv_byte = BUF_ZV_BYTE (buffer);
|
11660
|
2206 BUF_BEGV (buffer) = BUF_BEG (buffer);
|
|
2207 BUF_ZV (buffer) = BUF_Z (buffer);
|
20557
|
2208 BUF_BEGV_BYTE (buffer) = BUF_BEG_BYTE (buffer);
|
|
2209 BUF_ZV_BYTE (buffer) = BUF_Z_BYTE (buffer);
|
11660
|
2210
|
|
2211 /* There are no properties at the end of the buffer, so in that case
|
|
2212 check for a local map on the last character of the buffer instead. */
|
|
2213 if (position == BUF_Z (buffer) && BUF_Z (buffer) > BUF_BEG (buffer))
|
|
2214 --position;
|
|
2215 XSETFASTINT (lispy_position, position);
|
|
2216 XSETBUFFER (lispy_buffer, buffer);
|
35256
|
2217 prop = Fget_char_property (lispy_position, type, lispy_buffer);
|
11660
|
2218
|
|
2219 BUF_BEGV (buffer) = old_begv;
|
|
2220 BUF_ZV (buffer) = old_zv;
|
20557
|
2221 BUF_BEGV_BYTE (buffer) = old_begv_byte;
|
|
2222 BUF_ZV_BYTE (buffer) = old_zv_byte;
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2223
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2224 /* Use the local map only if it is valid. */
|
32988
|
2225 prop = get_keymap (prop, 0, 0);
|
|
2226 if (CONSP (prop))
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2227 return prop;
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2228
|
35256
|
2229 if (EQ (type, Qkeymap))
|
29278
|
2230 return Qnil;
|
|
2231 else
|
|
2232 return buffer->keymap;
|
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2233 }
|
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2234
|
1211
|
2235 /* Produce an interval tree reflecting the intervals in
|
22343
|
2236 TREE from START to START + LENGTH.
|
|
2237 The new interval tree has no parent and has a starting-position of 0. */
|
1157
|
2238
|
1316
|
2239 INTERVAL
|
1157
|
2240 copy_intervals (tree, start, length)
|
|
2241 INTERVAL tree;
|
|
2242 int start, length;
|
|
2243 {
|
|
2244 register INTERVAL i, new, t;
|
3490
|
2245 register int got, prevlen;
|
1157
|
2246
|
|
2247 if (NULL_INTERVAL_P (tree) || length <= 0)
|
|
2248 return NULL_INTERVAL;
|
|
2249
|
|
2250 i = find_interval (tree, start);
|
|
2251 if (NULL_INTERVAL_P (i) || LENGTH (i) == 0)
|
|
2252 abort ();
|
|
2253
|
4383
|
2254 /* If there is only one interval and it's the default, return nil. */
|
1157
|
2255 if ((start - i->position + 1 + length) < LENGTH (i)
|
|
2256 && DEFAULT_INTERVAL_P (i))
|
|
2257 return NULL_INTERVAL;
|
|
2258
|
|
2259 new = make_interval ();
|
22343
|
2260 new->position = 0;
|
1157
|
2261 got = (LENGTH (i) - (start - i->position));
|
1211
|
2262 new->total_length = length;
|
1157
|
2263 copy_properties (i, new);
|
|
2264
|
|
2265 t = new;
|
3490
|
2266 prevlen = got;
|
1157
|
2267 while (got < length)
|
|
2268 {
|
|
2269 i = next_interval (i);
|
4135
|
2270 t = split_interval_right (t, prevlen);
|
1157
|
2271 copy_properties (i, t);
|
3490
|
2272 prevlen = LENGTH (i);
|
|
2273 got += prevlen;
|
1157
|
2274 }
|
|
2275
|
5415
|
2276 return balance_an_interval (new);
|
1157
|
2277 }
|
|
2278
|
4383
|
2279 /* Give STRING the properties of BUFFER from POSITION to LENGTH. */
|
1157
|
2280
|
1288
|
2281 INLINE void
|
1157
|
2282 copy_intervals_to_string (string, buffer, position, length)
|
16110
|
2283 Lisp_Object string;
|
|
2284 struct buffer *buffer;
|
1157
|
2285 int position, length;
|
|
2286 {
|
16110
|
2287 INTERVAL interval_copy = copy_intervals (BUF_INTERVALS (buffer),
|
1157
|
2288 position, length);
|
|
2289 if (NULL_INTERVAL_P (interval_copy))
|
|
2290 return;
|
|
2291
|
28269
fd13be8ae190
Changes towards better type safety regarding intervals, primarily
Ken Raeburn <raeburn@raeburn.org>
diff
changeset
|
2292 SET_INTERVAL_OBJECT (interval_copy, string);
|
1157
|
2293 XSTRING (string)->intervals = interval_copy;
|
|
2294 }
|
10113
|
2295
|
22343
|
2296 /* Return 1 if strings S1 and S2 have identical properties; 0 otherwise.
|
10113
|
2297 Assume they have identical characters. */
|
|
2298
|
|
2299 int
|
|
2300 compare_string_intervals (s1, s2)
|
|
2301 Lisp_Object s1, s2;
|
|
2302 {
|
|
2303 INTERVAL i1, i2;
|
22343
|
2304 int pos = 0;
|
|
2305 int end = XSTRING (s1)->size;
|
10113
|
2306
|
22343
|
2307 i1 = find_interval (XSTRING (s1)->intervals, 0);
|
|
2308 i2 = find_interval (XSTRING (s2)->intervals, 0);
|
10113
|
2309
|
|
2310 while (pos < end)
|
|
2311 {
|
|
2312 /* Determine how far we can go before we reach the end of I1 or I2. */
|
|
2313 int len1 = (i1 != 0 ? INTERVAL_LAST_POS (i1) : end) - pos;
|
|
2314 int len2 = (i2 != 0 ? INTERVAL_LAST_POS (i2) : end) - pos;
|
|
2315 int distance = min (len1, len2);
|
|
2316
|
|
2317 /* If we ever find a mismatch between the strings,
|
|
2318 they differ. */
|
|
2319 if (! intervals_equal (i1, i2))
|
|
2320 return 0;
|
|
2321
|
|
2322 /* Advance POS till the end of the shorter interval,
|
|
2323 and advance one or both interval pointers for the new position. */
|
|
2324 pos += distance;
|
|
2325 if (len1 == distance)
|
|
2326 i1 = next_interval (i1);
|
|
2327 if (len2 == distance)
|
|
2328 i2 = next_interval (i2);
|
|
2329 }
|
|
2330 return 1;
|
|
2331 }
|
20677
|
2332
|
|
2333 /* Recursively adjust interval I in the current buffer
|
|
2334 for setting enable_multibyte_characters to MULTI_FLAG.
|
|
2335 The range of interval I is START ... END in characters,
|
|
2336 START_BYTE ... END_BYTE in bytes. */
|
|
2337
|
|
2338 static void
|
|
2339 set_intervals_multibyte_1 (i, multi_flag, start, start_byte, end, end_byte)
|
|
2340 INTERVAL i;
|
|
2341 int multi_flag;
|
|
2342 int start, start_byte, end, end_byte;
|
|
2343 {
|
|
2344 /* Fix the length of this interval. */
|
|
2345 if (multi_flag)
|
|
2346 i->total_length = end - start;
|
|
2347 else
|
|
2348 i->total_length = end_byte - start_byte;
|
|
2349
|
|
2350 /* Recursively fix the length of the subintervals. */
|
|
2351 if (i->left)
|
|
2352 {
|
|
2353 int left_end, left_end_byte;
|
|
2354
|
|
2355 if (multi_flag)
|
|
2356 {
|
|
2357 left_end_byte = start_byte + LEFT_TOTAL_LENGTH (i);
|
|
2358 left_end = BYTE_TO_CHAR (left_end_byte);
|
|
2359 }
|
|
2360 else
|
|
2361 {
|
|
2362 left_end = start + LEFT_TOTAL_LENGTH (i);
|
|
2363 left_end_byte = CHAR_TO_BYTE (left_end);
|
|
2364 }
|
|
2365
|
|
2366 set_intervals_multibyte_1 (i->left, multi_flag, start, start_byte,
|
|
2367 left_end, left_end_byte);
|
|
2368 }
|
|
2369 if (i->right)
|
|
2370 {
|
|
2371 int right_start_byte, right_start;
|
|
2372
|
|
2373 if (multi_flag)
|
|
2374 {
|
|
2375 right_start_byte = end_byte - RIGHT_TOTAL_LENGTH (i);
|
|
2376 right_start = BYTE_TO_CHAR (right_start_byte);
|
|
2377 }
|
|
2378 else
|
|
2379 {
|
|
2380 right_start = end - RIGHT_TOTAL_LENGTH (i);
|
|
2381 right_start_byte = CHAR_TO_BYTE (right_start);
|
|
2382 }
|
|
2383
|
|
2384 set_intervals_multibyte_1 (i->right, multi_flag,
|
|
2385 right_start, right_start_byte,
|
|
2386 end, end_byte);
|
|
2387 }
|
|
2388 }
|
1301
|
2389
|
21351
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2390 /* Update the intervals of the current buffer
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2391 to fit the contents as multibyte (if MULTI_FLAG is 1)
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2392 or to fit them as non-multibyte (if MULTI_FLAG is 0). */
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2393
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2394 void
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2395 set_intervals_multibyte (multi_flag)
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2396 int multi_flag;
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2397 {
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2398 if (BUF_INTERVALS (current_buffer))
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2399 set_intervals_multibyte_1 (BUF_INTERVALS (current_buffer), multi_flag,
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2400 BEG, BEG_BYTE, Z, Z_BYTE);
|
78203467fc7d
(set_intervals_multibyte): Function moved after set_intervals_multibyte_1.
Richard M. Stallman <rms@gnu.org>
diff
changeset
|
2401 }
|