Hi all,
I've got a problem, what function do i use to list the contents of all the directory tree (simular to "find")? Any other suggestions?
Thank you all (3 Replies)
Can someone tell me how I can determine how much space (blocks) have been used by a given directory tree?
I periodically need to know how much space is consumed by a directory and all of its files and subdirectories and their files in either KB or blocks. I have tried df and du but these do not... (1 Reply)
Hello,
When I do a "ls -l" I can see my directories have
drwxr-xr-xr. I am more used to the chmod numerical syntax like 755. Is there an easy way to list out the numerical permissions rather than rwx etc. (1 Reply)
hi i have modified a program to display directory entries recursively in a tree like form
i need an output with the following guidelines:
the prog displays the contents of the directory
the directory contents are sorted before printing so that directories come before regular files
if an entry... (2 Replies)
All,
I am new to Unix scripting ans was looking for some guidance.
I basically have to:
1. Check if a directory exists - if not create it
2. Check the permissions of the dir - if Wrong change
loop this.
Sort of creating a directory tree.
Thanks. (2 Replies)
Hi all,
The following is a script for displaying directory tree.
D=${1:-`pwd`}
(cd $D; pwd)
find $D -type d -print | sort |
sed -e "s,^$D,,"\
-e "/^$/d"\
-e "s,*/\(*\)$,\:-----\1,"\
-e "s,*/,: ,g" | more
exit 0
I am trying to understand the above script.But... (3 Replies)
Is this possible? Let me know If I need specify further on what I am trying to do- I just want to spare you the boring details of my personal file management.
Thanks in advance-
Brian- (2 Replies)
Hi all,
I'd like to create a directory tree, and define from stdin how many levels deep and how many directories in each level should be created.
What I wrote does not work properly:#!/bin/bash
#set -x
read -p " What root directory? " rootDir
&& { /bin/rm -R $rootDir; mkdir $rootDir; } ||... (2 Replies)
find . -type d -print 2>/dev/null|awk '!/\.$/ {for (i=1;i<NF;i++){d=length($i);if ( d < 5 && i != 1 )d=5;printf("%"d"s","|")}print "---"$NF}' FS='/'
Can someone explain how this works..??
How can i add directory size to be listed in the above command's output..?? (1 Reply)
Hi friends,
Hello again :)
i got stuck in problem. Is there any way to get a special directory from directory tree?
Here is my problm.." Suppose i have one fix directory structure "/abc/xyz/pqr/"(this will be fix).Under this directory structure i have some other directory and... (6 Replies)
Discussion started by: harpal singh
6 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::postordertraversal
Tree::Simple::Visitor::PostOrderTraversal(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::PostOrderTraversal(3pm)NAME
Tree::Simple::Visitor::PostOrderTraversal - A Visitor for post-order traversal a Tree::Simple hierarchy
SYNOPSIS
use Tree::Simple::Visitor::PostOrderTraversal;
# create an visitor
my $visitor = Tree::Simple::Visitor::PostOrderTraversal->new();
# pass our visitor to the tree
$tree->accept($visitor);
# print our results
print join ", " => $visitor->getResults();
# this will print this:
# 1.1.1 1.1 1.2 1 2.1 2 3.1 3
# assuming your tree is like this:
# 1
# 1.1
# 1.1.1
# 1.2
# 2
# 2.1
# 3
# 3.1
DESCRIPTION
Post-order traversal is a variation of the depth-first traversal in which the sub-tree's are processed before the parent. It is another
alternative to Tree::Simple's "traverse" method which implements a depth-first, pre-order traversal.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" method to customize
its behavior.
includeTrunk ($boolean)
Based upon the value of $boolean, this will tell the visitor to include the trunk of the tree in the traversal as well.
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 collected. This can be used to customize output, or to gather specific
information from a more complex tree node. The filter function should accept a single argument, which is the current Tree::Simple
object.
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.
getResults
This method returns the accumulated results of the application of the node filter to the tree.
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::PostOrderTraversal(3pm)