trackler 2.2.1.107 → 2.2.1.108

data/tracks/delphi/exercises/allergies/uAllergyTests.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.1.0';
+
 type
 
   [TestFixture]
@@ -33,10 +36,18 @@ type
     [Ignore]
     procedure Allergic_to_just_peanuts;
 
+    [Test]
+    [Ignore]
+    procedure Allergic_to_just_strawberries;
+
     [Test]
     [Ignore]
     procedure Allergic_to_eggs_and_peanuts;
 
+    [Test]
+    [Ignore]
+    procedure Allergic_to_more_than_eggs_but_not_peanuts;
+
     [Test]
     [Ignore]
     procedure Allergic_to_lots_of_stuff;
@@ -101,6 +112,14 @@ begin
   assert.IsTrue(allergies.IList.Contains('peanuts'));
 end;
 
+procedure AllergyTests.Allergic_to_just_strawberries;
+var allergies: IAllergies;
+begin
+  allergies := TAllergies.Create(8);
+  assert.AreEqual(1, allergies.IList.Count);
+  assert.IsTrue(allergies.IList.Contains('strawberries'));
+end;
+
 procedure AllergyTests.Allergic_to_eggs_and_peanuts;
 var allergies: IAllergies;
 begin
@@ -110,6 +129,15 @@ begin
   assert.IsTrue(allergies.IList.Contains('eggs'));
 end;
 
+procedure AllergyTests.Allergic_to_more_than_eggs_but_not_peanuts;
+var allergies: IAllergies;
+begin
+  allergies := TAllergies.Create(5);
+  assert.AreEqual(2, allergies.IList.Count);
+  assert.IsTrue(allergies.IList.Contains('eggs'));
+  assert.IsTrue(allergies.IList.Contains('shellfish'));
+end;
+
 procedure AllergyTests.Allergic_to_lots_of_stuff;
 var allergies: IAllergies;
     Expected: TArray<string>;

data/tracks/delphi/exercises/binary-search/uBinarySearchExample.pas

@@ -15,6 +15,12 @@ implementation
 class function BinarySearch.SearchHelper(input: TArray<Integer>; target: Integer; minIndex: Integer; maxIndex: Integer): integer;
 var middleIndex: integer;
 begin
+  if minIndex > maxIndex then
+  begin
+    result := -1;
+    exit;
+  end;
+
   middleIndex := (minIndex + maxIndex) div 2;
 
   if (input[middleIndex] = target) then

data/tracks/delphi/exercises/binary-search/uBinarySearchTest.pas

@@ -4,59 +4,66 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.1.0';
+
 type
 
   [TestFixture]
   TBinarySearchTest = class(TObject)
   public
     [Test]
-//  [Ignore('Comment the "[Ignore]" statement to run the test')]
-    procedure Should_return_minus_one_when_an_empty_array_is_searched;
+//    [Ignore('Comment the "[Ignore]" statement to run the test')]
+    procedure Finds_a_value_in_an_array_with_one_element;
 
     [Test]
     [Ignore]
-    procedure Should_be_able_to_find_a_value_in_a_single_element_array_with_one_access;
+    procedure Finds_a_value_in_the_middle_of_an_array;
 
     [Test]
     [Ignore]
-    procedure Should_return_minus_one_if_a_value_is_less_than_the_element_in_a_single_element_array;
+    procedure Finds_a_value_at_the_beginning_of_an_array;
 
     [Test]
     [Ignore]
-    procedure Should_return_minus_one_if_a_value_is_greater_than_the_element_in_a_single_element_array;
+    procedure Finds_a_value_at_the_end_of_an_array;
 
     [Test]
     [Ignore]
-    procedure Should_find_an_element_in_a_longer_array;
+    procedure Finds_a_value_in_an_array_of_odd_length;
 
     [Test]
     [Ignore]
-    procedure Should_find_elements_at_the_beginning_of_an_array;
+    procedure Finds_a_value_in_an_array_of_even_length;
 
     [Test]
     [Ignore]
