merge: Format codebase with standard.js (#989)

CarlosZoft · github-actions · web-flow · commit eb36e2de62cc · 2022-04-21T11:38:38.000+05:30
* Auto-update DIRECTORY.md

* fix: some redundancy according to standard javascript library

Co-authored-by: github-actions &lt;${GITHUB_ACTOR}@users.noreply.github.com&gt;
diff --git a/DIRECTORY.md b/DIRECTORY.md
@@ -77,7 +77,7 @@
     * [CycleDetection](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/CycleDetection.js)
     * [DoublyLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/DoublyLinkedList.js)
     * [RotateListRight](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/RotateListRight.js)
-    * [SingleCircularLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SingleCircularLinkedList.js.js)
+    * [SinglyCircularLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SinglyCircularLinkedList.js)
     * [SinglyLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SinglyLinkedList.js)
   * Queue
     * [CircularQueue](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Queue/CircularQueue.js)
diff --git a/Data-Structures/Tree/Trie.js b/Data-Structures/Tree/Trie.js
@@ -18,7 +18,7 @@ function Trie () {
 Trie.findAllWords = function (root, word, output) {
   if (root === null) return
   if (root.count > 0) {
-    if (typeof output === 'object') { output.push({ word: word, count: root.count }) }
+    if (typeof output === 'object') { output.push({ word, count: root.count }) }
   }
   let key
   for (key in root.children) {
diff --git a/Maths/test/EulerMethod.manual-test.js b/Maths/test/EulerMethod.manual-test.js
@@ -18,7 +18,7 @@ function plotLine (label, points, width, height) {
     type: 'scatter',
     data: {
       datasets: [{
-        label: label,
+        label,
         data: points,
         showLine: true,
         fill: false,
diff --git a/Sorts/TopologicalSort.js b/Sorts/TopologicalSort.js
@@ -42,7 +42,7 @@ export function TopologicalSorter () {
     }
 
     finishingTimeList.push({
-      node: node,
+      node,
       finishTime: ++finishTimeCount
     })
   }

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ function Trie () {`
`18`	`18`	`Trie.findAllWords = function (root, word, output) {`
`19`	`19`	`if (root === null) return`
`20`	`20`	`if (root.count > 0) {`
`21`		`- if (typeof output === 'object') { output.push({ word: word, count: root.count }) }`
	`21`	`+ if (typeof output === 'object') { output.push({ word, count: root.count }) }`
`22`	`22`	`}`
`23`	`23`	`let key`
`24`	`24`	`for (key in root.children) {`
Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,7 @@ export function TopologicalSorter () {`
`42`	`42`	`}`
`43`	`43`
`44`	`44`	`finishingTimeList.push({`
`45`		`- node: node,`
	`45`	`+ node,`
`46`	`46`	`finishTime: ++finishTimeCount`
`47`	`47`	`})`
`48`	`48`	`}`