On 02/18/2017 04:51 AM, Jun Wu wrote:
Excerpts from Stanislau Hlebik's message of 2017-02-17 16:06:33 +:
This is implementation of two caches (nonpublic + precursor) using
serialized sorted lists and sets
https://bitbucket.org/stashlebik/hg/commits/99879579ac2848a2567810b677d8344150a7b319?
On 02/14/2017 02:04 AM, Sean Farley wrote:
Jun Wu writes:
In general, I think this is a good direction. Some random thoughts:
- general purposed
I think the bitmap is not always a cache, so it should only have
operations like set/unset/readfromdisk/writetodisk. Practically, I won
Excerpts from Sean Farley's message of 2017-02-21 15:45:44 -0800:
> Augie Fackler writes:
>
> > On Fri, Feb 17, 2017 at 07:14:12PM -0800, Jun Wu wrote:
> >> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> >> > I think there are multiple topics being discussed:
> >> >
> >>
Augie Fackler writes:
> On Fri, Feb 17, 2017 at 07:14:12PM -0800, Jun Wu wrote:
>> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
>> > I think there are multiple topics being discussed:
>> >
>> > 1. How to solve the overhead loading hiddenrevs with minimal changes?
>> >
Jun Wu writes:
> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
>> On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
>>
>> > Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
>> > > As I said before we will load all non-public revs in one set and all
>
Excerpts from Augie Fackler's message of 2017-02-19 21:06:53 -0500:
> On Fri, Feb 17, 2017 at 09:59:48PM +, Stanislau Hlebik wrote:
> > Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> > > On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
> > >
> > > > Excerpts from Stani
On Fri, Feb 17, 2017 at 09:59:48PM +, Stanislau Hlebik wrote:
> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> > On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
> >
> > > Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > > > As I said before w
On Fri, Feb 17, 2017 at 07:14:12PM -0800, Jun Wu wrote:
> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> > I think there are multiple topics being discussed:
> >
> > 1. How to solve the overhead loading hiddenrevs with minimal changes?
> > 2. Why is the bitmap format i
Excerpts from Jun Wu's message of 2017-02-17 19:14:12 -0800:
> Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> > On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
> >
> > > Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > > > As I said before we wi
Excerpts from Stanislau Hlebik's message of 2017-02-17 16:06:33 +:
> This is implementation of two caches (nonpublic + precursor) using
> serialized sorted lists and sets
> https://bitbucket.org/stashlebik/hg/commits/99879579ac2848a2567810b677d8344150a7b319?at=hiddenbitmaps_lists
I had a quick
Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
>
> > Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > > As I said before we will load all non-public revs in one set and all
> >
> > The problem is,
Excerpts from Bryan O'Sullivan's message of 2017-02-17 13:29:58 -0800:
> On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
>
> > Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > > As I said before we will load all non-public revs in one set and all
> >
> > The problem is,
On Fri, Feb 17, 2017 at 10:30 AM, Jun Wu wrote:
> Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > As I said before we will load all non-public revs in one set and all
>
> The problem is, loading a Python set from disk is O(size-of-the-set).
>
> Bitmap's loading cost sho
Excerpts from Jun Wu's message of 2017-02-17 10:30:45 -0800:
> Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> > As I said before we will load all non-public revs in one set and all
>
> The problem is, loading a Python set from disk is O(size-of-the-set).
>
> Bitmap's loa
Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> As I said before we will load all non-public revs in one set and all
The problem is, loading a Python set from disk is O(size-of-the-set).
Bitmap's loading cost should be basically 0 (with mmap). I think that's why
we want b
Excerpts from Stanislau Hlebik's message of 2017-02-17 11:24:34 +:
> Excerpts from Jun Wu's message of 2017-02-16 13:42:46 -0800:
> > Excerpts from Stanislau Hlebik's message of 2017-02-16 19:39:07 +:
> > > Excerpts from Stanislau Hlebik's message of 2017-02-14 09:29:25 +:
> > > > Excer
Excerpts from Jun Wu's message of 2017-02-16 13:42:46 -0800:
> Excerpts from Stanislau Hlebik's message of 2017-02-16 19:39:07 +:
> > Excerpts from Stanislau Hlebik's message of 2017-02-14 09:29:25 +:
> > > Excerpts from Sean Farley's message of 2017-02-13 18:30:25 -0800:
> > > > Jun Wu wr
Excerpts from Stanislau Hlebik's message of 2017-02-16 19:39:07 +:
> Excerpts from Stanislau Hlebik's message of 2017-02-14 09:29:25 +:
> > Excerpts from Sean Farley's message of 2017-02-13 18:30:25 -0800:
> > > Jun Wu writes:
> > >
> > > > Excerpts from Sean Farley's message of 2017-02-1
Excerpts from Stanislau Hlebik's message of 2017-02-14 09:29:25 +:
> Excerpts from Sean Farley's message of 2017-02-13 18:30:25 -0800:
> > Jun Wu writes:
> >
> > > Excerpts from Sean Farley's message of 2017-02-13 17:04:35 -0800:
> > >> I was thinking about a more high-level approach (please
Excerpts from Gregory Szorc's message of 2017-02-13 20:28:37 -0700:
>
> > On Feb 10, 2017, at 10:33, Stanislau Hlebik wrote:
> >
> > Last year Durham sent a proposal for bitmap storage for computehidden()
> > https://urldefense.proofpoint.com/v2/url?u=https-3A__www.mercurial-2Dscm.org_pipermail
Excerpts from Sean Farley's message of 2017-02-13 18:30:25 -0800:
> Jun Wu writes:
>
> > Excerpts from Sean Farley's message of 2017-02-13 17:04:35 -0800:
> >> I was thinking about a more high-level approach (please feel free to
> >> pick apart):
> >>
> >> r = repo.filtered("bitmap1")
> >> r2 =
> On Feb 10, 2017, at 10:33, Stanislau Hlebik wrote:
>
> Last year Durham sent a proposal for bitmap storage for computehidden()
> https://www.mercurial-scm.org/pipermail/mercurial-devel/2016-September/087860.html.
>
> It got a few useful comments, two most important comments:
> Use bitmaps
Jun Wu writes:
> Excerpts from Sean Farley's message of 2017-02-13 17:04:35 -0800:
>> I was thinking about a more high-level approach (please feel free to
>> pick apart):
>>
>> r = repo.filtered("bitmap1")
>> r2 = r.filtered("bitmap2")
>>
>> So that r2 would be an intersection of bitmap1 and bi
Excerpts from Sean Farley's message of 2017-02-13 17:04:35 -0800:
> I was thinking about a more high-level approach (please feel free to
> pick apart):
>
> r = repo.filtered("bitmap1")
> r2 = r.filtered("bitmap2")
>
> So that r2 would be an intersection of bitmap1 and bitmap2 (haven't
> thought a
Jun Wu writes:
> In general, I think this is a good direction. Some random thoughts:
>
> - general purposed
>
> I think the bitmap is not always a cache, so it should only have
> operations like set/unset/readfromdisk/writetodisk. Practically, I won't
> couple cache invalidation wit
Excerpts from Jun Wu's message of 2017-02-10 11:04:24 -0800:
> In general, I think this is a good direction. Some random thoughts:
>
> - general purposed
>
> I think the bitmap is not always a cache, so it should only have
> operations like set/unset/readfromdisk/writetodisk. Practicall
In general, I think this is a good direction. Some random thoughts:
- general purposed
I think the bitmap is not always a cache, so it should only have
operations like set/unset/readfromdisk/writetodisk. Practically, I won't
couple cache invalidation with the bitmap implementation.
Last year Durham sent a proposal for bitmap storage for computehidden()
https://www.mercurial-scm.org/pipermail/mercurial-devel/2016-September/087860.html.
It got a few useful comments, two most important comments:
1. Use bitmaps for lower-level data structures, for example, bitmap for
publi
28 matches
Mail list logo