/usr/include/speech_tools/base_class/EST_TDeque.cc is in libestools-dev 1:2.4~release-1build1.
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 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 | /************************************************************************/
/* */
/* Centre for Speech Technology Research */
/* University of Edinburgh, UK */
/* Copyright (c) 1996,1997 */
/* All Rights Reserved. */
/* */
/* Permission is hereby granted, free of charge, to use and distribute */
/* this software and its documentation without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, and/or sell copies of this work, and to */
/* permit persons to whom this work is furnished to do so, subject to */
/* the following conditions: */
/* 1. The code must retain the above copyright notice, this list of */
/* conditions and the following disclaimer. */
/* 2. Any modifications must be clearly marked as such. */
/* 3. Original authors' names are not deleted. */
/* 4. The authors' names are not used to endorse or promote products */
/* derived from this software without specific prior written */
/* permission. */
/* */
/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
/* THIS SOFTWARE. */
/* */
/*************************************************************************/
/* */
/* Author: Richard Caley (rjc@cstr.ed.ac.uk) */
/* -------------------------------------------------------------------- */
/* Double ended queue. */
/* */
/* Implemented in a vector used as a circular buffer. When more space */
/* is needed we expand the vector and copy the data to the beginning */
/* of the buffer. */
/* */
/*************************************************************************/
#include "EST_error.h"
#include "EST_TDeque.h"
template <class T>
EST_TDeque<T>::EST_TDeque(unsigned int capacity, unsigned int increment)
: p_vector(capacity)
{
p_increment = increment;
p_front=0;
p_back=0;
}
template <class T>
EST_TDeque<T>::EST_TDeque(unsigned int capacity)
: p_vector(capacity)
{
p_increment = 10;
p_front=0;
p_back=0;
}
template <class T>
EST_TDeque<T>::EST_TDeque()
{
p_vector.resize(10);
p_increment = 10;
p_front=0;
p_back=0;
}
template <class T>
ostream &EST_TDeque<T>::print(ostream &s) const
{
s << "{" << p_vector.n() << "|";
if (p_front >= p_back)
{
for(int i0=0; i0<p_back; i0++)
s << "<>" << "//";
for(int i=p_back; i<p_front; i++)
s << p_vector(i) << "//";
for(int in=p_front; in <p_vector.n(); in++)
s << "<>" << "//";
}
else
{
for(int ii=0; ii<p_front; ii++)
s << p_vector(ii) << "//";
for(int i0=p_front; i0<p_back; i0++)
s << "<>" << "//";
for(int i=p_back; i<p_vector.n(); i++)
s << p_vector(i) << "//";
}
return s << "}";
}
template <class T>
void EST_TDeque<T>::expand()
{
EST_TVector<T> tmp(p_vector);
if (p_back==0)
// special case for pure stack
p_vector.resize(p_vector.n()+p_increment, true);
else
{
p_vector.resize(p_vector.n()+p_increment, false);
if (p_front >= p_back)
for(int i=p_back, j=0; i<p_front; i++, j++)
p_vector[j] = tmp[i];
else
{
int j=0;
for(int i=p_back; i<tmp.n(); i++, j++)
p_vector[j] = tmp[i];
for(int ii=0; ii<p_front; ii++, j++)
p_vector[j] = tmp[ii];
p_back=0;
p_front=j;
}
}
}
template <class T>
bool EST_TDeque<T>::is_empty() const
{
return p_front==p_back;
}
template <class T>
void EST_TDeque<T>::clear()
{
p_front=p_back=0;
for(int i=0; i<p_vector.n(); i++)
p_vector[i]=*Filler;
}
template <class T>
void EST_TDeque<T>::push(T& it)
{
int next_front= p_front+1;
if (next_front >= p_vector.n())
next_front= 0;
if (next_front==p_back)
{
expand();
push(it);
}
else
{
p_vector[p_front] = it;
p_front=next_front;
}
}
template <class T>
T &EST_TDeque<T>::pop()
{
if (is_empty())
EST_error("empty stack!");
p_front--;
if (p_front < 0)
p_front=p_vector.n()-1;
return p_vector[p_front];
}
template <class T>
T &EST_TDeque<T>::nth(int n)
{
if (is_empty())
EST_error("empty stack!");
int pos = p_front-1-n;
if (p_front < p_back)
{
if (pos < 0)
{
pos += p_vector.n();
if (pos < p_back)
EST_error("looking too far up stack!");
}
}
else
if (pos < p_back)
EST_error("looking too far up stack!");
return p_vector[pos];
}
template <class T>
void EST_TDeque<T>::back_push(T& it)
{
int next_back = p_back-1;
if (next_back < 0)
next_back = p_vector.n()-1;
if (next_back == p_front)
{
expand();
back_push(it);
}
else
{
p_vector[p_back=next_back] = it;
}
}
template <class T>
T &EST_TDeque<T>::back_pop()
{
if (is_empty())
EST_error("empty stack!");
int old_back = p_back;
p_back++;
if (p_back >= p_vector.n())
p_back=0;
return p_vector[old_back];
}
|