[MERGE] Graph.find_distance_to_null

[John Arbash Meinel]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Aaron Bentley wrote:
| John Arbash Meinel wrote:
|> 2) Branch.push() and Branch.pull() pass a Graph object into
|> update_revisions,
|> with the bias that 'self' is considered the closest repository.
|
| I wonder whether remote_repository.get_graph(other) should be equivalent
| to other.get_graph(remote_repository)?
|
| Aaron

Well, somehow you need to know what is local and what is remote. At the moment
we bias it as local.get_graph(remote). We've talked in the past, and it never
seemed like we wanted to do something like "repository.is_local()" or
"repository.transport.is_local()" to sort this automatically from a
'source.get_graph(other_source)".

I've also considered that you could place a request and actually just time the
latency. And sort the next request based on who returned the previous one the
fastest.

John
=:->
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (Cygwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkg2T/UACgkQJdeBCYSNAAM8RACeOpyf+SEQCfFlFjgywGlAPx2s
mRsAn0fHXis/QG+O4cRkcpd1mj/upk0y
=sdQy
-----END PGP SIGNATURE-----