/usr/include/gecode/support/dynamic-queue.hpp is in libgecode-dev 4.2.1-2.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* Last modified:
* $Date: 2009-09-08 21:10:29 +0200 (Tue, 08 Sep 2009) $ by $Author: schulte $
* $Revision: 9692 $
*
* 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 Queue with arbitrary number of elements
*
* \ingroup FuncSupport
*/
template<class T, class A>
class DynamicQueue {
private:
/// Memory allocator
A& a;
/// Current size of queue (must be power of two)
int limit;
/// First element in queue
int fst;
/// Last element in queue
int lst;
/// Elements in queue
T* q;
/// Resize queue (double size)
void resize(void);
/// Move index \a i to next element
void move(int& i);
public:
/// Initialize queue
DynamicQueue(A& a);
/// Release memory
~DynamicQueue(void);
/// Test whether queue is empty
bool empty(void) const;
/// Reset queue to be empty
void reset(void);
/// Pop element added first from queue and return it
T pop(void);
/// Push element \a x to queue
void push(const T& x);
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)
DynamicQueue(const DynamicQueue& s) : a(s.a) {}
/// Assignment operator (disabled)
const DynamicQueue& operator =(const DynamicQueue&) { return *this; }
};
template<class T, class A>
forceinline void
DynamicQueue<T,A>::move(int& i) {
i = (i+1) & (limit - 1);
}
template<class T, class A>
void
DynamicQueue<T,A>::resize(void) {
assert(fst == lst);
T* nq = a.template alloc<T>(limit << 1);
int j=0;
for (int i = fst; i<limit; i++)
nq[j++] = q[i];
for (int i = 0; i<lst; i++)
nq[j++] = q[i];
a.template free<T>(q,limit);
q = nq;
fst = 0;
lst = limit;
limit <<= 1;
}
template<class T, class A>
forceinline
DynamicQueue<T,A>::DynamicQueue(A& a0)
: a(a0), limit(8), fst(0), lst(0), q(a.template alloc<T>(limit)) {}
template<class T, class A>
forceinline
DynamicQueue<T,A>::~DynamicQueue(void) {
a.free(q,limit);
}
template<class T, class A>
forceinline bool
DynamicQueue<T,A>::empty(void) const {
return fst == lst;
}
template<class T, class A>
forceinline void
DynamicQueue<T,A>::reset(void) {
fst = lst = 0;
}
template<class T, class A>
forceinline T
DynamicQueue<T,A>::pop(void) {
assert(!empty());
T t = q[fst];
move(fst);
return t;
}
template<class T, class A>
forceinline void
DynamicQueue<T,A>::push(const T& x) {
q[lst] = x;
move(lst);
if (fst == lst)
resize();
}
}}
// STATISTICS: support-any
|