/usr/include/speech_tools/EST_TBuffer.h is in libestools2.1-dev 1:2.1~release-2build2.
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 | /************************************************************************/
/* */
/* 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. */
/* */
/*************************************************************************/
/**@name EST_TBuffer.h
* Extending buffers, ie arrays which grow as needed.
* I got fed up of writing equivalent code all over the place.
*
* @see EST_TBuffer
* @author Richard Caley <rjc@cstr.ed.ac.uk>
* @version $Id: EST_TBuffer.h,v 1.4 2004/09/29 08:24:17 robert Exp $
*/
//@{
#ifndef __EST_TBUFFER_H__
#define __EST_TBUFFER_H__
#include "EST_bool.h"
/// How many chunks of memory to keep around for re-use.
#define TBUFFER_N_OLD (10)
/// Initial size for buffers created with no size specified.
#define TBUFFER_DEFAULT_SIZE 0
/// Amount to increment buffer size by.
#define TBUFFER_DEFAULT_STEP 100
/** Structure to remember old buffers for re-use.
* @see EST_TBuffer.h
*/
struct old_tbuffer { void *mem; unsigned int size; };
/// Memory of old buffers
extern struct old_tbuffer EST_old_buffers[TBUFFER_N_OLD];
/** Extending buffer class.
* <p>
* This class provides the convenience of arrays which change in size
* at run time rather more efficiently than the full EST_TVector class
* would.
* <p>
* Buffers can only be expanded and when a buffer is no longer needed
* (i.e. when the variable goes out of scope) the memory is not deleted,
* rather it is saved for re-use as a new buffer.
* <p>
* A typical use would be a buffer to hold a windowed section of a signal
* inside a signal processing loop where the size of the window changes from
* iteration to iteration.
*
* @see EST_TBuffer.h, Associated definitions.
* @see EST_TVector, class to use for more general uses.
* @see lpc_analyse, example of use.
*/
template<class TYPE>
class EST_TBuffer {
private:
/// Pointer to memory.
TYPE *p_buffer;
/// Current size.
unsigned int p_size;
/// Amount to grow by (if negative it is a percentage).
int p_step;
private:
/// Setup code.
void init(unsigned int size, int step);
/// Expand the buffer.
void expand_to(unsigned int req_size, bool cpy);
/// Expand and set some of it to a known value.
void expand_to(unsigned int req_size, const TYPE &set_to, int howmany);
public:
/** Create with size and increment.
* Increment can be negative for percentage growth.
* <p>
* Tries to use a buffer from EST_old_buffers[] if there is one which
* is suitable
* @see EST_old_buffers
*/
EST_TBuffer(unsigned int size=TBUFFER_DEFAULT_SIZE, int step=TBUFFER_DEFAULT_STEP);
/// Destructor. Places the memory in EST_old_buffers[] for re-use if there is room.
~EST_TBuffer(void);
/// Current available space.
unsigned int length(void) const {return p_size;}
/// Set to the given value. By default sets all values.
void set(const TYPE &set_to, int howmany=-1);
/**@name Methods to make sure there is enough space. */
//@{
/// Extend if needed, copying existing data.
void ensure(unsigned int req_size)
{if (req_size > p_size) expand_to(req_size, (bool)TRUE);}
/// Make sure there is enough space, copying if requested.
void ensure(unsigned int req_size, bool copy)
{if (req_size > p_size) expand_to(req_size, copy,-1);}
/// Make sure there is enough space, setting to a known value.
void ensure(unsigned int req_size, const TYPE &set_to, int howmany=-1)
{if (req_size > p_size) expand_to(req_size, set_to, howmany);}
//@}
/**@name Access to the memory itself. */
//@{
/// Simple access as a pointer.
TYPE *b(void) {return p_buffer;}
/// Read-only access when the EST_TBuffer is a constant
const TYPE *b(void) const {return p_buffer;}
/// operator () is simple access
const TYPE &operator() (unsigned int i) const { return p_buffer[i];}
TYPE &operator[] (unsigned int i) { return p_buffer[i];}
const TYPE &operator[] (unsigned int i) const { return p_buffer[i];}
//@}
};
#endif
//@}
|