title: C# equivalent of LinkedHashMap
body: <p>As the question says, I'm looking for the c# equivalent of the <strong>LinkedHashMap</strong> in Java.</p>
  
  <p>I need to be able to retrieve keys <em>and</em> values by index, get the size. I need the elements to be ordered in the way they are inserted. One key should be matched to exactly one value.</p>
  
  <p>Collections I've tried (And problems with them):<br>
  <strong>NameValueCollection</strong> - Allows one-many linking. I'm guessing this causes an unnecessary overhead.<br>
  <strong>OrderedDictionary</strong> - Unable to retrieve key by index.</p>
  
  <p><strong>EDIT</strong> : It has been pointed out that no such equivalent exists in C#. In the linked question, the answer points to a forum for an example implementation, which appears to be down. Could someone perhaps provide an example implementation here?</p>
  
  <p><strong>EDIT 2</strong> : A <strong>CookieCollection</strong> from System.Net appears to be what I need. How would this react to larger sizes (number of elements)?</p>