trackler 2.0.0.5 → 2.0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0ad43d193656b92d10fd9344553cf30d66baae72
-  data.tar.gz: fa8601209c89c67e01b4e8d3b797a3fc98271692
+  metadata.gz: fd26f913270ca0a9e000f69e94f05f446e3dbcf0
+  data.tar.gz: be8dca46c9162bd55189ae5840d5f9cce840cfa6
 SHA512:
-  metadata.gz: ad7e2dba3130960687bf8c0dc7b4e0184e4d2951d10090d740af794de761d986e3c88aab193c5678627f9ed9908fe3bfea57c936c694f97c299896bbab2afcda
-  data.tar.gz: b7b933be55c8174b41730383df120ddf5aabd607cf9ef38054ee222df76058d73b8a012249ec1915ce3d529a1d6131469ab7ec684f4c5c0b25fabdc57040babc
+  metadata.gz: 40227845c9e6200c10cd5f4eb6f1d7b78bfba7160b9adaafc804293f92b7b0fef3eae27f56c3c810b4ed2daf6761b29e32a6d5dfbf9e77f788d0355d2cc95b28
+  data.tar.gz: 944ef6f86d085ea5b0d20e1c048ac31bc95f54a38f99ce7f0f9cf6358de4c6cd8a2bb096fb4b00f64455441115432bf45819cea2b1d9f23dc8b76f98788929b4

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.0.5"
+  VERSION = "2.0.0.6"
 end

data/tracks/bash/docs/TESTS.md

