C++ Programming Code Examples
C++ > Code Snippets Code Examples
Using the erase Member Function on a Multiset
/* Using the erase Member Function on a Multiset */
#include <set>
#include <iostream>
using namespace std;
typedef multiset <int> MSETINT;
int main ()
{
MSETINT msetIntegers;
msetIntegers.insert (43);
msetIntegers.insert (78);
msetIntegers.insert (78);
msetIntegers.insert (-1);
msetIntegers.insert (124);
MSETINT::const_iterator iElement;
cout << msetIntegers.size () << " elements.";
for ( iElement = msetIntegers.begin (); iElement != msetIntegers.end (); ++ iElement )
cout << *iElement << endl;
int nNumberToErase = 2;
cout << msetIntegers.count (nNumberToErase);
cout << nNumberToErase << endl;
msetIntegers.erase (nNumberToErase);
cout << msetIntegers.size () << " elements.";
for ( iElement = msetIntegers.begin (); iElement != msetIntegers.end (); ++ iElement )
cout << *iElement << endl;
return 0;
}
Return container size. Returns the number of elements in the multiset container. C++ Multiset size() function is used to find the number of elements present in the multiset container. size() function returns the number of elements in the container, i.e. std::distance(begin(), end()). No parameter is required.
Return iterator to beginning. Returns an iterator referring to the first element in the multiset container. The multiset::begin() is a built-in function in C++ STL which returns an iterator pointing to the first element in the multiset container. Since multiset always contains elements in an ordered way, begin() always points to the first element according to the sorting criterion. Because multiset containers keep their elements ordered at all times, begin points to the element that goes first following the container's sorting criterion. If the container is empty, the returned iterator value shall not be dereferenced. This function does not accept any parameter.
Insert element. Extends the container by inserting new elements, effectively increasing the container size by the number of elements inserted. Internally, multiset containers keep all their elements sorted following the criterion specified by its comparison object. The elements are always inserted in its respective position following this ordering. The relative ordering of equivalent elements is preserved, and newly inserted elements follow their equivalents already in the container. The parameters determine how many elements are inserted and to which values they are initialized: The function optimizes its insertion time if position points to the element that will follow the inserted element (or to the end, if it would be the last). Notice that this is just a hint and does not force the new element to be inserted at that position within the multiset container (the elements in a multiset always follow a specific order).
Return iterator to end. Returns an iterator referring to the past-the-end element in the multiset container. The multiset::end() is a built-in function in C++ STL which returns an iterator pointing to the position past the last element in the container. The past-the-end element is the theoretical element that would follow the last element in the multiset container. It does not point to any element, and thus shall not be dereferenced. Because the ranges used by functions of the standard library do not include the element pointed by their closing iterator, this function is often used in combination with multiset::begin to specify a range including all the elements in the container.
Multiple-key set. Multisets are containers that store elements following a specific order, and where multiple elements can have equivalent values. Multisets are part of the C++ STL (Standard Template Library). Multisets are the associative containers like Set that stores sorted values (the value is itself the key, of type T), but unlike Set which store only unique keys, multiset can have duplicate keys. By default it uses < operator to compare the keys. The value of the elements in a multiset can be inserted or deleted but cannot be altered (The elements are always const). In a multiset, the value of an element also identifies it (the value is itself the key, of type T). The value of the elements in a multiset cannot be modified once in the container (the elements are always const), but they can be inserted or removed from the container.
In computer programming, loops are used to repeat a block of code. For example, when you are displaying number from 1 to 100 you may want set the value of a variable to 1 and display it 100 times, increasing its value by 1 on each loop iteration. When you know exactly how many times you want to loop through a block of code, use the for loop instead of a while loop. A for loop is a repetition control structure that allows you to efficiently write a loop that needs to execute a specific number of times.
Count elements with a specific key. Searches the container for elements equivalent to val and returns the number of matches. Two elements of a multiset are considered equivalent if the container's comparison object returns false reflexively (i.e., no matter the order in which the elements are passed as arguments). C++ Multiset count() function is used to return the number of elements found in the container. Since, the multiset container does not contain any duplicate element, this function actually returns 1 if the element with value val is present in the multiset container otherwise, it returns 0. Function returns the number of elements in the container that are equivalent to val.
#include is a way of including a standard or user-defined file in the program and is mostly written at the beginning of any C/C++ program. This directive is read by the preprocessor and orders it to insert the content of a user-defined or system header file into the following program. These files are mainly imported from an outside source into the current program. The process of importing such files that might be system-defined or user-defined is known as File Inclusion. This type of preprocessor directive tells the compiler to include a file in the source code program.
A program shall contain a global function named main, which is the designated start of the program in hosted environment. main() function is the entry point of any C++ program. It is the point at which execution of program is started. When a C++ program is executed, the execution control goes directly to the main() function. Every C++ program have a main() function.
Consider a situation, when we have two persons with the same name, jhon, in the same class. Whenever we need to differentiate them definitely we would have to use some additional information along with their name, like either the area, if they live in different area or their mother's or father's name, etc. Same situation can arise in your C++ applications. For example, you might be writing some code that has a function called xyz() and there is another library available which is also having same function xyz(). Now the compiler has no way of knowing which version of xyz() function you are referring to within your code.
Erase elements. Removes elements from the multiset container. The multiset::erase() is the STL function in C++ removes the specified element from multiset. This effectively reduces the container size by the number of elements removed, which are destroyed. The parameters determine the elements removed: Member types iterator and const_iterator are bidirectional iterator types that point to elements. The erase() function returns an iterator that point to the next element of the deleted element or returns the number of deleted elements.
Iterators are just like pointers used to access the container elements. Iterators are one of the four pillars of the Standard Template Library or STL in C++. An iterator is used to point to the memory address of the STL container classes. For better understanding, you can relate them with a pointer, to some extent. Iterators act as a bridge that connects algorithms to STL containers and allows the modifications of the data present inside the container. They allow you to iterate over the container, access and assign the values, and run different operators over them, to get the desired result. • Iterators are used to traverse from one element to another element, a process is known as iterating through the container. • The main advantage of an iterator is to provide a common interface for all the containers type. • Iterators make the algorithm independent of the type of the container used.
In this C++ example, you'll 'learn to overload' Increment ++ and Decrement -- operators in C++. "increment & decrements" operator are overloaded in best possible way, increase the
"Operator Precedence" determines how an expression is evaluated. Some operators will have higher precedence than others. In this example, "Multiplication Operator" will have
