36   ASSERT_EQ(nullptr, lfind(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));  in TEST()
37   ASSERT_EQ(0U, x_size);  in TEST()
40   ASSERT_EQ(&xs[0], lsearch(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));  in TEST()
41   ASSERT_EQ(2, xs[0]);  in TEST()
42   ASSERT_EQ(1U, x_size);  in TEST()
45   ASSERT_EQ(&xs[0], lfind(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));  in TEST()
46   ASSERT_EQ(1U, x_size);  in TEST()
49   ASSERT_EQ(&xs[0], lsearch(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));  in TEST()
50   ASSERT_EQ(1U, x_size);  in TEST()
88   ASSERT_EQ(nullptr, tfind(&n1, &root, node_cmp));  in TEST()
89   ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));  in TEST()
90   ASSERT_EQ(nullptr, tfind(&n3, &root, node_cmp));  in TEST()
97   ASSERT_EQ(i1, tfind(&n1, &root, node_cmp));  in TEST()
98   ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));  in TEST()
99   ASSERT_EQ(nullptr, tfind(&n3, &root, node_cmp));  in TEST()
108   ASSERT_EQ(3U, g_nodes.size());  in TEST()
109   ASSERT_EQ("a", g_nodes[0]);  in TEST()
110   ASSERT_EQ("m", g_nodes[1]);  in TEST()
111   ASSERT_EQ("z", g_nodes[2]);  in TEST()
116   ASSERT_EQ(3U, g_free_calls);  in TEST()
141   ASSERT_EQ(nullptr, tdelete(&not_there, &root, pod_node_cmp));  in TEST()
167     ASSERT_EQ(expected, q->i);  in TEST()
170   ASSERT_EQ(3, expected);  in TEST()
174     ASSERT_EQ(expected, q->i);  in TEST()
176   ASSERT_EQ(0, expected);  in TEST()
181   ASSERT_EQ(0, head->i);  in TEST()
182   ASSERT_EQ(2, head->next->i);  in TEST()
183   ASSERT_EQ(nullptr, head->next->next);  in TEST()
186   ASSERT_EQ(0, head->i);  in TEST()
187   ASSERT_EQ(nullptr, head->next);  in TEST()
199   ASSERT_EQ(0, head->i);  in TEST()
200   ASSERT_EQ(1, head->next->i);  in TEST()
201   ASSERT_EQ(2, head->next->next->i);  in TEST()
202   ASSERT_EQ(0, head->next->next->next->i);  in TEST()
203   ASSERT_EQ(1, head->next->next->next->next->i);  in TEST()
204   ASSERT_EQ(2, head->next->next->next->next->next->i);  in TEST()
207   ASSERT_EQ(0, head->i);  in TEST()
208   ASSERT_EQ(2, head->next->i);  in TEST()
209   ASSERT_EQ(0, head->next->next->i);  in TEST()
210   ASSERT_EQ(2, head->next->next->next->i);  in TEST()
213   ASSERT_EQ(0, head->i);  in TEST()
214   ASSERT_EQ(0, head->next->i);  in TEST()
264   ASSERT_EQ(1, hcreate_r(13, &h1));  in TEST()
267   ASSERT_EQ(1, hcreate_r(128, &h2));  in TEST()
271   ASSERT_EQ(1, hsearch_r(ENTRY{.key = const_cast<char*>("a"), .data = const_cast<char*>("A")},  in TEST()
274   ASSERT_EQ(1, hsearch_r(ENTRY{.key = const_cast<char*>("a"), .data = const_cast<char*>("B")},  in TEST()
280   ASSERT_EQ(0, hsearch_r(ENTRY{.key = const_cast<char*>("b"), .data = nullptr}, FIND, &e, &h1));  in TEST()
284   ASSERT_EQ(1, hsearch_r(ENTRY{.key = const_cast<char*>("a"), .data = nullptr}, FIND, &e, &h1));  in TEST()
286   ASSERT_EQ(1, hsearch_r(ENTRY{.key = const_cast<char*>("a"), .data = nullptr}, FIND, &e, &h2));  in TEST()
291   ASSERT_EQ(1, hsearch_r(ENTRY{.key = const_cast<char*>("a"), .data = nullptr}, FIND, &e, &h2));  in TEST()