HTL-2IHIF-C/24-timed-sorting-4
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Initial commit

Browse source
This commit is contained in:
github-classroom[bot] 2025-04-28 22:11:20 +00:00 • committed by GitHub
commit b4c0b22597
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
104 changed files with 10100 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

63
test_binary_search.h Normal file
View file

@ -0,0 +1,63 @@
/*----------------------------------------------------------
* HTBLA-Leonding / Klasse: n/a
* ---------------------------------------------------------
* Title: Unit Tests for binary search functions
* Author: S. Schraml
* ----------------------------------------------------------
* Description:
* Tests functions for binary search.
* ----------------------------------------------------------
*/
#ifndef ___TEST_BINARY_SEARCH_H
#define ___TEST_BINARY_SEARCH_H
#include "shortcut.h"
#include "config.h"
#ifdef LIST_VARIANT
TEST(test_binary_search_list__shall_find_first_item);
TEST(test_binary_search_list__shall_find_middle_item);
TEST(test_binary_search_list__shall_find_last_item);
TEST(test_binary_search_list__shall_find_first_item_in_ambiguous_values);
TEST(test_binary_search_list__shall_find_middle_item_in_ambiguous_values);
TEST(test_binary_search_list__shall_find_last_item_in_ambiguous_values);
TEST(test_binary_search_list__shall_find_slot_at_beginning);
TEST(test_binary_search_list__shall_find_slot_in_the_middle);
TEST(test_binary_search_list__shall_find_slot_at_the_end);
TEST(test_binary_search_list__shall_find_slot_at_beginning_in_ambiguous_values);
TEST(test_binary_search_list__shall_find_slot_in_the_middle_in_ambiguous_values);
TEST(test_binary_search_list__shall_find_slot_at_the_end_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_first_item);
TEST(test_binary_search_list_limited__shall_find_middle_item);
TEST(test_binary_search_list_limited__shall_find_last_item);
TEST(test_binary_search_list_limited__shall_find_first_item_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_middle_item_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_last_item_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_slot_at_beginning);
TEST(test_binary_search_list_limited__shall_find_slot_in_the_middle);
TEST(test_binary_search_list_limited__shall_find_slot_at_the_end);
TEST(test_binary_search_list_limited__shall_find_slot_at_beginning_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_slot_in_the_middle_in_ambiguous_values);
TEST(test_binary_search_list_limited__shall_find_slot_at_the_end_in_ambiguous_values);
#else
TEST(test_binary_search_array__shall_find_first_item);
TEST(test_binary_search_array__shall_find_middle_item);
TEST(test_binary_search_array__shall_find_last_item);
TEST(test_binary_search_array__shall_find_first_item_in_ambiguous_values);
TEST(test_binary_search_array__shall_find_middle_item_in_ambiguous_values);
TEST(test_binary_search_array__shall_find_last_item_in_ambiguous_values);
TEST(test_binary_search_array__shall_find_slot_at_beginning);
TEST(test_binary_search_array__shall_find_slot_in_the_middle);
TEST(test_binary_search_array__shall_find_slot_at_the_end);
TEST(test_binary_search_array__shall_find_slot_at_beginning_in_ambiguous_values);
TEST(test_binary_search_array__shall_find_slot_in_the_middle_in_ambiguous_values);
TEST(test_binary_search_array__shall_find_slot_at_the_end_in_ambiguous_values);
#endif
#endif