-    procedure Should_find_elements_at_the_end_of_an_array;
+    procedure Identifies_that_a_value_is_not_included_in_the_array;
 
     [Test]
     [Ignore]
-    procedure Should_return_minus_one_if_a_value_is_less_than_all_elements_in_a_long_array;
+    procedure A_value_smaller_than_the_arrays_smallest_value_is_not_included;
 
     [Test]
     [Ignore]
-    procedure Should_return_minus_one_if_a_value_is_greater_than_all_elements_in_a_long_array;
+    procedure A_value_larger_than_the_arrays_largest_value_is_not_included;
+
+    [Test]
+    [Ignore]
+    procedure Nothing_is_included_in_an_empty_array;
   end;
 
 implementation
 uses System.Generics.Collections, uBinarySearch;
 
-procedure TBinarySearchTest.Should_return_minus_one_when_an_empty_array_is_searched;
+procedure TBinarySearchTest.Nothing_is_included_in_an_empty_array;
 var input: TArray<Integer>;
 begin
   SetLength(input, 0);
   Assert.AreEqual(-1, BinarySearch.Search(input, 6));
 end;
 
-procedure TBinarySearchTest.Should_be_able_to_find_a_value_in_a_single_element_array_with_one_access;
+procedure TBinarySearchTest.Finds_a_value_in_an_array_with_one_element;
 var input: TArray<integer>;
 begin
   SetLength(input, 1);
@@ -65,67 +72,76 @@ begin
   Assert.AreEqual(0, BinarySearch.Search(input, 6));
 end;
 
-procedure TBinarySearchTest.Should_return_minus_one_if_a_value_is_less_than_the_element_in_a_single_element_array;
-var input: TArray<integer>;
+procedure TBinarySearchTest.Finds_a_value_in_the_middle_of_an_array;
+var inputList: TList<integer>;
 begin
-  SetLength(input, 1);
-  input[0] := 94;
+  inputList := TList<integer>.Create;
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
 
-  Assert.AreEqual(-1, BinarySearch.Search(input, 6));
+  Assert.AreEqual(3, BinarySearch.Search(inputList.ToArray, 6));
 end;
 
-procedure TBinarySearchTest.Should_return_minus_one_if_a_value_is_greater_than_the_element_in_a_single_element_array;
-var input: TArray<integer>;
+procedure TBinarySearchTest.Finds_a_value_at_the_beginning_of_an_array;
+var inputList: TList<integer>;
 begin
-  SetLength(input, 1);
-  input[0] := 94;
+  inputList := TList<integer>.Create;
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
+
+  Assert.AreEqual(0, BinarySearch.Search(inputList.ToArray, 1));
+end;
+
+procedure TBinarySearchTest.Finds_a_value_at_the_end_of_an_array;
+var inputList: TList<integer>;
+begin
+  inputList := TList<integer>.Create;
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
 
-  Assert.AreEqual(-1, BinarySearch.Search(input, 602));
+  Assert.AreEqual(6, BinarySearch.Search(inputList.ToArray, 11));
 end;
 
-procedure TBinarySearchTest.Should_find_an_element_in_a_longer_array;
+procedure TBinarySearchTest.Finds_a_value_in_an_array_of_odd_length;
 var inputList: TList<integer>;
 begin
   inputList := TList<integer>.Create;
-  inputList.AddRange([6, 67, 123, 345, 456, 457, 490, 2002, 54321, 54322]);
+  inputList.AddRange([1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 634]);
 
-  Assert.AreEqual(7, BinarySearch.Search(inputList.ToArray, 2002));
+  Assert.AreEqual(9, BinarySearch.Search(inputList.ToArray, 144));
 end;
 
-procedure TBinarySearchTest.Should_find_elements_at_the_beginning_of_an_array;
+procedure TBinarySearchTest.Finds_a_value_in_an_array_of_even_length;
 var inputList: TList<integer>;
 begin
   inputList := TList<integer>.Create;
