How to resolve the algorithm Make directory path step by step in the Aime programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Make directory path step by step in the Aime programming language
Table of Contents
Problem Statement
Create a directory and any missing parents. This task is named after the posix mkdir -p command, and several libraries which implement the same behavior. Please implement a function of a single path string (for example ./path/to/dir) which has the above side-effect. If the directory already exists, return successfully. Ideally implementations will work equally well cross-platform (on windows, linux, and OS X). It's likely that your language implements such a function as part of its standard library. If so, please also show how such a function would be implemented.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Make directory path step by step in the Aime programming language
Source code in the aime programming language
void
mkdirp(text path)
{
list l;
text p, s;
file().b_affix(path).news(l, 0, 0, "/");
for (, s in l) {
p = p + s + "/";
trap_q(mkdir, p, 00755);
}
}
integer
main(void)
{
mkdirp("./path/to/dir");
0;
}
You may also check:How to resolve the algorithm Bitwise operations step by step in the FutureBasic programming language
You may also check:How to resolve the algorithm XML/XPath step by step in the PHP programming language
You may also check:How to resolve the algorithm Visualize a tree step by step in the REXX programming language
You may also check:How to resolve the algorithm Factorial step by step in the AArch64 Assembly programming language
You may also check:How to resolve the algorithm Remove lines from a file step by step in the Phix programming language