trackler 2.2.1.69 → 2.2.1.70

data/tracks/c/exercises/phone-number/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/queen-attack/makefile

@@ -1,12 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
+
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/raindrops/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/react/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/rna-transcription/makefile

@@ -1,12 +1,22 @@
 CFLAGS = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
+
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/robot-simulator/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/roman-numerals/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/scrabble-score/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/series/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/sieve/makefile

@@ -1,12 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
+
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/space-age/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/sublist/makefile

@@ -1,12 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
+
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/sum-of-multiples/makefile

@@ -1,12 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
+
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/c/exercises/triangle/makefile

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

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

@@ -1,13 +1,22 @@
 CFLAGS  = -std=c99
+CFLAGS += -g
 CFLAGS += -Wall
 CFLAGS += -Wextra
 CFLAGS += -pedantic
 CFLAGS += -Werror
 
+VFLAGS  = --quiet
+VFLAGS += --tool=memcheck
+VFLAGS += --leak-check=full
+VFLAGS += --error-exitcode=1
 
 test: tests.out
 	@./tests.out
 
+memcheck: tests.out
+	@valgrind $(VFLAGS) ./tests.out
+	@echo "Memory check passed"
+
 clean:
 	rm -f *.o *.out
 

data/tracks/delphi/config.json

@@ -22,6 +22,16 @@
       ],
       "uuid": "60eb0882-495d-45f4-8d38-5b10d8851cf6"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "reverse-string",
