/usr/include/gecode/minimodel/set-expr.hpp is in libgecode-dev 3.7.1-3.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2010
*
* Last modified:
* $Date: 2011-01-21 16:01:14 +0100 (Fri, 21 Jan 2011) $ by $Author: schulte $
* $Revision: 11553 $
*
* 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.
*
*/
#ifdef GECODE_HAS_SET_VARS
namespace Gecode {
/*
* Operations for expressions
*
*/
forceinline
SetExpr::Node::Node(void) : use(1) {}
forceinline void*
SetExpr::Node::operator new(size_t size) {
return heap.ralloc(size);
}
forceinline void
SetExpr::Node::operator delete(void* p, size_t) {
heap.rfree(p);
}
forceinline
SetExpr::SetExpr(void) : n(NULL) {}
forceinline
SetExpr::SetExpr(const SetExpr& e) : n(e.n) {
n->use++;
}
forceinline bool
SetExpr::same(NodeType t0, NodeType t1) {
return (t0==t1) || (t1==NT_VAR) || (t1==NT_CONST) || (t1==NT_LEXP);
}
inline SetVar
SetExpr::post(Home home) const {
Region r(home);
SetVar s(home,IntSet::empty,
IntSet(Set::Limits::min,Set::Limits::max));
NNF::nnf(r,n,false)->post(home,SRT_EQ,s);
return s;
}
inline void
SetExpr::post(Home home, SetRelType srt, const SetExpr& e) const {
Region r(home);
return NNF::nnf(r,n,false)->post(home,srt,NNF::nnf(r,e.n,false));
}
inline void
SetExpr::post(Home home, BoolVar b, bool t,
SetRelType srt, const SetExpr& e) const {
Region r(home);
return NNF::nnf(r,n,false)->post(home,b,t,srt,NNF::nnf(r,e.n,false));
}
}
#endif
// STATISTICS: minimodel-any
|