title: Efficient data structure to map integer-to-integer with find & insert, no allocations and fixed upper bound
body: <p>I am looking for input on an associative data structure that might take advantage of the specific criteria of my use case. </p>
  
  <p>Currently I am using a red/black tree to implement a dictionary that maps keys to values (in my case integers to addresses). </p>
  
  <p>In my use case, the maximum number of elements is known up front (1024), and I will only ever be inserting and searching. Searching happens twenty times more often than inserting. At the end of the process I clear the structure and repeat again. There can be no allocations during use - only the initial up front one. Unfortunately, the STL and recent versions of C++ are not available.</p>
  
  <p>Any insight? </p>