trackler 2.2.1.42 → 2.2.1.43

data/tracks/c/exercises/difference-of-squares/test/test_difference_of_squares.c

@@ -8,46 +8,55 @@ void test_square_of_sum_up_to_5(void)
 
 void test_square_of_sum_up_to_10(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_EQUAL(3025, square_of_sum(10));
 }
 
 void test_square_of_sum_up_to_100(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(25502500, square_of_sum(100));
 }
 
 void test_sum_of_squares_up_to_5(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(55, sum_of_squares(5));
 }
 
 void test_sum_of_squares_up_to_10(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(385, sum_of_squares(10));
 }
 
 void test_sum_of_squares_up_to_100(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(338350, sum_of_squares(100));
 }
 
 void test_difference_of_squares_up_to_0(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(0, difference_of_squares(0));
 }
 
 void test_difference_of_squares_up_to_5(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(170, difference_of_squares(5));
 }
 
 void test_difference_of_squares_up_to_10(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(2640, difference_of_squares(10));
 }
 
 void test_difference_of_squares_up_to_100(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(25164150, difference_of_squares(100));
 }
 

data/tracks/c/exercises/gigasecond/test/test_gigasecond.c

@@ -24,6 +24,7 @@ void test_date(void)
 
 void test_another_date(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    time_t expected = construct_date(2009, 2, 19, 1, 46, 40);
    time_t actual = gigasecond_after(construct_date(1977, 6, 13, 0, 0, 0));
    TEST_ASSERT(expected == actual);
@@ -31,6 +32,7 @@ void test_another_date(void)
 
 void test_third_date(void)
 {
+   TEST_IGNORE();
    time_t expected = construct_date(1991, 3, 27, 1, 46, 40);
    time_t actual = gigasecond_after(construct_date(1959, 7, 19, 0, 0, 0));
    TEST_ASSERT(expected == actual);
@@ -38,6 +40,7 @@ void test_third_date(void)
 
 void test_date_and_time(void)
 {
+   TEST_IGNORE();
    time_t expected = construct_date(2046, 10, 2, 23, 46, 40);
    time_t actual = gigasecond_after(construct_date(2015, 1, 24, 22, 0, 0));
    TEST_ASSERT(expected == actual);
@@ -45,6 +48,7 @@ void test_date_and_time(void)
 
 void test_date_and_time_with_day_rollover(void)
 {
+   TEST_IGNORE();
    time_t expected = construct_date(2046, 10, 3, 1, 46, 39);
    time_t actual = gigasecond_after(construct_date(2015, 1, 24, 23, 59, 59));
    TEST_ASSERT(expected == actual);

data/tracks/c/exercises/grains/test/test_grains.c

@@ -8,46 +8,55 @@ void test_square_1(void)
 
 void test_square_2(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_EQUAL_UINT64(2ul, square(2));
 }
 
 void test_square_3(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(4ul, square(3));
 }
 
 void test_square_4(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(8ul, square(4));
 }
 
 void test_square_16(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(32768ul, square(16));
 }
 
 void test_square_32(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(2147483648ul, square(32));
 }
 
 void test_square_64(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(9223372036854775808ul, square(64));
 }
 
 void test_square_0_does_not_exist(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(0, square(0));
 }
 
 void test_square_greater_than_64_does_not_exist(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(0, square(65));
 }
 
 void test_total(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT64(18446744073709551615ul, total());
 }
 

data/tracks/c/exercises/hamming/test/test_hamming.c

@@ -8,61 +8,73 @@ void test_empty_strands(void)
 
 void test_rejects_null_strand(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_EQUAL(-1, compute(NULL, "A"));
 }
 
 void test_rejects_other_null_strand(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, compute("A", NULL));
 }
 
 void test_no_difference_between_identical_strands(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(0, compute("A", "A"));
 }
 
 void test_identical_long_strands(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(0, compute("GGACTGA", "GGACTGA"));
 }
 
 void test_hamming_distance_for_single_nucleotide_strand(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(1, compute("A", "G"));
 }
 
 void test_complete_hamming_distance_for_small_strand(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(2, compute("AG", "CT"));
 }
 
 void test_small_hamming_distance(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(1, compute("AT", "CT"));
 }
 
 void test_small_hamming_distance_in_longer_strand(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(1, compute("GGACG", "GGTCG"));
 }
 
 void test_rejects_extra_length_on_first_strand_when_longer(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, compute("AAAG", "AAA"));
 }
 
 void test_rejects_extra_length_on_other_strand_when_longer(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, compute("AAA", "AAAG"));
 }
 
 void test_large_hamming_distance(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(4, compute("GATACA", "GCATAA"));
 }
 
 void test_hamming_distance_in_very_long_strand(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(9, compute("GGACGGATTCTG", "AGGACGGATTCT"));
 }
 

data/tracks/c/exercises/isogram/src/example.c

@@ -3,22 +3,22 @@
 #include <stddef.h>
 #include <stdint.h>
 
-bool isIsogram(const char phrase[])
+bool is_isogram(const char phrase[])
 {
-   uint32_t usedLetters = 0;
+   uint32_t used_letters = 0;
 
    if (phrase == NULL)
       return false;
 
    for (int16_t i = 0; phrase[i] != '\0'; ++i) {
       if (isalpha(phrase[i])) {
-         uint8_t bitNumber = toupper(phrase[i]) - 'A';
-         uint32_t bitMask = 1 << bitNumber;
+         uint8_t bit_number = toupper(phrase[i]) - 'A';
+         uint32_t bit_mask = 1 << bit_number;
 
-         if ((usedLetters & bitMask) > 0)
+         if ((used_letters & bit_mask) > 0)
             return false;
          else
-            usedLetters |= bitMask;
+            used_letters |= bit_mask;
       }
    }
 

data/tracks/c/exercises/isogram/src/example.h

@@ -3,6 +3,6 @@
 
 #include <stdbool.h>
 
-bool isIsogram(const char phrase[]);
+bool is_isogram(const char phrase[]);
 
 #endif

data/tracks/c/exercises/isogram/test/test_isogram.c

@@ -4,47 +4,55 @@
 
 void test_empty_string(void)
 {
-   TEST_ASSERT_TRUE(isIsogram(""));
+   TEST_ASSERT_TRUE(is_isogram(""));
 }
 
 void test_lower_case_only(void)
 {
-   TEST_ASSERT_TRUE(isIsogram("isogram"));
+   TEST_IGNORE();               // delete this line to run test
+   TEST_ASSERT_TRUE(is_isogram("isogram"));
 }
 
 void test_duplicated_letter(void)
 {
-   TEST_ASSERT_FALSE(isIsogram("eleven"));
+   TEST_IGNORE();
+   TEST_ASSERT_FALSE(is_isogram("eleven"));
 }
 
 void test_longest_known_isogram(void)
 {
-   TEST_ASSERT_TRUE(isIsogram("subdermatoglyphic"));
+   TEST_IGNORE();
+   TEST_ASSERT_TRUE(is_isogram("subdermatoglyphic"));
 }
 
 void test_duplicated_letter_mixed_case(void)
 {
-   TEST_ASSERT_FALSE(isIsogram("Alphabet"));
+   TEST_IGNORE();
+   TEST_ASSERT_FALSE(is_isogram("Alphabet"));
 }
 
 void test_non_letter_char(void)
 {
-   TEST_ASSERT_TRUE(isIsogram("thumbscrew-japingly"));
+   TEST_IGNORE();
+   TEST_ASSERT_TRUE(is_isogram("thumbscrew-japingly"));
 }
 
 void test_duplicated_non_letter_char(void)
 {
-   TEST_ASSERT_TRUE(isIsogram("Hjelmqvist-Gryb-Zock-Pfund-Wax"));
+   TEST_IGNORE();
+   TEST_ASSERT_TRUE(is_isogram("Hjelmqvist-Gryb-Zock-Pfund-Wax"));
 }
 
 void test_multiple_whitespace(void)
 {
-   TEST_ASSERT_TRUE(isIsogram("Emily Jung Schwartzkopf"));
+   TEST_IGNORE();
+   TEST_ASSERT_TRUE(is_isogram("Emily Jung Schwartzkopf"));
 }
 
 void test_duplicated_letter_within_word(void)
 {
-   TEST_ASSERT_FALSE(isIsogram("accentor"));
+   TEST_IGNORE();
+   TEST_ASSERT_FALSE(is_isogram("accentor"));
 }
 
 int main(void)

data/tracks/c/exercises/largest-series-product/test/test_largest_series_product.c

@@ -8,31 +8,37 @@ void test_can_find_the_largest_product_of_2_with_numbers_in_order(void)
 
 void test_can_find_the_largest_product_of_2(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_EQUAL(48, largest_series_product("576802143", 2));
 }
 
 void test_finds_the_largest_product_if_span_equals_length(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(18, largest_series_product("29", 2));
 }
 
 void test_can_find_the_largest_product_of_3_with_numbers_in_order(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(504, largest_series_product("0123456789", 3));
 }
 
 void test_can_find_the_largest_product_of_3(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(270, largest_series_product("1027839564", 3));
 }
 
 void test_can_find_the_largest_product_of_5_with_numbers_in_order(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(15120, largest_series_product("0123456789", 5));
 }
 
 void test_can_get_the_largest_product_of_a_big_number(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(23520,
                      largest_series_product
                      ("73167176531330624919225119674426574742355349194934", 6));
@@ -40,6 +46,7 @@ void test_can_get_the_largest_product_of_a_big_number(void)
 
 void test_can_get_the_largest_product_of_a_big_number_ii(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(28350,
                      largest_series_product
                      ("52677741234314237566414902593461595376319419139427", 6));
@@ -47,6 +54,7 @@ void test_can_get_the_largest_product_of_a_big_number_ii(void)
 
 void test_can_get_the_largest_product_of_a_big_number_project_euler(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_INT64(23514624000,
                            largest_series_product
                            ("7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450",
@@ -55,36 +63,43 @@ void test_can_get_the_largest_product_of_a_big_number_project_euler(void)
 
 void test_reports_zero_if_the_only_digits_are_zero(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(0, largest_series_product("0000", 2));
 }
 
 void test_reports_zero_if_all_spans_include_zero(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(0, largest_series_product("99099", 3));
 }
 
 void test_rejects_span_longer_than_string_length(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, largest_series_product("123", 4));
 }
 
 void test_reports_1_for_empty_string_and_empty_product_(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(1, largest_series_product("", 0));
 }
 
 void test_reports_1_for_nonempty_string_and_empty_product_(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(1, largest_series_product("123", 0));
 }
 
 void test_rejects_empty_string_and_nonzero_span(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, largest_series_product("", 1));
 }
 
 void test_rejects_invalid_character_in_digits(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL(-1, largest_series_product("123a5", 2));
 }
 

data/tracks/c/exercises/leap/test/test_leap.c

@@ -8,21 +8,25 @@ void test_a_known_leap_year(void)
 
 void test_any_old_year(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_FALSE(is_leap_year(1997));
 }
 
 void test_turn_of_the_20th_century(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_FALSE(is_leap_year(1900));
 }
 
 void test_turn_of_the_21st_century(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_TRUE(is_leap_year(2000));
 }
 
 void test_turn_of_the_25th_century(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_TRUE(is_leap_year(2400));
 }
 

data/tracks/c/exercises/nth-prime/test/test_nth_prime.c

@@ -8,21 +8,25 @@ void test_first_prime(void)
 
 void test_second_prime(void)
 {
+   TEST_IGNORE();               // delete this line to run test
    TEST_ASSERT_EQUAL_UINT32(3, nth(2));
 }
 
 void test_sixth_prime(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT32(13, nth(6));
 }
 
 void test_large_prime(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT32(104743, nth(10001));
 }
 
 void test_weird_case(void)
 {
+   TEST_IGNORE();
    TEST_ASSERT_EQUAL_UINT32(0, nth(0));
 }