title: Data structure for fast searching in C++
body: <p>I need to store the values like the following in a data structure,</p>
  
  <pre><code>id   x     y     z
  0    0.1   0.1   0.1
  1    0.2   0.1   0.6
  2    0.01  0.3   0.1
  .....
  </code></pre>
  
  <p>Now I need to match the x,y,z double values and get the corresponding id(int) value. I might need to store around 400000 values. What sot of data structure should I use for efficient searching? Does C++ come with any built-in structures that would support my requirement.</p>