abf1a96773
In the current testing setup, tests for both tree_search() and
infix_walk() defined by reftable/tree.{c, h} are performed by
a single test function, test_tree(). Split tree_test() into
test_tree_search() and test_infix_walk() responsible for
independently testing tree_search() and infix_walk() respectively.
This improves the overall readability of the test file as well as
simplifies debugging.
Note that the last parameter in the tree_search() functiom is
'int insert' which when set, inserts the key if it is not found
in the tree. Otherwise, the function returns NULL for such cases.
While at it, use 'func' to pass function pointers and not '&func'.
Mentored-by: Patrick Steinhardt <ps@pks.im>
Mentored-by: Christian Couder <chriscool@tuxfamily.org>
Signed-off-by: Chandra Pratap <chandrapratap3519@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
76 lines
1.5 KiB
C
76 lines
1.5 KiB
C
/*
|
|
Copyright 2020 Google LLC
|
|
|
|
Use of this source code is governed by a BSD-style
|
|
license that can be found in the LICENSE file or at
|
|
https://developers.google.com/open-source/licenses/bsd
|
|
*/
|
|
|
|
#include "test-lib.h"
|
|
#include "reftable/tree.h"
|
|
|
|
static int t_compare(const void *a, const void *b)
|
|
{
|
|
return (char *)a - (char *)b;
|
|
}
|
|
|
|
struct curry {
|
|
void *last;
|
|
};
|
|
|
|
static void check_increasing(void *arg, void *key)
|
|
{
|
|
struct curry *c = arg;
|
|
if (c->last)
|
|
check_int(t_compare(c->last, key), <, 0);
|
|
c->last = key;
|
|
}
|
|
|
|
static void t_tree_search(void)
|
|
{
|
|
struct tree_node *root = NULL;
|
|
void *values[11] = { 0 };
|
|
struct tree_node *nodes[11] = { 0 };
|
|
size_t i = 1;
|
|
|
|
/*
|
|
* Pseudo-randomly insert the pointers for elements between
|
|
* values[1] and values[10] (inclusive) in the tree.
|
|
*/
|
|
do {
|
|
nodes[i] = tree_search(&values[i], &root, &t_compare, 1);
|
|
i = (i * 7) % 11;
|
|
} while (i != 1);
|
|
|
|
for (i = 1; i < ARRAY_SIZE(nodes); i++) {
|
|
check_pointer_eq(&values[i], nodes[i]->key);
|
|
check_pointer_eq(nodes[i], tree_search(&values[i], &root, &t_compare, 0));
|
|
}
|
|
|
|
tree_free(root);
|
|
}
|
|
|
|
static void t_infix_walk(void)
|
|
{
|
|
struct tree_node *root = NULL;
|
|
void *values[11] = { 0 };
|
|
struct curry c = { 0 };
|
|
size_t i = 1;
|
|
|
|
do {
|
|
tree_search(&values[i], &root, t_compare, 1);
|
|
i = (i * 7) % 11;
|
|
} while (i != 1);
|
|
|
|
infix_walk(root, &check_increasing, &c);
|
|
tree_free(root);
|
|
}
|
|
|
|
int cmd_main(int argc, const char *argv[])
|
|
{
|
|
TEST(t_tree_search(), "tree_search works");
|
|
TEST(t_infix_walk(), "infix_walk works");
|
|
|
|
return test_done();
|
|
}
|