02-05-2019
Just do find -type f and you'll know that every top-level name you find is a file and everything beneath must be a folder, i.e. /path/to/filename
These 2 Users Gave Thanks to Corona688 For This Post:
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hi all,
i'm looking for a bash or tcsh script that will clone an empty dir tree 'over' another tree ...
specifically, i'd like to:
(1) specify a src directory
(2) list the directory tree/hiearchy beneath that src dir, w/o files -- just the dirs
(3) clone that same, empty dir hierarchy to... (2 Replies)
Discussion started by: OpenMacNews
2 Replies
2. UNIX for Dummies Questions & Answers
I have to read a complete folder and if it is a file older that 7 days I have to copy it elsewhere and if it is a folder nothing to make.
The way I do it:
for I in `find /home/. -name "*" -mtime +7`
do
cp -Rf $I /home/elsewhere/.
done
Am I okay with the way I want to do it?
Help... (3 Replies)
Discussion started by: denysQC
3 Replies
3. UNIX for Dummies Questions & Answers
Assume, I created one file three years back and I like to move the file to some other directory with the old date (Creation date)? Is it possible? Explain? (1 Reply)
Discussion started by: jee.ku2
1 Replies
4. UNIX for Dummies Questions & Answers
Hi all,
if I have a dir with a mixture of files and directories in it and one of the directories *only* has read permission for the owner and I am not the owner - will I see it with an 'ls -la'.
I do not have access to a unix box at present to try this out.
Any thoughts gratefully received (1 Reply)
Discussion started by: ajcannon
1 Replies
5. Shell Programming and Scripting
This might just be one command.
Any1 having the solution?
Thanks,
Rahul. (25 Replies)
Discussion started by: rahulrathod
25 Replies
6. Shell Programming and Scripting
Hello!!
I have directories from 2008, with files in them. I want to create a script that will find the directoried from 2008 (example directory:
drwxr-xr-x 2 isplan users 1024 Nov 21 2008 FILES_112108), delete the files within those directories and then delete the directories... (3 Replies)
Discussion started by: bigben1220
3 Replies
7. Shell Programming and Scripting
Just i want to ask How to search and display name of zero byte file
I have used find command but it is showing complete file path
Thanks
find . -size 0
giving me zero byte file with location
1)/home/user/a (4 Replies)
Discussion started by: vivek1489
4 Replies
8. UNIX for Advanced & Expert Users
Hi there, finally i'm installed Sco Foxbase 2.1.2d over my Sco Open Server 5.0.7v server.
Well at this point almost is working fine, but, when i Run mi application i receive the next error:
"sh: the_name_of_file": does not exist".
I checked it over the Hard Disk and the file exist, the... (1 Reply)
Discussion started by: danilosevilla
1 Replies
9. Shell Programming and Scripting
Dear Members,
I have a list of xml files like
abc.xml.table
prq.xml.table
...
..
.
in a txt file.
Now I have to search the file(s) in all directories and sub-directories and print the full path of file in a output txt file.
Please help me with the script or command to do so.
... (11 Replies)
Discussion started by: Yoodit
11 Replies
10. UNIX for Beginners Questions & Answers
Hi all,
At the moment, I am doing the following to exclude some exception strings. The more I need to exclude, the longer the string becomes and it has become error prone as I edit the list manually.
$ cat output.txt
host=192.168.1.99 user=mickey
host=192.168.1.99 user=mickey... (4 Replies)
Discussion started by: newbie_01
4 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::fromnestedhash
Tree::Simple::Visitor::FromNestedHash(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::FromNestedHash(3pm)
NAME
Tree::Simple::Visitor::FromNestedHash - A Visitor for creating Tree::Simple objects from nested hash trees.
SYNOPSIS
use Tree::Simple::Visitor::FromNestedHash;
my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
# given this nested hash tree
my $hash_tree = {
Root => {
Child1 => {
GrandChild1 => {},
GrandChild2 => {}
},
Child2 => {}
}
};
# set the array tree we
# are going to convert
$visitor->setHashTree($hash_tree);
$tree->accept($visitor);
# this then creates the equivalent Tree::Simple object:
# Tree::Simple->new("Root")
# ->addChildren(
# Tree::Simple->new("Child1")
# ->addChildren(
# Tree::Simple->new("GrandChild1"),
# Tree::Simple->new("GrandChild2")
# ),
# Tree::Simple->new("Child2"),
# );
DESCRIPTION
Given a tree constructed from nested hashs, this Visitor will create the equivalent Tree::Simple heirarchy.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" methods to customize
its behavior.
setNodeFilter ($filter_function)
This method accepts a CODE reference as its $filter_function argument and throws an exception if it is not a code reference. This code
reference is used to filter the tree nodes as they are created, the $filter_function is passed the node value extracted from the hash
prior to it being inserted into the tree being built. The $filter_function is expected to return the value desired for inclusion into
the tree.
setHashTree ($hash_tree)
This method is used to set the $hash_tree that our Tree::Simple heirarchy will be constructed from. It must be in the following form:
{
Root => {
Child1 => {
GrandChild1 => {},
GrandChild2 => {}
},
Child2 => {}
}
}
Basically each key in the hash is considered a node, values are ignored unless it is a hash reference with at least one key in it, in
which case it is interpreted as containing the children of the node created from the key.
The tree is validated prior being accepted, if it fails validation an execption will be thrown. The rules are as follows;
The hash tree must not be empty.
It makes not sense to create a tree out of nothing, so it is assumed that this is a sign of something wrong.
The hash tree must be a single rooted tree.
The hash tree should have only one key in it's first level, if it has more than one, then it is not a single rooted tree.
NOTE: Hash keys are sorted ascii-betically before being added to the tree, this results in a somewhat more predictable hierarchy.
visit ($tree)
This is the method that is used by Tree::Simple's "accept" method. It can also be used on its own, it requires the $tree argument to be
a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
BUGS
None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
CODE COVERAGE
See the CODE COVERAGE section in Tree::Simple::VisitorFactory for more inforamtion.
SEE ALSO
These Visitor classes are all subclasses of Tree::Simple::Visitor, which can be found in the Tree::Simple module, you should refer to that
module for more information.
AUTHOR
stevan little, <stevan@iinteractive.com>
COPYRIGHT AND LICENSE
Copyright 2004, 2005 by Infinity Interactive, Inc.
<http://www.iinteractive.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2005-07-14 Tree::Simple::Visitor::FromNestedHash(3pm)