Get a Numeric Permissions List for a Directory Tree???
Greetings!
Being a curious sort, I'm trying to get a numerical representation of a directory tree's permissions; in similar manner to the commonly-called ls -l command.
On that note, here's what cobbled out through the "digital interface" this afternoon:
Now, this is great for as far as it goes; recursing through whatever directory I point it at, pushing out all permissions to the console for the entire tree.
BUT, of course, there are no directory or file names associated with each of the linefed output; and I'm not quite sure what to shoehorn into this "one liner" to provide a line-by-line directory listing (similar in format to what's available via md5sum) as a finish.
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::redblack
RedBlack(3pm) User Contributed Perl Documentation RedBlack(3pm)NAME
Tree::RedBlack - Perl implementation of Red/Black tree, a type of balanced tree.
SYNOPSIS
use Tree::RedBlack;
my $t = new Tree::RedBlack;
$t->insert(3, 'cat');
$t->insert(4, 'dog');
my $v = $t->find(4);
my $min = $t->min;
my $max = $t->max;
$t->delete(3);
$t->print;
DESCRIPTION
This is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly
known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to
a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time.
A Tree::RedBlack object supports the following methods:
new ()
Creates a new RedBlack tree object.
root ()
Returns the root node of the tree. Note that this will either be undef if no nodes have been added to the tree, or a
Tree::RedBlack::Node object. See the Tree::RedBlack::Node manual page for details on the Node object.
cmp (&)
Use this method to set a comparator subroutine. The tree defaults to lexical comparisons. This subroutine should be just like a
comparator subroutine to sort, except that it doesn't do the $a, $b trick; the two elements to compare will just be the first two items
on the stack.
insert ($;$)
Adds a new node to the tree. The first argument is the key of the node, the second is its value. If a node with that key already
exists, its value is replaced with the given value and the old value is returned. Otherwise, undef is returned.
delete ($)
The argument should be either a node object to delete or the key of a node object to delete. WARNING!!! THIS STILL HAS BUGS!!!
find ($)
Searches the tree to find the node with the given key. Returns the value of that node, or undef if a node with that key isn't found.
Note, in particular, that you can't tell the difference between finding a node with value undef and not finding a node at all. If you
want to determine if a node with a given key exists, use the node method, below.
node ($)
Searches the tree to find the node with the given key. Returns that node object if it is found, undef otherwise. The node object is a
Tree::RedBlack::Node object.
min ()
Returns the node with the minimal key.
max ()
Returns the node with the maximal key.
AUTHOR
Benjamin Holzman <bholzman@earthlink.net>
SEE ALSO
Tree::RedBlack::Node
perl v5.10.0 2008-07-31 RedBlack(3pm)