Searched refs:tree (Results 1 - 25 of 703) sorted by relevance

1234567891011>>

/macosx-10.10/libarchive-30/libarchive/examples/minitar/
H A Dtree.h47 struct tree;
49 struct tree *tree_open(const char *);
51 int tree_next(struct tree *);
53 int tree_current_depth(struct tree *);
57 * Because tree does use chdir extensively, the access path is
60 const char *tree_current_path(struct tree *);
61 size_t tree_current_pathlen(struct tree *);
62 const char *tree_current_access_path(struct tree *);
65 * Since the tree package needs to do some of this anyway,
68 const struct stat *tree_current_stat(struct tree *);
[all...]
/macosx-10.10/libarchive-30/libarchive/contrib/shar/
H A Dtree.h49 struct tree;
51 /* Initiate/terminate a tree traversal. */
52 struct tree *tree_open(const char * /* pathname */);
53 void tree_close(struct tree *);
71 int tree_next(struct tree *);
73 int tree_errno(struct tree *);
82 void tree_descend(struct tree *);
88 int tree_current_depth(struct tree *);
92 * Because tree does use chdir extensively, the access path is
95 const char *tree_current_path(struct tree *);
[all...]
/macosx-10.10/libarchive-30/libarchive/tar/
H A Dtree.h25 * $FreeBSD: src/usr.bin/tar/tree.h,v 1.4 2008/11/27 05:49:52 kientzle Exp $
48 struct tree;
50 /* Initiate/terminate a tree traversal. */
51 struct tree *tree_open(const char * /* pathname */);
52 void tree_close(struct tree *);
78 int tree_next(struct tree *);
81 int tree_errno(struct tree *);
90 void tree_descend(struct tree *);
97 int tree_current_depth(struct tree *);
101 * that can be used to access the file. Because tree doe
[all...]
/macosx-10.10/xnu-2782.1.97/bsd/sys/
H A Dtree.h29 #include <libkern/tree.h>
/macosx-10.10/ncurses-44/ncurses/ncurses/trace/
H A Dtrace_tries.c45 recur_tries(TRIES * tree, unsigned level) argument
52 while (tree != 0) {
53 if ((my_buffer[level] = tree->ch) == 0)
56 if (tree->value != 0) {
57 _tracef("%5d: %s (%s)", tree->value,
58 _nc_visbuf((char *) my_buffer), keyname(tree->value));
60 if (tree->child)
61 recur_tries(tree->child, level + 1);
62 tree = tree
67 _nc_trace_tries(TRIES * tree) argument
[all...]
/macosx-10.10/ncurses-44/ncurses/ncurses/base/
H A Dtries.c36 ** Functions to manage the tree of partial-completions for keycodes.
49 _nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len) argument
51 TRIES *ptr = tree;
84 * Remove a code from the specified tree, freeing the unused nodes. Returns
88 _nc_remove_key(TRIES ** tree, unsigned code) argument
90 T((T_CALLED("_nc_remove_key(%p,%d)"), tree, code));
95 while (*tree != 0) {
96 if (_nc_remove_key(&(*tree)->child, code)) {
99 if ((*tree)->value == code) {
100 if ((*tree)
120 _nc_remove_string(TRIES ** tree, const char *string) argument
[all...]
/macosx-10.10/WebInspectorUI-7600.1.17/UserInterface/Views/
H A DDOMTreeContentView.css26 .content-view.dom-tree {
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/fumagic/
H A Dcgen.tcl30 package require struct::tree ; #
41 # The tree most operations use for their work.
42 variable tree {}
58 namespace export 2tree treedump treegen
95 proc ::fileutil::magic::cgen::path {tree} {
96 # Annotates the tree. In each node we store the path from the root
100 $tree set root path {}
101 foreach child [$tree children root] {
102 $tree walk $child -type dfs node {
103 set path [$tree ge
[all...]
/macosx-10.10/pyobjc-45/2.5/pyobjc/pyobjc-framework-Cocoa/Lib/
H A Dtest_cftree.py8 tree = CFTreeCreate(None, context)
9 self.assert_(isinstance(tree, CFTreeRef))
13 CFTreeAppendChild(tree, node)
15 self.assertEquals(CFTreeGetChildCount(tree), 3)
20 tree = CFTreeCreate(None, context)
21 self.assert_(isinstance(tree, CFTreeRef))
23 self.assert_(CFTreeGetContext(tree, None) is context)
29 tree = CFTreeCreate(None, context)
30 self.assert_(isinstance(tree, CFTreeRef))
32 CFTreeSetContext(tree, "fuba
[all...]
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-framework-Cocoa/Lib/
H A Dtest_cftree.py8 tree = CFTreeCreate(None, context)
9 self.assert_(isinstance(tree, CFTreeRef))
13 CFTreeAppendChild(tree, node)
15 self.assertEquals(CFTreeGetChildCount(tree), 3)
20 tree = CFTreeCreate(None, context)
21 self.assert_(isinstance(tree, CFTreeRef))
23 self.assert_(CFTreeGetContext(tree, None) is context)
29 tree = CFTreeCreate(None, context)
30 self.assert_(isinstance(tree, CFTreeRef))
32 CFTreeSetContext(tree, "fuba
[all...]
/macosx-10.10/pyobjc-45/pyobjc/pyobjc-framework-Cocoa-2.5.1/Lib/
H A Dtest_cftree.py8 tree = CFTreeCreate(None, context)
9 self.assert_(isinstance(tree, CFTreeRef))
13 CFTreeAppendChild(tree, node)
15 self.assertEquals(CFTreeGetChildCount(tree), 3)
20 tree = CFTreeCreate(None, context)
21 self.assert_(isinstance(tree, CFTreeRef))
23 self.assert_(CFTreeGetContext(tree, None) is context)
29 tree = CFTreeCreate(None, context)
30 self.assert_(isinstance(tree, CFTreeRef))
32 CFTreeSetContext(tree, "fuba
[all...]
/macosx-10.10/postfix-255/postfix/src/trivial-rewrite/
H A Drewrite.c19 /* void rewrite_tree(context, tree)
21 /* TOK822 *tree;
39 /* rewrite_tree() rewrites a parse tree with a single address to
40 /* another tree. A tree is a dummy node on top of a token list.
102 void rewrite_tree(RWR_CONTEXT *context, TOK822 *tree) argument
118 if (tree->head == 0)
119 msg_panic("rewrite_tree: empty tree");
124 if (tree->head == tree
219 TOK822 *tree; local
[all...]
/macosx-10.10/OpenSSL098-52/src/crypto/x509v3/
H A Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
72 if (!tree)
74 return tree->nlevel;
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
88 if (!tree)
90 return tree
[all...]
/macosx-10.10/Security-57031.1.35/Security/sec/securityd/Regressions/
H A Dsd-10-policytree.c52 policy_tree_t tree; local
53 ok(tree = policy_tree_create(&oidAnyPolicy, p_q),
54 "create tree root");
55 if (verbose) policy_tree_dump(tree);
60 policy_tree_add_child(tree, &oidAnyPolicy, NULL);
62 diag("node %p %d/%d children added", tree, i, count);
65 policy_tree_dump(tree);
68 for (depth = 0; tree && depth < 7; ++depth) {
71 added = policy_tree_walk_depth(tree, depth,
78 if (verbose) policy_tree_dump(tree);
[all...]
/macosx-10.10/CPANInternal-159.1/Tree-Simple-1.18/t/
H A D13_Tree_Simple_clone_test.t15 my $tree = Tree::Simple->new(Tree::Simple->ROOT);
16 isa_ok($tree, 'Tree::Simple');
26 my $SUB_TREE = Tree::Simple->new("sub tree test");
29 $tree->addChildren(
41 my $clone = $tree->clone();
51 isnt($clone, $tree, '... these should be refs');
53 is($clone->getChild(0)->getNodeValue(), $tree->getChild(0)->getNodeValue(), '... these should be the same value');
57 is(ref($tree->getChild(1)->getNodeValue()), "SCALAR", '... these should be scalar refs');
59 isnt($clone->getChild(1)->getNodeValue(), $tree->getChild(1)->getNodeValue(),
62 is(${$clone->getChild(1)->getNodeValue()}, ${$tree
[all...]
H A D11_Tree_Simple_fixDepth_test.t13 # tree is added to a tree. It basically fixes the depth field so that it
19 # create our tree to later add-in
20 my $tree = Tree::Simple->new("2.1")
28 ok($tree->isRoot(), '... our tree is a root');
31 ok(!$tree->isLeaf(), '... and it is not a leaf');
34 cmp_ok($tree->getDepth(), '==', -1, '... our depth should be -1');
38 cmp_ok($tree->getChildCount(), '==', 3, '... we have 3 children');
41 foreach my $sub_tree ($tree
[all...]
H A D12_Tree_Simple_exceptions_test.t39 my $tree = Tree::Simple->new(Tree::Simple->ROOT);
47 $tree->setNodeValue();
56 $tree->addChild();
57 } qr/^Insufficient Arguments : no tree\(s\) to insert/, '... this should die';
61 $tree->addChild("fail");
66 $tree->addChild([]);
72 $tree->addChild($BAD_OBJECT);
81 $tree->insertChild();
86 $tree->insertChild(5);
89 # giving an good index argument but no tree argumen
[all...]
H A D10_Tree_Simple_test.t17 # is so large because (at the moment) each test relies upon the tree created
28 # make a root for our tree
29 my $tree = Tree::Simple->new("root tree", Tree::Simple->ROOT);
30 isa_ok($tree, 'Tree::Simple');
34 can_ok($tree, '_init');
35 can_ok($tree, '_setParent');
37 can_ok($tree, 'isRoot');
38 can_ok($tree, 'isLeaf');
40 can_ok($tree, 'setNodeValu
[all...]
/macosx-10.10/sudo-73/src/
H A Dredblack.c67 * Red-Black tree, see http://en.wikipedia.org/wiki/Red-black_tree
69 * A red-black tree is a binary search tree where each node has a color
71 * is just a convenient way to express a 2-3-4 binary search tree where
75 * red-black tree:
85 * Create a red black tree struct using the specified compare routine.
86 * Allocates and returns the initialized (empty) tree.
92 struct rbtree *tree; local
94 tree = (struct rbtree *) emalloc(sizeof(*tree));
[all...]
/macosx-10.10/tcl-105/tcl_ext/tktreectrl/tktreectrl/generic/
H A DtkTreeDisplay.c14 #define W2Cy(y) ((y) + tree->yOrigin)
26 static void Range_RedoIfNeeded(TreeCtrl *tree);
27 static int Range_TotalWidth(TreeCtrl *tree, Range *range_);
28 static int Range_TotalHeight(TreeCtrl *tree, Range *range_);
29 static void Range_Redo(TreeCtrl *tree);
30 static Range *Range_UnderPoint(TreeCtrl *tree, int *x_, int *y_, int nearest);
31 static RItem *Range_ItemUnderPoint(TreeCtrl *tree, Range *range, int *x_,
83 * column displayed at the n'th tree column. */
124 int *xScrollIncrements; /* When tree->xScrollIncrement is zero */
125 int *yScrollIncrements; /* When tree
161 Tree_FreeItemRInfo(TreeCtrl *tree, TreeItem item) argument
167 Range_Free(TreeCtrl *tree, Range *range) argument
464 Range_TotalWidth( TreeCtrl *tree, Range *range ) argument
645 Range_TotalHeight( TreeCtrl *tree, Range *range ) argument
803 Range_UnderPoint( TreeCtrl *tree, int *x_, int *y_, int nearest ) argument
915 Range_ItemUnderPoint( TreeCtrl *tree, Range *range, int *x_, int *y_ ) argument
1008 Increment_AddX( TreeCtrl *tree, int offset, int size ) argument
1051 Increment_AddY( TreeCtrl *tree, int offset, int size ) argument
1504 B_IncrementFindX( TreeCtrl *tree, int offset ) argument
1536 B_IncrementFindY( TreeCtrl *tree, int offset ) argument
1571 B_XviewCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
1674 B_YviewCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
1774 Tree_ItemUnderPoint( TreeCtrl *tree, int *x_, int *y_, int nearest ) argument
1848 Tree_AreaBbox( TreeCtrl *tree, int area, int *x1_, int *y1_, int *x2_, int *y2_ ) argument
1926 Tree_HitTest( TreeCtrl *tree, int x, int y ) argument
1973 Tree_ItemBbox( TreeCtrl *tree, TreeItem item, int lock, int *x, int *y, int *w, int *h ) argument
2051 Tree_ItemLARB( TreeCtrl *tree, TreeItem item, int vertical, int prev ) argument
2106 Tree_ItemLeft( TreeCtrl *tree, TreeItem item) argument
2114 Tree_ItemAbove( TreeCtrl *tree, TreeItem item) argument
2122 Tree_ItemRight( TreeCtrl *tree, TreeItem item) argument
2130 Tree_ItemBelow( TreeCtrl *tree, TreeItem item) argument
2155 Tree_ItemFL( TreeCtrl *tree, TreeItem item, int vertical, int first ) argument
2207 Tree_ItemTop( TreeCtrl *tree, TreeItem item) argument
2215 Tree_ItemBottom( TreeCtrl *tree, TreeItem item) argument
2223 Tree_ItemLeftMost( TreeCtrl *tree, TreeItem item) argument
2231 Tree_ItemRightMost( TreeCtrl *tree, TreeItem item) argument
2255 Tree_ItemToRNC( TreeCtrl *tree, TreeItem item, int *row, int *col ) argument
2296 Tree_RNCToItem( TreeCtrl *tree, int row, int col ) argument
2365 DisplayDelay(TreeCtrl *tree) argument
2396 DItem_Alloc( TreeCtrl *tree, RItem *rItem ) argument
2485 DItem_Free( TreeCtrl *tree, DItem *dItem ) argument
2524 FreeDItems( TreeCtrl *tree, DItem *first, DItem *last, int unlink ) argument
2570 Tree_ItemsInArea( TreeCtrl *tree, TreeItemList *items, int minX, int minY, int maxX, int maxY ) argument
2689 GetOnScreenColumnsForItemAux( TreeCtrl *tree, DItem *dItem, DItemArea *area, int bounds[4], int lock, TreeColumnList *columns ) argument
2767 GetOnScreenColumnsForItem( TreeCtrl *tree, DItem *dItem, TreeColumnList *columns ) argument
2809 TrackOnScreenColumnsForItem( TreeCtrl *tree, TreeItem item, Tcl_HashEntry *hPtr ) argument
2915 UpdateDInfoForRange( TreeCtrl *tree, DItem *dItemHead, Range *range, RItem *rItem, int x, int y ) argument
3496 InvalidateWhitespace( TreeCtrl *tree, int x1, int y1, int x2, int y2) argument
3671 DblBufWinDirty( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
3695 AddRgnToRedrawRgn( TreeCtrl *tree, TkRegion rgn) argument
3705 AddRectToRedrawRgn( TreeCtrl *tree, int minX, int minY, int maxX, int maxY) argument
3744 DItemAllDirty( TreeCtrl *tree, DItem *dItem ) argument
4427 Proxy_DrawXOR( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
4615 Proxy_Draw( TreeCtrl *tree, TreeDrawable td, int x1, int y1, int x2, int y2 ) argument
4653 TreeColumnProxy_Draw( TreeCtrl *tree, TreeDrawable td ) argument
4681 TreeRowProxy_Draw( TreeCtrl *tree, TreeDrawable td ) argument
4898 GetItemBgIndex( TreeCtrl *tree, RItem *rItem ) argument
4947 DrawColumnBackground( TreeCtrl *tree, Drawable drawable, TreeColumn treeColumn, TkRegion dirtyRgn, XRectangle *bounds, RItem *rItem, int height, int index ) argument
5032 DrawWhitespaceBelowItem( TreeCtrl *tree, Drawable drawable, int lock, int bounds[4], int left, int top, TkRegion dirtyRgn, TkRegion columnRgn, int height, int index ) argument
5149 DrawWhitespace( TreeCtrl *tree, Drawable drawable, TkRegion dirtyRgn ) argument
5289 Tree_DrawTiledImage( TreeCtrl *tree, Drawable drawable, Tk_Image image, int x1, int y1, int x2, int y2, int xOffset, int yOffset ) argument
5354 DisplayDItem( TreeCtrl *tree, DItem *dItem, DItemArea *area, int lock, int bounds[4], TreeDrawable pixmap, TreeDrawable drawable ) argument
5446 DebugDrawBorder( TreeCtrl *tree, int inset, int left, int top, int right, int bottom ) argument
5507 TreeDisplay_GetReadyForTrouble( TreeCtrl *tree, int *requestsPtr ) argument
5518 TreeDisplay_WasThereTrouble( TreeCtrl *tree, int requests ) argument
5550 DisplayGetPixmap( TreeCtrl *tree, TreeDrawable *dPixmap, int width, int height ) argument
5593 SetBuffering( TreeCtrl *tree) argument
5647 TreeCtrl *tree = clientData; local
6358 A_IncrementFindX( TreeCtrl *tree, int offset ) argument
6396 A_IncrementFindY( TreeCtrl *tree, int offset ) argument
6434 Increment_FindX( TreeCtrl *tree, int offset ) argument
6464 Increment_FindY( TreeCtrl *tree, int offset ) argument
6493 Increment_ToOffsetX( TreeCtrl *tree, int index ) argument
6526 Increment_ToOffsetY( TreeCtrl *tree, int index ) argument
6611 Tree_GetScrollFractionsX( TreeCtrl *tree, double fractions[2] ) argument
6668 Tree_GetScrollFractionsY( TreeCtrl *tree, double fractions[2] ) argument
6725 Tree_SetOriginX( TreeCtrl *tree, int xOrigin ) argument
6807 Tree_SetOriginY( TreeCtrl *tree, int yOrigin ) argument
7049 Tree_FocusChanged( TreeCtrl *tree, int gotFocus ) argument
7107 Tree_Activate( TreeCtrl *tree, int isActive ) argument
7148 Tree_FreeItemDInfo( TreeCtrl *tree, TreeItem item1, TreeItem item2 ) argument
7196 Tree_InvalidateItemDInfo( TreeCtrl *tree, TreeColumn column, TreeItem item1, TreeItem item2 ) argument
7311 TreeDisplay_ItemDeleted( TreeCtrl *tree, TreeItem item ) argument
7346 TreeDisplay_ColumnDeleted( TreeCtrl *tree, TreeColumn column ) argument
7398 TreeDisplay_FreeColumnDInfo( TreeCtrl *tree, TreeColumn column ) argument
7460 Tree_DInfoChanged( TreeCtrl *tree, int flags ) argument
7490 Tree_InvalidateArea( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
7571 Tree_InvalidateRegion( TreeCtrl *tree, TkRegion region ) argument
7684 Tree_InvalidateItemArea( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
7723 Tree_RedrawArea( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
7756 Tree_ExposeArea( TreeCtrl *tree, int x1, int y1, int x2, int y2 ) argument
7900 Tree_DumpDInfo( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
[all...]
H A DtkTreeNotify.c45 TreeCtrl *tree, /* Widget info. */
52 (tree->itemPrefixLen ? tree->itemPrefix : ""), id);
74 TreeCtrl *tree, /* Widget info. */
89 (tree->itemPrefixLen ? tree->itemPrefix : ""),
90 TreeItem_GetID(tree, TreeItemList_Nth(itemList, i)));
167 TreeCtrl *tree; member in struct:__anon13282
189 case 'T': /* tree */
190 QE_ExpandString(Tk_PathName(data->tree
44 ExpandItem( TreeCtrl *tree, int id, Tcl_DString *result ) argument
73 ExpandItemList( TreeCtrl *tree, TreeItemList *itemList, Tcl_DString *result ) argument
227 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13283
264 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13284
305 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13285
351 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13286
393 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13287
439 TreeCtrl *tree = clientData; local
531 TreeNotify_OpenClose( TreeCtrl *tree, TreeItem item, int state, int before ) argument
541 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13289
576 TreeNotify_Selection( TreeCtrl *tree, TreeItemList *select, TreeItemList *deselect ) argument
584 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13290
619 TreeNotify_ActiveItem( TreeCtrl *tree, TreeItem itemPrev, TreeItem itemCur ) argument
627 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13291
660 TreeNotify_Scroll( TreeCtrl *tree, double fractions[2], int vertical ) argument
670 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13292
708 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13293
740 TreeNotify_ItemDeleted( TreeCtrl *tree, TreeItemList *items ) argument
747 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13294
778 TreeNotify_ItemVisibility( TreeCtrl *tree, TreeItemList *v, TreeItemList *h ) argument
786 TreeCtrl *tree; /* Must be first. See Percents_Any(). */ member in struct:__anon13295
[all...]
H A DtkTreeCtrl.c45 Tcl_HashEntry *hPtr; /* Entry in tree->imageNameHash. */
315 static int TreeConfigure(Tcl_Interp *interp, TreeCtrl *tree, int objc,
321 static void TreeComputeGeometry(TreeCtrl *tree);
322 static int TreeSeeCmd(TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[]);
323 static int TreeStateCmd(TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[]);
324 static int TreeSelectionCmd(Tcl_Interp *interp, TreeCtrl *tree, int objc,
326 static int TreeXviewCmd(Tcl_Interp *interp, TreeCtrl *tree, int objc,
328 static int TreeYviewCmd(Tcl_Interp *interp, TreeCtrl *tree, int objc,
366 TreeCtrl *tree; local
383 tree
503 TreeCtrl *tree = clientData; local
1180 TreeConfigure( Tcl_Interp *interp, TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[], int createFlag ) argument
1528 TreeCtrl *tree = (TreeCtrl *) instanceData; local
1572 TreeCtrl *tree = clientData; local
1659 TreeCtrl *tree = clientData; local
1689 TreeCtrl *tree = (TreeCtrl *) memPtr; local
1930 Tree_AddItem( TreeCtrl *tree, TreeItem item ) argument
1964 Tree_RemoveItem( TreeCtrl *tree, TreeItem item ) argument
2015 TreeCtrl *tree = clientData; local
2052 Tree_GetImage( TreeCtrl *tree, char *imageName ) argument
2103 Tree_FreeImage( TreeCtrl *tree, Tk_Image image ) argument
2142 TreeSeeCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
2318 Tree_StateFromObj( TreeCtrl *tree, Tcl_Obj *obj, int states[3], int *indexPtr, int flags ) argument
2413 Tree_StateFromListObj( TreeCtrl *tree, Tcl_Obj *obj, int states[3], int flags ) argument
2455 TreeStateCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
2587 Tree_AddToSelection( TreeCtrl *tree, TreeItem item ) argument
2632 Tree_RemoveFromSelection( TreeCtrl *tree, TreeItem item ) argument
2670 TreeSelectionCmd( Tcl_Interp *interp, TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
3198 A_XviewCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
3302 A_YviewCmd( TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
3403 TreeXviewCmd( Tcl_Interp *interp, TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
3434 TreeYviewCmd( Tcl_Interp *interp, TreeCtrl *tree, int objc, Tcl_Obj *CONST objv[] ) argument
3483 TreeCtrl *tree = clientData; local
[all...]
H A DtkTreeCtrl.h149 TreeCtrl *tree; member in struct:TreePtrList
448 MODULE_SCOPE void Tree_AddItem(TreeCtrl *tree, TreeItem item);
449 MODULE_SCOPE void Tree_RemoveItem(TreeCtrl *tree, TreeItem item);
450 MODULE_SCOPE Tk_Image Tree_GetImage(TreeCtrl *tree, char *imageName);
451 MODULE_SCOPE void Tree_FreeImage(TreeCtrl *tree, Tk_Image image);
452 MODULE_SCOPE void Tree_UpdateScrollbarX(TreeCtrl *tree);
453 MODULE_SCOPE void Tree_UpdateScrollbarY(TreeCtrl *tree);
454 MODULE_SCOPE void Tree_AddToSelection(TreeCtrl *tree, TreeItem item);
455 MODULE_SCOPE void Tree_RemoveFromSelection(TreeCtrl *tree, TreeItem item);
456 MODULE_SCOPE void Tree_PreserveItems(TreeCtrl *tree);
515 TreeCtrl *tree; member in struct:ItemForEach
634 TreeCtrl *tree; member in struct:StyleDrawArgs
725 TreeCtrl *tree; member in struct:ColumnForEach
1106 TreeCtrl *tree; member in struct:TagExpr
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/grammar_me/
H A Dme_util.tcl21 proc ::grammar::me::util::ast2tree {ast tree {root {}}} {
22 # See grammar::me_ast for the specification of both value and tree
26 set root [$tree rootname]
52 # from the value. Afterward recurse and build the tree for the
55 set new [lindex [$tree insert $root end] 0]
58 $tree set $new type terminal
60 $tree set $new type nonterminal
61 $tree set $new detail $type
64 $tree set $new range $range
67 ast2tree $child $tree
[all...]
/macosx-10.10/tcl-105/tcl_ext/bwidget/bwidget/demo/
H A Dtree.tcl2 # tree.tcl
4 # $Id: tree.tcl,v 1.4 2009/09/08 21:21:20 oberdorfer Exp $
19 set title [TitleFrame $pane.lf -text "Directory tree"]
22 set tree [Tree $sw.tree \
30 -opencmd "DemoTree::moddir 1 $sw.tree" \
31 -closecmd "DemoTree::moddir 0 $sw.tree"]
32 $sw setwidget $tree
56 $tree bindText <ButtonPress-1> "DemoTree::select tree
[all...]

Completed in 392 milliseconds

1234567891011>>