[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Thinking about changed buffers
From: |
Clément Pit--Claudel |
Subject: |
Re: Thinking about changed buffers |
Date: |
Mon, 28 Mar 2016 22:16:29 +0200 |
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101 Thunderbird/38.6.0 |
On 03/28/2016 09:32 PM, Dmitry Gutov wrote:
> On 03/28/2016 10:27 PM, Lars Magne Ingebrigtsen wrote:
>
>>> Still seems problematic if your 5 year old takes 2.7s to compute it on
>>> a 1GB file. You don't want to freeze for 2s in the normal course of
>>> editing just because you happen to cross the "original size" threshold.
>>
>> Yeah, I don't see any way around that.
>
> Don't use hashing. Use e.g. buffer-undo-list. We save enough data to return
> the buffer contents to the previous state, right? It should be possible to
> detect whether a given sequence of undo-s is a no-op.
Alternatively, introduce a threshold above which that hash-based check does not
happen, and instead fall back to the old, less complex behaviour in that case.
signature.asc
Description: OpenPGP digital signature
- Re: Thinking about changed buffers, (continued)
Re: Thinking about changed buffers, Lars Magne Ingebrigtsen, 2016/03/28
Re: Thinking about changed buffers, Stefan Monnier, 2016/03/28
Re: Thinking about changed buffers, Florian Weimer, 2016/03/29
Re: Thinking about changed buffers, Phillip Lord, 2016/03/29