Wintellect.PowerCollections Namespace
Algorithms Class
Bag(T) Class
BigList(T) Class
BinaryPredicate(T) Delegate
CollectionBase(T) Class
Deque(T) Class
DictionaryBase(TKey, TValue) Class
ListBase(T) Class
MultiDictionary(TKey, TValue) Class
MultiDictionaryBase(TKey, TValue) Class
OrderedBag(T) Class
OrderedBag(T).View Class
OrderedDictionary(TKey, TValue) Class
OrderedDictionary(TKey, TValue).View Class
OrderedMultiDictionary(TKey, TValue) Class
OrderedMultiDictionary(TKey, TValue).View Class
OrderedSet(T) Class
OrderedSet(T).View Class
OrderedSet(T).View Members
OrderedSet(T).View Methods
Add Method
AsList Method
Clear Method
Contains Method
GetEnumerator Method
GetFirst Method
GetLast Method
IndexOf Method
Remove Method
Reversed Method
OrderedSet(T).View Properties
Pair(TFirst, TSecond) Structure
ReadOnlyCollectionBase(T) Class
ReadOnlyDictionaryBase(TKey, TValue) Class
ReadOnlyListBase(T) Class
ReadOnlyMultiDictionaryBase(TKey, TValue) Class
Set(T) Class
Triple(TFirst, TSecond, TThird) Structure
GhostDoc Pro Sample Help File

View..::..Add Method

Adds a new item to the set underlying this View. If the set already contains an item equal to item, that item is replaces with item. If item is outside the range of this view, an InvalidOperationException is thrown.

Namespace:  Wintellect.PowerCollections
Assembly:  PowerCollections (in PowerCollections.dll)

Syntax

public bool Add(
	T item
)
Public Function Add ( _
	item As T _
) As Boolean
public:
bool^ Add(
	T item
)

Parameters

item
Type: T
The item to add.

Return Value

True if the set already contained an item equal to item (which was replaced), false otherwise.

Remarks

Equality between items is determined by the comparison instance or delegate used to create the set.

Adding an item takes time O(log N), where N is the number of items in the set.

See Also

OrderedSet<(Of <(<'T>)>)>..::..View Class
Wintellect.PowerCollections Namespace