|AVDictionaryEntry * ||av_dict_get (AVDictionary *m, const char *key, const AVDictionaryEntry *prev, int flags)|
| ||Get a dictionary entry with matching key. |
|int ||av_dict_count (const AVDictionary *m)|
| ||Get number of entries in dictionary. |
|int ||av_dict_set (AVDictionary **pm, const char *key, const char *value, int flags)|
| ||Set the given entry in *pm, overwriting an existing entry. |
|int ||av_dict_parse_string (AVDictionary **pm, const char *str, const char *key_val_sep, const char *pairs_sep, int flags)|
| ||Parse the key/value pairs list and add to a dictionary. |
|void ||av_dict_copy (AVDictionary **dst, AVDictionary *src, int flags)|
| ||Copy entries from one AVDictionary struct into another. |
|void ||av_dict_free (AVDictionary **m)|
| ||Free all the memory allocated for an AVDictionary struct and all keys and values. |
Public dictionary API.
- AVDictionary is provided for compatibility with libav. It is both in implementation as well as API inefficient. It does not scale and is extremely slow with large dictionaries. It is recommended that new code uses our tree container from tree.c/h where applicable, which uses AVL trees to achieve O(log n) performance.
Definition in file dict.h.