const path = require('path');

const fs = require('fs');

let URL_BASE = "https://github.com/TheAlgorithms/Javascript/blob/master";

let g_output = [];

let filepaths = [];

function good_filepaths(top_dir = ".") {

fs.readdir(top_dir, function(err, list) {

if (err) {

console.log(err);

return;

}

list.forEach(function(file) {

let path = top_dir + "/" + file;

if (!file.startsWith(".")) {

fs.stat(path, function(err, stat) {

if (stat && stat.isDirectory()) {

good_filepaths(path);

} else {

if (file.toLowerCase().endsWith(".js")) {

filepaths.push(path.slice(2));

}

}

});

}

});

})

function md_prefix(i) {

if (i) {

let res = ' '.repeat(i);

return res + "*";

} else {

return "\n##"

}

function print_path(old_path, new_path) {

let old_parts = old_path.split(path.sep);

let new_parts = new_path.split(path.sep);

for (let i = 0; i < new_parts.length; ++i) {

let new_part = new_parts[i];

if (i + 1 > old_parts.len || old_parts[i] != new_part) {

if (new_part) {

g_output.push(`${md_prefix(i)} ${new_part.replace('_', ' ')}`);

}

}

}

return new_path;

function build_directory_md(top_dir = ".") {

old_path = "";

filepaths.sort(function(a, b) {

if (a.toLowerCase() < b.toLowerCase()) return -1;

if (a.toLowerCase() > b.toLowerCase()) return 1;

return 0;

});

for (let filepath of filepaths) {

file = filepath.split(path.sep);

if (file.length == 1) {

filepath = "";

filename = file[0];

} else {

let total = file.length;

filename = file[total - 1];

filepath = file.splice(0, total - 1).join(path.sep);

}

if (filepath != old_path) {

old_path = print_path(old_path, filepath);

}

let indent = 0;

for (let i = 0; i < filepath.length; ++i) {

if (filepath[i] == path.sep) {

++indent;

}

}

if (filepath) {

++indent;

}

let urls = [URL_BASE, filepath, filename];

let url = urls.join("/").replace(" ", "%20");

// remove extension from filename

filename = filename.split(".")[0];

g_output.push(`${md_prefix(indent)} [${filename}](${url})`);

}

g_output = g_output.join('\n');

return g_output;

setTimeout(() => {

// once the filepaths have been computed

build_directory_md();

// console.log(filepaths);

}, 1000);

setTimeout(() => {

// once the g_output has been constructed, write to the file

fs.writeFile('DIRECTORY.md', g_output + '\n', (err) => {

if (err) {

console.log(err);

}

})

// console.log(g_output);

}, 1000);

name: Node CI

on: [push, pull_request]

jobs:

build:

runs-on: ubuntu-latest

strategy:

matrix:

node-version: [14.x]

steps:

- uses: actions/checkout@v2

- name: Use Node.js ${{ matrix.node-version }}

uses: actions/setup-node@v1

with:

node-version: ${{ matrix.node-version }}

- name: npm install, build, and test

run: |

env:

CI: true

name: update_directory_md

on: [push]

jobs:

update_directory_md:

runs-on: ubuntu-latest

steps:

- uses: actions/checkout@master

- uses: actions/setup-node@v1

- run: |

Welcome to [TheAlgorithms/Javascript](https://github.com/TheAlgorithms/Javascript)! Before sending your pull requests, make sure that you **read the whole guidelines**. If you have any doubt on the contributing guide, please feel free to [state it clearly in an issue](https://github.com/TheAlgorithms/Javascript/issues/new)

We are very happy that you consider implementing algorithms and data structures for others! This repository is referenced and used by learners from around the globe. Being one of our contributors, you agree and confirm that:

- You did your work - plagiarism is not allowed.

- Any plagiarized work will not be merged.

- Your work will be distributed under [GNU License](LICENSE) once your pull request is merged

- Your submitted work must fulfill our styles and standards

**New implementation** is welcome! For example, new solutions to a problem, different representations of a graph data structure or algorithm designs with different complexity.

**Improving comments** and **writing proper tests** are also highly welcome.

We appreciate any contribution, from fixing grammar mistakes to implementing complex algorithms. Please read this section if you are contributing to your work.

If you submit a pull request that resolves an open issue, please help us to keep our issue list small by adding `fixes: #{$ISSUE_NO}` to your commit message. GitHub will use this tag to auto-close the issue if your PR is merged.

An Algorithm is one or more functions (or classes) that:

* take one or more inputs,

* perform some internal calculations or data manipulations,

* return one or more outputs,

* have minimal side effects.

Algorithms should be packaged in a way that would make it easy for readers to put them into larger programs.

Algorithms should:

* have intuitive class and function names that make their purpose clear to readers

* use JavaScript naming conventions and intuitive variable names to ease comprehension

* be flexible to take different input values

* raise JavaScript exceptions (RangeError, etc.) on erroneous input values

Algorithms in this repo should not be how-to examples for existing JavaScript packages. Instead, they should perform internal calculations or manipulations to convert input values into different output values. Those calculations or manipulations can use data types, classes, or functions of existing JavaScript packages but each algorithm in this repo should add unique value.

- filenames should use the UpperCamelCase (PascalCase) style.

- There should be no spaces in filenames.

**Example:**`UserProfile.js` is allowed but `userprofile.js`,`Userprofile.js`,`user-Profile.js`,`userProfile.js` are not

To maximize the readability and correctness of our code, we require that new submissions follow [JavaScript Standard Style](https://standardjs.com/)

- Command to install JavaScript Standard Style

```