-  inputList.AddRange([6, 67, 123, 345, 456, 457, 490, 2002, 54321, 54322]);
+  inputList.AddRange([1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377]);
 
-  Assert.AreEqual(0, BinarySearch.Search(inputList.ToArray, 6));
+  Assert.AreEqual(5, BinarySearch.Search(inputList.ToArray, 21));
 end;
 
-procedure TBinarySearchTest.Should_find_elements_at_the_end_of_an_array;
+procedure TBinarySearchTest.Identifies_that_a_value_is_not_included_in_the_array;
 var inputList: TList<integer>;
 begin
   inputList := TList<integer>.Create;
-  inputList.AddRange([6, 67, 123, 345, 456, 457, 490, 2002, 54321, 54322]);
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
 
-  Assert.AreEqual(9, BinarySearch.Search(inputList.ToArray, 54322));
+  Assert.AreEqual(-1, BinarySearch.Search(inputList.ToArray, 7));
 end;
 
-procedure TBinarySearchTest.Should_return_minus_one_if_a_value_is_less_than_all_elements_in_a_long_array;
+procedure TBinarySearchTest.A_value_larger_than_the_arrays_largest_value_is_not_included;
 var inputList: TList<integer>;
 begin
   inputList := TList<integer>.Create;
-  inputList.AddRange([6, 67, 123, 345, 456, 457, 490, 2002, 54321, 54322]);
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
 
-  Assert.AreEqual(-1, BinarySearch.Search(inputList.ToArray, 2));
+  Assert.AreEqual(-1, BinarySearch.Search(inputList.ToArray, 13));
 end;
 
-procedure TBinarySearchTest.Should_return_minus_one_if_a_value_is_greater_than_all_elements_in_a_long_array;
+procedure TBinarySearchTest.A_value_smaller_than_the_arrays_smallest_value_is_not_included;
 var inputList: TList<integer>;
 begin
   inputList := TList<integer>.Create;
-  inputList.AddRange([6, 67, 123, 345, 456, 457, 490, 2002, 54321, 54322]);
+  inputList.AddRange([1, 3, 4, 6, 8, 9, 11]);
 
-  Assert.AreEqual(-1, BinarySearch.Search(inputList.ToArray, 54323));
+  Assert.AreEqual(-1, BinarySearch.Search(inputList.ToArray, 0));
 end;
 
 initialization

data/tracks/delphi/exercises/collatz-conjecture/uCollatzconjectureTest.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.2.0';
+
 type
   [TestFixture]
   CollatzconjectureTest = class(TObject)

data/tracks/delphi/exercises/etl/uETLtests.pas

@@ -4,6 +4,9 @@ interface
 uses
   System.Generics.Collections, DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.0.0';
+
 type
 
   [TestFixture]
@@ -15,20 +18,20 @@ type
     procedure Validate_CompareDictionaries;
 
     [Test]
-//  [Ignore('Comment the "[Ignore]" statement to run the test')]
-    procedure Transforms_one_value;
+//    [Ignore('Comment the "[Ignore]" statement to run the test')]
+    procedure A_single_letter;
 
     [Test]
     [Ignore]
-    procedure Transforms_multiple_values;
+    procedure Single_score_with_multiple_letters;
 
     [Test]
     [Ignore]
-    procedure Transforms_multiple_keys;
+    procedure Multiple_scores_with_multiple_letters;
 
     [Test]
     [Ignore]
-    procedure Transforms_a_full_dataset;
+    procedure Multiple_scores_with_differing_numbers_of_letters;
   end;
 
 implementation
@@ -61,7 +64,7 @@ begin
   CompareDictionaries(expected, actual);
 end;
 
-procedure testETL.Transforms_one_value;
+procedure testETL.A_single_letter;
 var aList: TList<string>;
     old: TDictionary<integer, TList<string>>;
     expected: TDictionary<string, integer>;
@@ -77,7 +80,7 @@ begin
   CompareDictionaries(expected, ETL.Transform(old));
 end;
 
