/usr/include/speech_tools/EST_TKVL.h is in libestools2.1-dev 1:2.1~release-8.
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 | /*************************************************************************/
/* */
/* Centre for Speech Technology Research */
/* University of Edinburgh, UK */
/* Copyright (c) 1995,1996 */
/* 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 : Paul Taylor */
/* Date : January 1995 */
/*-----------------------------------------------------------------------*/
/* Key/Value list template class */
/* */
/*=======================================================================*/
#ifndef __EST_TKVL_H__
#define __EST_TKVL_H__
#include <cmath>
using namespace std;
#include "EST_TList.h"
#include "instantiate/EST_TKVLI.h"
#include "EST_TIterator.h"
class EST_String;
/** \class EST_TKVI
* @ingroup containerclasses
* \brief Templated Key-Value Item. Serves as the items in the list of the
EST_TKVL class. */
template<class K, class V> class EST_TKVI {
public:
K k;
V v;
inline bool operator==(const EST_TKVI<K,V> &i){
return( (i.k == k) && (i.v == v) );
}
friend ostream& operator << (ostream& s, EST_TKVI<K,V> const &i)
{ return s << i.k << "\t" << i.v << "\n"; }
};
/** \class EST_TKVL
* @ingroup containerclasses
* \brief Templated Key-Value list. Objects of type EST_TKVL contain lists which
are accessed by a key of type `K`, which returns a value of type `V`. */
template<class K, class V> class EST_TKVL {
private:
EST_Litem *find_pair_key(const K &key) const;
EST_Litem *find_pair_val(const V &val) const;
public:
/**@name Constructor functions */
///@{
/// default constructor
EST_TKVL() {;}
/// copy constructor
EST_TKVL(const EST_TKVL<K, V> &kv);
///@}
/// default value, returned when there is no such entry.
static V *default_val;
/// default value, returned when there is no such entry.
static K *default_key;
/// Linked list of key-val pairs. Don't use
/// this as it will be made private in the future
EST_TList< EST_TKVI<K,V> > list;
/// number of key value pairs in list
const int length() const {return list.length();}
/// Return First key value pair in list
EST_Litem * head() const {return list.head();};
/// Empty list.
void clear();
/**@name Access functions.
*/
///@{
/// return value according to key (const)
const V &val(const K &rkey, bool m=0) const;
/// return value according to key (non-const)
V &val(const K &rkey, bool m=0);
/// return value according to ptr
const V &val(EST_Litem *ptr, bool m=0) const;
/// return value according to ptr
V &val(EST_Litem *ptr, bool m=0);
/// value or default
const V &val_def(const K &rkey, const V &def) const;
/// find key, reference by ptr
const K &key(EST_Litem *ptr, int m=1) const;
/// find key, reference by ptr
K &key(EST_Litem *ptr, int m=1);
/// return first matching key, referenced by val
const K &key(const V &v, int m=1) const;
/** change key-val pair. If no corresponding entry is present, add
to end of list.
*/
int change_val(const K &rkey,const V &rval);
/** change key-val pair. If no corresponding entry is present, add
to end of list.*/
int change_val(EST_Litem *ptr,const V &rval); // change key-val pair.
/// change name of key pair.
int change_key(EST_Litem *ptr,const K &rkey);
/// add key-val pair to list
int add_item(const K &rkey,const V &rval, int no_search = 0);
/// remove key and val pair from list
int remove_item(const K &rkey, int quiet = 0);
///@}
/// Returns true if key is present.
const int present(const K &rkey) const;
/// apply function to each pair
void map(void (*func)(K&, V&));
friend ostream& operator << (ostream& s, EST_TKVL<K,V> const &l)
{EST_Litem *p;
for (p = l.list.head(); p ; p = p->next())
s << l.list(p).k << "\t" << l.list(p).v << endl;
return s;
}
/// full copy of KV list.
EST_TKVL<K, V> & operator = (const EST_TKVL<K,V> &kv);
/// add kv after existing list.
EST_TKVL<K, V> & operator += (const EST_TKVL<K,V> &kv);
/// make new concatenated list
EST_TKVL<K, V> operator + (const EST_TKVL<K,V> &kv);
// Iteration support
protected:
struct IPointer { EST_Litem *p; };
void point_to_first(IPointer &ip) const { ip.p = list.head(); }
void move_pointer_forwards(IPointer &ip) const { ip.p = ip.p->next(); }
bool points_to_something(const IPointer &ip) const { return ip.p != NULL; }
EST_TKVI<K, V> &points_at(const IPointer &ip) { return list(ip.p); }
friend class EST_TIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >;
friend class EST_TStructIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >;
friend class EST_TRwIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >;
friend class EST_TRwStructIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >;
public:
typedef EST_TKVI<K, V> Entry;
typedef EST_TStructIterator< EST_TKVL<K, V>, IPointer, Entry> Entries;
typedef EST_TRwStructIterator< EST_TKVL<K, V>, IPointer, Entry> RwEntries;
// Iteration support
protected:
struct IPointer_k { EST_Litem *p; };
void point_to_first(IPointer_k &ip) const { ip.p = list.head(); }
void move_pointer_forwards(IPointer_k &ip) const { ip.p = ip.p->next(); }
bool points_to_something(const IPointer_k &ip) const { return ip.p != NULL; }
K &points_at(const IPointer_k &ip) { return list(ip.p).k; }
friend class EST_TIterator< EST_TKVL<K, V>, IPointer_k, K >;
friend class EST_TRwIterator< EST_TKVL<K, V>, IPointer_k, K >;
public:
typedef K KeyEntry;
typedef EST_TIterator< EST_TKVL<K, V>, IPointer_k, KeyEntry> KeyEntries;
typedef EST_TRwIterator< EST_TKVL<K, V>, IPointer_k, KeyEntry> KeyRwEntries;
};
#endif // __KVL_H__
|