/usr/include/libmesh/multi_predicates.h is in libmesh-dev 0.7.1-2ubuntu1.
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 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 | // $Id: multi_predicates.h 3874 2010-07-02 21:57:26Z roystgnr $
// The libMesh Finite Element Library.
// Copyright (C) 2002-2008 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
// This library is free software; 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 2.1 of the License, or (at your option) any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef __multi_predicates_h__
#define __multi_predicates_h__
#include <vector>
#include "libmesh_base.h" // for libMesh::processor_id()
#include "single_predicates.h"
namespace libMesh
{
/**
* This namespace defines several multi_predicates which are used by
* the element and node iterators. These classes are not in general
* used by the user, although they could be.
*
* @author John W. Peterson, 2004
*/
namespace Predicates
{
// Empty place-holder base class for multi_predicates
struct multi_predicate {};
// This class represents a generic combination of more than one predicate.
// It is meant to be derived from to actually be used.
template <typename T>
struct abstract_multi_predicate : multi_predicate
{
// virtual destructor.
virtual ~abstract_multi_predicate()
{
// Clean-up vector
for (unsigned int i=0; i<_predicates.size(); ++i)
delete _predicates[i];
}
// operator= (perform deep copy of entries in _predicates vector
abstract_multi_predicate& operator=(const abstract_multi_predicate& rhs)
{
// First clear out the predicates vector
for (unsigned int i=0; i<_predicates.size(); ++i)
delete _predicates[i];
// Now copy over the information from the rhs.
this->deep_copy(rhs);
return *this;
}
// operator() checks all the predicates in the vector.
virtual bool operator()(const T& it) const
{
for (unsigned int i=0; i<_predicates.size(); ++i)
{
const predicate<T>* pred = _predicates[i];
libmesh_assert (pred != NULL);
if ( ! (*pred)(it) )
return false;
}
return true;
}
protected:
// Do not instantiate the base class.
abstract_multi_predicate() {}
// Copy constructor.
abstract_multi_predicate(const abstract_multi_predicate& rhs)
{
this->deep_copy(rhs);
}
// The deep_copy function is used by both the op= and
// copy constructors. This function uses the default (empty)
// copy constructor for the predicate class.
void deep_copy(const abstract_multi_predicate& rhs)
{
for (unsigned int i=0; i<rhs._predicates.size(); ++i)
_predicates.push_back(rhs._predicates[i]->clone());
}
// Predicates to be evaluated.
std::vector<predicate<T>*> _predicates;
};
// Instantiation of the IsNull abstract_multi_predicate.
// This would be used to iterate over NULL entries in a container.
template <typename T>
struct IsNull : abstract_multi_predicate<T>
{
// Constructor, pushes back a single predicate
IsNull()
{
this->_predicates.push_back(new is_null<T>);
}
};
// Instantiation for the NotNull abstract_multi_predicate
template <typename T>
struct NotNull : abstract_multi_predicate<T>
{
// Constructor, pushes back a single predicate
NotNull()
{
this->_predicates.push_back(new not_null<T>);
}
};
// Instantiation for the Active abstract_multi_predicate
template <typename T>
struct Active : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
Active()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
}
};
// Instantiation for the NotActive abstract_multi_predicate
template <typename T>
struct NotActive : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
NotActive()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_active<T>);
}
};
// Instantiation for the Ancestor abstract_multi_predicate
template <typename T>
struct Ancestor : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
Ancestor()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new ancestor<T>);
}
};
// Instantiation for the NotAncestor abstract_multi_predicate
template <typename T>
struct NotAncestor : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
NotAncestor()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_ancestor<T>);
}
};
// Instantiation for the SubActive abstract_multi_predicate
template <typename T>
struct SubActive : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
SubActive()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new subactive<T>);
}
};
// Instantiation for the NotSubActive abstract_multi_predicate
template <typename T>
struct NotSubActive : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
NotSubActive()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_subactive<T>);
}
};
// Instantiation for the Local abstract_multi_predicate
template <typename T>
struct Local : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
Local()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new pid<T>(libMesh::processor_id()));
}
};
// Instantiation for the NotLocal abstract_multi_predicate
template <typename T>
struct NotLocal : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
NotLocal()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_pid<T>(libMesh::processor_id()));
}
};
// Instantiation for the ActiveNotLocal abstract_multi_predicate
template <typename T>
struct ActiveNotLocal : abstract_multi_predicate<T>
{
// Constructor, pushes back two single predicates
ActiveNotLocal()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new not_pid<T>(libMesh::processor_id()));
}
};
// Instantiation for the Type abstract_multi_predicate
template <typename T>
struct Type : abstract_multi_predicate<T>
{
Type(const ElemType type)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new elem_type<T>(type));
}
};
// Instantiation for the ActiveType abstract_multi_predicate
template <typename T>
struct ActiveType : abstract_multi_predicate<T>
{
ActiveType(const ElemType type)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new elem_type<T>(type));
}
};
// Instantiation for the ActivePID abstract_multi_predicate
template <typename T>
struct ActivePID : abstract_multi_predicate<T>
{
ActivePID(const unsigned int proc_id)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new pid<T>(proc_id));
}
};
// Instantiation for the ActiveLocal abstract_multi_predicate
template <typename T>
struct ActiveLocal : abstract_multi_predicate<T>
{
ActiveLocal()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new pid<T>(libMesh::processor_id()));
}
};
// Instantiation for the PID abstract_multi_predicate
template <typename T>
struct PID : abstract_multi_predicate<T>
{
PID(const unsigned int proc_id)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new pid<T>(proc_id));
}
};
// Instantiation for the NotPID abstract_multi_predicate
template <typename T>
struct NotPID : abstract_multi_predicate<T>
{
NotPID(const unsigned int proc_id)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_pid<T>(proc_id));
}
};
// Instantiation for the Level abstract_multi_predicate
template <typename T>
struct Level : abstract_multi_predicate<T>
{
Level(const unsigned int l)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new level<T>(l));
}
};
// Instantiation for the NotLevel abstract_multi_predicate
template <typename T>
struct NotLevel : abstract_multi_predicate<T>
{
NotLevel(const unsigned int l)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new not_level<T>(l));
}
};
// Instantiation for the LocalLevel abstract_multi_predicate
template <typename T>
struct LocalLevel : abstract_multi_predicate<T>
{
LocalLevel(const unsigned int l)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new pid<T>(libMesh::processor_id()));
this->_predicates.push_back(new level<T>(l));
}
};
// Instantiation for the LocalNotLevel abstract_multi_predicate
template <typename T>
struct LocalNotLevel : abstract_multi_predicate<T>
{
LocalNotLevel(const unsigned int l)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new pid<T>(libMesh::processor_id()));
this->_predicates.push_back(new not_level<T>(l));
}
};
// Instantiation for the ActiveOnBoundary abstract_multi_predicate
template <typename T>
struct ActiveOnBoundary : abstract_multi_predicate<T>
{
ActiveOnBoundary()
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new null_neighbor<T>);
}
};
// Instantiation for the BoundarySide abstract_multi_predicate
template <typename T>
struct BoundarySide : abstract_multi_predicate<T>
{
BoundarySide()
{
this->_predicates.push_back(new boundary_side<T>);
}
};
// Instantiation for the ActiveLocalSubdomain abstract_multi_predicate
template <typename T>
struct ActiveLocalSubdomain : abstract_multi_predicate<T>
{
ActiveLocalSubdomain(const unsigned int subdomain_id)
{
this->_predicates.push_back(new not_null<T>);
this->_predicates.push_back(new active<T>);
this->_predicates.push_back(new pid<T>(libMesh::processor_id()));
this->_predicates.push_back(new subdomain<T>(subdomain_id));
}
};
}
} // namespace libMesh
#endif
|