|
CSortedSet<T>
CSortedSet<T> is a generic class that implements the ISet<T> interface.
Description
The CSortedSet<T> class is an implementation of the sorted dynamic data set of type T, with the required uniqueness of each value. This class provides basic methods to work with sets and related operations, such as: the union and intersection of sets, definition of strict and non-strict subsets, and others.
Declaration
template<typename T>
|
Header
#include <Generic\SortedSet.mqh> |
Inheritance Hierarchy CSortedSet |
Class Methods
Method |
Description |
---|---|
Adds an element to a sorted set |
|
Returns the number of elements in a sorted set |
|
Determines whether a sorted set contains an element with the specified value |
|
Returns a pointer to the IComparer<T> interface, used to organize a sorted set |
|
Gets the minimum element from a sorted set |
|
Gets the maximum element from a sorted set |
|
Copies all elements of a sorted set to the specified array starting at the specified index |
|
Removes all elements from a sorted set |
|
Removes the occurrence of the specified element from a sorted set |
|
Produces the operation of difference between the current collection and a passed collection (array) |
|
Produces the operation of intersection of the current collection and a passed collection (array) |
|
Produces the operation of symmetrical difference between the current collection and a passed collection (array) |
|
Produces the union of the current collection and a passed collection (array) |
|
Determines whether the current sorted set is a proper subset of the specified collection or array |
|
Determines whether the current sorted set is a proper superset of the specified collection or array |
|
Determines whether the current sorted set is a subset of the specified collection or array |
|
Determines whether the current sorted set is a superset of the specified collection or array |
|
Determines whether the current sorted set overlaps the specified collection or array |
|
Determines whether the current sorted set contains all elements of the specified collection or array |
|
Gets from the current sorted set a subset specified by the minimum and maximum values |
|
Gets a copy of the current sorted set, in which all the elements are arranged in a reverse order |