On Wed, Jan 27, 2010 at 8:13 AM,
On the bright side, index updating has been implemented so as to be as fast as possible: before relocating an element indices check internally whether the element remains in place after modification, which is usually a cheaper operation than brute relocation. In the particular case of a hashed index, if modify() hasn't touched its key then updating merely invokes a hash call and a couple of pointer comparisons (not even equality comparison is needed.)
Cool, that's a valuable tip about the implementation. Would make a great note in the doc. Boost docs tend to be quite dry, and your very insightful answer to Christian's question would be very appreciated in the doc, perhaps linked from modify()/modify_key(). My $0.02, and once again thanks for this fantastic library. --DD