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
|
// Copyright (c) 2005 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Segment_Delaunay_graph_2/include/CGAL/Edge_hash_function.h $
// $Id: Edge_hash_function.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Menelaos Karavelas <mkaravel@iacm.forth.gr>
#ifndef CGAL_EDGE_HASH_FUNCTION_H
#define CGAL_EDGE_HASH_FUNCTION_H
#include <CGAL/basic.h>
#include <CGAL/Handle_hash_function.h>
namespace CGAL {
class Edge_hash_function
: public Handle_hash_function
{
private:
typedef Handle_hash_function Base;
public:
typedef Base::result_type result_type;
template<class Edge>
result_type operator()(const Edge& e) const
{
return (Base::operator()(e.first)) << e.second;
}
};
} //namespace CGAL
#endif // CGAL_EDGE_HASH_FUNCTION_H
|
