[MERGE] faster common ancestor

[Martin Pool]

On  6 Mar 2006, Robert Collins <robertc at robertcollins.net> wrote:
> this common ancestor implementation is ~ the same as the 0.7 one, but it
> does not need to read each revision. for knits it will be faster as
> we'll only hit the index.
> 
> 
> -- 
> GPG key available at: <http://www.robertcollins.net/keys.txt>.

> === modified file 'a/bzrlib/repository.py'
> --- a/bzrlib/repository.py	
> +++ b/bzrlib/repository.py	
> @@ -425,6 +425,32 @@
>          return self.get_revision(revision_id).inventory_sha1
>  
>      @needs_read_lock
> +    def get_revision_graph(self, revision_id=None):
> +        """Return a dictionary containing the revision graph.
> +        
> +        :return: a dictionary of revision_id->revision_parents_list.
> +        """

Add (if correct):

    The returned graph doesn't include ghost revisions.

    :param revision_id: If specified, give the graph of ancestors of
        this revision; otherwise give the entire graph for this
        repository.

Otherwise looks reasonable and +1 from me.

-- 
Martin
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 191 bytes
Desc: Digital signature
Url : https://lists.ubuntu.com/archives/bazaar/attachments/20060306/85e9d7a7/attachment.pgp