How to resolve the algorithm Walk a directory/Non-recursively step by step in the TUSCRIPT programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Walk a directory/Non-recursively step by step in the TUSCRIPT programming language
Table of Contents
Problem Statement
Walk a given directory and print the names of files matching a given pattern.
(How is "pattern" defined? substring match? DOS pattern? BASH pattern? ZSH pattern? Perl regular expression?)
Note: This task is for non-recursive methods. These tasks should read a single directory, not an entire directory tree.
Note: Please be careful when running any code presented here.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Walk a directory/Non-recursively step by step in the TUSCRIPT programming language
Source code in the tuscript programming language
$$ MODE TUSCRIPT
files=FILE_NAMES (+,-std-)
fileswtxt= FILTER_INDEX (files,":*.txt:",-)
txtfiles= SELECT (files,#fileswtxt)
You may also check:How to resolve the algorithm Best shuffle step by step in the jq programming language
You may also check:How to resolve the algorithm Sorting algorithms/Shell sort step by step in the Go programming language
You may also check:How to resolve the algorithm Collections step by step in the EchoLisp programming language
You may also check:How to resolve the algorithm Nth root step by step in the ALGOL 68 programming language
You may also check:How to resolve the algorithm Barnsley fern step by step in the zkl programming language