Mercurial > emacs
annotate src/intervals.c @ 3995:cdab67a10461
* intervals.c (intervals_equal): Test the return value of Fequal
against Qnil, not 0.
author | Jim Blandy <jimb@redhat.com> |
---|---|
date | Mon, 05 Jul 1993 07:57:34 +0000 |
parents | a58e981e2582 |
children | c0560357c84e |
rev | line source |
---|---|
1157 | 1 /* Code for doing intervals. |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
2 Copyright (C) 1993 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 | |
8 the Free Software Foundation; either version 1, or (at your option) | |
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 | |
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | |
20 | |
21 /* NOTES: | |
22 | |
23 Have to ensure that we can't put symbol nil on a plist, or some | |
24 functions may work incorrectly. | |
25 | |
26 An idea: Have the owner of the tree keep count of splits and/or | |
27 insertion lengths (in intervals), and balance after every N. | |
28 | |
29 Need to call *_left_hook when buffer is killed. | |
30 | |
31 Scan for zero-length, or 0-length to see notes about handling | |
32 zero length interval-markers. | |
33 | |
34 There are comments around about freeing intervals. It might be | |
35 faster to explicitly free them (put them on the free list) than | |
36 to GC them. | |
37 | |
38 */ | |
39 | |
40 | |
41 #include "config.h" | |
42 #include "lisp.h" | |
43 #include "intervals.h" | |
44 #include "buffer.h" | |
45 | |
1301
5a27062b8b7f
* intervals.c: Conditionalize all functions on
Joseph Arceneaux <jla@gnu.org>
parents:
1288
diff
changeset
|
46 /* The rest of the file is within this conditional. */ |
5a27062b8b7f
* intervals.c: Conditionalize all functions on
Joseph Arceneaux <jla@gnu.org>
parents:
1288
diff
changeset
|
47 #ifdef USE_TEXT_PROPERTIES |
5a27062b8b7f
* intervals.c: Conditionalize all functions on
Joseph Arceneaux <jla@gnu.org>
parents:
1288
diff
changeset
|
48 |
1157 | 49 /* Factor for weight-balancing interval trees. */ |
50 Lisp_Object interval_balance_threshold; | |
51 | |
52 /* Utility functions for intervals. */ | |
53 | |
54 | |
55 /* Create the root interval of some object, a buffer or string. */ | |
56 | |
57 INTERVAL | |
58 create_root_interval (parent) | |
59 Lisp_Object parent; | |
60 { | |
61 INTERVAL new = make_interval (); | |
62 | |
63 if (XTYPE (parent) == Lisp_Buffer) | |
64 { | |
65 new->total_length = BUF_Z (XBUFFER (parent)) - 1; | |
66 XBUFFER (parent)->intervals = new; | |
67 } | |
68 else if (XTYPE (parent) == Lisp_String) | |
69 { | |
70 new->total_length = XSTRING (parent)->size; | |
71 XSTRING (parent)->intervals = new; | |
72 } | |
73 | |
74 new->parent = (INTERVAL) parent; | |
75 new->position = 1; | |
76 | |
77 return new; | |
78 } | |
79 | |
80 /* Make the interval TARGET have exactly the properties of SOURCE */ | |
81 | |
82 void | |
83 copy_properties (source, target) | |
84 register INTERVAL source, target; | |
85 { | |
86 if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
87 return; | |
88 | |
89 COPY_INTERVAL_CACHE (source, target); | |
90 target->plist = Fcopy_sequence (source->plist); | |
91 } | |
92 | |
93 /* Merge the properties of interval SOURCE into the properties | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
94 of interval TARGET. That is to say, each property in SOURCE |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
95 is added to TARGET if TARGET has no such property as yet. */ |
1157 | 96 |
97 static void | |
98 merge_properties (source, target) | |
99 register INTERVAL source, target; | |
100 { | |
101 register Lisp_Object o, sym, val; | |
102 | |
103 if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
104 return; | |
105 | |
106 MERGE_INTERVAL_CACHE (source, target); | |
107 | |
108 o = source->plist; | |
109 while (! EQ (o, Qnil)) | |
110 { | |
111 sym = Fcar (o); | |
112 val = Fmemq (sym, target->plist); | |
113 | |
114 if (NILP (val)) | |
115 { | |
116 o = Fcdr (o); | |
117 val = Fcar (o); | |
118 target->plist = Fcons (sym, Fcons (val, target->plist)); | |
119 o = Fcdr (o); | |
120 } | |
121 else | |
122 o = Fcdr (Fcdr (o)); | |
123 } | |
124 } | |
125 | |
126 /* Return 1 if the two intervals have the same properties, | |
127 0 otherwise. */ | |
128 | |
129 int | |
130 intervals_equal (i0, i1) | |
131 INTERVAL i0, i1; | |
132 { | |
133 register Lisp_Object i0_cdr, i0_sym, i1_val; | |
134 register i1_len; | |
135 | |
136 if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1)) | |
137 return 1; | |
138 | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
139 if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
140 return 0; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
141 |
1157 | 142 i1_len = XFASTINT (Flength (i1->plist)); |
143 if (i1_len & 0x1) /* Paranoia -- plists are always even */ | |
144 abort (); | |
145 i1_len /= 2; | |
146 i0_cdr = i0->plist; | |
147 while (!NILP (i0_cdr)) | |
148 { | |
149 /* Lengths of the two plists were unequal */ | |
150 if (i1_len == 0) | |
151 return 0; | |
152 | |
153 i0_sym = Fcar (i0_cdr); | |
154 i1_val = Fmemq (i0_sym, i1->plist); | |
155 | |
156 /* i0 has something i1 doesn't */ | |
157 if (EQ (i1_val, Qnil)) | |
158 return 0; | |
159 | |
160 /* i0 and i1 both have sym, but it has different values in each */ | |
161 i0_cdr = Fcdr (i0_cdr); | |
3995
cdab67a10461
* intervals.c (intervals_equal): Test the return value of Fequal
Jim Blandy <jimb@redhat.com>
parents:
3847
diff
changeset
|
162 if (NILP (Fequal (i1_val, Fcar (i0_cdr)))) |
1157 | 163 return 0; |
164 | |
165 i0_cdr = Fcdr (i0_cdr); | |
166 i1_len--; | |
167 } | |
168 | |
169 /* Lengths of the two plists were unequal */ | |
170 if (i1_len > 0) | |
171 return 0; | |
172 | |
173 return 1; | |
174 } | |
175 | |
176 static int icount; | |
177 static int idepth; | |
178 static int zero_length; | |
179 | |
180 /* Traverse an interval tree TREE, performing FUNCTION on each node. | |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
181 Pass FUNCTION two args: an interval, and ARG. */ |
1157 | 182 |
183 void | |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
184 traverse_intervals (tree, position, depth, function, arg) |
1157 | 185 INTERVAL tree; |
1412
6097878fbd46
* intervals.c (traverse_intervals): New parameter `depth'.
Joseph Arceneaux <jla@gnu.org>
parents:
1316
diff
changeset
|
186 int position, depth; |
1157 | 187 void (* function) (); |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
188 Lisp_Object arg; |
1157 | 189 { |
190 if (NULL_INTERVAL_P (tree)) | |
191 return; | |
192 | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
193 traverse_intervals (tree->left, position, depth + 1, function, arg); |
1157 | 194 position += LEFT_TOTAL_LENGTH (tree); |
195 tree->position = position; | |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
196 (*function) (tree, arg); |
1157 | 197 position += LENGTH (tree); |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
198 traverse_intervals (tree->right, position, depth + 1, function, arg); |
1157 | 199 } |
200 | |
201 #if 0 | |
202 /* These functions are temporary, for debugging purposes only. */ | |
203 | |
204 INTERVAL search_interval, found_interval; | |
205 | |
206 void | |
207 check_for_interval (i) | |
208 register INTERVAL i; | |
209 { | |
210 if (i == search_interval) | |
211 { | |
212 found_interval = i; | |
213 icount++; | |
214 } | |
215 } | |
216 | |
217 INTERVAL | |
218 search_for_interval (i, tree) | |
219 register INTERVAL i, tree; | |
220 { | |
221 icount = 0; | |
222 search_interval = i; | |
223 found_interval = NULL_INTERVAL; | |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
224 traverse_intervals (tree, 1, 0, &check_for_interval, Qnil); |
1157 | 225 return found_interval; |
226 } | |
227 | |
228 static void | |
229 inc_interval_count (i) | |
230 INTERVAL i; | |
231 { | |
232 icount++; | |
233 if (LENGTH (i) == 0) | |
234 zero_length++; | |
235 if (depth > idepth) | |
236 idepth = depth; | |
237 } | |
238 | |
239 int | |
240 count_intervals (i) | |
241 register INTERVAL i; | |
242 { | |
243 icount = 0; | |
244 idepth = 0; | |
245 zero_length = 0; | |
1958
8bc716df45e3
(traverse_intervals): New arg ARG.
Richard M. Stallman <rms@gnu.org>
parents:
1412
diff
changeset
|
246 traverse_intervals (i, 1, 0, &inc_interval_count, Qnil); |
1157 | 247 |
248 return icount; | |
249 } | |
250 | |
251 static INTERVAL | |
252 root_interval (interval) | |
253 INTERVAL interval; | |
254 { | |
255 register INTERVAL i = interval; | |
256 | |
257 while (! ROOT_INTERVAL_P (i)) | |
258 i = i->parent; | |
259 | |
260 return i; | |
261 } | |
262 #endif | |
263 | |
264 /* Assuming that a left child exists, perform the following operation: | |
265 | |
266 A B | |
267 / \ / \ | |
268 B => A | |
269 / \ / \ | |
270 c c | |
271 */ | |
272 | |
273 static INTERVAL | |
274 rotate_right (interval) | |
275 INTERVAL interval; | |
276 { | |
277 INTERVAL i; | |
278 INTERVAL B = interval->left; | |
279 int len = LENGTH (interval); | |
280 | |
281 /* Deal with any Parent of A; make it point to B. */ | |
282 if (! ROOT_INTERVAL_P (interval)) | |
283 if (AM_LEFT_CHILD (interval)) | |
284 interval->parent->left = interval->left; | |
285 else | |
286 interval->parent->right = interval->left; | |
287 interval->left->parent = interval->parent; | |
288 | |
289 /* B gets the same length as A, since it get A's position in the tree. */ | |
290 interval->left->total_length = interval->total_length; | |
291 | |
292 /* B becomes the parent of A. */ | |
293 i = interval->left->right; | |
294 interval->left->right = interval; | |
295 interval->parent = interval->left; | |
296 | |
297 /* A gets c as left child. */ | |
298 interval->left = i; | |
299 if (! NULL_INTERVAL_P (i)) | |
300 i->parent = interval; | |
301 interval->total_length = (len + LEFT_TOTAL_LENGTH (interval) | |
302 + RIGHT_TOTAL_LENGTH (interval)); | |
303 | |
304 return B; | |
305 } | |
306 | |
307 /* Assuming that a right child exists, perform the following operation: | |
308 | |
309 A B | |
310 / \ / \ | |
311 B => A | |
312 / \ / \ | |
313 c c | |
314 */ | |
315 | |
316 static INTERVAL | |
317 rotate_left (interval) | |
318 INTERVAL interval; | |
319 { | |
320 INTERVAL i; | |
321 INTERVAL B = interval->right; | |
322 int len = LENGTH (interval); | |
323 | |
324 /* Deal with the parent of A. */ | |
325 if (! ROOT_INTERVAL_P (interval)) | |
326 if (AM_LEFT_CHILD (interval)) | |
327 interval->parent->left = interval->right; | |
328 else | |
329 interval->parent->right = interval->right; | |
330 interval->right->parent = interval->parent; | |
331 | |
332 /* B must have the same total length of A. */ | |
333 interval->right->total_length = interval->total_length; | |
334 | |
335 /* Make B the parent of A */ | |
336 i = interval->right->left; | |
337 interval->right->left = interval; | |
338 interval->parent = interval->right; | |
339 | |
340 /* Make A point to c */ | |
341 interval->right = i; | |
342 if (! NULL_INTERVAL_P (i)) | |
343 i->parent = interval; | |
344 interval->total_length = (len + LEFT_TOTAL_LENGTH (interval) | |
345 + RIGHT_TOTAL_LENGTH (interval)); | |
346 | |
347 return B; | |
348 } | |
349 | |
1164 | 350 /* Split INTERVAL into two pieces, starting the second piece at character |
351 position OFFSET (counting from 1), relative to INTERVAL. The right-hand | |
352 piece (second, lexicographically) is returned. | |
353 | |
354 The size and position fields of the two intervals are set based upon | |
355 those of the original interval. The property list of the new interval | |
356 is reset, thus it is up to the caller to do the right thing with the | |
357 result. | |
1157 | 358 |
359 Note that this does not change the position of INTERVAL; if it is a root, | |
360 it is still a root after this operation. */ | |
361 | |
362 INTERVAL | |
1164 | 363 split_interval_right (interval, offset) |
1157 | 364 INTERVAL interval; |
1164 | 365 int offset; |
1157 | 366 { |
367 INTERVAL new = make_interval (); | |
368 int position = interval->position; | |
1164 | 369 int new_length = LENGTH (interval) - offset + 1; |
1157 | 370 |
1164 | 371 new->position = position + offset - 1; |
1157 | 372 new->parent = interval; |
373 | |
374 if (LEAF_INTERVAL_P (interval) || NULL_RIGHT_CHILD (interval)) | |
375 { | |
376 interval->right = new; | |
377 new->total_length = new_length; | |
378 | |
379 return new; | |
380 } | |
381 | |
382 /* Insert the new node between INTERVAL and its right child. */ | |
383 new->right = interval->right; | |
384 interval->right->parent = new; | |
385 interval->right = new; | |
386 | |
387 new->total_length = new_length + new->right->total_length; | |
388 | |
389 return new; | |
390 } | |
391 | |
1164 | 392 /* Split INTERVAL into two pieces, starting the second piece at character |
393 position OFFSET (counting from 1), relative to INTERVAL. The left-hand | |
394 piece (first, lexicographically) is returned. | |
1157 | 395 |
1164 | 396 The size and position fields of the two intervals are set based upon |
397 those of the original interval. The property list of the new interval | |
398 is reset, thus it is up to the caller to do the right thing with the | |
399 result. | |
400 | |
401 Note that this does not change the position of INTERVAL; if it is a root, | |
402 it is still a root after this operation. */ | |
1157 | 403 |
404 INTERVAL | |
1164 | 405 split_interval_left (interval, offset) |
1157 | 406 INTERVAL interval; |
1164 | 407 int offset; |
1157 | 408 { |
409 INTERVAL new = make_interval (); | |
410 int position = interval->position; | |
1164 | 411 int new_length = offset - 1; |
1157 | 412 |
413 new->position = interval->position; | |
1164 | 414 interval->position = interval->position + offset - 1; |
1157 | 415 new->parent = interval; |
416 | |
417 if (NULL_LEFT_CHILD (interval)) | |
418 { | |
419 interval->left = new; | |
420 new->total_length = new_length; | |
421 | |
422 return new; | |
423 } | |
424 | |
425 /* Insert the new node between INTERVAL and its left child. */ | |
426 new->left = interval->left; | |
427 new->left->parent = new; | |
428 interval->left = new; | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
429 new->total_length = new_length + LEFT_TOTAL_LENGTH (new); |
1157 | 430 |
431 return new; | |
432 } | |
433 | |
1164 | 434 /* Find the interval containing text position POSITION in the text |
435 represented by the interval tree TREE. POSITION is relative to | |
436 the beginning of that text. | |
1157 | 437 |
1164 | 438 The `position' field, which is a cache of an interval's position, |
439 is updated in the interval found. Other functions (e.g., next_interval) | |
440 will update this cache based on the result of find_interval. */ | |
441 | |
442 INLINE INTERVAL | |
1157 | 443 find_interval (tree, position) |
444 register INTERVAL tree; | |
445 register int position; | |
446 { | |
447 register int relative_position = position; | |
448 | |
449 if (NULL_INTERVAL_P (tree)) | |
450 return NULL_INTERVAL; | |
451 | |
452 if (position > TOTAL_LENGTH (tree)) | |
453 abort (); /* Paranoia */ | |
454 #if 0 | |
455 position = TOTAL_LENGTH (tree); | |
456 #endif | |
457 | |
458 while (1) | |
459 { | |
460 if (relative_position <= LEFT_TOTAL_LENGTH (tree)) | |
461 { | |
462 tree = tree->left; | |
463 } | |
464 else if (relative_position > (TOTAL_LENGTH (tree) | |
465 - RIGHT_TOTAL_LENGTH (tree))) | |
466 { | |
467 relative_position -= (TOTAL_LENGTH (tree) | |
468 - RIGHT_TOTAL_LENGTH (tree)); | |
469 tree = tree->right; | |
470 } | |
471 else | |
472 { | |
473 tree->position = LEFT_TOTAL_LENGTH (tree) | |
474 + position - relative_position + 1; | |
475 return tree; | |
476 } | |
477 } | |
478 } | |
479 | |
480 /* Find the succeeding interval (lexicographically) to INTERVAL. | |
1164 | 481 Sets the `position' field based on that of INTERVAL (see |
482 find_interval). */ | |
1157 | 483 |
484 INTERVAL | |
485 next_interval (interval) | |
486 register INTERVAL interval; | |
487 { | |
488 register INTERVAL i = interval; | |
489 register int next_position; | |
490 | |
491 if (NULL_INTERVAL_P (i)) | |
492 return NULL_INTERVAL; | |
493 next_position = interval->position + LENGTH (interval); | |
494 | |
495 if (! NULL_RIGHT_CHILD (i)) | |
496 { | |
497 i = i->right; | |
498 while (! NULL_LEFT_CHILD (i)) | |
499 i = i->left; | |
500 | |
501 i->position = next_position; | |
502 return i; | |
503 } | |
504 | |
505 while (! NULL_PARENT (i)) | |
506 { | |
507 if (AM_LEFT_CHILD (i)) | |
508 { | |
509 i = i->parent; | |
510 i->position = next_position; | |
511 return i; | |
512 } | |
513 | |
514 i = i->parent; | |
515 } | |
516 | |
517 return NULL_INTERVAL; | |
518 } | |
519 | |
520 /* Find the preceding interval (lexicographically) to INTERVAL. | |
1164 | 521 Sets the `position' field based on that of INTERVAL (see |
522 find_interval). */ | |
1157 | 523 |
524 INTERVAL | |
525 previous_interval (interval) | |
526 register INTERVAL interval; | |
527 { | |
528 register INTERVAL i; | |
529 register position_of_previous; | |
530 | |
531 if (NULL_INTERVAL_P (interval)) | |
532 return NULL_INTERVAL; | |
533 | |
534 if (! NULL_LEFT_CHILD (interval)) | |
535 { | |
536 i = interval->left; | |
537 while (! NULL_RIGHT_CHILD (i)) | |
538 i = i->right; | |
539 | |
540 i->position = interval->position - LENGTH (i); | |
541 return i; | |
542 } | |
543 | |
544 i = interval; | |
545 while (! NULL_PARENT (i)) | |
546 { | |
547 if (AM_RIGHT_CHILD (i)) | |
548 { | |
549 i = i->parent; | |
550 | |
551 i->position = interval->position - LENGTH (i); | |
552 return i; | |
553 } | |
554 i = i->parent; | |
555 } | |
556 | |
557 return NULL_INTERVAL; | |
558 } | |
559 | |
1164 | 560 #if 0 |
1157 | 561 /* Traverse a path down the interval tree TREE to the interval |
562 containing POSITION, adjusting all nodes on the path for | |
563 an addition of LENGTH characters. Insertion between two intervals | |
564 (i.e., point == i->position, where i is second interval) means | |
565 text goes into second interval. | |
566 | |
567 Modifications are needed to handle the hungry bits -- after simply | |
568 finding the interval at position (don't add length going down), | |
569 if it's the beginning of the interval, get the previous interval | |
570 and check the hugry bits of both. Then add the length going back up | |
571 to the root. */ | |
572 | |
573 static INTERVAL | |
574 adjust_intervals_for_insertion (tree, position, length) | |
575 INTERVAL tree; | |
576 int position, length; | |
577 { | |
578 register int relative_position; | |
579 register INTERVAL this; | |
580 | |
581 if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ | |
582 abort (); | |
583 | |
584 /* If inserting at point-max of a buffer, that position | |
585 will be out of range */ | |
586 if (position > TOTAL_LENGTH (tree)) | |
587 position = TOTAL_LENGTH (tree); | |
588 relative_position = position; | |
589 this = tree; | |
590 | |
591 while (1) | |
592 { | |
593 if (relative_position <= LEFT_TOTAL_LENGTH (this)) | |
594 { | |
595 this->total_length += length; | |
596 this = this->left; | |
597 } | |
598 else if (relative_position > (TOTAL_LENGTH (this) | |
599 - RIGHT_TOTAL_LENGTH (this))) | |
600 { | |
601 relative_position -= (TOTAL_LENGTH (this) | |
602 - RIGHT_TOTAL_LENGTH (this)); | |
603 this->total_length += length; | |
604 this = this->right; | |
605 } | |
606 else | |
607 { | |
608 /* If we are to use zero-length intervals as buffer pointers, | |
609 then this code will have to change. */ | |
610 this->total_length += length; | |
611 this->position = LEFT_TOTAL_LENGTH (this) | |
612 + position - relative_position + 1; | |
613 return tree; | |
614 } | |
615 } | |
616 } | |
1164 | 617 #endif |
618 | |
619 /* Effect an adjustment corresponding to the addition of LENGTH characters | |
620 of text. Do this by finding the interval containing POSITION in the | |
621 interval tree TREE, and then adjusting all of it's ancestors by adding | |
622 LENGTH to them. | |
623 | |
624 If POSITION is the first character of an interval, meaning that point | |
625 is actually between the two intervals, make the new text belong to | |
626 the interval which is "sticky". | |
627 | |
1189 | 628 If both intervals are "sticky", then make them belong to the left-most |
1164 | 629 interval. Another possibility would be to create a new interval for |
630 this text, and make it have the merged properties of both ends. */ | |
631 | |
632 static INTERVAL | |
633 adjust_intervals_for_insertion (tree, position, length) | |
634 INTERVAL tree; | |
635 int position, length; | |
636 { | |
637 register INTERVAL i; | |
638 | |
639 if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ | |
640 abort (); | |
641 | |
642 /* If inserting at point-max of a buffer, that position | |
643 will be out of range. */ | |
644 if (position > TOTAL_LENGTH (tree)) | |
645 position = TOTAL_LENGTH (tree); | |
646 | |
647 i = find_interval (tree, position); | |
648 /* If we are positioned between intervals, check the stickiness of | |
649 both of them. */ | |
650 if (position == i->position | |
651 && position != 1) | |
652 { | |
1307 | 653 register INTERVAL prev = previous_interval (i); |
1164 | 654 |
655 /* If both intervals are sticky here, then default to the | |
656 left-most one. But perhaps we should create a new | |
657 interval here instead... */ | |
3736
dea4ce3d7a4d
(adjust_intervals_for_insertion): By default, copy
Richard M. Stallman <rms@gnu.org>
parents:
3734
diff
changeset
|
658 if (END_STICKY_P (prev) || ! FRONT_STICKY_P (i)) |
1164 | 659 i = prev; |
660 } | |
661 | |
662 while (! NULL_INTERVAL_P (i)) | |
663 { | |
664 i->total_length += length; | |
1307 | 665 i = i->parent; |
1164 | 666 } |
667 | |
668 return tree; | |
669 } | |
1157 | 670 |
1164 | 671 /* Delete an node I from its interval tree by merging its subtrees |
672 into one subtree which is then returned. Caller is responsible for | |
1157 | 673 storing the resulting subtree into its parent. */ |
674 | |
675 static INTERVAL | |
676 delete_node (i) | |
677 register INTERVAL i; | |
678 { | |
679 register INTERVAL migrate, this; | |
680 register int migrate_amt; | |
681 | |
682 if (NULL_INTERVAL_P (i->left)) | |
683 return i->right; | |
684 if (NULL_INTERVAL_P (i->right)) | |
685 return i->left; | |
686 | |
687 migrate = i->left; | |
688 migrate_amt = i->left->total_length; | |
689 this = i->right; | |
690 this->total_length += migrate_amt; | |
691 while (! NULL_INTERVAL_P (this->left)) | |
692 { | |
693 this = this->left; | |
694 this->total_length += migrate_amt; | |
695 } | |
696 this->left = migrate; | |
697 migrate->parent = this; | |
698 | |
699 return i->right; | |
700 } | |
701 | |
702 /* Delete interval I from its tree by calling `delete_node' | |
703 and properly connecting the resultant subtree. | |
704 | |
705 I is presumed to be empty; that is, no adjustments are made | |
706 for the length of I. */ | |
707 | |
708 void | |
709 delete_interval (i) | |
710 register INTERVAL i; | |
711 { | |
712 register INTERVAL parent; | |
713 int amt = LENGTH (i); | |
714 | |
715 if (amt > 0) /* Only used on zero-length intervals now. */ | |
716 abort (); | |
717 | |
718 if (ROOT_INTERVAL_P (i)) | |
719 { | |
720 Lisp_Object owner = (Lisp_Object) i->parent; | |
721 parent = delete_node (i); | |
722 if (! NULL_INTERVAL_P (parent)) | |
723 parent->parent = (INTERVAL) owner; | |
724 | |
725 if (XTYPE (owner) == Lisp_Buffer) | |
726 XBUFFER (owner)->intervals = parent; | |
727 else if (XTYPE (owner) == Lisp_String) | |
728 XSTRING (owner)->intervals = parent; | |
729 else | |
730 abort (); | |
731 | |
732 return; | |
733 } | |
734 | |
735 parent = i->parent; | |
736 if (AM_LEFT_CHILD (i)) | |
737 { | |
738 parent->left = delete_node (i); | |
739 if (! NULL_INTERVAL_P (parent->left)) | |
740 parent->left->parent = parent; | |
741 } | |
742 else | |
743 { | |
744 parent->right = delete_node (i); | |
745 if (! NULL_INTERVAL_P (parent->right)) | |
746 parent->right->parent = parent; | |
747 } | |
748 } | |
749 | |
1189 | 750 /* Find the interval in TREE corresponding to the character position FROM |
751 and delete as much as possible of AMOUNT from that interval, starting | |
752 after the relative position of FROM within it. Return the amount | |
753 actually deleted, and if the interval was zeroed-out, delete that | |
754 interval node from the tree. | |
1157 | 755 |
1189 | 756 Do this by recursing down TREE to the interval in question, and |
757 deleting the appropriate amount of text. */ | |
1157 | 758 |
759 static int | |
760 interval_deletion_adjustment (tree, from, amount) | |
761 register INTERVAL tree; | |
762 register int from, amount; | |
763 { | |
764 register int relative_position = from; | |
765 | |
766 if (NULL_INTERVAL_P (tree)) | |
767 return 0; | |
768 | |
769 /* Left branch */ | |
770 if (relative_position <= LEFT_TOTAL_LENGTH (tree)) | |
771 { | |
772 int subtract = interval_deletion_adjustment (tree->left, | |
773 relative_position, | |
774 amount); | |
775 tree->total_length -= subtract; | |
776 return subtract; | |
777 } | |
778 /* Right branch */ | |
779 else if (relative_position > (TOTAL_LENGTH (tree) | |
780 - RIGHT_TOTAL_LENGTH (tree))) | |
781 { | |
782 int subtract; | |
783 | |
784 relative_position -= (tree->total_length | |
785 - RIGHT_TOTAL_LENGTH (tree)); | |
786 subtract = interval_deletion_adjustment (tree->right, | |
787 relative_position, | |
788 amount); | |
789 tree->total_length -= subtract; | |
790 return subtract; | |
791 } | |
792 /* Here -- this node */ | |
793 else | |
794 { | |
795 /* If this is a zero-length, marker interval, then | |
796 we must skip it. */ | |
797 | |
798 if (relative_position == LEFT_TOTAL_LENGTH (tree) + 1) | |
799 { | |
800 /* This means we're deleting from the beginning of this interval. */ | |
801 register int my_amount = LENGTH (tree); | |
802 | |
803 if (amount < my_amount) | |
804 { | |
805 tree->total_length -= amount; | |
806 return amount; | |
807 } | |
808 else | |
809 { | |
810 tree->total_length -= my_amount; | |
811 if (LENGTH (tree) != 0) | |
812 abort (); /* Paranoia */ | |
813 | |
814 delete_interval (tree); | |
815 return my_amount; | |
816 } | |
817 } | |
818 else /* Deleting starting in the middle. */ | |
819 { | |
820 register int my_amount = ((tree->total_length | |
821 - RIGHT_TOTAL_LENGTH (tree)) | |
822 - relative_position + 1); | |
823 | |
824 if (amount <= my_amount) | |
825 { | |
826 tree->total_length -= amount; | |
827 return amount; | |
828 } | |
829 else | |
830 { | |
831 tree->total_length -= my_amount; | |
832 return my_amount; | |
833 } | |
834 } | |
835 } | |
836 | |
1189 | 837 /* Never reach here */ |
1157 | 838 } |
839 | |
3591
507f64624555
Apply typo patches from Paul Eggert.
Jim Blandy <jimb@redhat.com>
parents:
3490
diff
changeset
|
840 /* Effect the adjustments necessary to the interval tree of BUFFER |
1189 | 841 to correspond to the deletion of LENGTH characters from that buffer |
842 text. The deletion is effected at position START (relative to the | |
843 buffer). */ | |
844 | |
1157 | 845 static void |
846 adjust_intervals_for_deletion (buffer, start, length) | |
847 struct buffer *buffer; | |
848 int start, length; | |
849 { | |
850 register int left_to_delete = length; | |
851 register INTERVAL tree = buffer->intervals; | |
852 register int deleted; | |
853 | |
854 if (NULL_INTERVAL_P (tree)) | |
855 return; | |
856 | |
857 if (length == TOTAL_LENGTH (tree)) | |
858 { | |
859 buffer->intervals = NULL_INTERVAL; | |
860 return; | |
861 } | |
862 | |
863 if (ONLY_INTERVAL_P (tree)) | |
864 { | |
865 tree->total_length -= length; | |
866 return; | |
867 } | |
868 | |
869 if (start > TOTAL_LENGTH (tree)) | |
870 start = TOTAL_LENGTH (tree); | |
871 while (left_to_delete > 0) | |
872 { | |
873 left_to_delete -= interval_deletion_adjustment (tree, start, | |
874 left_to_delete); | |
875 tree = buffer->intervals; | |
876 if (left_to_delete == tree->total_length) | |
877 { | |
878 buffer->intervals = NULL_INTERVAL; | |
879 return; | |
880 } | |
881 } | |
882 } | |
883 | |
3591
507f64624555
Apply typo patches from Paul Eggert.
Jim Blandy <jimb@redhat.com>
parents:
3490
diff
changeset
|
884 /* Make the adjustments necessary to the interval tree of BUFFER to |
1189 | 885 represent an addition or deletion of LENGTH characters starting |
886 at position START. Addition or deletion is indicated by the sign | |
887 of LENGTH. */ | |
1157 | 888 |
889 INLINE void | |
890 offset_intervals (buffer, start, length) | |
891 struct buffer *buffer; | |
892 int start, length; | |
893 { | |
894 if (NULL_INTERVAL_P (buffer->intervals) || length == 0) | |
895 return; | |
896 | |
897 if (length > 0) | |
898 adjust_intervals_for_insertion (buffer->intervals, start, length); | |
899 else | |
900 adjust_intervals_for_deletion (buffer, start, -length); | |
901 } | |
1211 | 902 |
903 /* Merge interval I with its lexicographic successor. The resulting | |
904 interval is returned, and has the properties of the original | |
905 successor. The properties of I are lost. I is removed from the | |
906 interval tree. | |
1157 | 907 |
1211 | 908 IMPORTANT: |
909 The caller must verify that this is not the last (rightmost) | |
910 interval. */ | |
911 | |
912 INTERVAL | |
913 merge_interval_right (i) | |
914 register INTERVAL i; | |
915 { | |
916 register int absorb = LENGTH (i); | |
917 register INTERVAL successor; | |
918 | |
919 /* Zero out this interval. */ | |
920 i->total_length -= absorb; | |
921 | |
922 /* Find the succeeding interval. */ | |
923 if (! NULL_RIGHT_CHILD (i)) /* It's below us. Add absorb | |
924 as we descend. */ | |
925 { | |
926 successor = i->right; | |
927 while (! NULL_LEFT_CHILD (successor)) | |
928 { | |
929 successor->total_length += absorb; | |
930 successor = successor->left; | |
931 } | |
932 | |
933 successor->total_length += absorb; | |
934 delete_interval (i); | |
935 return successor; | |
936 } | |
937 | |
938 successor = i; | |
939 while (! NULL_PARENT (successor)) /* It's above us. Subtract as | |
940 we ascend. */ | |
941 { | |
942 if (AM_LEFT_CHILD (successor)) | |
943 { | |
944 successor = successor->parent; | |
945 delete_interval (i); | |
946 return successor; | |
947 } | |
948 | |
949 successor = successor->parent; | |
950 successor->total_length -= absorb; | |
951 } | |
952 | |
953 /* This must be the rightmost or last interval and cannot | |
954 be merged right. The caller should have known. */ | |
955 abort (); | |
956 } | |
957 | |
958 /* Merge interval I with its lexicographic predecessor. The resulting | |
959 interval is returned, and has the properties of the original predecessor. | |
960 The properties of I are lost. Interval node I is removed from the tree. | |
961 | |
962 IMPORTANT: | |
963 The caller must verify that this is not the first (leftmost) interval. */ | |
964 | |
965 INTERVAL | |
966 merge_interval_left (i) | |
967 register INTERVAL i; | |
968 { | |
969 register int absorb = LENGTH (i); | |
970 register INTERVAL predecessor; | |
971 | |
972 /* Zero out this interval. */ | |
973 i->total_length -= absorb; | |
974 | |
975 /* Find the preceding interval. */ | |
976 if (! NULL_LEFT_CHILD (i)) /* It's below us. Go down, | |
977 adding ABSORB as we go. */ | |
978 { | |
979 predecessor = i->left; | |
980 while (! NULL_RIGHT_CHILD (predecessor)) | |
981 { | |
982 predecessor->total_length += absorb; | |
983 predecessor = predecessor->right; | |
984 } | |
985 | |
986 predecessor->total_length += absorb; | |
987 delete_interval (i); | |
988 return predecessor; | |
989 } | |
990 | |
991 predecessor = i; | |
992 while (! NULL_PARENT (predecessor)) /* It's above us. Go up, | |
993 subtracting ABSORB. */ | |
994 { | |
995 if (AM_RIGHT_CHILD (predecessor)) | |
996 { | |
997 predecessor = predecessor->parent; | |
998 delete_interval (i); | |
999 return predecessor; | |
1000 } | |
1001 | |
1002 predecessor = predecessor->parent; | |
1003 predecessor->total_length -= absorb; | |
1004 } | |
1005 | |
1006 /* This must be the leftmost or first interval and cannot | |
1007 be merged left. The caller should have known. */ | |
1008 abort (); | |
1009 } | |
1010 | |
1189 | 1011 /* Make an exact copy of interval tree SOURCE which descends from |
1012 PARENT. This is done by recursing through SOURCE, copying | |
1013 the current interval and its properties, and then adjusting | |
1014 the pointers of the copy. */ | |
1015 | |
1157 | 1016 static INTERVAL |
1017 reproduce_tree (source, parent) | |
1018 INTERVAL source, parent; | |
1019 { | |
1020 register INTERVAL t = make_interval (); | |
1021 | |
1022 bcopy (source, t, INTERVAL_SIZE); | |
1023 copy_properties (source, t); | |
1024 t->parent = parent; | |
1025 if (! NULL_LEFT_CHILD (source)) | |
1026 t->left = reproduce_tree (source->left, t); | |
1027 if (! NULL_RIGHT_CHILD (source)) | |
1028 t->right = reproduce_tree (source->right, t); | |
1029 | |
1030 return t; | |
1031 } | |
1032 | |
1189 | 1033 /* Make a new interval of length LENGTH starting at START in the |
1034 group of intervals INTERVALS, which is actually an interval tree. | |
1035 Returns the new interval. | |
1036 | |
1037 Generate an error if the new positions would overlap an existing | |
1038 interval. */ | |
1039 | |
1157 | 1040 static INTERVAL |
1041 make_new_interval (intervals, start, length) | |
1042 INTERVAL intervals; | |
1043 int start, length; | |
1044 { | |
1045 INTERVAL slot; | |
1046 | |
1047 slot = find_interval (intervals, start); | |
1048 if (start + length > slot->position + LENGTH (slot)) | |
1049 error ("Interval would overlap"); | |
1050 | |
1051 if (start == slot->position && length == LENGTH (slot)) | |
1052 return slot; | |
1053 | |
1054 if (slot->position == start) | |
1055 { | |
1056 /* New right node. */ | |
1057 split_interval_right (slot, length + 1); | |
1058 return slot; | |
1059 } | |
1060 | |
1061 if (slot->position + LENGTH (slot) == start + length) | |
1062 { | |
1063 /* New left node. */ | |
1064 split_interval_left (slot, LENGTH (slot) - length + 1); | |
1065 return slot; | |
1066 } | |
1067 | |
1068 /* Convert interval SLOT into three intervals. */ | |
1069 split_interval_left (slot, start - slot->position + 1); | |
1070 split_interval_right (slot, length + 1); | |
1071 return slot; | |
1072 } | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1073 |
1211 | 1074 /* Insert the intervals of SOURCE into BUFFER at POSITION. |
1157 | 1075 |
1076 This is used in insdel.c when inserting Lisp_Strings into | |
1211 | 1077 the buffer. The text corresponding to SOURCE is already in |
1157 | 1078 the buffer when this is called. The intervals of new tree are |
1079 those belonging to the string being inserted; a copy is not made. | |
1080 | |
1081 If the inserted text had no intervals associated, this function | |
1082 simply returns -- offset_intervals should handle placing the | |
1164 | 1083 text in the correct interval, depending on the sticky bits. |
1157 | 1084 |
1085 If the inserted text had properties (intervals), then there are two | |
1086 cases -- either insertion happened in the middle of some interval, | |
1087 or between two intervals. | |
1088 | |
1089 If the text goes into the middle of an interval, then new | |
1090 intervals are created in the middle with only the properties of | |
1091 the new text, *unless* the macro MERGE_INSERTIONS is true, in | |
1092 which case the new text has the union of its properties and those | |
1093 of the text into which it was inserted. | |
1094 | |
1095 If the text goes between two intervals, then if neither interval | |
1164 | 1096 had its appropriate sticky property set (front_sticky, rear_sticky), |
1097 the new text has only its properties. If one of the sticky properties | |
1157 | 1098 is set, then the new text "sticks" to that region and its properties |
3591
507f64624555
Apply typo patches from Paul Eggert.
Jim Blandy <jimb@redhat.com>
parents:
3490
diff
changeset
|
1099 depend on merging as above. If both the preceding and succeeding |
1164 | 1100 intervals to the new text are "sticky", then the new text retains |
1101 only its properties, as if neither sticky property were set. Perhaps | |
1157 | 1102 we should consider merging all three sets of properties onto the new |
1103 text... */ | |
1104 | |
1105 void | |
1211 | 1106 graft_intervals_into_buffer (source, position, buffer) |
1107 INTERVAL source; | |
1157 | 1108 int position; |
1211 | 1109 struct buffer *buffer; |
1157 | 1110 { |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1111 register INTERVAL under, over, this, prev; |
1211 | 1112 register INTERVAL tree = buffer->intervals; |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1113 int middle; |
1157 | 1114 |
1115 /* If the new text has no properties, it becomes part of whatever | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1116 interval it was inserted into. */ |
1211 | 1117 if (NULL_INTERVAL_P (source)) |
1157 | 1118 return; |
1119 | |
1120 if (NULL_INTERVAL_P (tree)) | |
1121 { | |
1122 /* The inserted text constitutes the whole buffer, so | |
1123 simply copy over the interval structure. */ | |
1307 | 1124 if (BUF_Z (buffer) == TOTAL_LENGTH (source)) |
1157 | 1125 { |
1211 | 1126 buffer->intervals = reproduce_tree (source, tree->parent); |
1157 | 1127 /* Explicitly free the old tree here. */ |
1128 | |
1129 return; | |
1130 } | |
1131 | |
1132 /* Create an interval tree in which to place a copy | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1133 of the intervals of the inserted string. */ |
1157 | 1134 { |
1307 | 1135 Lisp_Object buf; |
1136 XSET (buf, Lisp_Buffer, buffer); | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1137 tree = create_root_interval (buf); |
1157 | 1138 } |
1139 } | |
1140 else | |
1211 | 1141 if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source)) |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1142 /* If the buffer contains only the new string, but |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1143 there was already some interval tree there, then it may be |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1144 some zero length intervals. Eventually, do something clever |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1145 about inserting properly. For now, just waste the old intervals. */ |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1146 { |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1147 buffer->intervals = reproduce_tree (source, tree->parent); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1148 /* Explicitly free the old tree here. */ |
1157 | 1149 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1150 return; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1151 } |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1152 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1153 /* Paranoia -- the text has already been added, so this buffer |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1154 should be of non-zero length. */ |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1155 if (TOTAL_LENGTH (tree) == 0) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1156 abort (); |
1157 | 1157 |
1158 this = under = find_interval (tree, position); | |
1159 if (NULL_INTERVAL_P (under)) /* Paranoia */ | |
1160 abort (); | |
1211 | 1161 over = find_interval (source, 1); |
1157 | 1162 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1163 /* Here for insertion in the middle of an interval. |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1164 Split off an equivalent interval to the right, |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1165 then don't bother with it any more. */ |
1157 | 1166 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1167 if (position > under->position) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1168 { |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1169 INTERVAL end_unchanged |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1170 = split_interval_left (this, position - under->position + 1); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1171 copy_properties (under, end_unchanged); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1172 under->position = position; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1173 prev = 0; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1174 middle = 1; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1175 } |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1176 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1177 { |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1178 prev = previous_interval (under); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1179 if (prev && !END_STICKY_P (prev)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1180 prev = 0; |
1157 | 1181 } |
1182 | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1183 /* Insertion is now at beginning of UNDER. */ |
1157 | 1184 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1185 /* The inserted text "sticks" to the interval `under', |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1186 which means it gets those properties. */ |
1157 | 1187 while (! NULL_INTERVAL_P (over)) |
1188 { | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1189 position = LENGTH (over) + 1; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1190 if (position < LENGTH (under)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1191 this = split_interval_left (under, position); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1192 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1193 this = under; |
1157 | 1194 copy_properties (over, this); |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1195 /* Insertion at the end of an interval, PREV, |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1196 inherits from PREV if PREV is sticky at the end. */ |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1197 if (prev && ! FRONT_STICKY_P (under) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1198 && MERGE_INSERTIONS (prev)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1199 merge_properties (prev, this); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1200 /* Maybe it inherits from the following interval |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1201 if that is sticky at the front. */ |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1202 else if ((FRONT_STICKY_P (under) || middle) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1203 && MERGE_INSERTIONS (under)) |
1157 | 1204 merge_properties (under, this); |
1205 over = next_interval (over); | |
1206 } | |
1207 | |
1211 | 1208 buffer->intervals = balance_intervals (buffer->intervals); |
1157 | 1209 return; |
1210 } | |
1211 | |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1212 /* 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>
parents:
2052
diff
changeset
|
1213 which is the plist of an interval. |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1214 We check for direct properties and for categories with property PROP. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1215 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1216 Lisp_Object |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1217 textget (plist, prop) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1218 Lisp_Object plist; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1219 register Lisp_Object prop; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1220 { |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1221 register Lisp_Object tail, fallback; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1222 fallback = Qnil; |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1223 |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1224 for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail))) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1225 { |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1226 register Lisp_Object tem; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1227 tem = Fcar (tail); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1228 if (EQ (prop, tem)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1229 return Fcar (Fcdr (tail)); |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1230 if (EQ (tem, Qcategory)) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1231 fallback = Fget (Fcar (Fcdr (tail)), prop); |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1232 } |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1233 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1234 return fallback; |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1235 } |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1236 |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1237 /* Set point in BUFFER to POSITION. If the target position is |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1238 before an invisible character which is not displayed with a special glyph, |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1239 move back to an ok place to display. */ |
1157 | 1240 |
1241 void | |
1242 set_point (position, buffer) | |
1243 register int position; | |
1244 register struct buffer *buffer; | |
1245 { | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1246 register INTERVAL to, from, toprev, fromprev, target; |
1157 | 1247 register int iposition = position; |
1248 int buffer_point; | |
1249 register Lisp_Object obj; | |
1250 int backwards = (position < BUF_PT (buffer)) ? 1 : 0; | |
1211 | 1251 int old_position = buffer->text.pt; |
1157 | 1252 |
1253 if (position == buffer->text.pt) | |
1254 return; | |
1255 | |
2779
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1256 /* Check this now, before checking if the buffer has any intervals. |
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1257 That way, we can catch conditions which break this sanity check |
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1258 whether or not there are intervals in the buffer. */ |
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1259 if (position > BUF_Z (buffer) || position < BUF_BEG (buffer)) |
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1260 abort (); |
857bb0f59668
* intervals.c (set_point): Check for point out of bounds before
Jim Blandy <jimb@redhat.com>
parents:
2090
diff
changeset
|
1261 |
1157 | 1262 if (NULL_INTERVAL_P (buffer->intervals)) |
1263 { | |
1264 buffer->text.pt = position; | |
1265 return; | |
1266 } | |
1267 | |
1268 /* Position Z is really one past the last char in the buffer. */ | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1269 if (position == BUF_ZV (buffer)) |
1157 | 1270 iposition = position - 1; |
1271 | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1272 /* Set TO to the interval containing the char after POSITION, |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1273 and TOPREV to the interval containing the char before POSITION. |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1274 Either one may be null. They may be equal. */ |
1157 | 1275 to = find_interval (buffer->intervals, iposition); |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1276 if (position == BUF_BEGV (buffer)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1277 toprev = 0; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1278 else if (to->position == position) |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1279 toprev = previous_interval (to); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1280 else if (iposition != position) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1281 toprev = to, to = 0; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1282 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1283 toprev = to; |
1211 | 1284 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1285 buffer_point = (BUF_PT (buffer) == BUF_ZV (buffer) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1286 ? BUF_ZV (buffer) - 1 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1287 : BUF_PT (buffer)); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1288 |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1289 /* Set FROM to the interval containing the char after PT, |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1290 and FROMPREV to the interval containing the char before PT. |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1291 Either one may be null. They may be equal. */ |
1211 | 1292 /* We could cache this and save time. */ |
1157 | 1293 from = find_interval (buffer->intervals, buffer_point); |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1294 if (from->position == BUF_BEGV (buffer)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1295 fromprev = 0; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1296 else if (from->position == BUF_PT (buffer)) |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1297 fromprev = previous_interval (from); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1298 else if (buffer_point != BUF_PT (buffer)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1299 fromprev = from, from = 0; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1300 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1301 fromprev = from; |
1157 | 1302 |
1303 /* Moving within an interval */ | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1304 if (to == from && toprev == fromprev && INTERVAL_VISIBLE_P (to)) |
1157 | 1305 { |
1306 buffer->text.pt = position; | |
1307 return; | |
1308 } | |
1309 | |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1310 /* If the new position is before an invisible character, |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1311 move forward over all such. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1312 while (! NULL_INTERVAL_P (to) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1313 && ! INTERVAL_VISIBLE_P (to) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1314 && ! DISPLAY_INVISIBLE_GLYPH (to)) |
1157 | 1315 { |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1316 toprev = to; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1317 to = next_interval (to); |
3734
5ada670e1fd8
(set_point): When moving over invis chars,
Richard M. Stallman <rms@gnu.org>
parents:
3591
diff
changeset
|
1318 if (NULL_INTERVAL_P (to)) |
5ada670e1fd8
(set_point): When moving over invis chars,
Richard M. Stallman <rms@gnu.org>
parents:
3591
diff
changeset
|
1319 position = BUF_ZV (buffer); |
5ada670e1fd8
(set_point): When moving over invis chars,
Richard M. Stallman <rms@gnu.org>
parents:
3591
diff
changeset
|
1320 else |
5ada670e1fd8
(set_point): When moving over invis chars,
Richard M. Stallman <rms@gnu.org>
parents:
3591
diff
changeset
|
1321 position = to->position; |
1157 | 1322 } |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1323 |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1324 buffer->text.pt = position; |
1157 | 1325 |
1288 | 1326 /* We run point-left and point-entered hooks here, iff the |
1327 two intervals are not equivalent. These hooks take | |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1328 (old_point, new_point) as arguments. */ |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1329 if (! intervals_equal (from, to) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1330 || ! intervals_equal (fromprev, toprev)) |
1211 | 1331 { |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1332 Lisp_Object leave_after, leave_before, enter_after, enter_before; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1333 |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1334 if (fromprev) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1335 leave_after = textget (fromprev->plist, Qpoint_left); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1336 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1337 leave_after = Qnil; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1338 if (from) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1339 leave_before = textget (from->plist, Qpoint_left); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1340 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1341 leave_before = Qnil; |
1211 | 1342 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1343 if (toprev) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1344 enter_after = textget (toprev->plist, Qpoint_entered); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1345 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1346 enter_after = Qnil; |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1347 if (to) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1348 enter_before = textget (to->plist, Qpoint_entered); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1349 else |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1350 enter_before = Qnil; |
1211 | 1351 |
1964
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1352 if (! EQ (leave_before, enter_before) && !NILP (leave_before)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1353 call2 (leave_before, old_position, position); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1354 if (! EQ (leave_after, enter_after) && !NILP (leave_after)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1355 call2 (leave_after, old_position, position); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1356 |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1357 if (! EQ (enter_before, leave_before) && !NILP (enter_before)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1358 call2 (enter_before, old_position, position); |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1359 if (! EQ (enter_after, leave_after) && !NILP (enter_after)) |
e6c49ff3a53c
(intervals_equal): Handle one arg null and other not.
Richard M. Stallman <rms@gnu.org>
parents:
1958
diff
changeset
|
1360 call2 (enter_after, old_position, position); |
1211 | 1361 } |
1157 | 1362 } |
1363 | |
1211 | 1364 /* Set point temporarily, without checking any text properties. */ |
1157 | 1365 |
1211 | 1366 INLINE void |
1367 temp_set_point (position, buffer) | |
1368 int position; | |
1369 struct buffer *buffer; | |
1370 { | |
1371 buffer->text.pt = position; | |
1372 } | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1373 |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1374 /* Return the proper local map for position POSITION in BUFFER. |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1375 Use the map specified by the local-map property, if any. |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1376 Otherwise, use BUFFER's local map. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1377 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1378 Lisp_Object |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1379 get_local_map (position, buffer) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1380 register int position; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1381 register struct buffer *buffer; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1382 { |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1383 register INTERVAL interval; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1384 Lisp_Object prop, tem; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1385 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1386 if (NULL_INTERVAL_P (buffer->intervals)) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1387 return current_buffer->keymap; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1388 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1389 /* Perhaps we should just change `position' to the limit. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1390 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>
parents:
2052
diff
changeset
|
1391 abort (); |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1392 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1393 /* Position Z is really one past the last char in the buffer. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1394 if (position == BUF_ZV (buffer)) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1395 return current_buffer->keymap; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1396 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1397 interval = find_interval (buffer->intervals, position); |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1398 prop = textget (interval->plist, Qlocal_map); |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1399 if (NILP (prop)) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1400 return current_buffer->keymap; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1401 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1402 /* Use the local map only if it is valid. */ |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1403 tem = Fkeymapp (prop); |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1404 if (!NILP (tem)) |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1405 return prop; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1406 |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1407 return current_buffer->keymap; |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1408 } |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1409 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1410 /* Call the modification hook functions in LIST, each with START and END. */ |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1411 |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1412 static void |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1413 call_mod_hooks (list, start, end) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1414 Lisp_Object list, start, end; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1415 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1416 struct gcpro gcpro1; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1417 GCPRO1 (list); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1418 while (!NILP (list)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1419 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1420 call2 (Fcar (list), start, end); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1421 list = Fcdr (list); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1422 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1423 UNGCPRO; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1424 } |
1211 | 1425 |
1426 /* Check for read-only intervals and signal an error if we find one. | |
1427 Then check for any modification hooks in the range START up to | |
1428 (but not including) TO. Create a list of all these hooks in | |
1429 lexicographic order, eliminating consecutive extra copies of the | |
1430 same hook. Then call those hooks in order, with START and END - 1 | |
1431 as arguments. */ | |
1157 | 1432 |
1433 void | |
1434 verify_interval_modification (buf, start, end) | |
1435 struct buffer *buf; | |
1436 int start, end; | |
1437 { | |
1438 register INTERVAL intervals = buf->intervals; | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1439 register INTERVAL i, prev; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1440 Lisp_Object hooks; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1441 register Lisp_Object prev_mod_hooks; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1442 Lisp_Object mod_hooks; |
1211 | 1443 struct gcpro gcpro1; |
1157 | 1444 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1445 hooks = Qnil; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1446 prev_mod_hooks = Qnil; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1447 mod_hooks = Qnil; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1448 |
1157 | 1449 if (NULL_INTERVAL_P (intervals)) |
1450 return; | |
1451 | |
1452 if (start > end) | |
1453 { | |
1454 int temp = start; | |
1455 start = end; | |
1456 end = temp; | |
1457 } | |
1458 | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1459 /* For an insert operation, check the two chars around the position. */ |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1460 if (start == end) |
1157 | 1461 { |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1462 INTERVAL prev; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1463 Lisp_Object before, after; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1464 |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1465 /* Set I to the interval containing the char after START, |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1466 and PREV to the interval containing the char before START. |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1467 Either one may be null. They may be equal. */ |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1468 i = find_interval (intervals, |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1469 (start == BUF_ZV (buf) ? start - 1 : start)); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1470 |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1471 if (start == BUF_BEGV (buf)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1472 prev = 0; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1473 if (i->position == start) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1474 prev = previous_interval (i); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1475 else if (i->position < start) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1476 prev = i; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1477 if (start == BUF_ZV (buf)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1478 i = 0; |
1157 | 1479 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1480 if (NULL_INTERVAL_P (prev)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1481 { |
3847
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1482 if (! INTERVAL_WRITABLE_P (i)) |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1483 error ("Attempt to insert within read-only text"); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1484 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1485 else if (NULL_INTERVAL_P (i)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1486 { |
3847
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1487 if (! INTERVAL_WRITABLE_P (prev)) |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1488 error ("Attempt to insert within read-only text"); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1489 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1490 else |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1491 { |
2090
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1492 before = textget (prev->plist, Qread_only); |
c7e1308a7184
(set_point): Check invisibility of following character, not previous character.
Richard M. Stallman <rms@gnu.org>
parents:
2052
diff
changeset
|
1493 after = textget (i->plist, Qread_only); |
3847
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1494 if (! NILP (before) && EQ (before, after) |
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1495 /* This checks Vinhibit_read_only properly |
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1496 for the common value of the read-only property. */ |
a58e981e2582
(verify_interval_modification): Don't just test
Richard M. Stallman <rms@gnu.org>
parents:
3736
diff
changeset
|
1497 && ! INTERVAL_WRITABLE_P (i)) |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1498 error ("Attempt to insert within read-only text"); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1499 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1500 |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1501 /* Run both mod hooks (just once if they're the same). */ |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1502 if (!NULL_INTERVAL_P (prev)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1503 prev_mod_hooks = textget (prev->plist, Qmodification_hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1504 if (!NULL_INTERVAL_P (i)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1505 mod_hooks = textget (i->plist, Qmodification_hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1506 GCPRO1 (mod_hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1507 if (! NILP (prev_mod_hooks)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1508 call_mod_hooks (prev_mod_hooks, make_number (start), |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1509 make_number (end)); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1510 UNGCPRO; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1511 if (! NILP (mod_hooks) && ! EQ (mod_hooks, prev_mod_hooks)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1512 call_mod_hooks (mod_hooks, make_number (start), make_number (end)); |
1157 | 1513 } |
1514 else | |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1515 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1516 /* Loop over intervals on or next to START...END, |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1517 collecting their hooks. */ |
1157 | 1518 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1519 i = find_interval (intervals, start); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1520 do |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1521 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1522 if (! INTERVAL_WRITABLE_P (i)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1523 error ("Attempt to modify read-only text"); |
1211 | 1524 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1525 mod_hooks = textget (i->plist, Qmodification_hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1526 if (! NILP (mod_hooks) && ! EQ (mod_hooks, prev_mod_hooks)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1527 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1528 hooks = Fcons (mod_hooks, hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1529 prev_mod_hooks = mod_hooks; |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1530 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1531 |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1532 i = next_interval (i); |
1211 | 1533 } |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1534 /* Keep going thru the interval containing the char before END. */ |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1535 while (! NULL_INTERVAL_P (i) && i->position < end); |
1157 | 1536 |
2052
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1537 GCPRO1 (hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1538 hooks = Fnreverse (hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1539 while (! EQ (hooks, Qnil)) |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1540 { |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1541 call_mod_hooks (Fcar (hooks), make_number (start), |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1542 make_number (end)); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1543 hooks = Fcdr (hooks); |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1544 } |
48c83a34c005
(verify_interval_modification): Handle insertions
Richard M. Stallman <rms@gnu.org>
parents:
1964
diff
changeset
|
1545 UNGCPRO; |
1211 | 1546 } |
1157 | 1547 } |
1548 | |
1549 /* Balance an interval node if the amount of text in its left and right | |
1550 subtrees differs by more than the percentage specified by | |
1551 `interval-balance-threshold'. */ | |
1552 | |
1553 static INTERVAL | |
1554 balance_an_interval (i) | |
1555 INTERVAL i; | |
1556 { | |
1557 register int total_children_size = (LEFT_TOTAL_LENGTH (i) | |
1558 + RIGHT_TOTAL_LENGTH (i)); | |
1559 register int threshold = (XFASTINT (interval_balance_threshold) | |
1560 * (total_children_size / 100)); | |
1561 | |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1562 /* Balance within each side. */ |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1563 balance_intervals (i->left); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1564 balance_intervals (i->right); |
1157 | 1565 |
1566 if (LEFT_TOTAL_LENGTH (i) > RIGHT_TOTAL_LENGTH (i) | |
1567 && (LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i)) > threshold) | |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1568 { |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1569 i = rotate_right (i); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1570 /* If that made it unbalanced the other way, take it back. */ |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1571 if (RIGHT_TOTAL_LENGTH (i) > LEFT_TOTAL_LENGTH (i) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1572 && (RIGHT_TOTAL_LENGTH (i) - LEFT_TOTAL_LENGTH (i)) > threshold) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1573 return rotate_left (i); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1574 return i; |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1575 } |
1157 | 1576 |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1577 if (RIGHT_TOTAL_LENGTH (i) > LEFT_TOTAL_LENGTH (i) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1578 && (RIGHT_TOTAL_LENGTH (i) - LEFT_TOTAL_LENGTH (i)) > threshold) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1579 { |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1580 i = rotate_left (i); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1581 if (LEFT_TOTAL_LENGTH (i) > RIGHT_TOTAL_LENGTH (i) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1582 && (LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i)) > threshold) |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1583 return rotate_right (i); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1584 return i; |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1585 } |
1157 | 1586 |
1587 return i; | |
1588 } | |
1589 | |
1590 /* Balance the interval tree TREE. Balancing is by weight | |
1591 (the amount of text). */ | |
1592 | |
1593 INTERVAL | |
1594 balance_intervals (tree) | |
1595 register INTERVAL tree; | |
1596 { | |
1597 register INTERVAL new_tree; | |
1598 | |
1599 if (NULL_INTERVAL_P (tree)) | |
1600 return NULL_INTERVAL; | |
1601 | |
1602 new_tree = tree; | |
1603 do | |
1604 { | |
1605 tree = new_tree; | |
1606 new_tree = balance_an_interval (new_tree); | |
1607 } | |
1608 while (new_tree != tree); | |
1609 | |
1610 return new_tree; | |
1611 } | |
1612 | |
1211 | 1613 /* Produce an interval tree reflecting the intervals in |
1157 | 1614 TREE from START to START + LENGTH. */ |
1615 | |
1316
f09c5c6563b8
* intervals.c: `copy_intervals()' no longer static.
Joseph Arceneaux <jla@gnu.org>
parents:
1307
diff
changeset
|
1616 INTERVAL |
1157 | 1617 copy_intervals (tree, start, length) |
1618 INTERVAL tree; | |
1619 int start, length; | |
1620 { | |
1621 register INTERVAL i, new, t; | |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1622 register int got, prevlen; |
1157 | 1623 |
1624 if (NULL_INTERVAL_P (tree) || length <= 0) | |
1625 return NULL_INTERVAL; | |
1626 | |
1627 i = find_interval (tree, start); | |
1628 if (NULL_INTERVAL_P (i) || LENGTH (i) == 0) | |
1629 abort (); | |
1630 | |
1631 /* If there is only one interval and it's the default, return nil. */ | |
1632 if ((start - i->position + 1 + length) < LENGTH (i) | |
1633 && DEFAULT_INTERVAL_P (i)) | |
1634 return NULL_INTERVAL; | |
1635 | |
1636 new = make_interval (); | |
1637 new->position = 1; | |
1638 got = (LENGTH (i) - (start - i->position)); | |
1211 | 1639 new->total_length = length; |
1157 | 1640 copy_properties (i, new); |
1641 | |
1642 t = new; | |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1643 prevlen = got; |
1157 | 1644 while (got < length) |
1645 { | |
1646 i = next_interval (i); | |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1647 t = split_interval_right (t, prevlen + 1); |
1157 | 1648 copy_properties (i, t); |
3490
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1649 prevlen = LENGTH (i); |
07b454ddc666
(copy_intervals): Don't adjust total_length at the end.
Richard M. Stallman <rms@gnu.org>
parents:
3333
diff
changeset
|
1650 got += prevlen; |
1157 | 1651 } |
1652 | |
1653 return balance_intervals (new); | |
1654 } | |
1655 | |
1656 /* Give STRING the properties of BUFFER from POSITION to LENGTH. */ | |
1657 | |
1288 | 1658 INLINE void |
1157 | 1659 copy_intervals_to_string (string, buffer, position, length) |
1660 Lisp_Object string, buffer; | |
1661 int position, length; | |
1662 { | |
1663 INTERVAL interval_copy = copy_intervals (XBUFFER (buffer)->intervals, | |
1664 position, length); | |
1665 if (NULL_INTERVAL_P (interval_copy)) | |
1666 return; | |
1667 | |
1668 interval_copy->parent = (INTERVAL) string; | |
1669 XSTRING (string)->intervals = interval_copy; | |
1670 } | |
1301
5a27062b8b7f
* intervals.c: Conditionalize all functions on
Joseph Arceneaux <jla@gnu.org>
parents:
1288
diff
changeset
|
1671 |
5a27062b8b7f
* intervals.c: Conditionalize all functions on
Joseph Arceneaux <jla@gnu.org>
parents:
1288
diff
changeset
|
1672 #endif /* USE_TEXT_PROPERTIES */ |