C++ Tutorial Index

C++ Tutorial C++ History C++ Installation C++ First Program C++ cin and cout C++ Data type C++ Variable C++ operator C++ Keywords

C++ Control Statements

C++ If C++ Nested if C++ If-else C++ If-else-if C++ Switch C++ Break C++ Continue C++ Goto C++ For loop C++ While loop C++ Do while loop

C++ Functions

C++ Call by Value C++ Call by Reference C++ Recursion Function C++ Inline function C++ Friend function

C++ Arrays

Single dimension array Two dimension array

C++ Strings

C++ Strings

C++ Inheritance

C++ Inheritance Single level Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance

C++ Polymorphism

C++ Polymorphism C++ Overloading C++ Overriding C++ Virtual Function

C++ Pointers

C++ Pointers C++ this pointer

C++ Exception Handling

C++ Exception Handling

C++ Constructors

C++ Constructors Default Constructor Parameterize Constructor Copy constructor Constructor Overloading Destructor

C++ File Handling

C++ File Handling C++ Writing to file C++ Reading file C++ Close file

Miscellaneous

C Vs C++ C++ Comments C++ Data Abstraction C++ Identifier C++ Memory Management C++ Storage Classes C++ Void Pointer C++ Array To Function C++ Expressions C++ Features C++ Interfaces C++ Encapsulation std::min in C++ External merge sort in C++ Remove duplicates from sorted array in C++ Precision of floating point numbers Using these functions floor(), ceil(), trunc(), round() and setprecision() in C++ C++ References C++ Friend Functions C++ Mutable keyword Unary Operators in C++ Initialize Array of objects with parameterized constructors in C++ Differences between #define & const in C/C++ C++ Program to Implement Shell Sort C++ Program to Implement Merge Sort Storage Classes in C Vector resize() in C++ Passing by Reference Vs. Passing by the pointer in C++ Free vs delete() in C++ goto statement in C and C++ C++ program to read string using cin.getline() C++ String Concatenation Heap Sort in C++ Swap numbers in C++ Input Iterators in C++ Fibonacci Series in C++ C ++ Program: Alphabet Triangle and Number Triangle C++ Program: Matrix Multiplication C++ Program to Print Fibonacci Triangle Stack in C++ Maps in C++ Queue in C++ C++ Bitset C++ Algorithms Priority Queue in C++ C++ Multimap C++ Deque Function Pointer in C++ Sizeof() Operators in C++ C++ array of Pointers free() Vs delete in C Timsort Implementation Using C++ CPP Templates C++ Aggregation C++ Enumeration C++ Math Functions C++ Object Class C++ Queue Initialize Vector in C++ Vector in C++ C++ STL Components Function overloading in C++ C++ Maximum Index Problem C++ find missing in the second array C++ Program to find the product array puzzle C++ Program To Find Largest Subarray With 0 Sum C++ Program To Move All Zeros To The End Of The Array C++ Program to find the element that occurs once C++ Program to find the largest number formed from an array Constructor Vs Destructor C++ Namespaces C++ OOPs Concept C++ Static C++ Structs C++ Try-Catch C++ User Defined Exceptions C++ Virtual Destructor C++ vs C# Malloc() and new in C++ Palindrome Number Program in C++ Snake Code in C++ Splitting a string in C++ Structure Vs Class in C++ Virtual Function Vs Pure Virtual Function C++ Bidirectional Iterators C++ Forward Iterators C++ Iterators C++ Output Iterators C++ Range-based For Loop Converting string into integer in C++ LCM Program in C++ Type conversion in C++ Add two numbers using the function in C++ Advantage and disadvantage friend function C++ Armstrong Number Program in C++ ATM machine program in C++ using functions Binary to Decimal in C++ Bit Manipulation in C++ C++ Constructor C++ Dijkstra Algorithm Using the Priority Queue C++ int into String C++ Signal Handling Decimal to Binary in C++ Decimal to Hexadecimal in C++ Decimal to Octal in C++ Factorial Program in C++ Function in C++ Hexadecimal to Decimal in C++ Octal to Decimal in C++ Reverse a Number in C++ Structure Vs Class in C++ C++ Forward Iterators C++ Output Iterators C++ Prime number program Char Array to String in C++ Constructor Overloading in C++ Default arguments in C++ Different Ways to Compare Strings in C++ Dynamic Binding in C++ Program to convert infix to postfix expression in C++ SET Data Structure in C++ Upcasting and Downcasting in C++ Reverse an Array in C++ Fast Input and Output in C++ Delete Operator in C++ Copy elision in C++ C++ Date and Time C++ Bitwise XOR Operator Array of sets in C++ Binary Operator Overloading in C++ Binary Search in C++ Implementing the sets without C++ STL containers Scope Resolution Operator in C++ Smart pointers in C++ Types of polymorphism in C++ Exception Handling in C++ vs Java Const Keyword in C++ Type Casting in C++ Static keyword in C++ vs Java Inheritance in C++ vs Java How to concatenate two strings in C++ Programs to Print Pyramid Patterns in C++ swap() function in C++ Structure of C++ Program Stringstream in C++ and its applications rand() and srand() in C / C++ C++ Ternary Operator C++ Scope of Variables While Loop Examples in C++ Star pattern in C++ using For Loops For Loop Examples in C++ Do-While Loop Examples in C++ Top 5 IDEs for C++ That You Should Try Once Assertions in C/C++ C++ Convert Int to String Continue in C++ While loop Diamond Pattern in C++ using For Loop How to Reverse a String in C++ using Do-While Loop How to Reverse a String in C++ using For Loop How to Reverse a String in C++ using While Loop Infinite loop in C++ Loops in C++ Returning Multiple Values from a Function using Tuple and Pair in C++ wcscpy(), wcslen(), wcscmp() Functions in C++ Auto keyword in C++ C++ 11 vs C++ 14 vs C++ 17 C++ STL (Standard Template Library) Differences Between C Structures and C++ Structures Divide by Zero Exception in C++ Dynamic Constructor in C++ Dynamic Memory Allocation in C++ Find the Size of Array in C/C++ without using sizeof() function Floating Point Operations and Associativity in C, C++ and Java Hello World Program in C++ How to create a table in C++ How to Setup Environment for C++ Programming on Mac Implementation of a Falling Matrix in C++ Message Passing in C++ Pointer to Object in C++ Templates in C++ vs Generics in Java Ways to Copy a Vector in C++ What does Buffer Flush mean in C++ sort() function in C++ Structure Sorting (By Multiple Rules) in C++ Similarities between C++ and Java std::distance in C++ Array program in C++ C++ Tricks for Competitive Programming Desired Capabilities in Selenium Web Driver in C++ Socket Programming in C++ Template Specialization in C++ Classes and Objects in C++ Convex hull Algorithm in C++ DES in C++ C++ vardiac() function Difference between Two Sets in C++ Difference between Exit and Return Structured Binding in C++ Differences between Local and Global Variable Bitwise Operator vs Logical Operator Difference between OOP and POP in C++ Fork in C++ Functors in C++ How to call a void function in C++ How to create a directory or folder in C/C++ How to create a library in C++ How to create a stack in C++ How to create the Processes with Fork in C++ How to Handle Divide by Zero Exception in C++ Lambda Expression in C++ Pattern programs in C++ Roadmap to C++ Programming Substring in C++ Virtual base class in C++ Bits stdc++.h in C++ Top 14 Best Free C++ IDE (Editor & Compiler) for Windows in 2022 Bitmasking in C++ Auto Keyword in C++ Features of OOPS in C++ Hospital Management Project in C++ How to Declare Unordered Sets in C++ How to Sort an Array in C++ Include Guards in C++ Iostream in C++ Method overriding in C++ How to run program in turbo c++ How to Use Getline in C++ Leap Year Program in C++ Naming Convention in C++ New Operator in C++ Nullptr in C++ Object Slicing in C++ Principles of Object-Oriented Programming in C++ Processing strings using std string stream in C++ Pure Virtual Function in C++ With Example Program Random Number Generator in C++ Singleton Design Pattern in C++ Size_t Data Type in C++ Skyline Problem in C++ System() function in C++ Web Development in C++ Data Hiding in C++ Difference between exit() and _Exit() in C++ Hashing in C++ Object in C++ Sum of all Elements between k1’th and k2’th Smallest Elements Virtual class in C++ Vector Size in C++ Top best IDEs for C/C++ Developers in 2022 Tensorflow in C++ Sliding Window Technique in C++ Reverse String Word-Wise in C++ Returning a Function Pointer from a Function in C/C++ RTTI in C++ Pthreads or POSIX Threads in C++ Reserved Keywords in C++ Passing a Vector to a function in C++ 10 Best C and C++ Books for Beginners & Advanced Programmers Add two numbers represented by two arrays in C++ Array of Object in C++ C++ Program For FCFS Containership in C++ Counting Frequencies of Array Elements in C++ Decltype type Specifier in C++ Dynamic _Cast in C++ Difference between int main() and int main(void) in C/C++ Depth First Search Program to Traverse a Graph in C++ Features and Use Of Pointers in C/C++ Fread Function in C++ Programming Fscanf Function in The C++ Functions in C++ With Types and Examples Gmtime Function in C/C++ How is Multiset Implemented in C++ How to Build a Program in C++ How to Declare a 2d Array Dynamically in C++ inheritance Program in C++ int Max and int Min in C/C++ is It Fine to Write Void Main Or Main in C/C++ How to create a button in C++ abs() function in C++ Compile Time Polymorphism in C++ Division in C++ Factorial of a Number in C++ using while Loop Multiset in C++ 4 Pillars of OOPs Approach in C++ Backtracking Time Complexity in C++ C++ Global Variable C++ Pipe Tutorial Observer Design Pattern in C++ Private Inheritance in C++ Pthread in C++ Parameters SDL library in C++ with Examples Pointers in C++ Abstract Factory Design Pattern in C++ Ascending order in C++ How the value is passed in C++ Call by Pointer in C++ Constexpr in C++ Deadlock in C++ Design Patterns in C++ Factory Method for Designing Pattern in C++ How to calculate size of string in C++ Name Mangling and extern in C++ Preventing Object Copy in C++ Program that produces different results in C and C++ Quick Sort in C++ Single Handling in C++ Type difference of Character literals in C VS C++ Use of Inheritance in C++ User-defined literals in C++ Vector methods in C++ Void * in C and C++ Zombie and Orphan Process in C++ Isprint() in C++ List and Vector in C++ List iterators in C++ Merging Two Vectors in C++ Sleep function in C++ Stoi function in C++ String erase() in C++ String Trim in C++ When should we write own Assignment operator in C++ C++ tcp client server example C++ tcp server example Early Binding and Late Binding in C++ Factory Design Pattern in C++ Fisher-Yates shuffle algorithm in C++ For Auto in C++ Group anagrams in C++ How to convert binary string to int in C++ How to convert string to float in C++ How to remove space from string in C++ How to use pair in C++ How to use the string find() in C++ Dynamic Casting in C++ 2D Vector Initialization in C++ C++ GUI Visual Studio C++ IPC C++ Macro Function Example C++ Permutation Overloading Stream Insertion in C++ Overloading array Index operator in C++ Operators that cannot be overloaded in C++ Operator overloading in C++ isprint() function in c++ Is_trivial function in C++ Is assignment operator Inherited in C++ div() function in C++ Default Assignment Operator and References in C++ Copy Constructor vs Assignment Operator in C++ Conversion Operator in C++ Array sum in C++ STL C++ Define Macro C++ Design C++ Factory Pattern TCP Client Server Example in C++ Convert String to Uppercase in C++ exit() and _Exit() in C and C++ Initializer list in C++ Iterator invalidation in C++ Lower bound in C++ Modulus of Two float numbers or double number Pass by value in C++ Set insert function in C++ Std partition_point in C++ Unary Operator Overloading in C++ Using Default Arguments with Virtual Functions Virtual Functions and Runtime Polymorphism What is endl in C++ What is Unary Operator Overloading in C++ Which operators cannot be overloaded in C++ C++ Program to Divide the String Into N equal Parts Gray Code to Binary Code in C++ How to get the value of pi in C++ Multimap value_comp() function in C++ Vector of Vectors in C++ Naïve Bayes Algorithm in C++ Minimum Cost Path Problem in C++ 10 C++ Programming Tricks You Should Know btowc() function in C++ forward_list::cend() in C++ Unordered_multimap max_load_factor() function in C++ Cpp_int in c++ Dynamic Objects in C++ FLOCK() FUNCTION IN C++ Generate Random Double Numbers in C++ How to Assign Infinity to a Number in C++ Jump statements in C++ Multipath inheritance in C++ Out of Range Exception in C++ Size of Class in C++ Size of string in C++ std::binary_negate in c++ Thread_local in C++ Tokenizing a String in C++ Ancestors of a Node in Binary Search Tree C++ program for Double to String Conversion C++ Program to Demonstrate Use of Formatting Flags on Float Output Clamp in C++ K-Dimensional Tree in C++ Mutable Lambda in C++ Power Set in C++ Program to Find Sum of Geometric Progression Std::Back_inserter in C++ Strpbrk() function in C++ Size of int in C++ TYPES OF MANIPULATORS IN C++ Double colon in C++ How to sort vector in C++ How to use Setprecision in C++ How to write a Vector in C++ Insertion in Splay Tree in C++ Merge Sort Algorithm in C++ Printing a Character using ASCII value in C++ Regex in C++ Size of Data Types in C++ Sqrtf() function in C++ Static Casting in C++ Using Range in Switch Case in C++ wcstoimax() and wcstoumax() function in C++ What is float in C++ What is the Diamond Problem in C++ Best way to learn C++ ios setstate() function in C++ Nested Namespace in C++ Single Inheritance in C++ std::fixed, std::scientific, std::hexfloat, std::defaultfloat in C++ StringStream in C++ for Decimal to Hexadecimal and back The OFFSETOF() macro in C++ Difference between std::next and std::advance in C++ Hiding of all overloaded methods with same name in base class in C++ C++ program to concatenate two strings using operator overloading Difference between array::fill() and array::swap() in C++ Difference between Friend Function and Virtual Function in C++ Semaphores in C++ Seekg in C++ UDP server- client implementattion in C++ What is long long in C++ CSV file management using C++ Toggle bits of a number except first and last bits in C++ Trailing Return Type C++ 11 Binary search implementation in C++ Different Versions of C++ What is Cascading in C++ Background Colour in C++ BOOL DATATYPE IN C++ BIT VECTORS IN C++ Literals in C++ Application of pointer in C++ Index with minimum sum of prefix and suffix sums in an array in C++ Maximum sum Bi-tonic sub-sequence in C++ std::optional in C++ C/C++ program for triangular matchstick number COUT COMMAND IN C++ LANGUAGE Adjacency matrix program in C++ language Difference between Null String and Empty String in C++ Character data type in c++ Constructors in Inheritance C++ Comma Operator Overloading in C++ Structure and Class in C++ Template Definition in C++ Tree Data Structure in C++ Typename in C++ C++ program to implement the bin packing algorithm How to merge multiple std::sets into a single std::set in C++? Stack Clear C++ C++ Friend Class Seekg in C++ Semaphores in C++ C++ Exceptions Difference Between C and C++ Double-linked list program in C++ Color Code in C++ CRC Program in C++ Anti-Clockwise spiral traversal of a binary tree in C++ Advantages of OOP in C++ Cryptarithmetic Puzzle in C++ Angular sweep algorithm in C++

