New low-level filtering

Augie Fackler raf at durin42.com
Wed Jan 30 09:24:07 CST 2013


On Wed, Jan 30, 2013 at 01:02:01AM -0800, v wrote:
> Matt Mackall wrote
> > Mercurial has always had a fast, numbered index of all changes. It can
> > find any change instantly, by hash or by number. There is no existing
> > notion of an "unreachable changeset" in Mercurial. So hiding change 1000
> > from Mercurial is thus not trivial: code expects that there's a
> > changeset between 999 and 1001.
>
> Where is this random-access to changesets (without a pointer from another
> changeset) actually useful? (Read the code would be an acceptable answer, if
> someone can point to code that needs this ...)
>

As one concrete example, blame. We can walk the file's history, then
use pointers to changeset objects by integer value in order to do
blame pretty quick.

>
>
>
> --
> View this message in context: http://mercurial.808500.n3.nabble.com/New-low-level-filtering-tp3997736p3997802.html
> Sent from the Development mailing list archive at Nabble.com.
> _______________________________________________
> Mercurial-devel mailing list
> Mercurial-devel at selenic.com
> http://selenic.com/mailman/listinfo/mercurial-devel


More information about the Mercurial-devel mailing list