Getting it right is another matter entirely. Getting software right is hard.
Have you worked on a project that required reading tons of code? - Many people would have, unless it's a very early stage project, or your personal project. Often times, we're forced to read a huge code base. You must have a huge task trackers and almost endless backlogs. There's not enough architecture / design mindset, from my experience.
The previous chapter explained what refactoring is. This chapter is about some of the principles.
It's a class file.
class Instrumenter
code, filename, and inputSourceMap. It creates babelOpts and generate sourcemap and AST with @babel/core#transformSync. The babelOpts is using their own plugin programVisitor. readInitialCoverage is used against the AST generated.
| // https://www.geeksforgeeks.org/rat-in-a-maze-backtracking-2/ | |
| // Rat in a maze | |
| // https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1 | |
| function printSolution(grid) { | |
| console.log(grid.map((row) => row.join(' | ')).join('\n') + '\n'); | |
| } | |
| function isSafe(maze, x, y) { | |
| const length = maze.length; |
| // https://www.geeksforgeeks.org/maximum-sum-increasing-subsequence-dp-14/ | |
| // https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence/0 | |
| function maxSumIncreasingSubsequence(arr) { | |
| const len = arr.length; | |
| let idx; | |
| let idx2; | |
| let resSum = [...arr]; | |
| // Loop through all members | |
| for (idx = 1; idx < len; idx++) { |
| // https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/ | |
| // https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0 | |
| /** | |
| * Optimal Substructure: | |
| * Let arr[0..n-1] be the input array and L(i) be the length of the LIS ending | |
| * at index i such that arr[i] is the last element of the LIS. | |
| * Then, L(i) can be recursively written as: | |
| * L(i) = 1 + max( L(j) ) where 0 < j < i and arr[j] < arr[i]; or | |
| * L(i) = 1, if no such j exists. |