Multiset in C++

Introduction

Multisets are part of the C++ STL, or Standard Template Library. In C++, a multiset is a set of associative containers that hold ordered items. Items in a multiset can be added or withdrawn, but their values cannot be altered (The items are also known as the values and are always constant).

What is a Set?

A set is a type of data structure that is used in C++ programming to hold the unique values of lists and to automatically order their elements. Ascending order is the default when ordering something.

We use the insert() function to insert the components. The set will only store one instance of an element, and if the same value is inserted more than once, duplicates will be promptly deleted.

Using the erase() method, the Set's components are removed.

The method erase(s.begin(),s.find(x)) removes every element in the set, starting at the beginning and ending with x.

What is Multiset in C++:

In the C++ programming language, a multiset is a container that stores elements in a predetermined sequence and permits many elements to share the same value.

 An element's value in a multiset also serves as a means of identification (the value is the key of type T).

If there are more than two items or a large number of components with similar values, you can store them in a multiset in a specific order.

Once added to the multiset, these values cannot be modified; they serve to identify the items with their respective key value and pair value. More elements can be added and removed at any moment. Thus, one condition can be satisfied.

Due to multisets' support for insertion and deletion operations, the storage requirements are dynamically managed.

The key comparison function compare() is utilized while sorting multisets. Search, insert, and remove operations all have logarithmic complexity.

