Author:
Unordered Set⚓︎
This data structure is used for the case we DON'T need the key-value pairs like in the unordered_map. It is a easy way to implement presence/absence
Directory⚓︎
insert()⚓︎
count()⚓︎
Details
Used to check if an element is present in the container or not. The function returns 1
if the element is present in the container; otherwise, it returns 0
.
Equals to return (Set.find(<element>) != Set.end());
. Same performance. See find().