41 #ifndef PB_DS_DEBUG_MAP_BASE_HPP
42 #define PB_DS_DEBUG_MAP_BASE_HPP
58 template<
typename _CharT,
typename _Traits,
typename _Tp1,
typename _Tp2>
59 inline std::basic_ostream<_CharT, _Traits>&
60 operator<<(std::basic_ostream<_CharT, _Traits>& __out,
61 const std::pair<_Tp1, _Tp2>& p)
62 {
return (__out <<
'(' << p.first <<
',' << p.second <<
')'); }
64 #define PB_DS_CLASS_T_DEC \
65 template<typename Key, typename Eq_Fn, typename Const_Key_Reference>
67 #define PB_DS_CLASS_C_DEC \
68 debug_map_base<Key, Eq_Fn, Const_Key_Reference>
71 template<
typename Key,
typename Eq_Fn,
typename Const_Key_Reference>
75 typedef Const_Key_Reference key_const_reference;
76 typedef std::_GLIBCXX_STD_C::list<Key> key_repository;
77 typedef typename key_repository::size_type size_type;
78 typedef typename key_repository::iterator iterator;
79 typedef typename key_repository::const_iterator const_iterator;
89 insert_new(key_const_reference);
92 erase_existing(key_const_reference);
98 check_key_exists(key_const_reference,
const char*,
int)
const;
101 check_key_does_not_exist(key_const_reference,
const char*,
int)
const;
104 check_size(size_type,
const char*,
int)
const;
109 template<
typename Cmp_Fn>
118 assert_valid(
const char*,
int)
const;
121 find(key_const_reference)
const;
124 find(key_const_reference);
126 key_repository m_keys;
138 : m_keys(other.m_keys), m_eq(other.m_eq)
149 insert_new(key_const_reference r_key)
153 if (find(r_key) != m_keys.end())
155 std::cerr <<
"insert_new key already present " << r_key << std::endl;
161 m_keys.push_back(r_key);
165 std::cerr <<
"insert_new " << r_key << std::endl;
175 erase_existing(key_const_reference r_key)
178 iterator it = find(r_key);
179 if (it == m_keys.end())
181 std::cerr <<
"erase_existing" << r_key << std::endl;
201 check_key_exists(key_const_reference r_key,
202 const
char* __file,
int __line)
const
204 assert_valid(__file, __line);
205 if (find(r_key) == m_keys.end())
207 std::cerr << __file <<
':' << __line <<
": check_key_exists "
208 << r_key << std::endl;
216 check_key_does_not_exist(key_const_reference r_key,
217 const char* __file,
int __line)
const
219 assert_valid(__file, __line);
220 if (find(r_key) != m_keys.end())
224 cerr << __file <<
':' << __line <<
": check_key_does_not_exist "
233 check_size(size_type size,
const char* __file,
int __line)
const
235 assert_valid(__file, __line);
236 const size_type keys_size = m_keys.size();
237 if (size != keys_size)
239 std::cerr << __file <<
':' << __line <<
": check_size "
240 << size <<
" != " << keys_size << std::endl;
251 m_keys.
swap(other.m_keys);
252 std::
swap(m_eq, other.m_eq);
259 find(key_const_reference r_key)
const
262 typedef const_iterator iterator_type;
263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it)
264 if (m_eq(*it, r_key))
272 find(key_const_reference r_key)
275 iterator it = m_keys.begin();
276 while (it != m_keys.end())
278 if (m_eq(*it, r_key))
288 assert_valid(
const char* __file,
int __line)
const
290 const_iterator prime_it = m_keys.begin();
291 while (prime_it != m_keys.end())
293 const_iterator sec_it = prime_it;
295 while (sec_it != m_keys.end())
306 template<
typename Cmp_Fn>
312 iterator it = m_keys.begin();
313 while (it != m_keys.end())
314 if (cmp_fn(r_key, *it))
316 other.insert_new(*it);
317 it = m_keys.erase(it);
328 iterator it = other.m_keys.begin();
329 while (it != other.m_keys.end())
333 it = other.m_keys.erase(it);
340 #undef PB_DS_CLASS_T_DEC
341 #undef PB_DS_CLASS_C_DEC
#define __try
Definition: exception_defines.h:35
#define _GLIBCXX_DEBUG_ASSERT(_Condition)
Definition: debug.h:61
#define PB_DS_CLASS_C_DEC
Definition: bin_search_tree_.hpp:71
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
return(unsigned int) __res
#define __catch(X)
Definition: exception_defines.h:36
#define PB_DS_ASSERT_VALID(X)
Definition: binary_heap_.hpp:324
#define PB_DS_DEBUG_VERIFY(_Cond)
Definition: binary_heap_.hpp:327
void swap(exception_ptr &__lhs, exception_ptr &__rhs)
Definition: exception_ptr.h:160