Performance - bearing propagation

[hschneid]

Currently every search for possible insert positions, checks the bearing capacity of items. Therefore all lower items are checked.

If there would be an additional data structure, which remembers the still open bearing capacity of upper items, there check would be faster. Only a little bit more effort in adding an item, because the bearing of lower items must be checked.

This features should be available first only for AddContainer.