A collection that contains no duplicate elements. This interface models the mathematical Set abstraction. The order of elements in a set is dependant on (a)the data-structure implementation, and (b)the implementation of the various Set methods, and thus is not guaranteed.
None of the Set implementations in this library are guranteed to be thread-safe in any way unless wrapped in a SynchronizedSet.
The following table summarizes the binary operators that are supported by the Set class.
| Operation | Description | Method |
|---|---|---|
| Union (OR) | Element included in result if it exists in either A OR B. | Union() |
| Intersection (AND) | Element included in result if it exists in both A AND B. | InterSect() |
| Exclusive Or (XOR) | Element included in result if it exists in one, but not both, of A and B. | ExclusiveOr() |
| Minus (n/a) | Take all the elements in A. Now, if any of them exist in B, remove
them. Note that unlike the other operators, A - B is not the same as B - A. | Minus() |
Assembly: Iesi.Collections (in Iesi.Collections)
Version: 1.0.0.3
Syntax
| Visual Basic (Declaration) |
|---|
Public Interface ISet(Of T) _ Implements ICollection(Of T), IEnumerable(Of T), IEnumerable, ICloneable |
| C# |
|---|
public interface ISet<T> : ICollection<T>, IEnumerable<T>, IEnumerable, ICloneable |
| Visual C++ |
|---|
generic<typename T> public interface class ISet : ICollection<T>, IEnumerable<T>, IEnumerable, ICloneable |
Type Parameters
- T
