On Fri, Nov 16, 2012 at 1:02 PM, Danny Yoo wrote:
>
>> I wanted to surprise you by getting this all working by mid-week, but it's
>> taking longer than I thought... :) So I might as well run it by you to make
>> sure the idea is sound before I go further on this track.
>
>
> The core rb implement
> I wanted to surprise you by getting this all working by mid-week, but it's
> taking longer than I thought... :) So I might as well run it by you to
> make sure the idea is sound before I go further on this track.
>
The core rb implementation is almost done. The search-by-position,
insert-befor
On Tue, Nov 13, 2012 at 6:15 PM, Robby Findler
wrote:
> That sounds fantastic! Thanks!
>
> In your stress test, try doing random insertions/deletions to try to
> find things that break the red/black invariant.
>
Of course!
https://github.com/dyoo/new-token-tree/commit/7264f76cf3f05ebb3c8e8630ef
You know I'm reminded that I did some (simpler) experiments on those
trees too and found that hundreds of thousands of cons cells (I think,
assuming I didn't count wrong) were being implemented when you put the
insertion point just before the first double quote character in
unit.rkt and then type a
That sounds fantastic! Thanks!
In your stress test, try doing random insertions/deletions to try to
find things that break the red/black invariant.
Robby
On Tue, Nov 13, 2012 at 5:21 PM, Danny Yoo wrote:
> Hi Robby,
>
> I've been looking at a profile of DrRacket when opening/indenting large
> f
Hi Robby,
I've been looking at a profile of DrRacket when opening/indenting large
files. Using the statistical profiler, I've measured a large chunk of time
(around 40%) is dedicated to the search operation of the existing
syntax-color token-tree. That seems too high, so I've been trying to
unde
6 matches
Mail list logo
