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)
In DOS, to get the complete directory structure, we use 'TREE' command..
can anyone tell me what is the equivalent command in Unix
I am using
SunOS ABC 5.8 Generic_117350-18 sun4u sparc SUNW,Sun-Fire-V240
thanks.. (1 Reply)
I need to create a binary tree like structure of directories using shell script... does anyone know of any algorithm for this ?
i tried doing a recursive algorithm
function CreateDir
{
level=$1
dirname=$2
mkdir $dirname/sub1/
mkdir $dirname/sub2/
let level=level-1
... (2 Replies)
Hello !
I am trying to find out if a simple command could build me a tree containing all the subdirectories for a specific directory.
I have a tree like /home/user/blabla..../mytree with a lot of symbolic links. It is quite tricky to find out where my data are 'logically' stored.
... (5 Replies)
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)
How can i install tree command in ubundu without root ? I have found some shell script which does the same job as tree but i would like to get all the options in tree command
thanks (2 Replies)
I have just been researching this topic and I was wondering what type of application might a binary tree be used for. For instance what type of application would be a good showcase for a binary tree that I could write as an example? (5 Replies)
Hi,
I am having an xml file which looks like this:
<Nodes>
<Node>
<Nodename>Student</Nodename>
<Filename>1.txt</filename>
<Node>
<Nodename>Dummy</Nodename>
<Filename>22.txt</filename>
</Node>
</Node>
</Nodes>
The text files will have data like this:
#1.txt... (8 Replies)
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
LEARN ABOUT DEBIAN
blt_treecreate
Blt_TreeCreate(3) BLT Library Procedures Blt_TreeCreate(3)__________________________________________________________________________________________________________________________________________________NAME
Blt_TreeCreate - Create tree data object.
SYNOPSIS
#include <bltTree.h>
int
Blt_TreeCreate(interp, name, tokenPtr)
ARGUMENTS
Tcl_Interp *interp (in) Interpreter to report results back to.
const char *name (in) Name of the new tree. Can be qualified by a namespace.
Blt_Tree *tokenPtr (out) If not NULL, points to location to store the client tree token.
_________________________________________________________________DESCRIPTION
This procedure creates a C-based tree data object and optionally returns a token to it. The arguments are as follows:
interp Interpreter to report results back to. If an error occurs, then interp->result will contain an error message.
name Name of the new tree object. You can think of name as the memory address of the object. It's a unique name that identifies the
tree object. No tree object name can already exist. Name can be qualified by a namespace such as fred::myTree. If no namespace
qualifier is used, the tree will be created in the current namespace, not the global namespace. If a qualifier is present, the
namespace must already exist.
tokenPtr Holds the returned token. TokenPtr points to a location where it is stored. Tree tokens are used to work with the tree object.
If NULL, no token is allocated. You can later use Tcl_TreeGetToken to obtain a token.
The new tree data object created will initially contain only a root node. You can add new nodes with Blt_TreeCreateNode.
Optionally a token for the tree data object is returned. Tree data objects can be shared. For example, the tree and hiertable commands
may be accessing the same tree data object. Each client grabs a token that is associated with the tree. When all tokens are released (see
Blt_TreeReleaseToken) the tree data object is automatically destroyed.
RETURNS
A standard Tcl result is returned. If TCL_ERROR is returned, then interp->result will contain an error message. The following errors may
occur:
o There already exists a tree by the same name as name. You can use Tcl_TreeExists to determine if a tree exists beforehand.
o The tree name is prefixed by a namespace that doesn't exist. If you qualified the tree name with a namespace, the namespace must exist.
Unlike Tcl procs and variables, the namespace is not automatically created for you.
o Memory can't be allocated for the tree or token.
EXAMPLE
The following example creates a new
Blt_Tree token;
if (Blt_TreeCreate(interp, "myTree", &token) != TCL_OK) {
return TCL_ERROR;
}
printf("tree is %s
", Blt_TreeName(token));
KEYWORDS
Tcl_TreeGetToken, Tcl_TreeExists, Tcl_TreeReleaseToken
BLT 2.4 Blt_TreeCreate(3)