Question

I need a data structure (std preferred) that boasts:

• sorting (upon insertion if possible)
• comparison (by random-access, or member function) to determine if an object already exists in the structure
• ability to retrieve, and remove lead/trailing element

I considered vector, but no real support for sorting exists, but did have the other 2

I also considered priority-queue, but need to have the ability to compare against what is already there.

Answer 1

You can use std::set.

1. It sorts the elements inserted into it.
2. To check whether an element already exists you can use set::find.
3. To retrieve the leading element you can use set::begin iterator and to last element you can use set::rbegin. To remove these elements you can use set::erase method.