File: unshare.cpp

package info (click to toggle)
gecode-snapshot 6.2.0%2Bgit20240207-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 35,308 kB
  • sloc: cpp: 475,516; perl: 2,077; makefile: 1,816; sh: 198
file content (147 lines) | stat: -rwxr-xr-x 4,464 bytes parent folder | download | duplicates (4)
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
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2007
 *
 *  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.
 *
 */

#include <gecode/int/rel.hh>
#include <gecode/int/bool.hh>

/**
 * \namespace Gecode::Int::Unshare
 * \brief Unsharing shared variables
 */

namespace Gecode { namespace Int { namespace Unshare {

  /// Sort order for variables
  template<class Var>
  class VarPtrLess {
  public:
    forceinline bool
    operator ()(const Var* a, const Var* b) {
      return a->varimp() < b->varimp();
    }
  };
  

  /// Replace by fresh yet equal integer variables
  forceinline void
  link(Home home, IntVar** x, int n, IntPropLevel ipl) {
    if (home.failed()) {
      for (int i=1; i<n; i++)
        *x[i]=IntVar(home,x[0]->min(),x[0]->min());
    } else if (n > 2) {
      ViewArray<IntView> y(home,n);
      y[0]=*x[0];
      for (int i=1; i<n; i++)
        y[i]=*x[i]=IntVar(home,x[0]->min(),x[0]->max());
      if ((ipl == IPL_DOM) || (ipl == IPL_DEF)) {
        ExecStatus es = Rel::NaryEqDom<IntView>::post(home,y);
        (void) es; assert(es == ES_OK);
      } else {
        ExecStatus es = Rel::NaryEqBnd<IntView>::post(home,y);
        (void) es; assert(es == ES_OK);
      }
    } else if (n == 2) {
      *x[1]=IntVar(home,x[0]->min(),x[0]->max());
      if ((ipl == IPL_DOM) || (ipl == IPL_DEF)) {
        ExecStatus es = Rel::EqDom<IntView,IntView>::post(home,*x[0],*x[1]);
        (void) es; assert(es == ES_OK);
      } else {
        ExecStatus es = Rel::EqBnd<IntView,IntView>::post(home,*x[0],*x[1]);
        (void) es; assert(es == ES_OK);
      }
    }
  }

  /// Replace by fresh yet equal Boolean variables
  forceinline void
  link(Home home, BoolVar** x, int n, IntPropLevel) {
    if (home.failed()) {
      for (int i=1; i<n; i++)
        *x[i]=BoolVar(home,0,0);
    } else if (n > 2) {
      ViewArray<BoolView> y(home,n);
      y[0]=*x[0];
      for (int i=1; i<n; i++)
        y[i]=*x[i]=BoolVar(home,0,1);
      ExecStatus es = Bool::NaryEq<BoolView>::post(home,y);
      (void) es; assert(es == ES_OK);
    } else if (n == 2) {
      *x[1] = BoolVar(home,0,1);
      ExecStatus es = Bool::Eq<BoolView,BoolView>::post(home,*x[0],*x[1]);
      (void) es; assert(es == ES_OK);
    }
  }

  /// Replace unassigned shared variables by fresh, yet equal variables
  template<class Var>
  forceinline void
  unshare(Home home, VarArgArray<Var>& x, IntPropLevel ipl) {
    int n=x.size();
    if (n < 2)
      return;
    
    Region r;
    Var** y = r.alloc<Var*>(n);
    for (int i=0; i<n; i++)
      y[i]=&x[i];

    VarPtrLess<Var> vpl;
    Support::quicksort<Var*,VarPtrLess<Var> >(y,n,vpl);
    
    // Replace all shared variables with new and equal variables
    for (int i=0; i<n;) {
      int j=i++;
      while ((i<n) && (y[j]->varimp() == y[i]->varimp()))
        i++;
      if (!y[j]->assigned())
        link(home,&y[j],i-j,ipl);
    }
  }

}}}

namespace Gecode {

  void
  unshare(Home home, IntVarArgs& x, IntPropLevel ipl) {
    Int::Unshare::unshare<IntVar>(home,x,vbd(ipl));
  }

  void
  unshare(Home home, BoolVarArgs& x, IntPropLevel) {
    Int::Unshare::unshare<BoolVar>(home,x,IPL_DEF);
  }

}

// STATISTICS: int-post