Avatar of kalyangkm
Flag for United States of America asked on

How to add and retrieve the data with key value pair without using dictionary

How to add and retrieve the data with key value pair without using dictionary?

Avatar of undefined
Last Comment

8/22/2022 - Mon
Marcus Keustermans

Why would you want to do that?

You can however replicate this with a 2 dimensional array, or List of POCO objects. Doing that is like reinventing the wheel though.
Eduard Ghergu

You can use Tuples, but this data structure is not "aware" about a key-value thing.

View this solution by signing up for a free trial.
Members can start a 7-Day free trial and enjoy unlimited access to the platform.
See Pricing Options
Start Free Trial
Ask your own question & get feedback from real experts
Find out why thousands trust the EE community with their toughest problems.
PANkaj Kumar

You can try Indexer  [c#].
All of life is about relationships, and EE has made a viirtual community a real community. It lifts everyone's boat
William Peck

if using first sample posted by saige, you would add key-value pair by

Dictionary<string, List<string>> myDictionary = new Dictionary<string, List<string>>();
myDictionary[key].Add(new string(value));

Open in new window

to retrieve key-value pairs by key do

List<string> valueList;
if (myDictionary.TryGetValue(key, out valueList))
     for each (string value in valueList)

Open in new window

How to add and retrieve the data with key value pair without using dictionary?

you could use a list of key-value pairs like saige has described, or if the key is part of the value class you could use a list of values, or you use a list of separate class containing key and value as members. after adding items to the list, sort the list by key.

the sort statement is like

List<KeyValue> myList;    // assume KeyValue has members key and value
myList.Sort((kv1, kv2) => kv1.key.CompareTo(f2.key));

Open in new window

to retrieve key-value pairs from list by key you either could search sequentially until you find the key. this is not elegant but for small lists - say count < 100 - the difference in speed is not measurable. if the list is sorted you could stop at the first catch and get all values to the same key by checking the next items of the list. so you would look-up about half time compared to searching the unsorted list. if sorted, however you could do a binary search like that:

    int start = 0; 
    int end   = myList.Count;
    int result  = 0;
    while (start < end)
        int mid = (start + end) / 2;
        result = key.CompareTo(myList[mid].key));
        if (result <= 0)
           end = mid;
           start = mid + 1;
    if (result == 0)
          // first key-value pair found at index start 

          // check next keys from start + 1 whether there are more key-value pairs containing the same key

Open in new window

what of course is reinventing the wheel but nevertheless a nice little piece of code.