emacs-pretest-bug
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: replace-match's problem


From: SAITO Takuya
Subject: Re: replace-match's problem
Date: Wed, 24 Sep 2003 23:57:57 +0900 (JST)

From: Richard Stallman <address@hidden>
Date: Tue, 23 Sep 2003 19:13:32 -0400

> This patch should fix those remaining two bugs.
> Does it work right for you?

Yes. All the bugs that I found are fixed. Thank you.

> *** intervals.c.~1.125.~      Sun Sep 21 15:48:02 2003
> --- intervals.c       Tue Sep 23 13:34:34 2003
> ***************
> *** 1746,1751 ****
> --- 1746,1752 ----
>         XSETBUFFER (buf, buffer);
>         BUF_INTERVALS (buffer) = reproduce_tree_obj (source, buf);
>         BUF_INTERVALS (buffer)->position = BEG;
> +       BUF_INTERVALS (buffer)->up_obj = 1;
>   
>         /* Explicitly free the old tree here?  */
>   
> ***************
> *** 1768,1773 ****
> --- 1769,1775 ----
>       {
>         BUF_INTERVALS (buffer) = reproduce_tree (source, INTERVAL_PARENT 
> (tree));
>         BUF_INTERVALS (buffer)->position = BEG;
> +       BUF_INTERVALS (buffer)->up_obj = 1;
>         /* Explicitly free the old tree here.  */
>   
>         return;
> ***************
> *** 1823,1831 ****
>     while (! NULL_INTERVAL_P (over))
>       {
>         /* If UNDER is longer than OVER, split it.  */
> !       if (LENGTH (over) < LENGTH (under))
>       {
> !       this = split_interval_left (under, LENGTH (over));
>         copy_properties (under, this);
>       }
>         else
> --- 1825,1833 ----
>     while (! NULL_INTERVAL_P (over))
>       {
>         /* If UNDER is longer than OVER, split it.  */
> !       if (LENGTH (over) - over_used < LENGTH (under))
>       {
> !       this = split_interval_left (under, LENGTH (over) - over_used);
>         copy_properties (under, this);
>       }
>         else




reply via email to

[Prev in Thread] Current Thread [Next in Thread]