Generated on Mon Jul 27 2020 00:00:00 for Gecode by doxygen 1.8.18
dynamic-stack.hpp
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, 2002
8  *
9  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 namespace Gecode { namespace Support {
35 
41  template<class T, class A>
42  class DynamicStack {
43  private:
45  A& a;
47  int limit;
49  int tos;
51  T* stack;
53  void resize(void);
54  public:
56  DynamicStack(A& a, int n=64);
59 
61  bool empty(void) const;
63  int entries(void) const;
64 
66  T pop(void);
68  T& top(void) const;
70  T& last(void) const;
72  void push(const T& x);
73 
74 
81  T& operator [](int i);
88  const T& operator [](int i) const;
89  private:
91  static void* operator new(size_t s) throw() { (void) s; return NULL; }
93  static void operator delete(void* p) { (void) p; };
95  DynamicStack(const DynamicStack& s) : a(s.a) {}
97  const DynamicStack& operator =(const DynamicStack&) { return *this; }
98  };
99 
100 
101  template<class T, class A>
102  void
103  DynamicStack<T,A>::resize(void) {
104  int nl = (limit * 3) / 2;
105  stack = a.template realloc<T>(stack,limit,nl);
106  limit = nl;
107  }
108 
109  template<class T, class A>
112  : a(a0), limit(n), tos(0), stack(a.template alloc<T>(n)) {}
113 
114  template<class T, class A>
117  a.free(stack,limit);
118  }
119 
120  template<class T, class A>
121  forceinline T
123  return stack[--tos];
124  }
125 
126  template<class T, class A>
127  forceinline T&
129  return stack[tos-1];
130  }
131 
132  template<class T, class A>
133  forceinline T&
135  return stack[tos];
136  }
137 
138  template<class T, class A>
139  forceinline void
141  stack[tos++] = x;
142  if (tos==limit)
143  resize();
144  }
145 
146  template<class T, class A>
147  forceinline bool
149  return tos==0;
150  }
151 
152  template<class T, class A>
153  forceinline int
155  return tos;
156  }
157 
158  template<class T, class A>
159  forceinline T&
161  return stack[i];
162  }
163 
164  template<class T, class A>
165  forceinline const T&
167  return stack[i];
168  }
169 
170 }}
171 
172 // STATISTICS: support-any
Post propagator for SetVar x
Definition: set.hh:767
DynamicStack(A &a, int n=64)
Initialize stack with n elements.
T & top(void) const
Return element on top of stack.
Gecode toplevel namespace
void push(const T &x)
Push element x on top of stack.
~DynamicStack(void)
Release memory.
T pop(void)
Pop topmost element from stack and return it.
T & operator[](int i)
Return entry at position i.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
int entries(void) const
Return number of entries currently on stack.
T & last(void) const
Return element that has just been popped.
bool empty(void) const
Test whether stack is empty.
Stack with arbitrary number of elements.
#define forceinline
Definition: config.hpp:185
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Gecode::IntArgs i({1, 2, 3, 4})
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232