diff options
Diffstat (limited to 'src/cairo-hash.c')
| -rw-r--r-- | src/cairo-hash.c | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/src/cairo-hash.c b/src/cairo-hash.c index 72b20b12..e6494120 100644 --- a/src/cairo-hash.c +++ b/src/cairo-hash.c @@ -47,7 +47,7 @@ * DEAD: Entry had been live in the past. A dead entry can be reused * but does not terminate a search for an exact entry. * Appears in the table as a pointer to DEAD_ENTRY. - * + * * LIVE: Entry is currently being used. * Appears in the table as any non-NULL, non-DEAD_ENTRY pointer. */ @@ -130,7 +130,7 @@ struct _cairo_hash_table { /** * _cairo_hash_table_create: * @keys_equal: a function to return TRUE if two keys are equal - * + * * Creates a new hash table which will use the keys_equal() function * to compare hash keys. Data is provided to the hash table in the * form of user-derived versions of cairo_hash_entry_t. A hash entry @@ -140,7 +140,7 @@ struct _cairo_hash_table { * will be necessary, (as in _cairo_hash_table_insert). * * See #cairo_hash_entry_t for more details. - * + * * Return value: the new hash table or NULL if out of memory. **/ cairo_hash_table_t * @@ -172,7 +172,7 @@ _cairo_hash_table_create (cairo_hash_keys_equal_func_t keys_equal) /** * _cairo_hash_table_destroy: * @hash_table: an empty hash table to destroy - * + * * Immediately destroys the given hash table, freeing all resources * associated with it. * @@ -212,7 +212,7 @@ _cairo_hash_table_destroy (cairo_hash_table_t *hash_table) * @key_unique: If TRUE, then caller asserts that no key already * exists that will compare equal to #key, so search can be * optimized. If unsure, set to FALSE and the code will always work. - * + * * Search the hashtable for a live entry for which * hash_table->keys_equal returns true. If no such entry exists then * return the first available (free or dead entry). @@ -275,7 +275,7 @@ _cairo_hash_table_lookup_internal (cairo_hash_table_t *hash_table, idx -= table_size; } - /* + /* * The table should not have permitted you to get here if you were just * looking for a free slot: there should have been room. */ @@ -287,11 +287,11 @@ _cairo_hash_table_lookup_internal (cairo_hash_table_t *hash_table, /** * _cairo_hash_table_resize: * @hash_table: a hash table - * + * * Resize the hash table if the number of entries has gotten much * bigger or smaller than the ideal number of entries for the current * size. - * + * * Return value: CAIRO_STATUS_SUCCESS if successful or * CAIRO_STATUS_NO_MEMORY if out of memory. **/ @@ -353,11 +353,11 @@ _cairo_hash_table_resize (cairo_hash_table_t *hash_table) * @hash_table: a hash table * @key: the key of interest * @entry_return: pointer for return value. - * + * * Performs a lookup in @hash_table looking for an entry which has a * key that matches @key, (as determined by the keys_equal() function * passed to _cairo_hash_table_create). - * + * * Return value: TRUE if there is an entry in the hash table that * matches the given key, (which will now be in *entry_return). FALSE * otherwise, (in which case *entry_return will be NULL). @@ -384,7 +384,7 @@ _cairo_hash_table_lookup (cairo_hash_table_t *hash_table, * _cairo_hash_table_random_entry: * @hash_table: a hash table * @predicate: a predicate function, or NULL for any entry. - * + * * Find a random entry in the hash table satisfying the given * @predicate. A NULL @predicate is taken as equivalent to a function * which always returns TRUE, (eg. any entry in the table will do). @@ -442,7 +442,7 @@ _cairo_hash_table_random_entry (cairo_hash_table_t *hash_table, * _cairo_hash_table_insert: * @hash_table: a hash table * @key_and_value: an entry to be inserted - * + * * Insert the entry #key_and_value into the hash table. * * WARNING: It is a fatal error if an entry exists in the hash table @@ -454,7 +454,7 @@ _cairo_hash_table_random_entry (cairo_hash_table_t *hash_table, * Instead of using insert to replace an entry, consider just editing * the entry obtained with _cairo_hash_table_lookup. Or if absolutely * necessary, use _cairo_hash_table_remove first. - * + * * Return value: CAIRO_STATUS_SUCCESS if successful or * CAIRO_STATUS_NO_MEMORY if insufficient memory is available. **/ @@ -491,7 +491,7 @@ _cairo_hash_table_insert (cairo_hash_table_t *hash_table, * _cairo_hash_table_remove: * @hash_table: a hash table * @key: key of entry to be removed - * + * * Remove an entry from the hash table which has a key that matches * @key, if any (as determined by the keys_equal() function passed to * _cairo_hash_table_create). @@ -529,7 +529,7 @@ _cairo_hash_table_remove (cairo_hash_table_t *hash_table, * @hash_table: a hash table * @hash_callback: function to be called for each live entry * @closure: additional argument to be passed to @hash_callback - * + * * Call @hash_callback for each live entry in the hash table, in a * non-specified order. * |