relaxing the same-length constraint on B+Tree indices

[Robert Collins]

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
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 197 bytes
Desc: This is a digitally signed message part
Url : https://lists.ubuntu.com/archives/bazaar/attachments/20090326/efa68503/attachment.pgp