title: What is the fastest data structure to use if I have a static list of Color names and their hex equivalent?
body: <p>Using .net core so I do not have access to System.Drawing. I have a list of 865 color names and their hex equivalent (in 0x format). I will NEVER need to modify list, I only need to be able to quickly search the list from Either column (could be searching the name or the hex). Names are easy and in alphabetical order, but Hex's what they are. I want it to quickly find the counterpart searching either way? what would be the best approach to create the data structure, and what search methods would you use?</p>
  
  <p>I was researching <a href="http://cc.davelozinski.com/c-sharp/fastest-collection-for-string-lookups" rel="nofollow noreferrer">http://cc.davelozinski.com/c-sharp/fastest-collection-for-string-lookups</a></p>
  
  <p>It shows some interesting data, but it only searches from a single column so not quite what i'm looking for. Sorted list seems the way to go if I was only using color names as the key value, but Hex is throwing my off a bit.</p>
  
  <p>Example list:</p>
  
  <pre><code>Air superiority blue    0x72A0C1 
  Alabama Crimson     0xA32638 
  Alice blue  0xF0F8FF 
  Alizarin crimson    0xE32636 
  Alloy orange    0xC46210 
  Almond  0xEFDECD 
  Amaranth    0xE52B50 
  Amber   0xFFBF00 
  </code></pre>