1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// { dg-do run { target c++17 } }
// { dg-require-effective-target std_allocator_new }
// Copyright (C) 2021-2022 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// libstdc++/96088
#include <string_view>
#include <string>
#include <unordered_set>
#include <testsuite_hooks.h>
#include <replacement_memory_operators.h>
static constexpr std::initializer_list<const char*> lst = {
"long_str_for_dynamic_allocating"
};
void
test01()
{
__gnu_test::counter::reset();
std::unordered_multiset<std::string,
std::hash<std::string_view>,
std::equal_to<std::string_view>> foo;
foo.insert(lst.begin(), lst.end());
VERIFY( foo.size() == 1 );
VERIFY( __gnu_test::counter::count() == 3 );
VERIFY( __gnu_test::counter::get()._M_increments == 3 );
}
void
test02()
{
__gnu_test::counter::reset();
std::unordered_multiset<std::string> foo;
foo.insert(lst.begin(), lst.end());
VERIFY( foo.size() == 1 );
VERIFY( __gnu_test::counter::count() == 3 );
VERIFY( __gnu_test::counter::get()._M_increments == 3 );
}
int
main()
{
test01();
test02();
return 0;
}
|
