KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I'm looking for a container that keeps all its items in order. I looked at SortedList, but that requires a separate key, and does not allow duplicate keys. I could also just use an unsorted container and explicitly sort it after each insert. Usage: Occasional insert Frequent traversal in order Ideally not working with keys separate from the actual object, using a compare function to sort. Stable sorting for equivalent objects is desired, but not required. Random access is not required. I realize I can just build myself a balanced tree structure, I was just wondering if the framework already contains such a beast.
Tags (comma-separated)
Save Edits
Cancel