From 70644b67a30f20b1325abb9be0f471bfde909eeb Mon Sep 17 00:00:00 2001
From: blackstormx <blackshtormx@gmail.com>
Date: Wed, 29 Jul 2020 16:10:06 +0400
Subject: [PATCH] Update content.js

---
 content.js | 198 ++++++++++++++++++++++++++++-------------------------
 1 file changed, 103 insertions(+), 95 deletions(-)

diff --git a/content.js b/content.js
index 0fa68ce..eb0844b 100644
--- a/content.js
+++ b/content.js
@@ -1,124 +1,132 @@
 const body = document.body;
 
-const bannedWord = "*Banned by StopSlogan*";
+let bannedWord = "*Banned by StopSlogan*";
 
-const slogans = {};
-let slogansKeys = [];
-const bannedSlogans = [];
-
-chrome.storage.sync.get("savedCustomSlogans", function(items) {
-  items.savedCustomSlogans.forEach(slogan => {
-    slogansKeys.push(slogan);
-    slogans[slogan] = true;
-  });
+chrome.storage.sync.get("customBanWord", function(items) {
+  bannedWord = items.customBanWord;
+  console.log(items, bannedWord);
+  startScan();
 });
 
-// const url = "https://en.wikipedia.org/wiki/List_of_political_slogans";
-const url =
-  "https://en.wikipedia.org/w/api.php?" +
-  new URLSearchParams({
-    origin: "*",
+function startScan() {
+  const slogans = {};
+  let slogansKeys = [];
+  const bannedSlogans = [];
 
-    action: "parse",
-    page: "List_of_political_slogans",
-    format: "json"
+  chrome.storage.sync.get("savedCustomSlogans", function(items) {
+    items.savedCustomSlogans.forEach(slogan => {
+      slogansKeys.push(slogan);
+      slogans[slogan] = true;
+    });
   });
-//en.wikipedia.org/w/api.php?action=parse&format=json&origin=*&page=Most%20common%20words%20in%20Spanish'
 
-function parseNode(startNode) {
-  if (startNode.tagName == "LI") {
-    const key = startNode.innerText.toLowerCase();
-    slogans[key] = true;
-    slogansKeys.push(key);
-  }
-  startNode.childNodes.forEach(node => {
-    parseNode(node);
-  });
-}
+  // const url = "https://en.wikipedia.org/wiki/List_of_political_slogans";
+  const url =
+    "https://en.wikipedia.org/w/api.php?" +
+    new URLSearchParams({
+      origin: "*",
 
-const callback = function(mutationsList, observer) {
-  // Use traditional 'for loops' for IE 11
-  for (let mutation of mutationsList) {
-    if (mutation.type === "childList") {
-      const node = mutation.target;
-      checkNodeRecursively(node);
+      action: "parse",
+      page: "List_of_political_slogans",
+      format: "json"
+    });
+  //en.wikipedia.org/w/api.php?action=parse&format=json&origin=*&page=Most%20common%20words%20in%20Spanish'
+
+  function parseNode(startNode) {
+    if (startNode.tagName == "LI") {
+      const key = startNode.innerText.toLowerCase();
+      slogans[key] = true;
+      slogansKeys.push(key);
     }
+    startNode.childNodes.forEach(node => {
+      parseNode(node);
+    });
   }
-};
 
-fetch(url)
-  .then(response => response.json())
-  .then(parsed => parsed.parse.text)
-  .then(text => {
-    const domParser = new DOMParser();
-    let doc = domParser.parseFromString(text["*"], "text/html");
-    parseNode(doc);
-    checkNodeRecursively(body);
-    const observer = new MutationObserver(callback);
-    observer.observe(body, {
-      childList: true,
-      subtree: true
+  const callback = function(mutationsList, observer) {
+    // Use traditional 'for loops' for IE 11
+    for (let mutation of mutationsList) {
+      if (mutation.type === "childList") {
+        const node = mutation.target;
+        checkNodeRecursively(node);
+      }
+    }
+  };
+
+  fetch(url)
+    .then(response => response.json())
+    .then(parsed => parsed.parse.text)
+    .then(text => {
+      const domParser = new DOMParser();
+      let doc = domParser.parseFromString(text["*"], "text/html");
+      parseNode(doc);
+      checkNodeRecursively(body);
+      const observer = new MutationObserver(callback);
+      observer.observe(body, {
+        childList: true,
+        subtree: true
+      });
     });
-  });
 
-function checkNode(startNode) {
-  if (startNode.nodeType == Node.TEXT_NODE) {
-    const value = startNode.nodeValue.toLowerCase();
-    if (deepCheck(value)) {
-      startNode.nodeValue = "*Banned by StopSlogan*";
-      bannedSlogans.push(value);
-    }
-  } else {
-    if (startNode.nodeType == Node.ELEMENT_NODE) {
-      if (startNode.tagName == "INPUT" || startNode.tagName == "TEXTAREA") {
-        const res = deepCheck(startNode.value);
-        if (res) {
-          startNode.value = res;
-        }
-      } else {
-        if (startNode.childNodes.length == 0) {
+  function checkNode(startNode) {
+    if (startNode.nodeType == Node.TEXT_NODE) {
+      const value = startNode.nodeValue.toLowerCase();
+      if (deepCheck(value)) {
+        startNode.nodeValue = bannedWord;
+        bannedSlogans.push(value);
+      }
+    } else {
+      if (startNode.nodeType == Node.ELEMENT_NODE) {
+        if (startNode.tagName == "INPUT" || startNode.tagName == "TEXTAREA") {
           const res = deepCheck(startNode.value);
           if (res) {
-            startNode.innerText = res;
+            startNode.value = res;
+          }
+        } else {
+          if (startNode.childNodes.length == 0) {
+            const res = deepCheck(startNode.value);
+            if (res) {
+              startNode.innerText = res;
+            }
           }
         }
       }
     }
   }
-}
 
-function deepCheck(text) {
-  if (text == bannedWord || !text) {
-    return false;
-  }
-  text = text.toLowerCase();
+  function deepCheck(text) {
+    if (text == bannedWord || !text) {
+      return false;
+    }
+    text = text.toLowerCase();
 
-  if (slogans[text]) {
-    return bannedWord;
-  }
-  for (var i = 0; i < slogansKeys.length; i++) {
-    const key = slogansKeys[i];
-    if (text.includes(key)) {
-      let edited = text.replace(key, bannedWord);
-      return edited;
+    if (slogans[text]) {
+      return bannedWord;
+    }
+    for (var i = 0; i < slogansKeys.length; i++) {
+      const key = slogansKeys[i];
+      if (text.includes(key)) {
+        let edited = text.replace(key, bannedWord);
+        return edited;
+      }
     }
+    return false;
+    //TODO: Levenshtein Distance Algorithm
   }
-  return false;
-  //TODO: Levenshtein Distance Algorithm
-}
 
-function checkNodeRecursively(startNode) {
-  checkNode(startNode);
+  function checkNodeRecursively(startNode) {
+    checkNode(startNode);
 
-  startNode.childNodes.forEach(node => {
-    checkNodeRecursively(node);
+    startNode.childNodes.forEach(node => {
+      checkNodeRecursively(node);
+    });
+  }
+  // chrome.runtime.sendMessage(bannedSlogans, function (response) {
+  //     console.log(response.farewell);
+  // });
+  chrome.runtime.onMessage.addListener(function(request, sender, sendResponse) {
+    if (request.action == "getBannedSlogans") {
+      sendResponse(bannedSlogans);
+    }
   });
 }
-// chrome.runtime.sendMessage(bannedSlogans, function (response) {
-//     console.log(response.farewell);
-// });
-chrome.runtime.onMessage.addListener(function(request, sender, sendResponse) {
-  if (request.action == "getBannedSlogans") {
-    sendResponse(bannedSlogans);
-  }
-});