small changes

Author: digitsensitive

CHANGELOG.md

@@ -6,6 +6,9 @@ The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/).
 ## [1.X.X] - 2020-XX-XX
 ### Added
 ### Changed
+- Introduce const for let where possible
+- Small changes in LICENSE and README
+
 ### Fixed
 
 ---

LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2020 digitsensitive
+Copyright (c) 2017 - 2020 digitsensitive <digit.sensitivee@gmail.com>
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

README.md

@@ -195,10 +195,22 @@ More informations about the format options can be found [here](https://prettier.
 
 [MIT License](https://opensource.org/licenses/mit-license.php)
 
-© 2017-2020 digitsensitive <digit.sensitivee@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+Copyright (c) 2017 - 2020 digitsensitive <digit.sensitivee@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal 
+in the Software without restriction, including without limitation the rights 
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 
+copies of the Software, and to permit persons to whom the Software is 
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+ copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

lib/core/grid.ts

@@ -44,7 +44,7 @@ export class Grid {
     height: number,
     densityOfObstacles?: number
   ): Node[][] {
-    let newGrid: Node[][] = [];
+    const newGrid: Node[][] = [];
     let id: number = 0;
 
     // Generate an empty matrix
@@ -67,7 +67,7 @@ export class Grid {
     if (matrix === undefined) {
       for (let y = 0; y < height; y++) {
         for (let x = 0; x < width; x++) {
-          let rndNumber = Math.floor(Math.random() * 10) + 1;
+          const rndNumber = Math.floor(Math.random() * 10) + 1;
           if (rndNumber > 10 - densityOfObstacles) {
             newGrid[y][x].setIsWalkable(false);
           } else {
@@ -135,7 +135,7 @@ export class Grid {
     currentPosition: IPoint,
     diagnonalMovementAllowed: boolean
   ): Node[] {
-    let surroundingNodes: Node[] = [];
+    const surroundingNodes: Node[] = [];
 
     for (var y = currentPosition.y - 1; y <= currentPosition.y + 1; y++) {
       for (var x = currentPosition.x - 1; x <= currentPosition.x + 1; x++) {
@@ -189,7 +189,7 @@ export class Grid {
    * Get a clone of the grid
    */
   public clone(): Node[][] {
-    let cloneGrid: Node[][] = [];
+    const cloneGrid: Node[][] = [];
     let id: number = 0;
 
     for (let y = 0; y < this.height; y++) {

lib/core/heuristic.ts

@@ -23,8 +23,8 @@ export function calculateHeuristic(
   pos1,
   weight
 ): number {
-  let dx = Math.abs(pos1.x - pos0.x);
-  let dy = Math.abs(pos1.y - pos0.y);
+  const dx = Math.abs(pos1.x - pos0.x);
+  const dy = Math.abs(pos1.y - pos0.y);
 
   switch (heuristicFunction) {
     case 'Manhatten':

lib/core/util.ts

@@ -11,7 +11,7 @@ export function backtrace(
   includeEndNode: boolean
 ): number[][] {
   // Init empty path
-  let path: number[][] = [];
+  const path: number[][] = [];
 
   let currentNode: Node;
   if (includeEndNode) {

lib/finders/astar-finder.ts

@@ -65,8 +65,8 @@ export class AStarFinder {
     // Reset grid
     this.grid.resetGrid();
 
-    let startNode = this.grid.getNodeAt(startPosition);
-    let endNode = this.grid.getNodeAt(endPosition);
+    const startNode = this.grid.getNodeAt(startPosition);
+    const endNode = this.grid.getNodeAt(endPosition);
 
     // Break if start and/or end position is/are not walkable
     if (
@@ -112,7 +112,7 @@ export class AStarFinder {
     // As long the open list is not empty, continue searching a path
     while (this.openList.length !== 0) {
       // Get node with lowest f value
-      let currentNode = _.minBy(this.openList, (o) => {
+      const currentNode = _.minBy(this.openList, (o) => {
         return o.getFValue();
       });
 
@@ -129,22 +129,22 @@ export class AStarFinder {
       }
 
       // Get neighbors
-      let neighbors = this.grid.getSurroundingNodes(
+      const neighbors = this.grid.getSurroundingNodes(
         currentNode.position,
         this.diagonalAllowed
       );
 
       // Loop through all the neighbors
       for (let i in neighbors) {
-        let neightbor = neighbors[i];
+        const neightbor = neighbors[i];
 
         // Continue if node on closed list
         if (neightbor.getIsOnClosedList()) {
           continue;
         }
 
         // Calculate the g value of the neightbor
-        let nextGValue =
+        const nextGValue =
           currentNode.getGValue() +
           (neightbor.position.x !== currentNode.position.x ||
           neightbor.position.y! == currentNode.position.y