diff options
Diffstat (limited to 'source/blender/blenlib/BLI_edgehash.h')
| -rw-r--r-- | source/blender/blenlib/BLI_edgehash.h | 84 |
1 files changed, 42 insertions, 42 deletions
diff --git a/source/blender/blenlib/BLI_edgehash.h b/source/blender/blenlib/BLI_edgehash.h index b00ac683eb1..8d7d3b05653 100644 --- a/source/blender/blenlib/BLI_edgehash.h +++ b/source/blender/blenlib/BLI_edgehash.h @@ -39,62 +39,62 @@ struct EdgeHashIterator; typedef struct EdgeHash EdgeHash; typedef struct EdgeHashIterator EdgeHashIterator; -typedef void (*EdgeHashFreeFP)(void *key); +typedef void (*EdgeHashFreeFP)(void *key); -EdgeHash* BLI_edgehash_new (void); -void BLI_edgehash_free (EdgeHash *eh, EdgeHashFreeFP valfreefp); +EdgeHash *BLI_edgehash_new(void); +void BLI_edgehash_free(EdgeHash *eh, EdgeHashFreeFP valfreefp); - /* Insert edge (v0,v1) into hash with given value, does - * not check for duplicates. - */ -void BLI_edgehash_insert (EdgeHash *eh, unsigned int v0, unsigned int v1, void *val); +/* Insert edge (v0,v1) into hash with given value, does + * not check for duplicates. + */ +void BLI_edgehash_insert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val); - /* Return value for given edge (v0,v1), or NULL if - * if key does not exist in hash. (If need exists - * to differentiate between key-value being NULL and - * lack of key then see BLI_edgehash_lookup_p(). - */ -void* BLI_edgehash_lookup (EdgeHash *eh, unsigned int v0, unsigned int v1); +/* Return value for given edge (v0,v1), or NULL if + * if key does not exist in hash. (If need exists + * to differentiate between key-value being NULL and + * lack of key then see BLI_edgehash_lookup_p(). + */ +void *BLI_edgehash_lookup(EdgeHash *eh, unsigned int v0, unsigned int v1); - /* Return pointer to value for given edge (v0,v1), - * or NULL if key does not exist in hash. - */ -void** BLI_edgehash_lookup_p (EdgeHash *eh, unsigned int v0, unsigned int v1); +/* Return pointer to value for given edge (v0,v1), + * or NULL if key does not exist in hash. + */ +void **BLI_edgehash_lookup_p(EdgeHash *eh, unsigned int v0, unsigned int v1); - /* Return boolean true/false if edge (v0,v1) in hash. */ -int BLI_edgehash_haskey (EdgeHash *eh, unsigned int v0, unsigned int v1); +/* Return boolean true/false if edge (v0,v1) in hash. */ +int BLI_edgehash_haskey(EdgeHash *eh, unsigned int v0, unsigned int v1); - /* Return number of keys in hash. */ -int BLI_edgehash_size (EdgeHash *eh); +/* Return number of keys in hash. */ +int BLI_edgehash_size(EdgeHash *eh); - /* Remove all edges from hash. */ -void BLI_edgehash_clear (EdgeHash *eh, EdgeHashFreeFP valfreefp); +/* Remove all edges from hash. */ +void BLI_edgehash_clear(EdgeHash *eh, EdgeHashFreeFP valfreefp); /***/ - /** - * Create a new EdgeHashIterator. The hash table must not be mutated - * while the iterator is in use, and the iterator will step exactly - * BLI_edgehash_size(gh) times before becoming done. - */ -EdgeHashIterator* BLI_edgehashIterator_new (EdgeHash *eh); +/** + * Create a new EdgeHashIterator. The hash table must not be mutated + * while the iterator is in use, and the iterator will step exactly + * BLI_edgehash_size(gh) times before becoming done. + */ +EdgeHashIterator *BLI_edgehashIterator_new(EdgeHash *eh); + +/* Free an EdgeHashIterator. */ +void BLI_edgehashIterator_free(EdgeHashIterator *ehi); - /* Free an EdgeHashIterator. */ -void BLI_edgehashIterator_free (EdgeHashIterator *ehi); +/* Retrieve the key from an iterator. */ +void BLI_edgehashIterator_getKey(EdgeHashIterator *ehi, unsigned int *v0_r, unsigned int *v1_r); - /* Retrieve the key from an iterator. */ -void BLI_edgehashIterator_getKey (EdgeHashIterator *ehi, unsigned int *v0_r, unsigned int *v1_r); - - /* Retrieve the value from an iterator. */ -void* BLI_edgehashIterator_getValue (EdgeHashIterator *ehi); +/* Retrieve the value from an iterator. */ +void *BLI_edgehashIterator_getValue(EdgeHashIterator *ehi); - /* Set the value for an iterator. */ -void BLI_edgehashIterator_setValue (EdgeHashIterator *ehi, void *val); +/* Set the value for an iterator. */ +void BLI_edgehashIterator_setValue(EdgeHashIterator *ehi, void *val); - /* Steps the iterator to the next index. */ -void BLI_edgehashIterator_step (EdgeHashIterator *ehi); +/* Steps the iterator to the next index. */ +void BLI_edgehashIterator_step(EdgeHashIterator *ehi); - /* Determine if an iterator is done. */ -int BLI_edgehashIterator_isDone (EdgeHashIterator *ehi); +/* Determine if an iterator is done. */ +int BLI_edgehashIterator_isDone(EdgeHashIterator *ehi); #endif |