-procedure testETL.Transforms_multiple_values;
+procedure testETL.Single_score_with_multiple_letters;
 var aList: TList<string>;
     old: TDictionary<integer, TList<string>>;
     expected: TDictionary<string, integer>;
@@ -97,7 +100,7 @@ begin
   CompareDictionaries(expected, ETL.Transform(old));
 end;
 
-procedure testETL.Transforms_multiple_keys;
+procedure testETL.Multiple_scores_with_multiple_letters;
 var aList: TList<string>;
     old: TDictionary<integer, TList<string>>;
     expected: TDictionary<string, integer>;
@@ -114,14 +117,14 @@ begin
 
   expected := TDictionary<string, integer>.Create;
   expected.Add('a',1);
-  expected.Add('e',1);
   expected.Add('d',2);
+  expected.Add('e',1);
   expected.Add('g',2);
 
   CompareDictionaries(expected, ETL.Transform(old));
 end;
 
-procedure testETL.Transforms_a_full_dataset;
+procedure testETL.Multiple_scores_with_differing_numbers_of_letters;
 var aList: TList<string>;
     old: TDictionary<integer, TList<string>>;
     expected: TDictionary<string, integer>;

data/tracks/delphi/exercises/grains/uGrainsTests.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.1.0';
+
 type
   [TestFixture]
   TgrainsTests = class(TObject)
@@ -50,7 +53,7 @@ type
 
     [Test]
     [Ignore]
-    procedure Test_total_grains;
+    procedure Returns_the_total_number_of_grains_on_the_board;
   end;
 
 implementation
@@ -138,7 +141,7 @@ begin
   Assert.WillRaise(MyProc, ERangeError);
 end;
 
-procedure TgrainsTests.Test_total_grains;
+procedure TgrainsTests.Returns_the_total_number_of_grains_on_the_board;
 var expected: UInt64;
 begin
   expected := 18446744073709551615;

data/tracks/delphi/exercises/hamming/uHammingTests.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '2.1.0';
+
 type
 
   [TestFixture]

data/tracks/delphi/exercises/hello-world/uTestHelloWorld.pas

@@ -53,6 +53,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.1.0';
+
 type
   [TestFixture]
   HelloWorldTest = class(TObject)

data/tracks/delphi/exercises/leap/uLeapTests.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.3.0';
+
 type
 
   [TestFixture]

data/tracks/delphi/exercises/minesweeper/uMineSweeperTest.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '1.1.0';
+
 type
 
   [TestFixture]

data/tracks/delphi/exercises/nucleotide-count/uNucleotideCountTest.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework, System.Generics.Collections;
 
+const
+  CanonicalVersion = '1.3.0';
+
 type
 
   [TestFixture('count all nucleotides in a strand')]
@@ -13,7 +16,7 @@ type
     procedure Validate_CompareDictionaries;
 
     [Test]
-//  [Ignore('Comment the "[Ignore]" statement to run the test')]
+//    [Ignore('Comment the "[Ignore]" statement to run the test')]
     procedure empty_strand;
 
     [Test]
@@ -26,15 +29,11 @@ type
 
     [Test]
     [Ignore]
-    procedure Counts_a_nucleotide_only_once;
+    procedure strand_with_multiple_nucleotides;
 
     [Test]
     [Ignore]
     procedure strand_with_invalid_nucleotides;
-
-    [Test]
-    [Ignore]
-    procedure strand_with_multiple_nucleotides;
   end;
 
 implementation
@@ -103,17 +102,6 @@ begin
   CompareDictionaries(expected, dna.NucleotideCounts);
 end;
 
-procedure NucleoTideCountTest.Counts_a_nucleotide_only_once;
-var dna: TDNA;
-    inStr: string;
-begin
-  inStr := 'GGTTGG';
-  dna := TDNA.Create(inStr);
-  dna.Count('T');
-
-  Assert.AreEqual(2, dna.Count('T'));
-end;
-
 procedure NucleoTideCountTest.strand_with_invalid_nucleotides;
 var MyProc: TTestLocalMethod;
 begin