relaxing the same-length constraint on B+Tree indices

[John Arbash Meinel]

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

Robert Collins wrote:
> I'd like to relax the constraint that all the keys and references in a B
> +Tree index be the same width.
> 
> This would remove a safeguard against bad code in knit->pack mapping,
> but I am confident in the rest of our test suite to catch changes there.
> 
> Thoughts?
> 
> -Rob

Is this so you could combine revisions and inventories, etc in the same
index?

Conceptually I'm fine with it, but I think it breaks the parser to have
arbitrary width nodes. (I think parsing the key grabs the first N null
bytes.)

John
=:->

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

iEYEARECAAYFAknK4rwACgkQJdeBCYSNAAPMywCg0vhXWUW/Mnwn+dyB7igSYyZl
jJYAn0yrxaSQ6J1iULiSwJifti7ZN4Px
=XMGj
-----END PGP SIGNATURE-----