.. SPDX-FileCopyrightText: 2019-2020 Intel Corporation .. .. SPDX-License-Identifier: CC-BY-4.0 ================ Deduction guides ================ Where possible, constructors of ``concurrent_unordered_set`` support class template argument deduction (since C++17): .. code:: cpp template >, typename KeyEqual = std::equal_to>, typename Allocator = tbb_allocator>> concurrent_unordered_set( InputIterator, InputIterator, map_size_type = /*implementation_defined*/, Hash = Hash(), KeyEqual = KeyEqual(), Allocator = Allocator() ) -> concurrent_unordered_set, Hash, KeyEqual, Allocator>; template concurrent_unordered_set( InputIterator, InputIterator, map_size_type, Allocator ) -> concurrent_unordered_set, std::hash>, std::equal_to>, Allocator>; template concurrent_unordered_set( InputIterator, InputIterator, Allocator ) -> concurrent_unordered_set, std::hash>, std::equal_to>, Allocator>; template concurrent_unordered_set( InputIterator, InputIterator, Hash, Allocator ) -> concurrent_unordered_set, Hash, std::equal_to>, Allocator>; template , typename KeyEqual = std::equal_to, typename Allocator = tbb_allocator>> concurrent_unordered_set( std::initializer_list, map_size_type = /*implementation-defined*/, Hash = Hash(), KeyEqual = KeyEqual(), Allocator = Allocator() ) -> concurrent_unordered_set; template concurrent_unordered_set( std::initializer_list, map_size_type, Allocator ) -> concurrent_unordered_set, std::equal_to, Allocator>; template concurrent_unordered_set( std::initializer_list, map_size_type, Hash, Allocator ) -> concurrent_unordered_set, Allocator>; Where the type ``map_size_type`` refers to the ``size_type`` member type of the deduced ``concurrent_unordered_set`` and the type alias ``iterator_value_t`` is defined as follows: .. code:: cpp template using iterator_value_t = typename std::iterator_traits::value_type; **Example** .. code:: cpp #include #include #include struct CustomHasher {...}; int main() { std::vector v; // Deduces s1 as concurrent_unordered_set tbb::concurrent_unordered_set s1(v.begin(), v.end()); // Deduces s2 as concurrent_unordered_set; tbb::concurrent_unordered_set s2(v.begin(), v.end(), CustomHasher{}); }