@@ -113,9 +113,11 @@ TEST(StackTest, Basic) {
113113 value = TEST_INT_new (6 );
114114 ASSERT_TRUE (value);
115115 size_t index;
116- EXPECT_FALSE (sk_TEST_INT_find (sk.get (), &index, value.get ()));
117- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, raw));
118- EXPECT_EQ (4u , index);
116+ EXPECT_FALSE (sk_TEST_INT_find_awslc (sk.get (), &index, value.get ()));
117+ EXPECT_EQ (-1 , sk_TEST_INT_find (sk.get (), value.get ()));
118+ EXPECT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, raw));
119+ EXPECT_EQ (4UL , index);
120+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), raw));
119121
120122 // sk_TEST_INT_insert can also insert values at the end.
121123 value = TEST_INT_new (7 );
@@ -244,12 +246,14 @@ TEST(StackTest, Sorted) {
244246 auto ten = TEST_INT_new (10 );
245247 ASSERT_TRUE (ten);
246248 size_t index;
247- EXPECT_FALSE (sk_TEST_INT_find (sk.get (), &index, ten.get ()));
249+ EXPECT_FALSE (sk_TEST_INT_find_awslc (sk.get (), &index, ten.get ()));
250+ EXPECT_EQ (-1 , sk_TEST_INT_find (sk.get (), ten.get ()));
248251
249252 auto three = TEST_INT_new (3 );
250253 ASSERT_TRUE (three);
251- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, three.get ()));
254+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, three.get ()));
252255 EXPECT_EQ (3 , *sk_TEST_INT_value (sk.get (), index));
256+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), three.get ()));
253257
254258 sk_TEST_INT_sort (sk.get ());
255259 EXPECT_TRUE (sk_TEST_INT_is_sorted (sk.get ()));
@@ -264,11 +268,13 @@ TEST(StackTest, Sorted) {
264268
265269 // When sorted, find uses binary search.
266270 ASSERT_TRUE (ten);
267- EXPECT_FALSE (sk_TEST_INT_find (sk.get (), &index, ten.get ()));
271+ EXPECT_FALSE (sk_TEST_INT_find_awslc (sk.get (), &index, ten.get ()));
272+ EXPECT_EQ (-1 , sk_TEST_INT_find (sk.get (), ten.get ()));
268273
269274 ASSERT_TRUE (three);
270- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, three.get ()));
275+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, three.get ()));
271276 EXPECT_EQ (3u , index);
277+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), three.get ()));
272278
273279 // Copies preserve comparison and sorted information.
274280 bssl::UniquePtr<STACK_OF (TEST_INT)> copy (sk_TEST_INT_deep_copy (
@@ -279,14 +285,16 @@ TEST(StackTest, Sorted) {
279285 TEST_INT_free));
280286 ASSERT_TRUE (copy);
281287 EXPECT_TRUE (sk_TEST_INT_is_sorted (copy.get ()));
282- ASSERT_TRUE (sk_TEST_INT_find (copy.get (), &index, three.get ()));
288+ ASSERT_TRUE (sk_TEST_INT_find_awslc (copy.get (), &index, three.get ()));
283289 EXPECT_EQ (3u , index);
290+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (copy.get (), three.get ()));
284291
285292 ShallowStack copy2 (sk_TEST_INT_dup (sk.get ()));
286293 ASSERT_TRUE (copy2);
287294 EXPECT_TRUE (sk_TEST_INT_is_sorted (copy2.get ()));
288- ASSERT_TRUE (sk_TEST_INT_find (copy2.get (), &index, three.get ()));
295+ ASSERT_TRUE (sk_TEST_INT_find_awslc (copy2.get (), &index, three.get ()));
289296 EXPECT_EQ (3u , index);
297+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (copy.get (), three.get ()));
290298
291299 // Removing elements does not affect sortedness.
292300 TEST_INT_free (sk_TEST_INT_delete (sk.get (), 0 ));
@@ -296,25 +304,28 @@ TEST(StackTest, Sorted) {
296304 // Changing the comparison function invalidates sortedness.
297305 sk_TEST_INT_set_cmp_func (sk.get (), compare_reverse);
298306 EXPECT_FALSE (sk_TEST_INT_is_sorted (sk.get ()));
299- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, three.get ()));
307+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, three.get ()));
300308 EXPECT_EQ (2u , index);
309+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), three.get ()));
301310
302311 sk_TEST_INT_sort (sk.get ());
303312 ExpectStackEquals (sk.get (), {6 , 5 , 4 , 3 , 2 , 1 });
304- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, three.get ()));
313+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, three.get ()));
305314 EXPECT_EQ (3u , index);
315+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), three.get ()));
306316
307317 // Inserting a new element invalidates sortedness.
308318 auto tmp = TEST_INT_new (10 );
309319 ASSERT_TRUE (tmp);
310320 ASSERT_TRUE (bssl::PushToStack (sk.get (), std::move (tmp)));
311321 EXPECT_FALSE (sk_TEST_INT_is_sorted (sk.get ()));
312- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, ten.get ()));
322+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, ten.get ()));
313323 EXPECT_EQ (6u , index);
324+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), ten.get ()));
314325 } while (std::next_permutation (vec.begin (), vec.end ()));
315326}
316327
317- // sk_*_find should return the first matching element in all cases.
328+ // sk_*_find_awslc should return the first matching element in all cases.
318329TEST (StackTest, FindFirst) {
319330 bssl::UniquePtr<STACK_OF (TEST_INT)> sk (sk_TEST_INT_new (compare));
320331 ASSERT_TRUE (sk);
@@ -330,27 +341,31 @@ TEST(StackTest, FindFirst) {
330341 const TEST_INT *two = sk_TEST_INT_value (sk.get (), 1 );
331342 // Pointer-based equality.
332343 size_t index;
333- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, two));
344+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, two));
334345 EXPECT_EQ (1u , index);
346+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), two));
335347
336348 // Comparator-based equality, unsorted.
337349 sk_TEST_INT_set_cmp_func (sk.get (), compare);
338350 EXPECT_FALSE (sk_TEST_INT_is_sorted (sk.get ()));
339- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, two));
351+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, two));
340352 EXPECT_EQ (1u , index);
353+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), two));
341354
342355 // Comparator-based equality, sorted.
343356 sk_TEST_INT_sort (sk.get ());
344357 EXPECT_TRUE (sk_TEST_INT_is_sorted (sk.get ()));
345- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, two));
358+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, two));
346359 EXPECT_EQ (1u , index);
360+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), two));
347361
348362 // Comparator-based equality, sorted and at the front.
349363 sk_TEST_INT_set_cmp_func (sk.get (), compare_reverse);
350364 sk_TEST_INT_sort (sk.get ());
351365 EXPECT_TRUE (sk_TEST_INT_is_sorted (sk.get ()));
352- ASSERT_TRUE (sk_TEST_INT_find (sk.get (), &index, two));
366+ ASSERT_TRUE (sk_TEST_INT_find_awslc (sk.get (), &index, two));
353367 EXPECT_EQ (0u , index);
368+ EXPECT_EQ ((int ) index, sk_TEST_INT_find (sk.get (), two));
354369}
355370
356371// Exhaustively test the binary search.
@@ -385,12 +400,14 @@ TEST(StackTest, BinarySearch) {
385400 ASSERT_TRUE (key);
386401
387402 size_t idx;
388- int found = sk_TEST_INT_find (sk.get (), &idx, key.get ());
403+ int found = sk_TEST_INT_find_awslc (sk.get (), &idx, key.get ());
389404 if (i == j) {
390405 EXPECT_FALSE (found);
406+ EXPECT_EQ (-1 , sk_TEST_INT_find (sk.get (), key.get ()));
391407 } else {
392408 ASSERT_TRUE (found);
393409 EXPECT_EQ (i, idx);
410+ EXPECT_EQ ((int ) idx, sk_TEST_INT_find (sk.get (), key.get ()));
394411 }
395412 }
396413 }
0 commit comments