Generated on Mon May 10 06:46:43 2010 for Gecode by doxygen 1.6.3

bool-expr.hpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Guido Tack <tack@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Guido Tack, 2004
00008  *
00009  *  Last modified:
00010  *     $Date: 2010-02-03 11:13:34 +0100 (Wed, 03 Feb 2010) $ by $Author: schulte $
00011  *     $Revision: 10262 $
00012  *
00013  *  This file is part of Gecode, the generic constraint
00014  *  development environment:
00015  *     http://www.gecode.org
00016  *
00017  *  Permission is hereby granted, free of charge, to any person obtaining
00018  *  a copy of this software and associated documentation files (the
00019  *  "Software"), to deal in the Software without restriction, including
00020  *  without limitation the rights to use, copy, modify, merge, publish,
00021  *  distribute, sublicense, and/or sell copies of the Software, and to
00022  *  permit persons to whom the Software is furnished to do so, subject to
00023  *  the following conditions:
00024  *
00025  *  The above copyright notice and this permission notice shall be
00026  *  included in all copies or substantial portions of the Software.
00027  *
00028  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00029  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00030  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00031  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00032  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00033  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00034  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00035  *
00036  */
00037 
00038 namespace Gecode {
00039 
00040   /*
00041    * Operations for expressions
00042    *
00043    */
00044   forceinline
00045   BoolExpr::Node::Node(void) : use(1) {}
00046 
00047   forceinline void*
00048   BoolExpr::Node::operator new(size_t size) {
00049     return heap.ralloc(size);
00050   }
00051   forceinline void
00052   BoolExpr::Node::operator delete(void* p, size_t) {
00053     heap.rfree(p);
00054   }
00055 
00056   forceinline
00057   BoolExpr::BoolExpr(const BoolExpr& e) : n(e.n) {
00058     n->use++;
00059   }
00060 
00061   forceinline
00062   BoolExpr::BoolExpr(const BoolVar& x) : n(new Node) {
00063     n->same = 1;
00064     n->t    = NT_VAR;
00065     n->l    = NULL;
00066     n->r    = NULL;
00067     n->x    = x;
00068   }
00069 
00070   forceinline
00071   BoolExpr::BoolExpr(const BoolExpr& l, NodeType t, const BoolExpr& r)
00072     : n(new Node) {
00073     unsigned int ls = ((l.n->t == t) || (l.n->t == NT_VAR)) ? l.n->same : 1;
00074     unsigned int rs = ((r.n->t == t) || (r.n->t == NT_VAR)) ? r.n->same : 1;
00075     n->same = ls+rs;
00076     n->t    = t;
00077     n->l    = l.n;
00078     n->l->use++;
00079     n->r    = r.n;
00080     n->r->use++;
00081   }
00082 
00083   forceinline
00084   BoolExpr::BoolExpr(const BoolExpr& l, NodeType t) {
00085     (void) t;
00086     assert(t == NT_NOT);
00087     if (l.n->t == NT_NOT) {
00088       n = l.n->l;
00089       n->use++;
00090     } else {
00091       n = new Node;
00092       n->same = 1;
00093       n->t    = NT_NOT;
00094       n->l    = l.n;
00095       n->l->use++;
00096       n->r    = NULL;
00097     }
00098   }
00099 
00100   forceinline
00101   BoolExpr::BoolExpr(const LinRel& rl)
00102     : n(new Node) {
00103     n->same = 1;
00104     n->t    = NT_RLIN;
00105     n->l    = NULL;
00106     n->r    = NULL;
00107     n->rl   = rl;
00108   }
00109 
00110   forceinline BoolVar
00111   BoolExpr::post(Home home, IntConLevel icl) const {
00112     Region r(home);
00113     return NNF::nnf(r,n,false)->post(home,icl);
00114   }
00115 
00116   forceinline void
00117   BoolExpr::post(Home home, bool t, IntConLevel icl) const {
00118     Region r(home);
00119     return NNF::nnf(r,n,false)->post(home,t,icl);
00120   }
00121 
00122 }
00123 
00124 // STATISTICS: minimodel-any