Cleanup: added const keyword to BLI_dlrbTree search functions.
This commit is contained in:
parent
6c5f8bf5aa
commit
9e1fdd1f14
|
@ -111,20 +111,22 @@ void BLI_dlrbTree_linkedlist_sync(DLRBT_Tree *tree);
|
|||
/* Searching ------------------------------------ */
|
||||
|
||||
/* Find the node which matches or is the closest to the requested node */
|
||||
DLRBT_Node *BLI_dlrbTree_search(DLRBT_Tree *tree, DLRBT_Comparator_FP cmp_cb, void *search_data);
|
||||
DLRBT_Node *BLI_dlrbTree_search(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data);
|
||||
|
||||
/* Find the node which exactly matches the required data */
|
||||
DLRBT_Node *BLI_dlrbTree_search_exact(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_exact(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data);
|
||||
|
||||
/* Find the node which occurs immediately before the best matching node */
|
||||
DLRBT_Node *BLI_dlrbTree_search_prev(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_prev(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data);
|
||||
|
||||
/* Find the node which occurs immediately after the best matching node */
|
||||
DLRBT_Node *BLI_dlrbTree_search_next(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_next(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data);
|
||||
|
||||
|
|
|
@ -128,7 +128,9 @@ void BLI_dlrbTree_linkedlist_sync(DLRBT_Tree *tree)
|
|||
/* Tree Search Utilities */
|
||||
|
||||
/* Find the node which matches or is the closest to the requested node */
|
||||
DLRBT_Node *BLI_dlrbTree_search(DLRBT_Tree *tree, DLRBT_Comparator_FP cmp_cb, void *search_data)
|
||||
DLRBT_Node *BLI_dlrbTree_search(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data)
|
||||
{
|
||||
DLRBT_Node *node = (tree) ? tree->root : NULL;
|
||||
short found = 0;
|
||||
|
@ -174,7 +176,7 @@ DLRBT_Node *BLI_dlrbTree_search(DLRBT_Tree *tree, DLRBT_Comparator_FP cmp_cb, vo
|
|||
}
|
||||
|
||||
/* Find the node which exactly matches the required data */
|
||||
DLRBT_Node *BLI_dlrbTree_search_exact(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_exact(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data)
|
||||
{
|
||||
|
@ -222,7 +224,7 @@ DLRBT_Node *BLI_dlrbTree_search_exact(DLRBT_Tree *tree,
|
|||
}
|
||||
|
||||
/* Find the node which occurs immediately before the best matching node */
|
||||
DLRBT_Node *BLI_dlrbTree_search_prev(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_prev(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data)
|
||||
{
|
||||
|
@ -253,7 +255,7 @@ DLRBT_Node *BLI_dlrbTree_search_prev(DLRBT_Tree *tree,
|
|||
}
|
||||
|
||||
/* Find the node which occurs immediately after the best matching node */
|
||||
DLRBT_Node *BLI_dlrbTree_search_next(DLRBT_Tree *tree,
|
||||
DLRBT_Node *BLI_dlrbTree_search_next(const DLRBT_Tree *tree,
|
||||
DLRBT_Comparator_FP cmp_cb,
|
||||
void *search_data)
|
||||
{
|
||||
|
|
Loading…
Reference in New Issue