Package Wintellect.PowerCollections

Classes
class	Algorithms
	Algorithms contains a number of static methods that implement algorithms that work on collections. Most of the methods deal with the standard generic collection interfaces such as IEnumerable<T>, ICollection<T> and IList<T>.
class	Bag< T >
	Bag<T> is a collection that contains items of type T. Unlike a Set, duplicate items (items that compare equal to each other) are allowed in an Bag. More...
class	BigList< T >
	BigList<T> provides a list of items, in order, with indices of the items ranging from 0 to one less than the count of items in the collection. BigList<T> is optimized for efficient operations on large (>100 items) lists, especially for insertions, deletions, copies, and concatinations. More...
class	CollectionBase< T >
	CollectionBase is a base class that can be used to more easily implement the generic ICollection<T> and non-generic ICollection interfaces. More...
class	Comparers
	A collection of methods to create IComparer and IEqualityComparer instances in various ways.
class	Deque< T >
class	DictionaryBase< TKey, TValue >
	DictionaryBase is a base class that can be used to more easily implement the generic IDictionary<T> and non-generic IDictionary interfaces. More...
class	Hash< T >
	The base implementation for various collections classes that use hash tables as part of their implementation. This class should not (and can not) be used directly by end users; it's only for internal use by the collections package. The Hash does not handle duplicate values.
class	ListBase< T >
	ListBase is an abstract class that can be used as a base class for a read-write collection that needs to implement the generic IList<T> and non-generic IList collections. The derived class needs to override the following methods: Count, Clear, Insert, RemoveAt, and the indexer. The implementation of all the other methods in IList<T> and IList are handled by ListBase. More...
class	MultiDictionary< TKey, TValue >
class	MultiDictionaryBase< TKey, TValue >
	MultiDictionaryBase is a base class that can be used to more easily implement a class that associates multiple values to a single key. The class implements the generic IDictionary<TKey, ICollection<TValue>> interface. More...
class	OrderedBag< T >
	OrderedBag<T> is a collection that contains items of type T. The item are maintained in a sorted order. Unlike a OrderedSet, duplicate items (items that compare equal to each other) are allows in an OrderedBag. More...
class	OrderedDictionary< TKey, TValue >
	OrderedDictionary<TKey, TValue> is a collection that maps keys of type TKey to values of type TValue. The keys are maintained in a sorted order, and at most one value is permitted for each key. More...
class	OrderedMultiDictionary< TKey, TValue >
class	OrderedSet< T >
	OrderedSet<T> is a collection that contains items of type T. The item are maintained in a sorted order, and duplicate items are not allowed. Each item has an index in the set: the smallest item has index 0, the next smallest item has index 1, and so forth. More...
struct	Pair< TFirst, TSecond >
	Stores a pair of objects within a single struct. This struct is useful to use as the T of a collection, or as the TKey or TValue of a dictionary. More...
class	ReadOnlyCollectionBase< T >
	ReadOnlyCollectionBase is a base class that can be used to more easily implement the generic ICollection<T> and non-generic ICollection interfaces for a read-only collection: a collection that does not allow adding or removing elements. More...
class	ReadOnlyDictionaryBase< TKey, TValue >
	ReadOnlyDictionaryBase is a base class that can be used to more easily implement the generic IDictionary<T> and non-generic IDictionary interfaces. More...
class	ReadOnlyListBase< T >
	ReadOnlyListBase is an abstract class that can be used as a base class for a read-only collection that needs to implement the generic IList<T> and non-generic IList collections. The derived class needs to override the Count property and the get part of the indexer. The implementation of all the other methods in IList<T> and IList are handled by ListBase. More...
class	ReadOnlyMultiDictionaryBase< TKey, TValue >
	MultiDictionaryBase is a base class that can be used to more easily implement a class that associates multiple values to a single key. The class implements the generic IDictionary<TKey, ICollection<TValue>> interface. The resulting collection is read-only – items cannot be added or removed. More...
class	RedBlackTree< T >
	The base implementation for various collections classes that use Red-Black trees as part of their implementation. This class should not (and can not) be used directly by end users; it's only for internal use by the collections package.
class	Set< T >
	Set<T> is a collection that contains items of type T. The item are maintained in a haphazard, unpredictable order, and duplicate items are not allowed. More...
class	Strings
	A holder class for localizable strings that are used. Currently, these are not loaded from resources, but just coded into this class. To make this library localizable, simply change this class to load the given strings from resources.
struct	Triple< TFirst, TSecond, TThird >
	Stores a triple of objects within a single struct. This struct is useful to use as the T of a collection, or as the TKey or TValue of a dictionary. More...
class	Util
	A holder class for various internal utility functions that need to be shared.

Functions
delegate bool	BinaryPredicate< T > (T item1, T item2)
	The BinaryPredicate delegate type encapsulates a method that takes two items of the same type, and returns a boolean value representating some relationship between them. For example, checking whether two items are equal or equivalent is one kind of binary predicate. More...
.	Add (T item)

Variables
**void ICollection &	lt
T &	gt

Function Documentation

delegate bool Wintellect.PowerCollections.BinaryPredicate< T >	(	T	item1,
		T	item2
	)

The BinaryPredicate delegate type encapsulates a method that takes two items of the same type, and returns a boolean value representating some relationship between them. For example, checking whether two items are equal or equivalent is one kind of binary predicate.

Parameters

item1	The first item.
item2	The second item.

Returns

Whether item1 and item2 satisfy the relationship that the BinaryPredicate defines.