/usr/include/CGAL/Unique_hash_map.h is in libcgal-dev 4.2-5ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // 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); 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$
// $Id$
//
//
// Author(s) : Michael Seel <seel@mpi-sb.mpg.de>
// Lutz Kettner <kettner@inf.ethz.ch>
#ifndef CGAL_UNIQUE_HASH_MAP_H
#define CGAL_UNIQUE_HASH_MAP_H
#include <CGAL/basic.h>
#include <CGAL/Handle_hash_function.h>
#include <CGAL/Tools/chained_map.h>
#include <cstddef>
namespace CGAL {
template <class Key_, class Data_,
class UniqueHashFunction = Handle_hash_function>
class Unique_hash_map {
public:
typedef Key_ Key;
typedef Data_ Data;
typedef UniqueHashFunction Hash_function;
// STL compliance
typedef Key_ key_type;
typedef Data_ data_type;
typedef UniqueHashFunction hasher;
typedef Unique_hash_map<Key,Data,Hash_function> Self;
private:
typedef internal::chained_map<Data> Map;
typedef typename Map::item Item;
private:
Hash_function m_hash_function;
Map m_map;
public:
Unique_hash_map() { m_map.xdef() = Data(); }
Unique_hash_map( const Data& deflt, std::size_t table_size = 1)
: m_map( table_size) { m_map.xdef() = deflt; }
Unique_hash_map( const Data& deflt,
std::size_t table_size,
const Hash_function& fct)
: m_hash_function(fct), m_map( table_size) { m_map.xdef() = deflt; }
Unique_hash_map( Key first1, Key beyond1, Data first2) {
m_map.xdef() = Data();
insert( first1, beyond1, first2);
}
Unique_hash_map( Key first1, Key beyond1, Data first2,
const Data& deflt,
std::size_t table_size = 1,
const Hash_function& fct = Hash_function())
: m_hash_function(fct), m_map( table_size) {
m_map.xdef() = deflt;
insert( first1, beyond1, first2);
}
Data default_value() const { return m_map.cxdef(); }
Hash_function hash_function() const { return m_hash_function; }
void clear() { m_map.clear(); }
void clear( const Data& deflt) {
m_map.clear();
m_map.xdef() = deflt; }
bool is_defined( const Key& key) const {
return m_map.lookup( m_hash_function(key)) != 0;
}
const Data& operator[]( const Key& key) const {
Item p = m_map.lookup( m_hash_function(key));
if ( p != 0 )
return m_map.inf(p);
return m_map.cxdef();
}
Data& operator[]( const Key& key) {
return m_map.access( m_hash_function(key));
}
Data insert( Key first1, Key beyond1, Data first2) {
for ( ; first1 != beyond1; (++first1, ++first2)) {
operator[]( first1) = first2;
}
return first2;
}
void statistics() const { m_map.statistics(); }
};
} //namespace CGAL
namespace boost {
template <typename UniquePairAssociativeContainer>
class associative_property_map;
struct lvalue_property_map_tag;
template <typename KeyType, typename ValueType>
class associative_property_map<CGAL::Unique_hash_map<KeyType,ValueType> >
{
typedef CGAL::Unique_hash_map<KeyType,ValueType> C;
public:
typedef KeyType key_type;
typedef ValueType value_type;
typedef value_type& reference;
typedef lvalue_property_map_tag category;
associative_property_map() : m_c(0) { }
associative_property_map(C& c) : m_c(&c) { }
reference operator[](const key_type& k) const {
return (*m_c)[k];
}
private:
C* m_c;
};
template <typename KeyType, typename ValueType>
associative_property_map<CGAL::Unique_hash_map<KeyType,ValueType> >
make_assoc_property_map(CGAL::Unique_hash_map<KeyType,ValueType> & c)
{
return associative_property_map<CGAL::Unique_hash_map<KeyType,ValueType> >(c);
}
template <typename KeyType, typename ValueType>
ValueType& get(const associative_property_map<CGAL::Unique_hash_map<KeyType,ValueType> >& uhm, const KeyType& key)
{
return uhm[key];
}
template <typename KeyType, typename ValueType>
void put(associative_property_map<CGAL::Unique_hash_map<KeyType,ValueType> >& uhm, const KeyType& key, const ValueType& val)
{
uhm[key] = val;
}
}
#endif // CGAL_UNIQUE_HASH_MAP_H
// EOF
|