@@ -21,4 +21,4 @@ For Red Hat, Scientific Linux, and CentOS 6 or later bats is found in the EPEL r
 sudo yum install bats  
 ```
 
-Run the tests with `bats whatever_test.sh`.  
+Run the tests with `bats whatever_test.sh` or `./whatever_test.sh`.

data/tracks/bash/exercises/bob/bob_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test "stating something." {
   run bash bob.sh "Tom-ay-to, tom-aaaah-to."
 

data/tracks/bash/exercises/gigasecond/gigasecond_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test 'April 25th, 2011' {
   run bash gigasecond.sh '2011-04-25Z'
 

data/tracks/bash/exercises/hamming/hamming_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test "Short identical strands have hamming distance of zero" {
   run bash hamming.sh C C
 

data/tracks/bash/exercises/hello-world/hello_world_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test "When given no name, it should greet the world!" {
   run bash hello_world.sh
 

data/tracks/bash/exercises/leap/leap_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test "Leap year should return leap year" {
   run ./leap.sh 1996
 

data/tracks/bash/exercises/raindrops/raindrops_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 # check non factors
 
 @test "Number 1, not factor of 3, 5 or 7, should output itself: 1." {

data/tracks/bash/exercises/rna-transcription/rna_transcription_test.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bats
+
 @test 'Complement of cytosine is guanine' {
   run bash rna_transcription.sh C
 

data/tracks/c/bin/verify-indent

@@ -1,7 +1,11 @@
-#!/bin/sh
+#!/bin/bash
 
 sh indent.sh
 
+# This script fails when run by Travis if the diff is not checked twice
+# Unfortunately no better solution was found
+git diff --quiet
+
 if ! $(git diff --quiet)
 then
   echo "Incorrect style detected:"

data/tracks/c/config.json

@@ -137,8 +137,17 @@
       "strings"
     ]
   }, {
-    "slug": "allergies",
+    "difficulty": 3,
+    "slug": "word-count",
+    "topics": [
+      "strings",
+      "filtering",
+      "structs",
+      "memory management"
+    ]
+  }, {
     "difficulty": 4,
+    "slug": "allergies",
     "topics": [
       "control-flow (if-statements)",
       "control-flow (loops)",

data/tracks/c/exercises/clock/src/clock.h

@@ -1,7 +1,7 @@
 #ifndef _CLOCK_H
 #define _CLOCK_H
 
-#define MAX_STR_LEN (5 + 1) // "##:##\0"
+#define MAX_STR_LEN (5 + 1)     // "##:##\0"
 
 typedef char time_text_t[MAX_STR_LEN];
 

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

@@ -50,7 +50,7 @@ void test_can_get_the_largest_product_of_a_big_number_project_euler(void)
    TEST_ASSERT_EQUAL_INT64(23514624000,
                            largest_series_product
                            ("7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450",
-                           13));
+                            13));
 }
 
 void test_reports_zero_if_the_only_digits_are_zero(void)

data/tracks/c/exercises/phone-number/src/example.c

@@ -15,7 +15,8 @@
 
 #define INVALID_NUMBER_RESULT    "0000000000"
 
-static void remove_leading_digit(char *phone_number) {
+static void remove_leading_digit(char *phone_number)
+{
    char *temp = calloc(VALID_NUMBER_LENGTH, sizeof(char));
    strcpy(temp, &phone_number[1]);
    strcpy(phone_number, temp);
@@ -58,7 +59,8 @@ char *phone_number_format(const char *input)
    char *cleaned_input = phone_number_clean(input);
    char *output = calloc(FORMATTED_LENGTH, sizeof(char));
 
-   sprintf(output, "(%.3s) %.3s-%.4s", cleaned_input, &cleaned_input[AREA_CODE_LENGTH], &cleaned_input[EXTENSION_OFFSET]);
+   sprintf(output, "(%.3s) %.3s-%.4s", cleaned_input,
+           &cleaned_input[AREA_CODE_LENGTH], &cleaned_input[EXTENSION_OFFSET]);
 
    free(cleaned_input);
 

data/tracks/c/exercises/roman-numerals/src/example.c

@@ -5,36 +5,35 @@
 #define NUM_OF_ELEMENTS(a)    (sizeof(a) / sizeof(a[0]))
 #define MAX_NUMERAL_LENGTH    (7)
 
-typedef struct
-{
-    char *numeral;
-    unsigned int value;
+typedef struct {
+   char *numeral;
+   unsigned int value;
 } numeral_values_t;
 
-const numeral_values_t numeral_values[] =
-{
-    { "M", 1000 },
-    { "CM", 900 },
-    { "D",  500 },
-    { "CD", 400 },
-    { "C",  100 },
-    { "XC",  90 },
-    { "L",   50 },
-    { "XL",  40 },
-    { "X",   10 },
-    { "IX",   9 },
-    { "V",    5 },
-    { "IV",   4 },
-    { "I",    1 }
+const numeral_values_t numeral_values[] = {
+   {"M", 1000},
+   {"CM", 900},
+   {"D", 500},
+   {"CD", 400},
+   {"C", 100},
+   {"XC", 90},
+   {"L", 50},
+   {"XL", 40},
+   {"X", 10},
+   {"IX", 9},
+   {"V", 5},
+   {"IV", 4},
+   {"I", 1}
 };
 
-char * to_roman_numeral(unsigned int number)
+char *to_roman_numeral(unsigned int number)
 {
    char *numerals = calloc(0, sizeof(char) * MAX_NUMERAL_LENGTH);
 
    for (size_t i = 0; i < NUM_OF_ELEMENTS(numeral_values); i++) {
       while (number >= numeral_values[i].value) {
-         strncat(numerals, numeral_values[i].numeral, MAX_NUMERAL_LENGTH - strlen(numerals));
+         strncat(numerals, numeral_values[i].numeral,
+                 MAX_NUMERAL_LENGTH - strlen(numerals));
          number -= numeral_values[i].value;
       }
    }

data/tracks/c/exercises/roman-numerals/src/example.h

@@ -1,6 +1,6 @@
 #ifndef _ROMAN_NUMERALS_H
 #define _ROMAN_NUMERALS_H
 
-char * to_roman_numeral(unsigned int number);
+char *to_roman_numeral(unsigned int number);
 
 #endif

data/tracks/c/exercises/roman-numerals/test/test_roman_numerals.c

@@ -8,6 +8,7 @@ static void test_conversion(int number, char *expected)
    TEST_ASSERT_EQUAL_STRING(expected, result);
    free(result);
 }
+
 void test_one_yields_I(void)
 {
    test_conversion(1, "I");

data/tracks/c/exercises/sum-of-multiples/src/example.c

@@ -1,7 +1,9 @@
 #include "sum_of_multiples.h"
 #include <stdbool.h>
 
-unsigned int sum_of_multiples(const unsigned int *multiples, const size_t number_of_multiples, const unsigned int upper_bound)
+unsigned int sum_of_multiples(const unsigned int *multiples,
+                              const size_t number_of_multiples,
+                              const unsigned int upper_bound)
 {
    unsigned int sum = 0;
 

data/tracks/c/exercises/sum-of-multiples/src/example.h

@@ -3,6 +3,8 @@
 
 #include <stddef.h>
 
-unsigned int sum_of_multiples(const unsigned int *multiples, const size_t number_of_multiples, const unsigned int up_to);
+unsigned int sum_of_multiples(const unsigned int *multiples,
+                              const size_t number_of_multiples,
+                              const unsigned int up_to);
 
 #endif

data/tracks/c/exercises/sum-of-multiples/test/test_sum_of_multiples.c

@@ -5,68 +5,90 @@
 
 void test_sum_of_multiples_of_3_and_5_up_to_1(void)
 {
-   const unsigned int multiples[] = {3, 5};
-   TEST_ASSERT_EQUAL(0, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 1));
+   const unsigned int multiples[] = { 3, 5 };
+   TEST_ASSERT_EQUAL(0,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      1));
 }
 
 void test_sum_of_multiples_of_3_and_5_up_to_4(void)
 {
-   const unsigned int multiples[] = {3, 5};
-   TEST_ASSERT_EQUAL(3, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 4));
+   const unsigned int multiples[] = { 3, 5 };
+   TEST_ASSERT_EQUAL(3,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      4));
 }
 
 void test_sum_of_multiples_of_3_and_5_up_to_10(void)
 {
-   const unsigned int multiples[] = {3, 5};
-   TEST_ASSERT_EQUAL(23, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 10));
+   const unsigned int multiples[] = { 3, 5 };
+   TEST_ASSERT_EQUAL(23,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      10));
 }
 
 void test_sum_of_multiples_of_3_and_5_up_to_100(void)
 {
-   const unsigned int multiples[] = {3, 5};
-   TEST_ASSERT_EQUAL(2318, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 100));
+   const unsigned int multiples[] = { 3, 5 };
+   TEST_ASSERT_EQUAL(2318,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      100));
 }
 
 void test_sum_of_multiples_of_3_and_5_up_to_1000(void)
 {
-   const unsigned int multiples[] = {3, 5};
-   TEST_ASSERT_EQUAL(233168, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 1000));
+   const unsigned int multiples[] = { 3, 5 };
+   TEST_ASSERT_EQUAL(233168,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      1000));
 }
 
 void test_sum_of_multiples_of_7_13_and_17_up_to_20(void)
 {
-   const unsigned int multiples[] = {7, 13, 17};
-   TEST_ASSERT_EQUAL(51, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 20));
+   const unsigned int multiples[] = { 7, 13, 17 };
+   TEST_ASSERT_EQUAL(51,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      20));
 }
 
 void test_sum_of_multiples_of_4_and_6_up_to_15(void)
 {
-   const unsigned int multiples[] = {4, 6};
-   TEST_ASSERT_EQUAL(30, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 15));
+   const unsigned int multiples[] = { 4, 6 };
+   TEST_ASSERT_EQUAL(30,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      15));
 }
 
 void test_sum_of_multiples_of_5_6_and_8_up_to_150(void)
 {
-   const unsigned int multiples[] = {5, 6, 8};
-   TEST_ASSERT_EQUAL(4419, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 150));
+   const unsigned int multiples[] = { 5, 6, 8 };
+   TEST_ASSERT_EQUAL(4419,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      150));
 }
 
 void test_sum_of_multiples_of_5_and_25_up_to_51(void)
 {
-   const unsigned int multiples[] = {5, 25};
-   TEST_ASSERT_EQUAL(275, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 51));
+   const unsigned int multiples[] = { 5, 25 };
+   TEST_ASSERT_EQUAL(275,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      51));
 }
 
 void test_sum_of_multiples_of_43_and_47_up_to_10000(void)
 {
-   const unsigned int multiples[] = {43, 47};
-   TEST_ASSERT_EQUAL(2203160, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 10000));
+   const unsigned int multiples[] = { 43, 47 };
+   TEST_ASSERT_EQUAL(2203160,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      10000));
 }
 
 void test_sum_of_multiples_of_1_up_to_100(void)
 {
-   const unsigned int multiples[] = {1};
-   TEST_ASSERT_EQUAL(4950, sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples), 100));
+   const unsigned int multiples[] = { 1 };
+   TEST_ASSERT_EQUAL(4950,
+                     sum_of_multiples(multiples, NUM_OF_ELEMENTS(multiples),
+                                      100));
 }
 
 void test_no_multiples_given(void)

data/tracks/c/exercises/word-count/makefile

@@ -0,0 +1,16 @@
+CFLAGS  = -std=c99
+CFLAGS += -Wall
+CFLAGS += -Wextra
+CFLAGS += -pedantic
+CFLAGS += -Werror
+
+
+test: tests.out
+	@./tests.out
+
+clean:
+	rm -f *.o *.out
+
+tests.out: test/test_word_count.c src/word_count.c src/word_count.h
+	@echo Compiling $@
+	@cc $(CFLAGS) src/word_count.c test/vendor/unity.c test/test_word_count.c -o tests.out

data/tracks/c/exercises/word-count/src/example.c

@@ -0,0 +1,65 @@
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include "word_count.h"
+
+// checks to see if we are counting a given word:
+// if word counted already it returns index,
+// else returns -1
+static int word_match(char *testWord, int current_word_count,
+                      WordCount_Word_t words[MAX_WORDS])
+{
+   int matchIndex = -1;
+
+   for (int index = 0; index < current_word_count; index++) {
+      if (!strcmp(testWord, words[index].text)) {
+         matchIndex = index;
+         break;
+      }
+   }
+   return matchIndex;
+}
+
+int word_count(char *input_text, WordCount_Word_t words[MAX_WORDS])
+{
+   int index;
+   int uniqueWords = 0;
+   char *testWord;
+   char *lowerCaseInputText;    // hold lowercase copy of passed text
+   const char *delimiters = " ,.-\n:!!&@$%^&\"";
+
+   // convert the input text to lower case
+   lowerCaseInputText = malloc(strlen(input_text) + 1);
+   for (index = 0; input_text[index] != 0; index++) {
+      lowerCaseInputText[index] = tolower(input_text[index]);
+   }
+   lowerCaseInputText[index] = '\0';
+
+   // start with known results...
+   memset(words, 0, sizeof(WordCount_Word_t));
+
+   testWord = strtok(lowerCaseInputText, delimiters);
+   while (testWord != NULL) {
+      // account for leading/trailing single quote.
+      if (('\'' == testWord[0]) && ('\'' == testWord[strlen(testWord) - 1])) {
+         testWord[strlen(testWord) - 1] = '\0';
+         testWord++;
+      }
+      // determine index of counted word.
+      index = word_match(testWord, uniqueWords, words);
+
+      // add if not yet counted else increment count.
+      if (-1 == index) {
+         words[uniqueWords].count = 1;
+         strcpy(words[uniqueWords].text, testWord);
+         uniqueWords++;
+      } else {
+         words[index].count++;
+      }
+      // get next word in string
+      testWord = strtok(NULL, delimiters);
+   }
+
+   free(lowerCaseInputText);
+   return uniqueWords;
+}

data/tracks/c/exercises/word-count/src/word_count.h

@@ -0,0 +1,22 @@
+#ifndef _WORD_COUNT_H
+#define _WORD_COUNT_H
+
+#define MAX_WORDS 20            // at most MAX_WORDS will be found in the test input string
+#define MAX_WORD_LENGTH 50      // no individual word will exceed this length
+
+// results structure
+typedef struct WordCount_Word {
+   char text[MAX_WORD_LENGTH];
+   int count;
+} WordCount_Word_t;
+
+// word_count - routine to classify the unique words and their frequency in a test input string
+// inputs:
+//    input_text =  string no longer than will take (MAX_WORDS * MAX_WORD_LENGTH)
+//    words = allocated structure to record the words fourn and their frequency
+//
+// outputs:
+//    uniqueWords - number of words in the words structure
+int word_count(char *input_text, WordCount_Word_t words[MAX_WORDS]);
+
+#endif