Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0
static-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
34namespace Gecode { namespace Support {
35
41 template<class T, class A>
43 private:
45 A& a;
47 int n;
49 unsigned int tos;
51 T* stack;
52 public:
54 StaticStack(A& a, int n);
57
59 void reset(void);
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 private:
76 static void* operator new(size_t s) throw() { (void) s; return NULL; }
78 static void operator delete(void* p) { (void) p; };
80 StaticStack(const StaticStack& s) : a(s.a) {}
82 const StaticStack& operator =(const StaticStack&) { return *this; }
83 };
84
85 template<class T, class A>
88 : a(a0), n(n0), tos(0), stack(a.template alloc<T>(n)) {}
89
90 template<class T, class A>
93 a.free(stack,n);
94 }
95
96 template<class T, class A>
97 forceinline bool
99 return tos==0;
100 }
101
102 template<class T, class A>
103 forceinline int
105 return tos;
106 }
107
108 template<class T, class A>
109 forceinline void
111 tos = 0;
112 }
113
114 template<class T, class A>
117 assert((tos > 0) && (tos <= static_cast<unsigned int>(n)));
118 return stack[--tos];
119 }
120
121 template<class T, class A>
122 forceinline T&
124 assert((tos > 0) && (tos <= static_cast<unsigned int>(n)));
125 return stack[tos-1];
126 }
127
128 template<class T, class A>
129 forceinline T&
131 assert((tos >= 0) && (tos < static_cast<unsigned int>(n)));
132 return stack[tos];
133 }
134
135 template<class T, class A>
136 forceinline void
138 assert(tos < static_cast<unsigned int>(n));
139 stack[tos++] = x;
140 }
141
142}}
143
144// STATISTICS: support-any
void push(const T &x)
Push element x on top of stack.
void reset(void)
Reset stack (pop all elements)
~StaticStack(void)
Release memory.
T pop(void)
Pop topmost element from stack and return it.
T & last(void) const
Return element that has just been popped.
bool empty(void) const
Test whether stack is empty.
StaticStack(A &a, int n)
Initialize for n elements.
T & top(void) const
Return element on top of stack.
int entries(void) const
Return number of entries currently on stack.
Support algorithms and datastructures
Gecode toplevel namespace
Post propagator for SetVar x
Definition set.hh:773
#define forceinline
Definition config.hpp:194