The insertion sequence of the elements that compare equivalents has stayed the same since the release of C++11.

A container, an aware allocator container, an associative container, and a reversible container are essential for multisets.

Binary search trees are where multisets are most commonly used.

Once entered into the container, the value of the elements in multisets cannot be changed; as a result, the items are always constant. But it is possible to conduct the insertion and removal procedure.

Multiset in C++

Syntax of Multiset:

template<class P,                   // multiset::key_type/value_type  
class Comp = less<P>              // multiset::key_compare/value_compare  
class Alloc = allocator<P>>       // multiset::allocator_type
> class multiset;

where P = multiset:: key_type/value type.

It is crucial for us to include the set's header file when we utilize a multiset.

To enable all of the multiset's features, we use #include <set>.

  • Multiset container characteristics:

1 - Associative: Rather than being in the container's absolute position, their key reference elements are present in associative containers.

2- Ordered: The components of the multiset container are always arranged in a specific order. According to a predetermined order, the container assigns a place to every element that is introduced.

3 - Multiple equivalent keys: According to this trait, a number of objects in the multisets may have identical keys.

4 - Allocator-aware: This container often employs an allocator object to address the storage requirements on a dynamic basis.

How to Make a Multiset?

Use C++'s multiset class if require a set's sorting capabilities but also wish to support repetitions in the container. We can apply the same functions we did for sets to multisets.

