|
|
|
|
|
#ifndef DLIB_HASH_MAP_KERNEl_C_ |
|
#define DLIB_HASH_MAP_KERNEl_C_ |
|
|
|
#include "hash_map_kernel_abstract.h" |
|
#include "../algs.h" |
|
#include "../assert.h" |
|
|
|
namespace dlib |
|
{ |
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
class hash_map_kernel_c : public hash_map_base |
|
{ |
|
|
|
typedef typename hash_map_base::domain_type domain; |
|
typedef typename hash_map_base::range_type range; |
|
|
|
|
|
public: |
|
void add ( |
|
domain& d, |
|
range& r |
|
); |
|
|
|
void remove_any ( |
|
domain& d, |
|
range& r |
|
); |
|
|
|
void remove ( |
|
const domain& d, |
|
domain& d_copy, |
|
range& r |
|
); |
|
|
|
void destroy ( |
|
const domain& d |
|
); |
|
|
|
range& operator[] ( |
|
const domain& d |
|
); |
|
|
|
const range& operator[] ( |
|
const domain& d |
|
) const; |
|
|
|
const map_pair<domain,range>& element ( |
|
) const; |
|
|
|
map_pair<domain,range>& element ( |
|
); |
|
}; |
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
inline void swap ( |
|
hash_map_kernel_c<hash_map_base>& a, |
|
hash_map_kernel_c<hash_map_base>& b |
|
) { a.swap(b); } |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
void hash_map_kernel_c<hash_map_base>:: |
|
add ( |
|
domain& d, |
|
range& r |
|
) |
|
{ |
|
|
|
|
|
DLIB_CASSERT( (!this->is_in_domain(d)) && |
|
(static_cast<void*>(&d) != static_cast<void*>(&r)), |
|
"\tvoid hash_map::add" |
|
<< "\n\tdomain element being added must not already be in the hash_map" |
|
<< "\n\tand d and r must not be the same variable" |
|
<< "\n\tis_in_domain(d): " << (this->is_in_domain(d) ? "true" : "false") |
|
<< "\n\tthis: " << this |
|
<< "\n\t&d: " << static_cast<void*>(&d) |
|
<< "\n\t&r: " << static_cast<void*>(&r) |
|
); |
|
|
|
|
|
|
|
hash_map_base::add(d,r); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
void hash_map_kernel_c<hash_map_base>:: |
|
remove_any ( |
|
domain& d, |
|
range& r |
|
) |
|
{ |
|
|
|
|
|
|
|
DLIB_CASSERT( (this->size() > 0) && |
|
(static_cast<void*>(&d) != static_cast<void*>(&r)), |
|
"\tvoid hash_map::remove_any" |
|
<< "\n\tsize() must be greater than zero if something is going to be removed" |
|
<< "\n\tand d and r must not be the same variable." |
|
<< "\n\tsize(): " << this->size() |
|
<< "\n\tthis: " << this |
|
<< "\n\t&d: " << static_cast<void*>(&d) |
|
<< "\n\t&r: " << static_cast<void*>(&r) |
|
); |
|
|
|
|
|
|
|
hash_map_base::remove_any(d,r); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
void hash_map_kernel_c<hash_map_base>:: |
|
remove ( |
|
const domain& d, |
|
domain& d_copy, |
|
range& r |
|
) |
|
{ |
|
|
|
|
|
|
|
DLIB_CASSERT( (this->is_in_domain(d)) && |
|
(static_cast<const void*>(&d) != static_cast<void*>(&r)) && |
|
(static_cast<void*>(&r) != static_cast<void*>(&d_copy)) && |
|
(static_cast<const void*>(&d) != static_cast<void*>(&d_copy)), |
|
"\tvoid hash_map::remove" |
|
<< "\n\tcan't remove something that isn't in the hash_map or if the paremeters" |
|
<< "\n\tare actually the same variable. Either way can't remove." |
|
<< "\n\tis_in_domain(d): " << (this->is_in_domain(d) ? "true" : "false") |
|
<< "\n\tthis: " << this |
|
<< "\n\t&d: " << static_cast<const void*>(&d) |
|
<< "\n\t&r: " << static_cast<void*>(&r) |
|
<< "\n\t&d_copy: " << static_cast<void*>(&d_copy) |
|
); |
|
|
|
|
|
|
|
hash_map_base::remove(d,d_copy,r); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
void hash_map_kernel_c<hash_map_base>:: |
|
destroy ( |
|
const domain& d |
|
) |
|
{ |
|
|
|
|
|
|
|
DLIB_CASSERT( this->is_in_domain(d), |
|
"\tvoid hash_map::destroy" |
|
<< "\n\tcan't remove something that isn't in the hash_map" |
|
<< "\n\tthis: " << this |
|
<< "\n\t&d: " << static_cast<const void*>(&d) |
|
); |
|
|
|
|
|
|
|
hash_map_base::destroy(d); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
typename hash_map_base::range_type& hash_map_kernel_c<hash_map_base>:: |
|
operator[] ( |
|
const domain& d |
|
) |
|
{ |
|
|
|
DLIB_CASSERT( this->is_in_domain(d), |
|
"\trange& hash_map::operator[]" |
|
<< "\n\td must be in the domain of the hash_map" |
|
<< "\n\tthis: " << this |
|
); |
|
|
|
|
|
return hash_map_base::operator[](d); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
const typename hash_map_base::range_type& hash_map_kernel_c<hash_map_base>:: |
|
operator[] ( |
|
const domain& d |
|
) const |
|
{ |
|
|
|
DLIB_CASSERT( this->is_in_domain(d), |
|
"\tconst range& hash_map::operator[]" |
|
<< "\n\td must be in the domain of the hash_map" |
|
<< "\n\tthis: " << this |
|
); |
|
|
|
|
|
return hash_map_base::operator[](d); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
const map_pair<typename hash_map_base::domain_type,typename hash_map_base::range_type>& hash_map_kernel_c<hash_map_base>:: |
|
element ( |
|
) const |
|
{ |
|
|
|
DLIB_CASSERT(this->current_element_valid() == true, |
|
"\tconst map_pair<domain,range>& hash_map::element" |
|
<< "\n\tyou can't access the current element if it doesn't exist" |
|
<< "\n\tthis: " << this |
|
); |
|
|
|
|
|
return hash_map_base::element(); |
|
} |
|
|
|
|
|
|
|
template < |
|
typename hash_map_base |
|
> |
|
map_pair<typename hash_map_base::domain_type,typename hash_map_base::range_type>& hash_map_kernel_c<hash_map_base>:: |
|
element ( |
|
) |
|
{ |
|
|
|
DLIB_CASSERT(this->current_element_valid() == true, |
|
"\tmap_pair<domain,range>& hash_map::element" |
|
<< "\n\tyou can't access the current element if it doesn't exist" |
|
<< "\n\tthis: " << this |
|
); |
|
|
|
|
|
return hash_map_base::element(); |
|
} |
|
|
|
|
|
|
|
} |
|
|
|
#endif |
|
|
|
|