Generated on Sat Nov 9 2013 19:18:25 for Gecode by doxygen 1.8.4
activity.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2012
8  *
9  * Last modified:
10  * $Date: 2013-07-23 14:31:03 +0200 (Tue, 23 Jul 2013) $ by $Author: schulte $
11  * $Revision: 13939 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/kernel.hh>
39 
40 namespace Gecode {
41 
42  const Activity Activity::def;
43 
45  : storage(a.storage) {
46  if (storage != NULL) {
47  acquire();
48  storage->use_cnt++;
49  release();
50  }
51  }
52 
53  Activity&
55  if (storage != a.storage) {
56  if (storage != NULL) {
57  bool done;
58  acquire();
59  done = (--storage->use_cnt == 0);
60  release();
61  if (done)
62  delete storage;
63  }
64  storage = a.storage;
65  if (storage != NULL) {
66  acquire();
67  storage->use_cnt++;
68  release();
69  }
70  }
71  return *this;
72  }
73 
75  if (storage == NULL)
76  return;
77  bool done;
78  acquire();
79  done = (--storage->use_cnt == 0);
80  release();
81  if (done)
82  delete storage;
83  }
84 
85  void
87  const_cast<Activity&>(a).acquire();
88  storage = a.storage;
89  storage->use_cnt++;
90  const_cast<Activity&>(a).release();
91  }
92 
93  void
94  Activity::set(Space&, double a) {
95  acquire();
96  for (int i=storage->n; i--; )
97  storage->a[i] = a;
98  release();
99  }
100 
101  void
102  Activity::decay(Space&, double d) {
103  acquire();
104  storage->d = d;
105  release();
106  }
107 
108  double
109  Activity::decay(const Space&) const {
110  double d;
111  const_cast<Activity*>(this)->acquire();
112  d = storage->d;
113  const_cast<Activity*>(this)->release();
114  return d;
115  }
116 
117 }
118 
119 // STATISTICS: kernel-branch