When you don't need a key/value combination but still require the search features of a set with several elements per key, you can use a multiset in C++.

Multiset-specific functions

  • begin(): Responsible for bringing an iterator back to the first item of the multiset.

Parameters: None

Return type: iterator

  • end(): Accountable for returning an iterator to the theoretical item following the multiset's last item.

Parameters: None

Return type: iterator

  • size(): responsible for returning the multiset's entire number of elements.

Parameters: None

Return type: integer - total number of elements in the multiset

  • insert(element): adds a new element to the multiset.

Time Complexity: O(logN) where N is the size of the multiset

Parameters: the element that needs to be inserted

Return type: void

  • find(element): If the element is located, the function returns an iterator pointing to it; otherwise, it returns an iterator pointing to the multiset's end.

Parameters: the element which needs to be found

Return type: iterator

  • clear(): It eliminates every element of the multiset.

Parameters: None

Return type: void

  • empty(): It informs us whether or not the multiset is empty.

Parameters: None

Return type: Boolean; true if a multiset is empty; otherwise, false.

  • erase(value): Eliminate components from the multiset.

Time Complexity: O(logN) where N represents the multiset's size.

Parameters: the value to be deleted or iterators indicating the intervals between which the value should be erased.

Return type: void

Example Program

#include<iostream>
#include<set>
using namespace std;


