For collections which need to be searched quiet often the current Vec<Item> approach is not really fast. To make it faster I'll change those collections to BTreeMaps.
This also involves the checking for already existing items in the collection which isn't doent till now.
For collections which need to be searched quiet often the current
Vec<Item>approach is not really fast. To make it faster I'll change those collections to BTreeMaps. This also involves the checking for already existing items in the collection which isn't doent till now.