Lines Matching refs:key
55 association is identified by a unique string key. Looking up values
64 char ** key ; /** List of string keys */
75 @brief Compute the hash key for a string.
76 @param key Character string to use for key.
81 The key is stored anyway in the struct so that collision can be avoided
82 by comparing the key itself in last resort.
85 unsigned dictionary_hash(const char * key);
115 @param key Key to look for in the dictionary.
116 @param def Default value to return if key not found.
119 This function locates a key in a dictionary and returns a pointer to its
120 value, or the passed 'def' pointer if no such key can be found in
125 const char * dictionary_get(const dictionary * d, const char * key, const char * def);
132 @param key Key to modify or add.
136 If the given key is found in the dictionary, the associated value is
137 replaced by the provided one. If the key cannot be found in the
141 or the key are considered as errors: the function will return immediately
148 dictionary. It is not possible (in this implementation) to have a key in
154 int dictionary_set(dictionary * vd, const char * key, const char * val);
158 @brief Delete a key in a dictionary
160 @param key Key to remove.
163 This function deletes a key in a dictionary. Nothing is done if the
164 key cannot be found.
167 void dictionary_unset(dictionary * d, const char * key);