/usr/include/opengm/functions/singlesitefunction.hxx is in libopengm-dev 2.3.6+20160905-1build2.
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 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 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 | #pragma once
#ifndef OPENGM_SINGLESITEFUNCTION_HXX
#define OPENGM_SINGLESITEFUNCTION_HXX
#include <vector>
#include <algorithm>
#include "opengm/opengm.hxx"
#include "opengm/functions/function_registration.hxx"
#include "opengm/functions/function_properties_base.hxx"
namespace opengm {
/// \cond HIDDEN_SYMBOLS
template<class T, size_t SIZE>
class StackStorage {
public:
StackStorage(){}
~StackStorage(){}
template<class ITERATOR>
const T & operator()(ITERATOR iter) const {
OPENGM_ASSERT(*iter<SIZE);
return this->dataPointer_[*iter];
}
template<class ITERATOR>
T & operator()(ITERATOR iter) {
OPENGM_ASSERT(*iter<SIZE);
return this->dataPointer_[*iter];
}
T & operator[](const size_t index) {
OPENGM_ASSERT(index<SIZE);
return this->dataPointer_[index];
}
const T & operator[](const size_t index) const {
OPENGM_ASSERT(index<SIZE);
return this->dataPointer_[index];
}
private:
T dataPointer_[SIZE];
};
template<class T, size_t SIZE>
class HeapStorage {
public:
HeapStorage() {
dataPointer_ = new T[SIZE];
}
~HeapStorage(){
delete[] dataPointer_;
}
T& operator[](const size_t index) {
OPENGM_ASSERT(index<SIZE);
return this->dataPointer_[index];
}
const T& operator[](const size_t index) const {
OPENGM_ASSERT(index<SIZE);
return this->dataPointer_[index];
}
template<class ITERATOR>
const T& operator()(ITERATOR iter) const {
OPENGM_ASSERT(*iter<SIZE);
return this->dataPointer_[*iter];
}
template<class ITERATOR>
T& operator()(ITERATOR iter) {
OPENGM_ASSERT(*iter<SIZE);
return this->dataPointer_[*iter];
}
private:
T* dataPointer_;
};
/// \endcond
/// \brief Single site function whose size is fixed at compile time
///
/// \ingroup functions
template<class T, size_t SIZE, template<typename, size_t> class STORAGE>
class StaticSingleSiteFunction
: STORAGE<T, SIZE>,
public FunctionBase<StaticSingleSiteFunction<T, SIZE, STORAGE>, T, size_t, size_t>
{
public:
typedef T ValueType;
typedef T value_type;
StaticSingleSiteFunction():STORAGE<T, SIZE>() {}
StaticSingleSiteFunction(const StaticSingleSiteFunction& other)
: STORAGE<T, SIZE>()
{
for(size_t i=0;i<SIZE;++i){
(*this).operator [](i)=other[i];
}
}
StaticSingleSiteFunction& operator=(const StaticSingleSiteFunction & other)
{
if(this != &other) {
for(size_t i=0;i<SIZE;++i) {
(*this).operator [](i)=other[i];
}
}
return *this;
}
template<class ITERATOR> const T& operator()(ITERATOR iter) const
{
OPENGM_ASSERT(*iter < SIZE);
return (static_cast<const STORAGE<T, SIZE>&>(*this)).operator()(iter);
}
template<class ITERATOR> T& operator()(ITERATOR iter)
{
OPENGM_ASSERT(*iter<SIZE);
return (static_cast<STORAGE<T, SIZE>&>(*this)).operator()(iter);
}
size_t size() const
{ return SIZE; }
size_t dimension() const
{ return 1; }
size_t shape(const size_t index) const
{
OPENGM_ASSERT(index == 0);
return SIZE;
}
};
/// Single site function with dynamic size
///
/// \ingroup functions
template<class T>
class DynamicSingleSiteFunction {
public:
typedef T ValueType;
typedef T value_type;
DynamicSingleSiteFunction(const size_t size = 0)
: size_(size)
{
if(size_ != 0){
dataPointer_ = new T[size];
}
}
DynamicSingleSiteFunction(const size_t size, ValueType value)
: size_(size)
{
if(size_ != 0) {
dataPointer_ = new T[size];
std::fill(dataPointer_, dataPointer_+size_, value);
}
}
~DynamicSingleSiteFunction()
{
if(size_ != 0) {
delete[] dataPointer_;
}
}
DynamicSingleSiteFunction(const DynamicSingleSiteFunction & other)
{
if(other.size_ != 0) {
dataPointer_ = new T[other.size_];
size_ = other.size_;
std::copy(other.dataPointer_, other.dataPointer_+size_, dataPointer_);
}
else {
size_=0;
}
}
DynamicSingleSiteFunction& operator=(const DynamicSingleSiteFunction& other)
{
if(this != &other) {
if(other.size_ > size_) {
delete[] dataPointer_;
dataPointer_ = new T[other.size_];
size_ = other.size_;
std::copy(other.dataPointer_, other.dataPointer_ + size_, dataPointer_);
}
else if(other.size_ < size_) {
delete[] dataPointer_;
if(other.size_!= 0) {
dataPointer_= new T[other.size_];
size_ = other.size_;
std::copy(other.dataPointer_, other.dataPointer_+size_, dataPointer_);
}
else {
size_ = 0;
}
}
if(other.size_ == size_) {
std::copy(other.dataPointer_, other.dataPointer_+size_, dataPointer_);
}
}
return *this;
}
void assign(const size_t size)
{
if(size_ != size){
delete[] dataPointer_;
if(size != 0){
dataPointer_ = new T[size];
size_=size;
}
else {
size_ = 0;
}
}
}
void assign(const size_t size, const T value)
{
if(size_ != size){
delete[] dataPointer_;
if(size != 0) {
dataPointer_ = new T[size];
size_ = size;
std::fill(dataPointer_, dataPointer_+size_, value);
}
else {
size_=0;
}
}
else {
std::fill(dataPointer_, dataPointer_+size_, value);
}
}
size_t size() const
{ return size_; }
size_t dimension() const
{ return 1; }
size_t shape(const size_t index) const
{
OPENGM_ASSERT(index==0);
return size_;
}
T& operator[](const size_t index)
{
OPENGM_ASSERT(index < size_);
return dataPointer_[index];
}
const T & operator[](const size_t index) const
{
OPENGM_ASSERT(index < size_);
return dataPointer_[index];
}
template<class ITERATOR>
const T& operator()(ITERATOR iter) const
{
OPENGM_ASSERT(*iter < size_);
return dataPointer_[*iter];
}
template<class ITERATOR>
T& operator()(ITERATOR iter)
{
OPENGM_ASSERT(*iter < size_);
return dataPointer_[*iter];
}
private:
T* dataPointer_;
size_t size_;
};
/// \cond HIDDEN_SYMBOLS
/// FunctionRegistration
template<class T, size_t SIZE, template < typename , size_t > class STORAGE>
struct FunctionRegistration< StaticSingleSiteFunction<T, SIZE, STORAGE> > {
enum ID { Id = opengm::FUNCTION_TYPE_ID_OFFSET + 9 };
};
/// FunctionRegistration
template<class T>
struct FunctionRegistration< DynamicSingleSiteFunction<T> > {
enum ID { Id = opengm::FUNCTION_TYPE_ID_OFFSET + 10 };
};
/// FunctionSerialization
template<class T, size_t SIZE, template < typename , size_t > class STORAGE>
class FunctionSerialization< StaticSingleSiteFunction<T, SIZE, STORAGE> > {
public:
typedef typename StaticSingleSiteFunction<T, SIZE, STORAGE> ::ValueType ValueType;
static size_t indexSequenceSize(const StaticSingleSiteFunction<T, SIZE, STORAGE> & f){
return 0;
}
static size_t valueSequenceSize(const StaticSingleSiteFunction<T, SIZE, STORAGE> & f){
return SIZE;
}
template<class INDEX_OUTPUT_ITERATOR, class VALUE_OUTPUT_ITERATOR >
static void serialize(const StaticSingleSiteFunction<T, SIZE, STORAGE> & f, INDEX_OUTPUT_ITERATOR ii, VALUE_OUTPUT_ITERATOR vi){
for(size_t i=0;i<SIZE;++i){
size_t c[]={i};
*vi=f(c);
++vi;
}
}
template<class INDEX_INPUT_ITERATOR , class VALUE_INPUT_ITERATOR>
static void deserialize( INDEX_INPUT_ITERATOR ii, VALUE_INPUT_ITERATOR vi, StaticSingleSiteFunction<T, SIZE, STORAGE> & f){
for(size_t i=0;i<SIZE;++i){
size_t c[]={i};
f(c)=*vi;
++vi;
}
}
};
/// FunctionSerialization
template<class T>
class FunctionSerialization< DynamicSingleSiteFunction<T> > {
public:
typedef typename DynamicSingleSiteFunction<T>::ValueType ValueType;
static size_t indexSequenceSize(const DynamicSingleSiteFunction<T> & f){
return 1;
}
static size_t valueSequenceSize(const DynamicSingleSiteFunction<T> & f){
return f.size();
}
template<class INDEX_OUTPUT_ITERATOR, class VALUE_OUTPUT_ITERATOR >
static void serialize(const DynamicSingleSiteFunction<T> & f, INDEX_OUTPUT_ITERATOR ii, VALUE_OUTPUT_ITERATOR vi){
for(size_t i=0;i<f.size();++i){
size_t c[]={i};
*vi=f(c);
++vi;
}
}
template<class INDEX_INPUT_ITERATOR , class VALUE_INPUT_ITERATOR>
static void deserialize( INDEX_INPUT_ITERATOR ii, VALUE_INPUT_ITERATOR vi, DynamicSingleSiteFunction<T> & f){
const size_t size=*ii;
f.assign(size);
for(size_t i=0;i<size;++i){
size_t c[]={i};
f(c)=*vi;
++vi;
}
}
};
/// \endcond
} // namespace opengm
#endif // #ifndef OPENGM_SINGLESITEFUNCTION_HXX
|