/usr/include/gecode/minimodel/optimize.hpp is in libgecode-dev 4.2.1-1.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main author:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2008
*
* Last modified:
* $Date: 2013-04-09 15:16:43 +0200 (Tue, 09 Apr 2013) $ by $Author: schulte $
* $Revision: 13571 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace MiniModel {
template<IntRelType irt>
forceinline
IntOptimizeSpace<irt>::IntOptimizeSpace(void) {}
template<IntRelType irt>
forceinline
IntOptimizeSpace<irt>::IntOptimizeSpace(bool share, IntOptimizeSpace& s)
: Space(share,s) {}
template<IntRelType irt>
void
IntOptimizeSpace<irt>::constrain(const Space& _best) {
const IntOptimizeSpace<irt>* best =
dynamic_cast<const IntOptimizeSpace<irt>*>(&_best);
if (best == NULL)
throw DynamicCastFailed("IntOptimizeSpace::constrain");
rel(*this, cost(), irt, best->cost().val());
}
#ifdef GECODE_HAS_FLOAT_VARS
template<FloatRelType frt>
forceinline
FloatOptimizeSpace<frt>::FloatOptimizeSpace(void) {}
template<FloatRelType frt>
forceinline
FloatOptimizeSpace<frt>::FloatOptimizeSpace(bool share,
FloatOptimizeSpace& s)
: Space(share,s) {}
template<FloatRelType frt>
void
FloatOptimizeSpace<frt>::constrain(const Space& _best) {
const FloatOptimizeSpace<frt>* best =
dynamic_cast<const FloatOptimizeSpace<frt>*>(&_best);
if (best == NULL)
throw DynamicCastFailed("FloatOptimizeSpace::constrain");
rel(*this, cost(), frt, best->cost().val());
}
#endif
}}
// STATISTICS: minimodel-search
|