• Home
  • C++
  • STL
  • C++11
  • Multithreading
  • Python
  • Data Science
  • Design Patterns
  • About Us
  • Privacy Policy

thispointer.com

  • C++11 Tutorials
  • Python
  • C++ Tutorials
  • STL
  • Multithreading
  • Data Science
  • Boost Library
    • Boost Date Time Library
    • Boost String Algorithms Library
  • Design Patterns
  • java
  • GDB
  • Datastructure
    • Binary Search Tree
    • Binary Tree
    • Linked List
  • Subscribe
You are here: Home » C++ 11 » unordered_set

How to use Unordered_set with User defined classes – Tutorial & Example

Varun July 10, 2016 How to use Unordered_set with User defined classes – Tutorial & Example2016-07-10T16:51:05+00:00 C++ 11 No Comment
In this article we will discuss how to use std::unordered_set with User defined classes. (more…)
Continue Reading »

Using unordered_set with custom hasher and comparision function

Varun July 10, 2016 Using unordered_set with custom hasher and comparision function2016-07-10T16:50:43+00:00 C++ 11 No Comment
In this article we will discuss how to use std::unordered_set custom hasher and comparision function. (more…)
Continue Reading »

How to Search an element in unordered_set

Varun July 9, 2016 How to Search an element in unordered_set2016-07-09T12:04:49+00:00 C++ 11 No Comment
In this article we will see how to search if an element is present in an unordered_set or not. (more…)
Continue Reading »

How to initialize an unordered_set in C++11

Varun July 9, 2016 How to initialize an unordered_set in C++112016-07-09T11:57:32+00:00 C++ 11 No Comment
In this article we will discuss the different ways to initialize an unordered_set. (more…)
Continue Reading »

How to Insert elements in an unordered_set in C++11

Varun July 6, 2016 How to Insert elements in an unordered_set in C++112016-07-06T08:52:55+00:00 C++ 11 No Comment
std::unordered_set provides the different overloaded versions of insert() member function to insert elements (more…)
Continue Reading »

std::unordered_set Basic Usage & Example

Varun July 3, 2016 std::unordered_set Basic Usage & Example2016-07-03T23:43:09+00:00 C++ 11 No Comment
std::unordered_set is an STL container and its introduced in C++11. It provides a functionality of a Set it can contains the unique elements only. unordered_set stores the elements internally using a Hash Table. (more…)
Continue Reading »

Advertisements

Advertisements

Subscribe For latest Tutorials

* indicates required

Advertisements

Advertisements

Search

Python : List

  • Check if an item exists in List
  • Check if a list contains all the elements of other list
  • Create a List and initialize with values
  • How to Iterate over a List
  • Insert an element at specific index in List
  • Sort a list of tuples by 2nd Item
  • Sort a list of strings
  • Add an element in list | append() vs extend()
  • Check if all elements in a List are same
  • Merge / Join two or more lists
  • Remove Duplicates from a List
  • Convert a list to string
  • Remove element from a list by value or Index
  • Remove multiple elements from list

Python : Dictionary

  • Creating Dictionaries in Python
  • Iterating over Dictionaries in Python
  • Check if a key exists in Dictionary
  • Get list of all the keys in Dictionary
  • Get list of all the Values in a Dictionary
  • Remove multiple keys in Dictionary while Iterating
  • Remove a key from Dictionary
  • Add key/value pairs in Dictionary
  • Find keys by value in Dictionary
  • Sort a Dictionary by key or Value
  • Copy a dictionary | Shallow vs Deep Copy
  • Convert a list to dictionary

Python Strings

  • Access characters in string by index in Python
  • Iterate over the characters in string
  • How to Replace characters in a string ?

Java – Hashmap

  • What is Hashing and Hash Table?
  • Associating Multiple values with same Key
  • Remove elements while Iterating
  • Update the value of an existing key
  • Get all keys by a value in HashMap

Java – HashSet

  • What is Hashing and Hash Table?
  • Create and add elements in a HashSet
  • Iterate over a HashSet
  • Search for an element in HashSet
  • Merge two HashSets
  • Initializing HashSet from an Array
  • Convert a HashSet into an Array
  • Merge an Array in a HashSet

Java Interview Questions

  • Method Overriding Tutorial
  • Overriding with Different Return Type
  • Calling Base class’s overridden method
  • Preventing Method Overriding
  • Need of preventing Method Overriding

C++11 – Utilities

  • std::bind
  • auto specifier
  • Variadic Templates

C++11 – Unordered Set

  • 1.) unordered_set Basic Example
  • 2.) Initializing an unordered_set
  • 3.) Inserting elements in an unordered_set
  • 4.) Searching an element in unordered_set
  • 5.) unordered_set – Custom Hasher & Comparator
  • 6.) Unordered_set & User defined classes

