Home/ Questions/Q 5957675
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-22T18:26:06+00:00

Say I have string->index pairs of data, e.g. hello -> 0 best -> 1

  • 0

Say I have string->index pairs of data, e.g.

"hello" -> 0
"best" -> 1
"nice" -> 2
"beautiful" -> 3

Now for my flow I want to have logarithmic search on strings, so it is obvious to place this data into std::map. But, in some point, I want to have back my data ordered by index (as it is written above) but with with no o(N^2) complexity. How I can do that, boost can help? std::map is not useful for the second requirement. How to handle this data without using N – dependent memory. (N is the number of elements in map.)

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You need to use boost::bimap. Check the documentation here.

    • 0