kabikaboo(1) [debian man page]

KABIKABOO(1)							   User Manuals 						      KABIKABOO(1)

NAME

       kabikaboo - recursive writing assistant

SYNOPSIS

       kabikaboo [FILE]...

DESCRIPTION

       kabikaboo  is  a  tree  branching  text	organizer. It is meant to be used to help aid in the writing of novels or other large documents. A
       recursive viewing feature allows one to see any section of the tree.

       You can see an overview of all the children or grandchildren of any given node in the tree, for reference. Each	text  node  can  have  any
       arrangement of children, and the nodes can be moved around freely. A tabbed notebook allows users to keep track of the most recently opened
       nodes, easing movement within a large tree.

       This tree-based note pad could be used for any purposes - not only for novels. It could be used to plan a  technical  manual,  todo  lists,
       anything  that  would  benefit from tree-based text organization. Kabikaboo is not meant to actually write a document - you should use Abi-
       Word/OpenOffice/LaTeX or some other editor for that purpose..

       Free and open source, created with Python, PyGTK, Geany, Glade.	SH OPTIONS No options available.

FILES

       ~/.kabikaboo/settings.txt
	      The user's saved settings file.  Includes last opened file, last directory, window size, viewing preferencs, and more.  It is  auto-
	      generated upon running.

BUGS

       If you find a bug, please run kabikaboo from command line, reproduce the bug, and report the output errors to:

       https://bugs.launchpad.net/kabikaboo

AUTHOR

       Dave Kerr <aidave@shaw.ca>

SEE ALSO

       abiword(1)

Linux								   JUNE 17 2009 						      KABIKABOO(1)

Blt_TreeCreateNode(3)					      BLT Library Procedures					     Blt_TreeCreateNode(3)

__________________________________________________________________________________________________________________________________________________

NAME

       Blt_TreeCreateNode - Creates a node in a tree data object.

SYNOPSIS

       #include <bltTree.h>

       Blt_TreeNode
       Blt_TreeCreateNode(tree, parent, name, position)

ARGUMENTS

       Blt_Tree       tree     (in)	 Tree containing the parent node.

       Blt_TreeNode   parent   (in)	 Node in which to insert the new child.

       const char     *name    (in)	 Node label.  If NULL, a label will automatically be generated.

       int	      position (in)	 Position in the parent's list of children to insert the new node.
_________________________________________________________________

DESCRIPTION

       This  procedure creates a new node is a tree data object.  The node is initially empty, but data values can be added with Blt_TreeSetValue.
       Each node has a serial number that identifies it within the tree.  No two nodes in the same tree will ever have the same ID.  You can  find
       a node's ID with Blt_TreeNodeId.

       The arguments are as follows:

       tree	 The tree containing the parent node.

       parent	 Node in which the new child will be inserted.

       name	 Label of the new node.  If name is NULL, a label in the form "node0", "node1", etc. will automatically be generated.  Name can be
		 any string.  Labels are non-unique.  A parent can contain two nodes with the same label. Nodes can be relabeled using Blt_TreeRe-
		 labelNode.

       position  Position  the parent's list of children to insert the new node.  For example, if position is 0, then the new node is prepended to
		 the beginning of the list.  If position is -1, then the node is appended onto the end of the parent's list.

RETURNS

       The new node returned is of type Blt_TreeNode.  It's a token that can be used with other routines to add/delete	data  values  or  children
       nodes.

EXAMPLE

       The following example creates a new node from the root node.

	      Blt_Tree token;
	      Blt_TreeNode root, node;

	      if (Blt_TreeGetToken(interp, "myTree", &token) != TCL_OK) {
		  return TCL_ERROR;
	      }
	      root = Blt_TreeRootNode(token);
	      node = Blt_TreeCreateNode(token, root, "myNode", -1);

NOTIFICATIONS

       Blt_TreeCreateNode  can	trigger  tree notify events.  You can be notified whenever a node is created by using the Blt_TreeCreateNotifyHan-
       dler.  A callback routine is registered that will be automatically invoked whenever a new node is added via Blt_TreeCreateNode to the tree.

KEYWORDS

       tree, token

BLT
									2.4						     Blt_TreeCreateNode(3)