Are there any implementations of multiset for .Net?

Posted by dangph on Stack Overflow See other posts from Stack Overflow or by dangph
Published on 2010-04-08T05:03:59Z Indexed on 2010/04/08 5:13 UTC
Read the original article Hit count: 310

Filed under:

multiset

|

bag

|

.NET

|

c#

|

datastructures

I'm looking for a .Net implementation of a multiset. Can anyone recommend a good one?

(A multiset, or bag, is a set that can have duplicate values, and on which you can do set operations: intersection, difference, etc. A shopping cart for instance could be thought of as a multiset because you can have multiple occurrences of the same product.)

© Stack Overflow or respective owner

Related posts about multiset

Are there any implementations of multiset for .Net?

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm looking for a .Net implementation of a multiset. Can anyone recommend a good one? (A multiset, or bag, is a set that can have duplicate values, and on which you can do set operations: intersection, difference, etc. A shopping cart for instance could be thought of as a multiset because you can… >>> More
Coordinating typedefs and structs in std::multiset (C++)

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm not a professional programmer, so please don't hesitate to state the obvious. My goal is to use a std::multiset container (typedef EventMultiSet) called currentEvents to organize a list of structs, of type Event, and to have members of class Host occasionally add new Event structs to currentEvents… >>> More
Multiset of shared_ptrs as a dynamic priority queue: Concept and practice

as seen on Stack Overflow - Search for 'Stack Overflow'
I was using a vector-based priority queue typedef std::priority_queue< Event, vector< Event >, std::greater< Event > > EventPQ; to manage my Event objects. Now my simulation has to be able to find and delete certain Event objects not at the top of the queue. I'd like to know… >>> More
Multiset without Compare?

as seen on Stack Overflow - Search for 'Stack Overflow'
I want to use multiset to count some custom defined keys. The keys are not comparable numerically, comparing two keys does not mean anything, but their equality can be checked. I see that multiset template wants a Compare to order the multiset. The order is not important to me, only the counts are… >>> More
Does std::multiset guarntee insertion order?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a std::multiset which stores elements of class A. I have provided my own implementation of operator< for this class. My question is if I insert two equivalent objects into this multiset is their order guaranteed? For example, first I insert a object a1 into the set and then I insert an equivalent… >>> More

Related posts about bag

DIY Camera Carrier Turns any Bag into a Camera Bag

as seen on How to geek - Search for 'How to geek'
The biggest problem with camera bags is that they look like camera bags and thus become a perfect target for thieves. This DIY camera carrier lets you slip a lens and camera holder into any bag to help conceal and protect your gear. The project comes to us courtesy of Joy, a designer and crafter… >>> More
An Xml Serializable PropertyBag Dictionary Class for .NET

as seen on West-Wind - Search for 'West-Wind'
I don't know about you but I frequently need property bags in my applications to store and possibly cache arbitrary data. Dictionary<T,V> works well for this although I always seem to be hunting for a more specific generic type that provides a string key based dictionary. There's string dictionary… >>> More
C#/.NET Little Wonders: ConcurrentBag and BlockingCollection

as seen on Geeks with Blogs - Search for 'Geeks with Blogs'
In the first week of concurrent collections, began with a general introduction and discussed the ConcurrentStack<T> and ConcurrentQueue<T>. The last post discussed the ConcurrentDictionary<T> . Finally this week, we shall close with a discussion of the ConcurrentBag<T> and… >>> More
Logic / Probability Question: Picking from a bag

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm coding a board game where there is a bag of possible pieces. Each turn, players remove randomly selected pieces from the bag according to certain rules. For my implementation, it may be easier to divide up the bag initially into pools for one or more players. These pools would be randomly selected… >>> More
Mapping a child collection without indexing based on database primary key or using bag

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a existing parent-child relationship I am trying to map in Fluent Nhibernate: [RatingCollection] -- [Rating] Rating Collection has: ID (database generated ID) Code Name Rating has: ID (database generated id) Rating Collection ID Code Name I have been trying to figure out which permutation… >>> More