Blt_TreeExists(3) BLT Library Procedures Blt_TreeExists(3)__________________________________________________________________________________________________________________________________________________NAME
Blt_TreeExists - Indicates if a tree exists.
SYNOPSIS
#include <bltTree.h>
int
Blt_TreeExists(interp, name)
ARGUMENTS
Tcl_Interp *interp (in) Interpreter to determine current namespace context.
const char *name (in) Name of an existing tree data object. Can be qualified by a namespace.
_________________________________________________________________DESCRIPTION
This procedure determines if a C-based tree data object exists by a given name. The arguments are as follows:
interp Used the determine the current namespace context.
name Name of an existing tree data object. Name can be qualified by a namespace such as fred::myTree. If no namespace qualifier is
used, the current namespace is searched, then the global namespace.
RETURNS
A boolean result is returned. If the tree exists 1 is returned, 0 otherwise.
EXAMPLE
The following example checks if a tree "myTree" exists.
if (!Blt_TreeExists(interp, "myTree")) {
fprintf(stderr, "can't find tree "myTree\n");
}
KEYWORDS
tree, token Tcl_TreeCreate, Tcl_TreeGetToken, Tcl_TreeReleaseToken
BLT 2.4 Blt_TreeExists(3)
Check Out this Related Man Page
Blt_TreeDeleteNode(3) BLT Library Procedures Blt_TreeDeleteNode(3)__________________________________________________________________________________________________________________________________________________NAME
Blt_TreeDeleteNode - Deletes a node and its descendants.
SYNOPSIS
#include <bltTree.h>
Blt_TreeNode
Blt_TreeDeleteNode(tree, node)
ARGUMENTS
Blt_Tree tree (in) Tree containing the node.
Blt_TreeNode node (in) Node to be deleted.
_________________________________________________________________DESCRIPTION
This procedure deletes a given node and all it descendants from a tree data object.
The arguments are as follows:
tree The tree containing the parent node.
node Node to be deleted. The node and its descendant nodes are deleted. Each node's data values are deleted also. The reference
count of the Tcl_Obj is decremented.
Since all tree objects must contain at least a root node, the root node itself can't be deleted unless the tree is released and destroyed.
Therefore you can clear a tree by deleting its root, but the root node will remain until the tree is destroyed.
RETURNS
Always returns TCL_OK. Errors generated in a notification callbacks are backgrounded (see Tcl_TreeCreateNotifyHandler).
EXAMPLE
The following example deletes the root node.
Blt_TreeNode root;
root = Blt_TreeRootNode(token);
Blt_TreeDeleteNode(token, root);
NOTIFICATIONS
Blt_TreeDeleteNode can trigger tree notify events. You can be notified whenever a node is deleted by using the Blt_TreeCreateNotifyHan-
dler. A callback routine is registered that will be automatically invoked whenever a node is deleted via Blt_TreeDeleteNode to the tree.
KEYWORDS
tree, token
BLT 2.4 Blt_TreeDeleteNode(3)
How can I make a process tree?
The tree must have X rows and each process must have Y sons.
All the processes must comunicate with their fathers.
Can anyone help me with that? (1 Reply)
hello
is there a family tree, or words that would illustrate the family tree of,
Unix -> Linux
As i would understand Unix, it is a OS.
And Linux is a ?, is Linux a OS or a sub structure inside of the Unix OS ?.
Have you ever seen one of those family tree`s where ma and pa are shown at... (3 Replies)
I want to use tree to display the directory tree. It is easy to use
tree -d -L 2
However I would like to run it on specific list of directories. Can such a thing be performed?
Example:
/media/academic-repo/chrisd/literature
tree -d prose -L 2
prose
├── computer-technology... (1 Reply)