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
|
// Copyright (c) 1997-2000
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Hash_map/include/CGAL/Handle_hash_function.h $
// $Id: include/CGAL/Handle_hash_function.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Michael Seel <seel@mpi-sb.mpg.de>
// Lutz Kettner <kettner@inf.ethz.ch>
#ifndef CGAL_HANDLE_HASH_FUNCTION_H
#define CGAL_HANDLE_HASH_FUNCTION_H
#include <CGAL/config.h>
#include <cstddef>
namespace CGAL {
//mechanism to abuse Handle_hash_function which is the default
//template parameter of Unique_hash_map
namespace internal{
namespace handle {
template <class H>
struct Hash_functor{
std::size_t
operator()(const H& h)
{
return std::size_t(h.operator->()) /
sizeof( typename std::iterator_traits<H>::value_type);
}
};
template <class H>
struct Hash_functor<H*>{
std::size_t
operator()(const H* h)
{
return std::size_t(h) /
sizeof(H);
}
};
}
}
struct Handle_hash_function {
typedef std::size_t result_type;
template <class H>
std::size_t operator() (const H& h) const {
return ::CGAL::internal::handle::Hash_functor<H>()(h);
}
};
} //namespace CGAL
#endif // CGAL_HANDLE_HASH_FUNCTION_H
// EOF
|
