libstdc++
safe_unordered_container.h
Go to the documentation of this file.
1// Safe container implementation -*- C++ -*-
2
3// Copyright (C) 2011-2025 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/** @file debug/safe_unordered_container.h
26 * This file is a GNU debug extension to the Standard C++ Library.
27 */
28
29#ifndef _GLIBCXX_DEBUG_SAFE_UNORDERED_CONTAINER_H
30#define _GLIBCXX_DEBUG_SAFE_UNORDERED_CONTAINER_H 1
31
32#include <debug/assertions.h>
33#include <debug/macros.h>
34#include <debug/functions.h>
36
37namespace __gnu_debug
38{
39 /**
40 * @brief Base class for constructing a @a safe unordered container type
41 * that tracks iterators that reference it.
42 *
43 * The class template %_Safe_unordered_container simplifies the
44 * construction of @a safe unordered containers that track the iterators
45 * that reference the container, so that the iterators are notified of
46 * changes in the container that may affect their operation, e.g., if
47 * the container invalidates its iterators or is destructed. This class
48 * template may only be used by deriving from it and passing the name
49 * of the derived class as its template parameter via the curiously
50 * recurring template pattern. The derived class must have @c
51 * iterator and @c const_iterator types that are instantiations of
52 * class template _Safe_iterator for this container and @c local_iterator
53 * and @c const_local_iterator types that are instantiations of class
54 * template _Safe_local_iterator for this container. Iterators will
55 * then be tracked automatically.
56 */
57 template<typename _Container>
58 class _Safe_unordered_container : public _Safe_unordered_container_base
59 {
60 private:
61 _Container&
62 _M_cont() noexcept
63 { return *static_cast<_Container*>(this); }
64
66 _M_self() const
67 { return this; }
68
69 protected:
70 void
71 _M_invalidate_locals()
72 {
73 auto __local_end = _M_cont()._M_base().cend(0);
75 [__local_end](__decltype(__local_end) __it)
76 { return __it != __local_end; });
77 }
78
79#if __cplusplus > 201402L
80 template<typename _ExtractKey, typename _Source>
81 struct _UContInvalidatePred
82 {
83 template<typename _Iterator>
84 bool
85 operator()(_Iterator __it) const
86 { return _M_source.count(_ExtractKey{}(*__it)) == 0; }
87
88 const _Source& _M_source;
89 };
90
91 template<typename _ExtractKey, typename _Source>
92 struct _UMContInvalidatePred
93 {
94 template<typename _Iterator>
95 bool
96 operator()(_Iterator __it) const
97 {
98 auto __rng =
99 _M_source._M_base().equal_range(_ExtractKey{}(*__it));
100 for (auto __rit = __rng.first;
101 __rit != __rng.second; ++__rit)
102 {
103 if (__it == __rit)
104 return false;
105 }
106
107 return true;
108 }
109
110 const _Source& _M_source;
111 };
112
113 template<typename _Source, typename _InvalidatePred>
114 struct _UContMergeGuard
115 {
116 _UContMergeGuard(_Source& __src) noexcept
117 : _M_source(__src), _M_size(__src.size()), _M_pred { __src }
118 { }
119
120 _UContMergeGuard(const _UContMergeGuard&) = delete;
121
122 ~_UContMergeGuard()
123 {
124 const std::size_t __size = _M_source.size();
125 if (__size == _M_size)
126 return;
127
128 __try
129 {
130 if (__size == 0)
131 _M_source._M_invalidate_all();
132 else
133 {
134 _M_source._M_invalidate_if(_M_pred);
135 _M_source._M_invalidate_local_if(_M_pred);
136 }
137 }
138 __catch(...)
139 {
140 _M_source._M_invalidate_all();
141 }
142 }
143
144 _Source& _M_source;
145 const std::size_t _M_size;
146 _InvalidatePred _M_pred;
147 };
148
149 template<typename _ExtractKey, typename _Source>
150 static _UContMergeGuard<_Source,
151 _UContInvalidatePred<_ExtractKey, _Source>>
152 _S_uc_guard(_ExtractKey, _Source& __src)
153 {
154 typedef _UContInvalidatePred<_ExtractKey, _Source> _InvalidatePred;
155 return _UContMergeGuard<_Source, _InvalidatePred>(__src);
156 }
157
158 template<typename _ExtractKey, typename _Source>
159 static _UContMergeGuard<_Source,
160 _UMContInvalidatePred<_ExtractKey, _Source>>
161 _S_umc_guard(_ExtractKey, _Source& __src)
162 {
163 typedef _UMContInvalidatePred<_ExtractKey, _Source> _InvalidatePred;
164 return _UContMergeGuard<_Source, _InvalidatePred>(__src);
165 }
166#endif // C++17
167
168 public:
169 void
170 _M_invalidate_all()
171 {
172 auto __end = _M_cont()._M_base().cend();
173 this->_M_invalidate_if([__end](__decltype(__end) __it)
174 { return __it != __end; });
175 _M_invalidate_locals();
176 }
177
178 /** Invalidates all iterators @c x that reference this container,
179 are not singular, and for which @c __pred(x) returns @c
180 true. @c __pred will be invoked with the normal iterators nested
181 in the safe ones. */
182 template<typename _Predicate>
183 void
184 _M_invalidate_if(_Predicate __pred);
185
186 /** Invalidates all local iterators @c x that reference this container,
187 are not singular, and for which @c __pred(x) returns @c
188 true. @c __pred will be invoked with the normal local iterators
189 nested in the safe ones. */
190 template<typename _Predicate>
191 void
192 _M_invalidate_local_if(_Predicate __pred);
193 };
194} // namespace __gnu_debug
195
197
198#endif
GNU debug classes for public use.
Base class for constructing a safe unordered container type that tracks iterators that reference it.