/usr/include/gecode/support/dynamic-stack.hpp is in libgecode-dev 4.4.0-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
*
* Last modified:
* $Date: 2013-07-11 12:30:18 +0200 (Thu, 11 Jul 2013) $ by $Author: schulte $
* $Revision: 13840 $
*
* 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.
*
*/
namespace Gecode { namespace Support {
/**
* \brief Stack with arbitrary number of elements
*
* \ingroup FuncSupport
*/
template<class T, class A>
class DynamicStack {
private:
/// Memory allocator
A& a;
/// Current size of the stack
int limit;
/// Top of stack
int tos;
/// Elements on stack
T* stack;
/// Resize stack (increase size)
void resize(void);
public:
/// Initialize stack with \a n elements
DynamicStack(A& a, int n=64);
/// Release memory
~DynamicStack(void);
/// Test whether stack is empty
bool empty(void) const;
/// Return number of entries currently on stack
int entries(void) const;
/// Pop topmost element from stack and return it
T pop(void);
/// Return element on top of stack
T& top(void) const;
/// Return element that has just been popped
T& last(void) const;
/// Push element \a x on top of stack
void push(const T& x);
/** \brief Return entry at position \a i
*
* Position 0 corresponds to the element first pushed,
* whereas position \c entries()-1 corresponds to the
* element pushed last.
*/
T& operator [](int i);
/** \brief Return entry at position \a i
*
* Position 0 corresponds to the element first pushed,
* whereas position \c entries()-1 corresponds to the
* element pushed last.
*/
const T& operator [](int i) const;
private:
/// Allocate memory from heap (disabled)
static void* operator new(size_t s) throw() { (void) s; return NULL; }
/// Free memory allocated from heap (disabled)
static void operator delete(void* p) { (void) p; };
/// Copy constructor (disabled)
DynamicStack(const DynamicStack& s) : a(s.a) {}
/// Assignment operator (disabled)
const DynamicStack& operator =(const DynamicStack&) { return *this; }
};
template<class T, class A>
void
DynamicStack<T,A>::resize(void) {
int nl = (limit * 3) / 2;
stack = a.template realloc<T>(stack,limit,nl);
limit = nl;
}
template<class T, class A>
forceinline
DynamicStack<T,A>::DynamicStack(A& a0, int n)
: a(a0), limit(n), tos(0), stack(a.template alloc<T>(n)) {}
template<class T, class A>
forceinline
DynamicStack<T,A>::~DynamicStack(void) {
a.free(stack,limit);
}
template<class T, class A>
forceinline T
DynamicStack<T,A>::pop(void) {
return stack[--tos];
}
template<class T, class A>
forceinline T&
DynamicStack<T,A>::top(void) const {
return stack[tos-1];
}
template<class T, class A>
forceinline T&
DynamicStack<T,A>::last(void) const {
return stack[tos];
}
template<class T, class A>
forceinline void
DynamicStack<T,A>::push(const T& x) {
stack[tos++] = x;
if (tos==limit)
resize();
}
template<class T, class A>
forceinline bool
DynamicStack<T,A>::empty(void) const {
return tos==0;
}
template<class T, class A>
forceinline int
DynamicStack<T,A>::entries(void) const {
return tos;
}
template<class T, class A>
forceinline T&
DynamicStack<T,A>::operator [](int i) {
return stack[i];
}
template<class T, class A>
forceinline const T&
DynamicStack<T,A>::operator [](int i) const {
return stack[i];
}
}}
// STATISTICS: support-any
|