int main() {
  multiset <int> c1;
  multiset <int, greater <int> > c2;
  for (int i = 0; i < 6; i++) {
    c1.insert(i + 1);
  }
  for (int i = 0; i < 6; i++) {
    c1.insert(i + 1);
  }
  for (int i = 0; i < 6; i++) {
    c2.insert((i + 1) * 10);
  }
  for (int i = 0; i < 6; i++) {
    c2.insert((i + 1) * 10);
  }
  set <int> ::iterator sec;
  for (sec = c1.begin(); sec != c1.end(); sec++)
    cout << * sec << " ";
  cout << '\n';
  for (sec = c2.begin(); sec != c2.end(); sec++)
    cout << * sec << " ";
  cout << endl;


  c1.erase(2);
  c2.erase(c2.begin(), c2.find(15));
  cout << "the size of set is after an element has been erased." << c1.size() << '\n';
  int value = 8;
  if (c1.find(value) != c1.end())
    cout << "The set includes " << value << endl;
  else
    cout << "The set does not include " << value << endl;
  cout << "New elements of set are ";
  for (sec = c1.begin(); sec != c1.end(); sec++)
    cout << * sec << " ";
  cout << endl;


  c1.clear();
  if (c1.empty() == true) {
    cout << "set is empty!";
  }
  return 0;
}

