<div dir="ltr"><div dir="ltr"><br></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Mon, Mar 11, 2024 at 9:12 AM Joaquin M López Muñoz &lt;<a href="mailto:joaquinlopezmunoz@gmail.com">joaquinlopezmunoz@gmail.com</a>&gt; wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><u></u>

  
    
  
  <div><p>May I suggest that you use boost::unordered_map instead of
      boost::unordered_flat_map<br>
      for those small maps and see if this improves the performance of
      your program?<br>
      <br></p></div></blockquote><div>Thank you for the suggestion, I was hoping to keep all the elements sequentially in memory(general preference to make efficient use of cache, hard to microbenchmark),  I will probably just stick to linear search or try my luck with flat_map(that in my experience has quite bad performance, but might work fine for this case).<br></div></div><div class="gmail_quote"><br></div><div class="gmail_quote">regards, <br></div><div class="gmail_quote">Ivan<br></div></div>