In file ../include/EST_TKVL.h:

## template<class K, class V> class EST_TKVL

> Templated Key-Value list.

## Inheritance:

### Public Fields

  static V* | default_val default value, returned when there is no such entry
  static K* | default_key default value, returned when there is no such entry

### Public Methods

  | Constructor functions
  | EST_TKVL () default constructor
  | EST_TKVL (const EST_TKVL<K, V> &kv) copy constructor
  const int | length () const number of key value pairs in list
  EST_Litem* | head () const Return First key value pair in list
  void | clear () Empty list
  | Access functions.
  const V& | val (const K &rkey, bool m=0) const return value according to key (const)
  V& | val (const K &rkey, bool m=0) return value according to key (non-const)
  const V& | val (EST_Litem* ptr, bool m=0) const return value according to ptr
  V& | val (EST_Litem* ptr, bool m=0) return value according to ptr
  const V& | val_def (const K &rkey, const V &def) const value or default
  const K& | key (EST_Litem* ptr, int m=1) const find key, reference by ptr
  K& | key (EST_Litem* ptr, int m=1) find key, reference by ptr
  const K& | key (const V &v, int m=1) const return first matching key, referenced by val
  int | change_val (const K &rkey, const V &rval) change key-val pair.
  int | change_val (EST_Litem* ptr, const V &rval) change key-val pair.
  int | change_key (EST_Litem* ptr, const K &rkey) change name of key pair
  int | add_item (const K &rkey, const V &rval, int no_search = 0) add key-val pair to list
  int | remove_item (const K &rkey, int quiet = 0) remove key and val pair from list
  const int | present (const K &rkey) const Returns true if key is present
  void | map (void (*func)(K&, V&)) apply function to each pair
  EST_TKVL<K, V> & | operator = (const EST_TKVL<K, V> &kv) 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

### Public

  | Linked list of key-val pairs.

## Documentation

> 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.

`Constructor functions`

`EST_TKVL()`
  default constructor

`EST_TKVL(const EST_TKVL<K, V> &kv)`
  copy constructor

`static V* default_val`
  default value, returned when there is no such entry

`static K* default_key`
  default value, returned when there is no such entry

`Linked list of key-val pairs.`
  Linked list of key-val pairs. Don't use

`const int length() const`
  number of key value pairs in list

`EST_Litem* head() const`
  Return First key value pair in list

`void clear()`
  Empty list

`Access functions.`

`const V& val(const K &rkey, bool m=0) const`
  return value according to key (const)

`V& val(const K &rkey, bool m=0)`
  return value according to key (non-const)

`const V& val(EST_Litem* ptr, bool m=0) const`
  return value according to ptr

`V& val(EST_Litem* ptr, bool m=0)`
  return value according to ptr

`const V& val_def(const K &rkey, const V &def) const`
  value or default

`const K& key(EST_Litem* ptr, int m=1) const`
  find key, reference by ptr

`K& key(EST_Litem* ptr, int m=1)`
  find key, reference by ptr

`const K& key(const V &v, int m=1) const`
  return first matching key, referenced by val

`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. If no corresponding entry is present, add to end of list.

`int change_key(EST_Litem* ptr, const K &rkey)`
  change name of key pair

`int add_item(const K &rkey, const V &rval, int no_search = 0)`
  add key-val pair to list

`int remove_item(const K &rkey, int quiet = 0)`
  remove key and val pair from list

`const int present(const K &rkey) const`
  Returns true if key is present

`void map(void (*func)(K&, V&))`
  apply function to each pair

`EST_TKVL<K, V> & operator = (const EST_TKVL<K, V> &kv)`
  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

Direct child classes:
  EST_Option

Friends:
  ostream& operator << (ostream& s, EST_TKVL<K,V> const &kv)
  class EST_TIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >
  class EST_TStructIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >
  class EST_TRwIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >
  class EST_TRwStructIterator< EST_TKVL<K, V>, IPointer, EST_TKVI<K, V> >
  class EST_TIterator< EST_TKVL<K, V>, IPointer_k, K >
  class EST_TRwIterator< EST_TKVL<K, V>, IPointer_k, K >

Alphabetic index HTML hierarchy of classes or Java

This page is part of the Edinburgh Speech Tools Library documentation
Copyright University of Edinburgh 1997
Contact: speech_tools@cstr.ed.ac.uk