[api] using get instead of search throughout

Author: albarrentine

src/binary_tree.h

@@ -147,8 +147,7 @@ void BST_FUNC(rotate_right)(BST_NODE_TYPE *node) {
     node->right->key = tmp_key;
 }
 
-#ifndef BST_CUSTOM_SEARCH
-void *BST_FUNC(search)(BST_NODE_TYPE *node, BST_KEY_TYPE key) {
+void *BST_FUNC(get)(BST_NODE_TYPE *node, BST_KEY_TYPE key) {
     BST_NODE_TYPE *tmp_node = node;
     BST_KEY_TYPE tmp_key = node->key;
 
@@ -168,7 +167,6 @@ void *BST_FUNC(search)(BST_NODE_TYPE *node, BST_KEY_TYPE key) {
         return NULL;
     }
 }
-#endif
 
 #undef BST_CONCAT_
 #undef BST_CONCAT

test.c

@@ -66,13 +66,13 @@ TEST test_bst(void) {
 
     char *a, *b, *c, *d;
 
-    a = binary_tree_search(root, 1);
+    a = binary_tree_get(root, 1);
     ASSERT_STR_EQ(a, "a");
-    b = binary_tree_search(root, 3);
+    b = binary_tree_get(root, 3);
     ASSERT_STR_EQ(b, "b");
-    c = binary_tree_search(root, 5);
+    c = binary_tree_get(root, 5);
     ASSERT_STR_EQ(c, "c");
-    d = binary_tree_search(root, 7);
+    d = binary_tree_get(root, 7);
     ASSERT_STR_EQ(d, "d");
 
     binary_tree_stack_t stack = (binary_tree_stack_t){
@@ -109,13 +109,13 @@ TEST test_bst(void) {
     ASSERT_EQ(root->left->left->left->key, 1);
     ASSERT_EQ(root->left->left->right->key, 3);
 
-    a = binary_tree_search(root, 1);
+    a = binary_tree_get(root, 1);
     ASSERT_STR_EQ(a, "a");
-    b = binary_tree_search(root, 3);
+    b = binary_tree_get(root, 3);
     ASSERT_STR_EQ(b, "b");
-    c = binary_tree_search(root, 5);
+    c = binary_tree_get(root, 5);
     ASSERT_STR_EQ(c, "c");
-    d = binary_tree_search(root, 7);
+    d = binary_tree_get(root, 7);
     ASSERT_STR_EQ(d, "d");
 
     candidate = binary_tree_candidate_leaf(root, 3, &stack);
@@ -136,13 +136,13 @@ TEST test_bst(void) {
     ASSERT_EQ(root->right->left->key, 5);
     ASSERT_EQ(root->right->right->key, 7);
 
-    a = binary_tree_search(root, 1);
+    a = binary_tree_get(root, 1);
     ASSERT_STR_EQ(a, "a");
-    b = binary_tree_search(root, 3);
+    b = binary_tree_get(root, 3);
     ASSERT_STR_EQ(b, "b");
-    c = binary_tree_search(root, 5);
+    c = binary_tree_get(root, 5);
     ASSERT_STR_EQ(c, "c");
-    d = binary_tree_search(root, 7);
+    d = binary_tree_get(root, 7);
     ASSERT_STR_EQ(d, "d");
 
     binary_tree_rotate_right(root);
@@ -167,13 +167,13 @@ TEST test_bst(void) {
     ASSERT_EQ(root->right->right->left->key, 5);
     ASSERT_EQ(root->right->right->right->key, 7);
 
-    a = binary_tree_search(root, 1);
+    a = binary_tree_get(root, 1);
     ASSERT_STR_EQ(a, "a");
-    b = binary_tree_search(root, 3);
+    b = binary_tree_get(root, 3);
     ASSERT_STR_EQ(b, "b");
-    c = binary_tree_search(root, 5);
+    c = binary_tree_get(root, 5);
     ASSERT_STR_EQ(c, "c");
-    d = binary_tree_search(root, 7);
+    d = binary_tree_get(root, 7);
     ASSERT_STR_EQ(d, "d");
 
     candidate = binary_tree_candidate_leaf(root, 7, &stack);