Explanation:

  • In the main() function, we have declared a multiset of integer type with the name of “c1”.
  • We have declared a second multiset of integer type with the name "c2". This c2 is a std::multiset, storing int and using a comparison functor of the type std::greater<int>.
  • In the c2 multiset, we stored the elements in descending order because we have a comparison function.
  • In the for loop, we initialized “i” and have a condition that “i” must be less than 6. so in c1, we stored the values from 1 to 6 twice and in c2 from 10, 20 to 60 twice, but in reverse order ( descending order)
  • We created an iterator, 'sec', which will iterate over the set to get the values. First, we iterated the c1 set, and from beginning to ending (using being() and end() functions), we printed the values of c1.
  • So, we got the output as 1,1,2,2,3,3,4,4,5,5,6,6 in c1.
  • In the same way, we iterated the set c2 and printed the values, which are: 60,60,50,50,40,40,30,30,20,20,10,10.
  • In the set c1, we deleted values at the second index, which were: 2,2, and printed the size of set c1, which is 12-2 = 10
  • for c2, we started deleting the values until we found the value 15, but as we know, 15 is not present in the c2, so all the values from the beginning to end will be deleted in the c2.
  • For c1, we compare if the value 8 is present in the set or not since it is not present, so we terminated the if condition and printed the statement of the else condition.
  • Now using an iterator, we printed the values of set c1.
  • We use the clear() function for the set c1, which will remove all the elements in c1, and c1 is now empty so that it will return true for the function empty().

Program Output:

Multiset in C++

Removing Element from multiset

Program:

#include <iostream>
#include<set>
using namespace std;


int main()
{
       // Integer type multiset with the name x.
       multiset<int> x;
       // Inserting of integers in the multiset.
	x.insert(10);
	x.insert(10);
	x.insert(10);
	x.insert(10);
        // the multiset is being updated with the same values.
	// the output that is produced is 4.
	cout << x.count(10) << endl;


	// removing a single instance from a group of numerous instances.


	//By using the erase function, it will only remove 1 value of 10 from the multiset.
	x.erase(x.find(10));


	//the output that is produced is 3.
	cout << x.count(10) << endl;


	// Let's attempt to remove every element from the multiset.
	// deleting every instance of the number 10
	x.erase(10);


	// Due to the multiset's deletion of every occurrence of a value, the output we receive will be equal to 0.
	cout << x.count(10) << endl;


	return 0;
}

Explanation:

  • In the main() function, we have declared a multiset of integer type with the name of “x”.
  • Then we inserted the elements in the multiset.
  • In the multiset, we insert the same type of value, which is 10.
  • Then we used a count() function to determine the multiple values of the same key. Then we get the output is 4.
  • After that we removed the single instance from the numerous multiset instance. For this, we have used erase(find()) function.
  • This erase(find()) function erase only 1 value of 10 from the multiset.
  • Then we try to remove all instance from the multiset. For this, we used erase() function.
  • Due to this, the output we receive will equal 0 because all instance of the value is deleted from the multiset.