C++11 – UnorderedMap

  • Basic Usage Detail and Example
  • Initializing an unordered_map
  • Searching in unordered_map
  • Insert elements in unordered_map
  • Erasing an element
  • Erase elements while iterating
  • std::map vs std::unordered_map

C++11 Smart Pointers

  • shared_ptr<> Tutorial and Examples
  • shared_ptr and Custom Deletor
  • shared_ptr vs raw pointer
  • Create shared_ptr objects carefully
  • weak_ptr Tutorial | shared_ptr and Cyclic References
  • unique_ptr<> Tutorial and Examples

C++11 Multithreading

  • Part 1: Three Ways to Create Threads
  • Part 2: Joining and Detaching Threads
  • Part 3: Passing Arguments to Threads
  • Part 4 : Sharing Data & Race Conditions
  • Part 5 : Fixing Race Conditions using mutex
  • Part 6 : Need of Event Handling
  • Part 7: Condition Variables
  • Part 8: std::future and std::promise
  • Part 9: std::async Tutorial & Example
  • Part 10: std::packaged_task<> Tutorial

C++11 Rvalue References

  • lvalue vs rvalue
  • Is rvalue immutable in C++?
  • What is rvalue reference in C++11
  • Move Contsructor

Advertisement




Design Patterns

  • Behavioral Design Patterns
    • Observer Design Pattern
    • State Design Pattern
    • Strategy Design Pattern
  • Structural Design Patterns
    • Composite Design Pattern
    • Flyweight Design Pattern
  • Creational Design Patterns
    • Factory Method Design Pattern

Pointers

  • Pointer vs Refrence
  • Allocating 2D Array Dynamically

Callbacks in C++

  • Function Pointers
  • Function Objects & Functors

C++ Strings

  • Find and Replace all occurrences of a string
  • Find all occurrences of a sub string
  • Case Insensitive string::find
  • Convert First Letter of each word to Upper Case
  • Converting a String to Upper & Lower Case
  • Trim strings in C++
  • C++ : How to split a string using String and character as Delimiter?
  • startsWith() Implementation
  • endsWith() Implementation
  • Remove Sub Strings from String

C++ Memory Manangement

  • Memory Leaks
  • new and delete operator
  • delete vs []delete
  • Out Of Memory Errors
  • Overload new & delete
  • Restrict Dynamic Deletion
  • Placement new operator
  • Delete ‘this’ pointer

Polymorphism

  • Virtual Functions
  • vTable and vPointer

STL – Vector

  • 1.) What’s std::vector and why to use it?
  • 2.) Different ways to initialize a vector
  • 3.) How does std::vector works internally
  • 4.) User Defined Objects & std::vector
  • 5.) How to use vector efficiently in C++?
  • 6.) std::vector and Iterator Invalidation
  • 7.) Remove repeated elements from a vector
  • 8.) Fill a vector with random numbers
  • 9.) Hidden cost of std::vector
  • 10.) Adding elements in Vector

STL – Deque

  • 1.) What is std::deque and how deque works internally.
  • 2.) deque vs vector : What to choose ?

STL – List

  • 1.) std::list Internals & Usage Details
  • 2.) List vs Vector
  • 3.) Different ways to Initialize a list
  • 4.) Erase elements using iterators
  • 5.) Remove elements while Iterating
  • 6.) Remove elements based on External Criterion
  • 7.) Get element by index in List
  • 8.) Searching an element in std::list
  • 9.) Different Ways to iterate over a List
  • 10.) Sorting a List & custom Comparator

STL – Set

  • 1.) C++ Set basic example and Tutorial
  • 2.) Using std::set with user defined classes
  • 3.) std::set and external Sorting criteria | Comparator
  • 4.) Access Element by index in Set
  • 5.) How to insert elements in Set
  • 6.) How to iterate over a Set
  • 7.) Removing an element from Set
  • 8.) Erase elements while Iterating & Generic erase_if()

STL – Map

  • 1.) std::map Usage Detail with examples
  • 2.) std::map and Comparator
  • 3.) std::map & User defined class objects as keys
  • 4.) Set vs Map
  • 5.) How to Iterate over a map in C++
  • 6.) Map Insert Example
  • 7.) Iterate a map in reverse order
  • 8.) Check if a key exists in a Map
  • 9.) Search by value in a Map
  • 10.) Erase by Key | Iterators
  • 11.) C++ Map : Operator []
  • 12.) Erase by Value or callback
  • 13.) copy all Values from a Map to vector

STL Multimap

  • MultiMap Example and Tutorial
  • multimap::equals_range – Tutorial

STL Algorithms

  • std::sort Tutorial & Example
  • std::unique Tutorial & Example
  • 1.) Using std::find & std::find_if with User Defined Classes
  • 2.) Iterating over a range of User Defined objects and calling member function using std::for_each

Terms and Conditions

  • Terms and Conditions Policy
Copyright ©2018. thispointer.com