File size: 5,179 Bytes
9375c9a |
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 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 |
// Copyright (C) 2003 Davis E. King ([email protected])
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_HASH_SET_KERNEl_C_
#define DLIB_HASH_SET_KERNEl_C_
#include "hash_set_kernel_abstract.h"
#include "../algs.h"
#include "../assert.h"
namespace dlib
{
template <
typename hash_set_base
>
class hash_set_kernel_c : public hash_set_base
{
typedef typename hash_set_base::type T;
public:
void add (
T& item
);
void remove_any (
T& item
);
void remove (
const T& item,
T& item_copy
);
void destroy (
const T& item
);
const T& element (
) const;
const T& element (
);
};
template <
typename hash_set_base
>
inline void swap (
hash_set_kernel_c<hash_set_base>& a,
hash_set_kernel_c<hash_set_base>& b
) { a.swap(b); }
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
// member function definitions
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
void hash_set_kernel_c<hash_set_base>::
add(
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT( !this->is_member(item),
"\tvoid hash_set::add"
<< "\n\titem being added must not already be in the hash_set"
<< "\n\tthis: " << this
);
// call the real function
hash_set_base::add(item);
}
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
void hash_set_kernel_c<hash_set_base>::
remove (
const T& item,
T& item_copy
)
{
// make sure requires clause is not broken
DLIB_CASSERT( this->is_member(item) &&
(static_cast<const void*>(&item) != static_cast<void*>(&item_copy)),
"\tvoid hash_set::remove"
<< "\n\titem should be in the hash_set if it's going to be removed"
<< "\n\tthis: " << this
<< "\n\t&item: " << &item
<< "\n\t&item_copy: " << &item_copy
);
// call the real function
hash_set_base::remove(item,item_copy);
}
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
void hash_set_kernel_c<hash_set_base>::
destroy (
const T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT( this->is_member(item),
"\tvoid hash_set::destroy"
<< "\n\titem should be in the hash_set if it's going to be removed"
<< "\n\tthis: " << this
<< "\n\t&item: " << &item
);
// call the real function
hash_set_base::destroy(item);
}
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
void hash_set_kernel_c<hash_set_base>::
remove_any (
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT( this->size() != 0,
"\tvoid hash_set::remove_any"
<< "\n\tsize must be greater than zero if an item is to be removed"
<< "\n\tthis: " << this
);
// call the real function
hash_set_base::remove_any(item);
}
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
const typename hash_set_base::type& hash_set_kernel_c<hash_set_base>::
element (
) const
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tconst T& hash_set::element()"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return hash_set_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename hash_set_base
>
const typename hash_set_base::type& hash_set_kernel_c<hash_set_base>::
element (
)
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tT& hash_set::element()"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return hash_set_base::element();
}
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_HASH_SET_KERNEl_C_
|