Is there any NAT type that represents a set of key-value pairs where each key is only a single value (i.e. That a regular dictionary ), but each value will be connected with only one key? I was thinking of it as a "unambiguous" dictionary because you could swap keys with values without any collision. Writing such a class should not be difficult and should add methods such as "TryGetKey" for a given value. However, I want to see if such a thing was already present, probably under a different name that I did not think.
In addition, looking at the elegant answer, will it be useful for me to represent a recorded dictionary? A class, when I can easily convert any dictionary to its value-par value easily Can I use LINQ?
I do not believe there is such a class in the framework that makes it straight.
Also, on giving a great reply to this question, will it be useful to me as long as I can easily convert any dictionary into its value-key equivalent using LINQ Can i
The answer to both of your questions really depends on how you are reaching your data. If you need a steady, important and time-based basis for continuous time, Want to create your own collection?
It can be done very easily, however, just wrap two examples inside your class, and when you add it to a new element, add both - with a key / value And with a price / key, your lookup routines can only be pulled from the appropriate collection, and it will be near the O (1) time for access.
If, however, memory is of a concern, then you can only use one collection, and use LINQ to analyze it. This is going to slow down your "reverse" look, because you have to re-pars each time.
Comments
Post a Comment