+      "topics": [
+        "strings"
+      ],
+      "unlocked_by": null,
+      "uuid": "8bdf3796-592c-48f1-b2ef-8e4deb40cc37"
+    },
     {
       "core": false,
       "difficulty": 1,

data/tracks/delphi/exercises/reverse-string/README.md

@@ -0,0 +1,34 @@
+# reverse-string
+
+Reverse a string
+
+For example:
+input: "cool"
+output: "looc"
+
+## Testing
+
+In order to run the tests for this track, you will need to install
+DUnitX. Please see the [installation](http://www.exercism.io/languages/delphi/installing) instructions for more information.
+
+### Loading Exercises into Delphi
+
+If Delphi is properly installed, and `*.dpr` file types have been associated with Delphi, then double clicking the supplied `*.dpr` file will start Delphi and load the exercise/project.  `control + F9` is the keyboard shortcut to compile the project or pressing `F9` will compile and run the project.
+
+Alternatively you may opt to start Delphi and load your project via. the `File` drop down menu.
+
+### When Questions Come Up
+We monitor the [Pascal-Delphi](https://gitter.im/exercism/Pascal-Delphi) support room on [gitter.im](https://gitter.im) to help you with any questions that might arise.
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the exercise file you're submitting is in the `exercism/delphi/<exerciseName>` directory.
+
+For example, if you're submitting `ubob.pas` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/delphi/bob/ubob.pas`.
+
+## Source
+
+Introductory challenge to reverse an input string [https://medium.freecodecamp.org/how-to-reverse-a-string-in-javascript-in-3-different-ways-75e4763c68cb](https://medium.freecodecamp.org/how-to-reverse-a-string-in-javascript-in-3-different-ways-75e4763c68cb)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/delphi/exercises/reverse-string/ReverseString.dpr

@@ -0,0 +1,60 @@
+program ReverseString;
+
+{$IFNDEF TESTINSIGHT}
+{$APPTYPE CONSOLE}
+{$ENDIF}{$STRONGLINKTYPES ON}
+uses
+  System.SysUtils,
+  {$IFDEF TESTINSIGHT}
+  TestInsight.DUnitX,
+  {$ENDIF }
+  DUnitX.Loggers.Console,
+  DUnitX.Loggers.Xml.NUnit,
+  DUnitX.TestFramework,
+  uReverseStringTests in 'uReverseStringTests.pas',
+  uReverseString in 'uReverseString.pas';
+
+var
+  runner : ITestRunner;
+  results : IRunResults;
+  logger : ITestLogger;
+  nunitLogger : ITestLogger;
+begin
+{$IFDEF TESTINSIGHT}
+  TestInsight.DUnitX.RunRegisteredTests;
+  exit;
+{$ENDIF}
+  try
+    //Check command line options, will exit if invalid
+    TDUnitX.CheckCommandLine;
+    //Create the test runner
+    runner := TDUnitX.CreateRunner;
+    //Tell the runner to use RTTI to find Fixtures
+    runner.UseRTTI := True;
+    //tell the runner how we will log things
+    //Log to the console window
+    logger := TDUnitXConsoleLogger.Create(true);
+    runner.AddLogger(logger);
+    //Generate an NUnit compatible XML File
+    nunitLogger := TDUnitXXMLNUnitFileLogger.Create(TDUnitX.Options.XMLOutputFile);
+    runner.AddLogger(nunitLogger);
+    runner.FailsOnNoAsserts := True; //When true, Assertions must be made during tests;
+
+    //Run tests
+    results := runner.Execute;
+    if not results.AllPassed then
+      System.ExitCode := EXIT_ERRORS;
+
+    {$IFNDEF CI}
+    //We don't want this happening when running under CI.
+    if TDUnitX.Options.ExitBehavior = TDUnitXExitBehavior.Pause then
+    begin
+      System.Write('Done.. press <Enter> key to quit.');
+      System.Readln;
+    end;
+    {$ENDIF}
+  except
+    on E: Exception do
+      System.Writeln(E.ClassName, ': ', E.Message);
+  end;
+end.

data/tracks/delphi/exercises/reverse-string/uReverseStringExample.pas

@@ -0,0 +1,18 @@
+unit uReverseString;
+
+interface
+
+function reverse(aInString: string): string;
+
+implementation
+
+function reverse(aInString: string): string;
+var
+  i: integer;
+begin
+  result := '';
+  for i := Low(aInString) to High(aInString) do
+    result := aInString[i] + result;
+end;
+
+end.

data/tracks/delphi/exercises/reverse-string/uReverseStringTests.pas

@@ -0,0 +1,69 @@
+unit uReverseStringTests;
+
+interface
+uses
+  DUnitX.TestFramework;
+
+const
+   CanonicalVersion = '1.0.1';
+
+type
+
+  [TestFixture]
+  ReverseStringTest = class(TObject)
+  public
+    [Test]
+//    [Ignore('Comment the "[Ignore]" statement to run the test')]
+    procedure an_empty_string;
+
+    [Test]
+    [Ignore]
+    procedure a_word;
+
+    [Test]
+    [Ignore]
+    procedure a_capitalized_word;
+
+    [Test]
+    [Ignore]
+    procedure a_sentence_with_punctuation;
+
+    [Test]
+    [Ignore]
+    procedure a_palindrome;
+  end;
+
+implementation
+uses uReverseString;
+
+
+{ ReverseStringTest }
+
+procedure ReverseStringTest.an_empty_string;
+begin
+  Assert.AreEqual('', reverse(''));
+end;
+
+procedure ReverseStringTest.a_capitalized_word;
+begin
+  Assert.AreEqual('nemaR',reverse('Ramen'));
+end;
+
+procedure ReverseStringTest.a_palindrome;
+begin
+  Assert.AreEqual('racecar',reverse('racecar'));
+end;
+
+procedure ReverseStringTest.a_sentence_with_punctuation;
+begin
+  Assert.AreEqual('!yrgnuh m''I', reverse('I''m hungry!'));
+end;
+
+procedure ReverseStringTest.a_word;
+begin
+  Assert.AreEqual('tobor', reverse('robot'));
+end;
+
+initialization
+  TDUnitX.RegisterTestFixture(ReverseStringTest);
+end.

data/tracks/fsharp/exercises/forth/Example.fs

@@ -23,12 +23,6 @@ type Operation =
 
 type ForthState = { sStack: Value list; sInput: Item list; sMapping: Map<Word, Operation> }
 
-type ForthError = 
-    | DivisionByZero 
-    | StackUnderflow 
-    | InvalidWord 
-    | UnknownWord of Word
-
 let defaultMapping = 
     [("+",    Plus);
      ("-",    Minus);
@@ -72,21 +66,21 @@ let parse text state = parseText text |> addItems state
 
 let unaryStackOp op state =
     match state.sStack with
-    | []    -> Choice2Of2 StackUnderflow
-    | x::xs -> Choice1Of2 { state with sStack = op x @ xs}
+    | []    -> None
+    | x::xs -> Some { state with sStack = op x @ xs}
 
 let binaryStackOp op state =
     match state.sStack with
-    | x::y::xs -> Choice1Of2 { state with sStack = op x y @ xs}
-    | _        -> Choice2Of2 StackUnderflow
+    | x::y::xs -> Some { state with sStack = op x y @ xs}
+    | _        -> None
 
 let toBinaryStackOp op x y = [op y x]
 
 let divOp state = 
     match state.sStack with
-    | 0::_     -> Choice2Of2 DivisionByZero
-    | x::y::xs -> Choice1Of2 { state with sStack = (y / x) :: xs }
-    | _        -> Choice2Of2 StackUnderflow
+    | 0::_     -> None
+    | x::y::xs -> Some { state with sStack = (y / x) :: xs }
+    | _        -> None
 
 let applyOp op state =
     match op with
@@ -98,33 +92,43 @@ let applyOp op state =
     | Drop  -> unaryStackOp (fun _ -> []) state
     | Swap  -> binaryStackOp (fun x y -> [y; x]) state
     | Over  -> binaryStackOp (fun x y -> [y; x; y]) state
-    | User terms -> addItems state terms |> Choice1Of2
+    | User terms -> addItems state terms |> Some
 
 let evalWord word state = 
     match Map.tryFind word state.sMapping with
-    | None -> UnknownWord word |> Choice2Of2 
+    | None -> None
     | Some op -> applyOp op state
 
 let rec evalState state =
     match state with
-    | Choice2Of2 _ -> state
-    | Choice1Of2 s ->
+    | None -> state
+    | Some s ->
         match s.sInput with
         | [] -> state
-        | (Value v)::xs -> { s with sStack = v::s.sStack; sInput = xs } |> Choice1Of2 |> evalState
+        | (Value v)::xs -> { s with sStack = v::s.sStack; sInput = xs } |> Some |> evalState
         | (Word w)::xs ->
             match w with
             | ":" -> 
                 match breakBy (fun c -> c = Word ";") xs with
                 | ((Word userWord::operations), remainder) ->
                     { s with sInput = List.tail remainder; sMapping = Map.add (userWord.ToLower()) (User operations) s.sMapping } 
-                    |> Choice1Of2
+                    |> Some
                     |> evalState
-                | _ -> Choice2Of2 InvalidWord
-            | ";" -> Choice2Of2 InvalidWord
+                | _ -> None
+            | ";" -> None
             | _   -> evalWord w { s with sInput = xs } |> evalState
 
-let eval text state =     
-    parse text state 
-    |> Choice1Of2
-    |> evalState
+let rec eval commands (state: ForthState option) =   
+    match commands, state with
+    | [], _ 
+        -> state |> Option.map (fun x -> List.rev x.sStack)
+    | x::xs, Some y ->
+        let updatedState = 
+            parse x y 
+            |> Some
+            |> evalState
+
+        eval xs updatedState
+    | _ -> None    
+
+let evaluate commands = eval commands (Some empty)