Intersection

[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

[Daniel O'Connell [C# MVP]]

"ryu" <bl***************@yahoo.com> wrote in message
news:uu**************@tk2msftngp13.phx.gbl...

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.

[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.

[Daniel O'Connell [C# MVP]]

"rk" <kr*****@hotmail.com> wrote in message
news:11**********************@z14g2000cwz.googlegr oups.com...

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.