Is there a data structure that doesn't allow duplicates and also maintains order of entry?

Take a look at Boost. MultiIndex . You may have to write a wrapper over this.

A Boost. Bimap with the insertion order as an index should work (e.g. Boost::bimap ). If you are removing objects from the data structure, you will need to track the next insertion order value separately.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.