D
Der Andere
Are priority queues implemented in the STL in Visual Studio 6? If no, which
is the easiest way to simulate them? Multisets?
BTW: The container contains pointers to instances of a class. The ordering
of the elements must follow the value of the class-instances not the value
of the pointers. Furthermore, elements are inserted throughout execution of
the program so I need a insert function which keeps the elements sorted; a
sort function which sorts the whole container after every insertion is not
sufficient (and surely not efficient).
Regards,
Matthias
is the easiest way to simulate them? Multisets?
BTW: The container contains pointers to instances of a class. The ordering
of the elements must follow the value of the class-instances not the value
of the pointers. Furthermore, elements are inserted throughout execution of
the program so I need a insert function which keeps the elements sorted; a
sort function which sorts the whole container after every insertion is not
sufficient (and surely not efficient).
Regards,
Matthias