Glasgow | 25-ITP-SEP | Mohammed Abdoon | Sprint 3 | Coursework/2-practice-tdd

Sprint-3/2-practice-tdd/count.js

@@ -1,5 +1,10 @@
 function countChar(stringOfCharacters, findCharacter) {
-  return 5
+  let output = 0;
+  for( let i=0; i <= stringOfCharacters.length; i++ ) {
+    if(stringOfCharacters[i] === findCharacter)
+      output++;
+  }
+  return output;
 }
 
 module.exports = countChar;

Sprint-3/2-practice-tdd/count.test.js

@@ -22,3 +22,9 @@ test("should count multiple occurrences of a character", () => {
 // And a character char that does not exist within the case-sensitive str,
 // When the function is called with these inputs,
 // Then it should return 0, indicating that no occurrences of the char were found in the case-sensitive str.
+test("should return 0 if there are no occurrences at all", () => {
+  const str = "Hello World!";
+  const char = "a";
+  const count = countChar(str, char);
+  expect(count).toEqual(0);
+});

Sprint-3/2-practice-tdd/get-ordinal-number.js

@@ -1,5 +1,28 @@
 function getOrdinalNumber(num) {
-  return "1st";
+  //
+  if (typeof num !== "number" || !Number.isInteger(num) || num <= 0) {
+    return "Input must be a positive integer.";
+  }
+
+  const lastTwoDigits = num % 100;
+  const lastDigit = num % 10;
+
+  if (lastTwoDigits >= 11 && lastTwoDigits <= 13) {
+    return `${num}th`;
+  }
+
+  switch (lastDigit) {
+    case 1:
+      return `${num}st`;
+    case 2:
+      return `${num}nd`;
+    case 3:
+      return `${num}rd`;
+    default:
+      return `${num}th`;
+  }
+  return num;  
 }
 
+console.log(getOrdinalNumber(21));    // "1st"
 module.exports = getOrdinalNumber;

Sprint-3/2-practice-tdd/get-ordinal-number.test.js

@@ -10,4 +10,54 @@ const getOrdinalNumber = require("./get-ordinal-number");
 
 test("should return '1st' for 1", () => {
   expect(getOrdinalNumber(1)).toEqual("1st");
+  expect(getOrdinalNumber(21)).toEqual("21st");
+  expect(getOrdinalNumber(101)).toEqual("101st");
 });
+
+// Case 2: Identify the ordinal number for 1
+// except those ending in 12
+test("append 'nd' to numbers ending in 2, except those ending in 12", () => {
+    expect( getOrdinalNumber(2) ).toEqual("2nd");
+    expect( getOrdinalNumber(22) ).toEqual("22nd");
+    expect( getOrdinalNumber(132) ).toEqual("132nd");
+});
+
+// Case 3: Identify the ordinal numbers for 3 to 12
+test("should return correct ordinal suffixes for numbers 3 to 12", () => {
+    expect( getOrdinalNumber(3) ).toEqual("3rd");
+    expect( getOrdinalNumber(4) ).toEqual("4th");
+    expect( getOrdinalNumber(5) ).toEqual("5th");
+    expect( getOrdinalNumber(6) ).toEqual("6th");
+    expect( getOrdinalNumber(7) ).toEqual("7th");
+    expect( getOrdinalNumber(8) ).toEqual("8th");
+    expect( getOrdinalNumber(9) ).toEqual("9th");
+    expect( getOrdinalNumber(10) ).toEqual("10th");
+    expect( getOrdinalNumber(11) ).toEqual("11th");
+    expect( getOrdinalNumber(12) ).toEqual("12th");
+});
+// Case 4: Identify the ordinal numbers for numbers above 12
+test("should return correct ordinal suffixes for numbers above 12", () => {
+    expect( getOrdinalNumber(13) ).toEqual("13th");
+    expect( getOrdinalNumber(19) ).toEqual("19th");
+    expect( getOrdinalNumber(23) ).toEqual("23rd");
+    expect( getOrdinalNumber(34) ).toEqual("34th");
+    expect( getOrdinalNumber(45) ).toEqual("45th");
+    expect( getOrdinalNumber(56) ).toEqual("56th");
+    expect( getOrdinalNumber(67) ).toEqual("67th");
+});
+
+// Case 5: Identify the ordinal numbers for numbers like 20 30 40 etc
+test("should return correct ordinal suffixes for multiples of ten", () => {
+    expect( getOrdinalNumber(20) ).toEqual("20th");
+    expect( getOrdinalNumber(30) ).toEqual("30th");
+    expect( getOrdinalNumber(70) ).toEqual("70th");
+    expect( getOrdinalNumber(50) ).toEqual("50th");
+});
+
+// Case 6: dealing with big numbers
+test("should return correct ordinal suffixes for big numbers", () => {
+    expect( getOrdinalNumber(111) ).toEqual("111th");
+    expect( getOrdinalNumber(4712) ).toEqual("4712th");
+    expect( getOrdinalNumber(10003) ).toEqual("10003rd");
+    expect( getOrdinalNumber(10012) ).toEqual("10012th");
+});

Sprint-3/2-practice-tdd/repeat.js

@@ -1,5 +1,8 @@
-function repeat() {
-  return "hellohellohello";
+function repeat(str, count) {
+  if (typeof count !== "number" || isNaN(count) || count < 0) {
+    throw new Error("Count must be a valid number");
+  }
+  return str.repeat(count);
 }
 
 module.exports = repeat;

Sprint-3/2-practice-tdd/repeat.test.js

@@ -20,13 +20,39 @@ test("should repeat the string count times", () => {
 // Given a target string str and a count equal to 1,
 // When the repeat function is called with these inputs,
 // Then it should return the original str without repetition, ensuring that a count of 1 results in no repetition.
+test("should repeat the string only 1 time (no repetition)", () => {
+  const str = "hello";
+  const count = 1;
+  const repeatedStr = repeat(str, count);
+  expect(repeatedStr).toEqual("hello");
+});
 
 // case: Handle Count of 0:
 // Given a target string str and a count equal to 0,
 // When the repeat function is called with these inputs,
 // Then it should return an empty string, ensuring that a count of 0 results in an empty output.
+test("should repeat the string 0 times ( means the output will be an empty string)", () => {
+  const str = "hello";
+  const count = 0;
+  const repeatedStr = repeat(str, count);
+  expect(repeatedStr).toEqual("");
+});
 
 // case: Negative Count:
 // Given a target string str and a negative integer count,
 // When the repeat function is called with these inputs,
 // Then it should throw an error or return an appropriate error message, as negative counts are not valid.
+test("should throw an error if count is not a valid number", () => {
+  const str = "hello";
+  const count = -8;
+  expect(() => repeat(str, count)).toThrow("Count must be a valid number");
+});
+
+test("should throw an error if count is not a valid number", () => {
+  const str = "hello";
+  const count = "abc";
+  expect(() => repeat(str, count)).toThrow("Count must be a valid number");
+});
+
+
+