Message generator adding

_small_exercices/credit_card_checker.js

@@ -0,0 +1,101 @@
+// Returns a random DNA base
+function returnRandBase() {
+  const dnaBases = ['A', 'T', 'C', 'G'];
+  return dnaBases[Math.floor(Math.random() * 4)];
+}
+
+// Returns a random single strand of DNA containing 15 bases
+function mockUpStrand() {
+  const newStrand = [];
+  for (let i = 0; i < 15; i++) {
+    newStrand.push(returnRandBase());
+  }
+  return newStrand;
+}
+
+// Factory function to create a DNA specimen object
+function pAequorFactory(specimenNumber, dnaArray) {
+  if (dnaArray.length !== 15) throw new Error('DNA array must be 15 bases long');
+  return {
+    _specimenNum: specimenNumber,
+    _dna: dnaArray,
+
+    get dna() {
+      return this._dna;
+    },
+
+    get specimenNum() {
+      return this._specimenNum;
+    },
+
+    mutate() {
+      const dnaBases = ['A', 'T', 'C', 'G'];
+      let indexToMutate = Math.floor(Math.random() * this._dna.length);
+      const currentBase = this._dna[indexToMutate];
+
+      // Filter out the current base to select a different one
+      const otherBases = dnaBases.filter(base => base !== currentBase);
+      const newBase = otherBases[Math.floor(Math.random() * otherBases.length)];
+
+      // Update DNA at the selected index
+      this._dna[indexToMutate] = newBase;
+
+      return this._dna;
+    },
+
+    compareDNA(secondDNA) {
+      let DNAsimilarities = 0;
+      for (let i = 0; i < this._dna.length; i++) {
+        if (this._dna[i] === secondDNA.dna[i]) {
+          DNAsimilarities++;
+        }
+      }
+      const commonDNA = DNAsimilarities / this._dna.length * 100; // the *100 is to calculate %age
+      return(`The two DNA threads of specimens numbers ${this._specimenNum} and ${secondDNA.specimenNum} are ${commonDNA.toFixed(2)}% similar.`);
+    },
+
+    willLikelySurvive() {
+      let survivalChances = 0;
+      for (let i = 0; i < this._dna.length; i++) {
+        if (this._dna[i] === "G" || this._dna[i] === "C") {
+          survivalChances++;
+        }
+      }
+      const totalChances = survivalChances / this._dna.length * 100; // the *100 is to calculate %age
+      const willSurvive = totalChances >= 60;
+      //console.log(`The specimen #${this._specimenNum} has a DNA composed at ${totalChances}% of C and G bases and thus will likely ${willSurvive ? "survive" : "not survive"}.`);
+      return willSurvive;
+    }
+    
+  };
+}
+
+function pAequorLaboratory(number) {
+  let pAequorLab = [];
+  let i = 0;
+  while (i < number) {
+    let pAequor = mockUpStrand();
+    let pAequorSpecimen = pAequorFactory(i+1, pAequor);
+    if (pAequorSpecimen.willLikelySurvive()) {
+      pAequorLab.push(pAequorSpecimen);
+      i++;
+    }
+  }
+  
+  return pAequorLab;
+}
+
+const pAequor1DNA = mockUpStrand();
+const pAequor2DNA = mockUpStrand();
+const pAequor1 = pAequorFactory(1, pAequor1DNA);
+const pAequor2 = pAequorFactory(2, pAequor2DNA);
+
+
+console.log(`
+${pAequor1.dna}
+${pAequor2.dna}`);
+
+console.log(pAequor1.compareDNA(pAequor2));
+pAequor1.willLikelySurvive();
+const pAequorLab1 = pAequorLaboratory(30);
+console.log(pAequorLab1.map(p => p.dna));

_small_exercices/mysterious_organism.js

@@ -0,0 +1,69 @@
+// Returns a random DNA base
+function returnRandBase() {
+  const dnaBases = ['A', 'T', 'C', 'G'];
+  return dnaBases[Math.floor(Math.random() * 4)];
+}
+
+// Returns a random single strand of DNA containing 15 bases
+function mockUpStrand() {
+  const newStrand = [];
+  for (let i = 0; i < 15; i++) {
+    newStrand.push(returnRandBase());
+  }
+  return newStrand;
+}
+
+// Factory function to create a DNA specimen object
+function pAequorFactory(specimenNumber, dnaArray) {
+  return {
+    _specimenNum: specimenNumber,
+    _dna: dnaArray,
+
+    get dna() {
+      return this._dna;
+    },
+
+    get specimenNum() {
+      return this._specimenNum;
+    },
+
+    mutate() {
+      const dnaBases = ['A', 'T', 'C', 'G'];
+      let indexToMutate = Math.floor(Math.random() * this._dna.length);
+      const currentBase = this._dna[indexToMutate];
+
+      // Filter out the current base to select a different one
+      const otherBases = dnaBases.filter(base => base !== currentBase);
+      const newBase = otherBases[Math.floor(Math.random() * otherBases.length)];
+
+      // Update DNA at the selected index
+      this._dna[indexToMutate] = newBase;
+
+      return this._dna;
+    },
+
+    compareDNA(secondDNA) {
+      let DNAsimilarities = 0;
+      for (let i = 0; i < this._dna.length; i++) {
+        if (this._dna[i] === secondDNA[i]) {
+          DNAsimilarities++;
+        }
+      }
+      const commonDNA = DNAsimilarities / 16 * 100; // the *100 is to calculate %age
+      return(`The two DNA threads are ${commonDNA.toFixed(2)}% similar.`);
+    }
+    
+  };
+}
+
+const pAequor1DNA = mockUpStrand();
+const pAequor2DNA = mockUpStrand();
+const pAequor1 = pAequorFactory(1, pAequor1DNA);
+const pAequor2 = pAequorFactory(2, pAequor2DNA);
+
+
+console.log(`
+${pAequor1.dna}
+${pAequor2.dna}`);
+
+console.log(pAequor1.compareDNA(pAequor2.dna));

message_generator/message_generator.js

@@ -0,0 +1,22 @@
+const fs = require("fs");
+fs.readFile("./dictionnaire_fr.txt", "utf8", (err, data) => {
+  if (err) {
+    console.error("Erreur de lecture du fichier :", err);
+    return;
+  }
+  const words = data.split("\n").filter(word => word.trim() !== "");
+
+  let wordNumber = Math.floor(Math.random() * 20 + 2);
+  let randomMessage = [];
+
+  for (let i = 0; i < wordNumber; i++) {
+    const joiners = ["et", "ou", "alors", "mais", "donc", "car", "puis", "ensuite,", "toutefois,", "cependant,", "néanmoins,", "par conséquent", "ainsi,", "en outre", "de plus", "d'ailleurs,", "en effet", "par ailleurs"];
+    const randomIndex = Math.floor(Math.random() * words.length);
+    const randomWord = words[randomIndex];
+    randomMessage.push(randomWord, joiners[Math.floor(Math.random() * joiners.length)]);
+  }
+
+    // Remove the last joiner
+    randomMessage.pop();
+    console.log(`Message généré : ${randomMessage.join(" ")}.`);
+})