12-18-2008
Tree directory structure of Unix to get final node path
Hi,
I want to list all the last directories from mentioned base path.
for eg: If i have a base path say /base/base1/
How can i get the path till last node in tree like directory structure of unix by applying any command.
so that i will get following output.
/base/base1/base2/final1/final2/last
/base/base1/base2/final1/final3/last
/base/base1/base2/final1/last
/base/base1/base2/final1/final4/last
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Does anyone know of a good Internet source that explains the directory structure of Unix/Linux??
Thanks
Gregg (2 Replies)
Discussion started by: gdboling
2 Replies
2. UNIX for Advanced & Expert Users
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... (4 Replies)
Discussion started by: srmadab
4 Replies
3. Solaris
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... (3 Replies)
Discussion started by: friendanoop
3 Replies
4. HP-UX
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... (2 Replies)
Discussion started by: friendanoop
2 Replies
5. Shell Programming and Scripting
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
... (2 Replies)
Discussion started by: ThobiasVakayil
2 Replies
6. UNIX for Dummies Questions & Answers
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... (0 Replies)
Discussion started by: MissI
0 Replies
7. UNIX for Dummies Questions & Answers
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: (1 Reply)
Discussion started by: GreginNC
1 Replies
8. Shell Programming and Scripting
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... (1 Reply)
Discussion started by: naw_deepak
1 Replies
9. Shell Programming and Scripting
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... (1 Reply)
Discussion started by: rohit22hamirpur
1 Replies
10. Shell Programming and Scripting
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... (1 Reply)
Discussion started by: ponmuthu
1 Replies
LEARN ABOUT DEBIAN
recover
RECOVER(6) Games Manual RECOVER(6)
NAME
recover - recover a NetHack game interrupted by disaster
SYNOPSIS
recover [ -d directory ] base1 base2 ...
DESCRIPTION
Occasionally, a NetHack game will be interrupted by disaster when the game or the system crashes. Prior to NetHack v3.1, these games were
lost because various information like the player's inventory was kept only in memory. Now, all pertinent information can be written out to
disk, so such games can be recovered at the point of the last level change.
The base options tell recover which files to process. Each base option specifies recovery of a separate game.
The -d option, which must be the first argument if it appears, supplies a directory which is the NetHack playground. It overrides the
value from NETHACKDIR, HACKDIR, or the directory specified by the game administrator during compilation (usually /usr/games/lib/nethack-
dir).
For recovery to be possible, nethack must have been compiled with the INSURANCE option, and the run-time option checkpoint must also have
been on. NetHack normally writes out files for levels as the player leaves them, so they will be ready for return visits. When check-
pointing, NetHack also writes out the level entered and the current game state on every level change. This naturally slows level changes
down somewhat.
The level file names are of the form base.nn, where nn is an internal bookkeeping number for the level. The file base.0 is used for game
identity, locking, and, when checkpointing, for the game state. Various OSes use different strategies for constructing the base name.
Microcomputers use the character name, possibly truncated and modified to be a legal filename on that system. Multi-user systems use the
(modified) character name prefixed by a user number to avoid conflicts, or "xlock" if the number of concurrent players is being limited.
It may be necessary to look in the playground to find the correct base name of the interrupted game. recover will transform these level
files into a save file of the same name as nethack would have used.
Since recover must be able to read and delete files from the playground and create files in the save directory, it has interesting interac-
tions with game security. Giving ordinary players access to recover through setuid or setgid is tantamount to leaving the playground
world-writable, with respect to both cheating and messing up other players. For a single-user system, this of course does not change any-
thing, so some of the microcomputer ports install recover by default.
For a multi-user system, the game administrator may want to arrange for all .0 files in the playground to be fed to recover when the host
machine boots, and handle game crashes individually. If the user population is sufficiently trustworthy, recover can be installed with the
same permissions the nethack executable has. In either case, recover is easily compiled from the distribution utility directory.
NOTES
Like nethack itself, recover will overwrite existing savefiles of the same name. Savefiles created by recover are uncompressed; they may
be compressed afterwards if desired, but even a compression-using nethack will find them in the uncompressed form.
SEE ALSO
nethack(6)
BUGS
recover makes no attempt to find out if a base name specifies a game in progress. If multiple machines share a playground, this would be
impossible to determine.
recover should be taught to use the nethack playground locking mechanism to avoid conflicts.
4th Berkeley Distribution 9 January 1993 RECOVER(6)