Tree directory structure of Unix to get final node path

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Shell output with plot a tree structure.

Hi All, i am in need of plotting graph ( tree structure ) depends upon my shell script output. For this requirement, what kind of open source avail in market. For example: (my script output will be like below ) Parent:A process-name:child-processes A:B,C B: D expecting...

2. Shell Programming and Scripting

How we can create the master file through shell to show the tree structure of the directory?

Can we create the master file that show the whole tree structure of the directory till a particular folder? Database that contains four sub repository Sybase,sql,oracle,mysql and sql and oracle contains two subrepostories Siebel and plsql and each repositories contains three folders...

3. Shell Programming and Scripting

help need while creating tree structure

Hi Experts, I have table in mysql like below: 'user` ( `user_id` int(11) NOT NULL AUTO_INCREMENT, `parent_id` varchar(100) NOT NULL, `member_name` varchar(100) NOT NULL, `city` varchar(100) NOT NULL, `member_id` varchar(100) NOT NULL, `password` varchar(100) NOT...

4. UNIX for Dummies Questions & Answers

Commands to create hierarchical tree structure

I am creating a hierarchical tree structure and I was wondering what commands I needed to do that. I have 4 directories and sixteen sub directories and 4 files. Thank you for your help in getting my started in right direction.:confused:

5. UNIX for Dummies Questions & Answers

Find a tree structure in software modules

I have a list of software funtions in tcl code. Some of these functions call other functions. I want to build a tree structure of all called functions. Right now I list all the functions into a file then read this file so that I can cat each function and grep for EXECUTE (command that calls...

6. Shell Programming and Scripting

tree structure of the data

Hello, I have a file of the following information ( first field parent item, second field child item) PM01 PM02 PM01 PM1A PM02 PM03 PM03 PM04 PM03 PM05 PM03 PM06 PM05 PM10 PM1A PM2A PM2A PM3B PM2A PM3C The output should be like this : PM01 PM02 PM03 PM04 ...

7. HP-UX

Not able to copy the tree node text in HP UX, while easily done in window

I m not able to copy the text present on the tree's node to terminal or other text editor in solaris. I m using <Shift><control> C and V comaand for the same but the text is not being copied and pasted on the text pad or the terminal window. While the same is possible in windows OS using ctrl+c...

8. Solaris

Not able to copy the tree node text in solaris, while easily done in window

9. UNIX for Advanced & Expert Users

MV files from one directory structure(multiple level) to other directory structure

Hi, I am trying to write a script that will move all the files from source directory structure(multiple levels might exist) to destination directory structure. If a sub folder is source doesnot exist in destination then I have to skip and goto next level. I also need to delete the files in...

10. UNIX for Dummies Questions & Answers

Unix/Linux Directory Structure

Does anyone know of a good Internet source that explains the directory structure of Unix/Linux?? Thanks Gregg

LEARN ABOUT DEBIAN

pod::abstract::tree

Pod::Abstract::Tree(3pm)				User Contributed Perl Documentation				  Pod::Abstract::Tree(3pm)

NAME

       Pod::Abstract::Tree - Manage a level of Pod document tree Nodes.

DESCRIPTION

       Pod::Abstract::Tree keeps track of a set of Pod::Abstract::Node elements, and allows manipulation of that list of elements. Elements are
       stored in an ordered set - a single node can appear once only in a single document tree, so inserting a node at a point will also remove it
       from it's previous location.

       This is an internal class to Pod::Abstract::Node, and should not generally be used externally.

METHODS

   detach
	$tree->detach($node);

       Unparent the $node from $tree. All other elements will be shifted to fill the empty spot.

   push
       Add an element to the end of the node list.

   pop
       Remove an element from the end of the node list.

   insert_before
	$tree->insert_before($target,$node);

       Insert $node before $target. Both must be children of $tree

   insert_after
	$tree->insert_after($target,$node);

       Insert $node after $target. Both must be children of $tree

   unshift
       Remove the first node from the node list and return it.

       Unshift takes linear time - it has to relocate every other element in id_map so that they stay in line.

   children
       Returns the in-order node list.

   index_relative
	my $node = $tree->index_relative($target, $offset);

       This method will return a node at an offset of $offset (which may be negative) from this tree structure. If there is no such node, undef
       will be returned. For example, an offset of 1 will give the following element of $node.

AUTHOR

       Ben Lilburne <bnej@mac.com>

COPYRIGHT AND LICENSE

       Copyright (C) 2009 Ben Lilburne

       This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

perl v5.10.1							    2010-01-03						  Pod::Abstract::Tree(3pm)

UNIX for Dummies Questions & Answers