Hi Miklos,
Miklos Vajna-4 wrote
Isn't the difference between std::set and std::map that the key is
separated from the value, i.e. it has an operator[] what you want here?
The [] operator is to retrieve the nth element of the sorted vector. I don't
figure out how map would replace vector here? What key to use?
Above all, do you think it worths it to spend some time on searching a way
to replace the vector implementation or am I misleading? I must recognize
it's just some guessing, I haven't profiled anything.
Julien
--
View this message in context:
http://nabble.documentfoundation.org/About-SwSortedObjs-tp4102571p4102612.html
Sent from the Dev mailing list archive at Nabble.com.
Context
Privacy Policy |
Impressum (Legal Info) |
Copyright information: Unless otherwise specified, all text and images
on this website are licensed under the
Creative Commons Attribution-Share Alike 3.0 License.
This does not include the source code of LibreOffice, which is
licensed under the Mozilla Public License (
MPLv2).
"LibreOffice" and "The Document Foundation" are
registered trademarks of their corresponding registered owners or are
in actual use as trademarks in one or more countries. Their respective
logos and icons are also subject to international copyright laws. Use
thereof is explained in our
trademark policy.