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
|
// Copyright (c) 2005 Stanford University (USA).
// 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 Lesser 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/Kinetic_data_structures/include/CGAL/Kinetic/Sort_visitor_base.h $
// $Id: Sort_visitor_base.h 67093 2012-01-13 11:22:39Z lrineau $
//
//
// Author(s) : Daniel Russel <drussel@alumni.princeton.edu>
#ifndef CGAL_KINETIC_DELAUNAY_SORT_WATCHER_BASE_H
#define CGAL_KINETIC_DELAUNAY_SORT_WATCHER_BASE_H
#include <CGAL/Kinetic/basic.h>
namespace CGAL { namespace Kinetic {
struct Sort_visitor_base
{
Sort_visitor_base(){}
template <class Point_key>
void pre_insert_vertex(Point_key) {
}
template <class Vertex_handle>
void post_insert_vertex(Vertex_handle) {
}
template <class Vertex_handle>
void pre_remove_vertex(Vertex_handle) {
}
template <class Point_key>
void post_remove_vertex(Point_key) {
}
template <class Vertex_handle>
void change_vertex(Vertex_handle) {
}
template <class Vertex_handle>
void pre_swap(Vertex_handle, Vertex_handle) {
}
template <class Vertex_handle>
void post_swap(Vertex_handle, Vertex_handle) {
}
};
} } //namespace CGAL::Kinetic
#endif
|
