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 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301
|
// Copyright (c) 2017 GeometryFactory (France). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Property_map/include/CGAL/Dynamic_property_map.h $
// $Id: include/CGAL/Dynamic_property_map.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Andreas Fabri
#ifndef CGAL_DYNAMIC_PROPERTY_MAP_H
#define CGAL_DYNAMIC_PROPERTY_MAP_H
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <CGAL/boost/graph/properties.h>
#include <CGAL/property_map.h>
#include <memory>
#include <type_traits>
#include <unordered_map>
namespace CGAL {
namespace internal {
template <typename K, typename V>
struct Dynamic_property_map {
typedef K key_type;
typedef V value_type;
typedef const value_type& reference;
typedef boost::read_write_property_map_tag category;
Dynamic_property_map(const V default_value = V())
: map_(new Map()), default_value_(default_value)
{}
void clear()
{
if(map_){
map_->clear();
}
}
friend reference get(const Dynamic_property_map& m, const key_type& k)
{
typename Map::const_iterator it = m.map_->find(k);
if(it == m.map_->end()){
(*(const_cast<Dynamic_property_map&>(m).map_))[k] = m.default_value();
return m.default_value();
}
return it->second;
}
friend void put(const Dynamic_property_map& m, const key_type& k, const value_type& v)
{
(*(m.map_))[k] = v;
}
const V& default_value() const
{
return default_value_;
}
typedef std::unordered_map<K,V> Map;
std::shared_ptr<Map> map_;
V default_value_;
};
template <typename M, typename PM>
struct Dynamic_property_map_deleter {
M& mesh;
Dynamic_property_map_deleter(const M& mesh)
: mesh(const_cast<M&>(mesh))
{}
void operator()(PM* pm) const
{
remove_property(*pm, mesh);
delete pm;
}
};
template <typename Mesh, typename PM>
struct Dynamic {
typedef typename PM::key_type key_type;
typedef typename PM::value_type value_type;
typedef typename PM::reference reference;
typedef boost::read_write_property_map_tag category;
typedef Dynamic_property_map_deleter<Mesh,PM> Deleter;
Dynamic()
: map_()
{}
Dynamic(const Mesh& mesh, PM* pm)
: map_(pm, Deleter(mesh))
{}
friend reference get(const Dynamic& m, const key_type& k)
{
return get(*(m.map_), k);
}
friend void put(const Dynamic& m, const key_type& k, const value_type& v)
{
put(*(m.map_), k, v);
}
std::shared_ptr<PM> map_;
};
template <typename Key, typename Value>
struct Dynamic_with_index
{
typedef Key key_type;
typedef Value value_type;
typedef std::conditional_t< std::is_same_v<bool, Value>,
value_type,
value_type&> reference;
typedef boost::read_write_property_map_tag category;
Dynamic_with_index()
: m_values()
{}
Dynamic_with_index(std::size_t num_features, Value default_value = Value())
: m_values( new std::vector<value_type>(num_features, default_value) )
{}
friend reference get(const Dynamic_with_index& m, const key_type& k)
{
return (*m.m_values)[k.idx()];
}
friend void put(const Dynamic_with_index& m, const key_type& k, const value_type& v)
{
(*m.m_values)[k.idx()]=v;
}
std::shared_ptr<std::vector<value_type> > m_values;
};
} // namespace internal
struct dynamic_property_t {};
template <typename T>
struct dynamic_vertex_property_t : public dynamic_property_t
{
dynamic_vertex_property_t()
{}
using value_type = T;
template <typename G>
struct property_map {
using descriptor = typename boost::graph_traits<G>::vertex_descriptor;
using vertex_descriptor = descriptor;
};
};
template <typename T>
struct dynamic_halfedge_property_t : public dynamic_property_t
{
dynamic_halfedge_property_t()
{}
using value_type = T;
template <typename G>
struct property_map {
using descriptor = typename boost::graph_traits<G>::halfedge_descriptor;
using halfedge_descriptor = descriptor;
};
};
template <typename T>
struct dynamic_edge_property_t : public dynamic_property_t
{
dynamic_edge_property_t()
{}
using value_type = T;
template <typename G>
struct property_map {
using descriptor = typename boost::graph_traits<G>::edge_descriptor;
using edge_descriptor = descriptor;
};
};
template <typename T>
struct dynamic_face_property_t : public dynamic_property_t
{
dynamic_face_property_t()
{}
using value_type = T;
template <typename G>
struct property_map
{
using descriptor = typename boost::graph_traits<G>::face_descriptor;
using face_descriptor = descriptor;
};
};
template <typename T>
constexpr bool is_dynamic_property_tag()
{
return std::is_base_of_v<CGAL::dynamic_property_t, T>;
}
template <typename Graph, typename Dynamic_property_tag>
struct property_map_of_dynamic_property_map : Dynamic_property_tag::template property_map<Graph>
{
using descriptor = typename Dynamic_property_tag::template property_map<Graph>::descriptor;
using type = CGAL::internal::Dynamic_property_map<descriptor, typename Dynamic_property_tag::value_type>;
using const_type = const type;
};
} // namespace CGAL
namespace boost {
template <typename G, typename T>
struct property_map<G, CGAL::dynamic_vertex_property_t<T> >
: public CGAL::property_map_of_dynamic_property_map<G, CGAL::dynamic_vertex_property_t<T>>
{
using vertex_descriptor = typename boost::graph_traits<G>::vertex_descriptor;
};
template <typename G, typename T>
struct property_map<G, CGAL::dynamic_halfedge_property_t<T> >
: public CGAL::property_map_of_dynamic_property_map<G, CGAL::dynamic_halfedge_property_t<T>>
{
using halfedge_descriptor = typename boost::graph_traits<G>::halfedge_descriptor;
};
template <typename G, typename T>
struct property_map<G, CGAL::dynamic_edge_property_t<T> >
: public CGAL::property_map_of_dynamic_property_map<G, CGAL::dynamic_edge_property_t<T>>
{
using edge_descriptor = typename boost::graph_traits<G>::edge_descriptor;
};
template <typename G, typename T>
struct property_map<G, CGAL::dynamic_face_property_t<T> >
: public CGAL::property_map_of_dynamic_property_map<G, CGAL::dynamic_face_property_t<T>>
{
using face_descriptor = typename boost::graph_traits<G>::face_descriptor;
};
} // namespace boost
namespace CGAL {
template <typename Dynamic_property_tag,
typename G,
typename = std::enable_if_t<is_dynamic_property_tag<Dynamic_property_tag>()>,
typename ...Default_value_args>
auto get(const Dynamic_property_tag&, const G&, Default_value_args&&... default_value_args)
{
using pmap_traits = typename Dynamic_property_tag::template property_map<G>;
using descriptor = typename pmap_traits::descriptor;
using value_type = typename Dynamic_property_tag::value_type;
using Property_map = internal::Dynamic_property_map<descriptor, value_type>;
return Property_map(std::forward<Default_value_args>(default_value_args)...);
}
template<typename G, typename Descriptor, typename T>
void remove_property(
internal::Dynamic_property_map<Descriptor, T> pm,
const G&)
{
pm.clear();
}
} // namespace CGAL
#endif // CGAL_DYNAMIC_PROPERTY_MAP_H
|