R
ryu
Hi, May I know how to do an intersection of sets using C#? Where the number
of sets will only be known during runtime. Many Thanks
of sets will only be known during runtime. Many Thanks
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an alternative browser.
You should upgrade or use an alternative browser.
D
Daniel O'Connell [C# MVP]
ryu said:Hi, May I know how to do an intersection of sets using C#? Where the
number of sets will only be known during runtime. Many Thanks
Since .NET does not offer a set class, and C# doesn't offer any set
operations, there is no inherent way to do this. You will have to either
write a set class to perform the work, or define a method that does it over
arrays or lists.
Determining the intersection is pretty easy, just iterate one list and keep
only the elements that exist in all others.
R
rk
If the members of the set are enumerable then they can be represented
by a bitset and anding the bitsets will give the intersection very
easily.
by a bitset and anding the bitsets will give the intersection very
easily.
D
Daniel O'Connell [C# MVP]
rk said:If the members of the set are enumerable then they can be represented
by a bitset and anding the bitsets will give the intersection very
easily.
Yes, you have a point there. It entirely depends on the size and consistency
of your set universe.