Program Output:

Multiset in C++

Using size(), find the size of a multiset in C++:

#include<iostream>
#include<set>
using namespace std;


int main()
{
// Integer type multiset with the name x.
	multiset<int> x;


	// with the help of the insert() function, we will insert the element in a multiset container.


       // Inserting first element.
	x.insert(15);
       // Inserting second element.
	x.insert(16);
       // Inserting third element.
	x.insert(17);


	cout << "The multiset's size is equivalent to: " << x.size(); 
       // inserting Four elements
	x.insert(10);
	x.insert(12);
	x.insert(14);
	x.insert(16);


	cout <<endl << "The multiset's size is equivalent to: " << x.size();
	x.insert(5);
	x.insert(6);
    
    
       // Calculating the size of the multiset with the help of the size() function.
	cout << endl << "The multiset's size is equivalent to: " << x.size();
	return 0;
}

Explanation:

  • In the main() function, we have declared a multiset of integer type with the name of “x”.
  • Then we inserted the elements in the multiset container with the help of the insert() function.
  • The first element, which has a value of 15, is inserted first. The second element, which has a value of 16, is inserted next. Finally, the third element, which has a value of 17, is inserted.
  • The size of the multiset is then calculated with the aid of the size() function. The size() function gives the size of the multiset is 3.
  • Next, the four elements with different types of values—10, 12, 14, and 16—are added to the multiset container.
  • Then we again calculated the size of the multiset, using the size() function, and we will get the size of the multiset is 7.
  • Next, the two elements with different types of values – 5 and 6 are added to the multiset container.
  • And after calculating the size of the multiset, using the size() function, we will get the size of the multiset is 9.

Program Output:

Multiset in C++

Using the clear() function, all of the elements are removed from the Multiset Container.

Program:

#include <iostream>
#include<set>
using namespace std;


int main()
{
        // Initializing the array named b with different values
	int b[] = { 1, 2, 3, 4, 5 };


	//initializes the set using the values of the b array.
	multiset<int> x(b, b + 5);


	//printing every element in the set.
	cout << "The multiset's elements are listed as follows: ";
	for (auto i = x.begin(); i != x.end(); i++)
		cout << *i << " ";


	cout << "After using clear() function, the size is equal to: ";


	// erases off every element that is present in the multiset.
	x.clear();
	cout << x.size();


	return 0;
}

Explanation:

  • We initialized an array with the name "b" in the main() function, and we initialized various values in this array.
  • We have 5 values in array b, and we declared a multiset of integer type which will contain the values from array b
  • It will contain the initial 5 values of array b as we have declared it to b+5.
  • now it will also contain the values: 1,2,3,4,5
  • using the iterator, we printed the values of the multiset.
  • Now we used the clear() function on the multiset, which will remove all the elements from the multiset, and then we print its size using the size() function, which will return 0.

Program Output:

Multiset in C++

Template Parameters:

The key, Allocator, and comparison class are the three template parameters.

  • Key: The key controls the type of elements contained in the container. Each component of a multiset is its key.
  • Compare: A class that receives two arguments of the same type as the container elements returns a boolean value. When x is to come before y in a strict weak ordering action, the expression comp(x,y), where x comp is an object of this type, and x and y are parts of the container, should return true. The class in question may implement a function pointer or a function call operator. When using the less-than operator, the default value of less is equivalent (all times).
  • Allocator: The kind of allocator object determines the allocation paradigm for storage. As a default, the allocator class template for type Key is utilized, which specifies the most basic, value-neutral memory allocation paradigm.

Conclusion:

Multisets are included in the C++ STL (Standard Template Library).

Multisets are sorted value storage associative containers, similar to Sets (the value is the key of type T).

Multisets, unlike sets, can contain a variety of redundant keys.

Multisets, by default, compare the operator and the keys.

Items in a multiset's value can be added or subtracted from it but not modified (The items are always const).

A key of type T that is the content of a multiset is allowed, unlike Sets, to contain additional keys.