Searched defs:tree (Results 1 - 5 of 5) sorted by relevance

/glassfish-3.1.2/admingui/common/src/main/java/org/glassfish/admingui/common/tree/
H A DFilterTreeEvent.java41 package org.glassfish.admingui.common.tree;
H A DListTreeAdaptor.java41 package org.glassfish.admingui.common.tree;
44 import com.sun.jsftemplating.component.factory.tree.TreeAdaptor;
45 import com.sun.jsftemplating.component.factory.tree.TreeAdaptorBase;
191 * factory that creates the <code>TreeNode</code> for the given tree
289 * <p> This method returns the <code>id</code> for the given tree node
317 * @param comp The tree node <code>UIComponent</code>.
318 * @param nodeObject The (model) object representing the tree node.
435 * <code>TreeNode</code> for the given tree node model object.</p>
H A DJndiBrowserTreeAdaptor.java41 package org.glassfish.admingui.common.tree;
44 import com.sun.jsftemplating.component.factory.tree.TreeAdaptor;
45 import com.sun.jsftemplating.component.factory.tree.TreeAdaptorBase;
214 * that creates the <code>TreeNode</code> for the given tree node model
292 + ") for tree processing");
324 * This method returns the <code>id</code> for the given tree node model
383 * The tree node <code>UIComponent</code>.
385 * The (model) object representing the tree node.
/glassfish-3.1.2/installer/src/cpp/share/launcher/zlib-1.1.4/
H A Dinfcodes.c40 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon7::__anon8
42 } code; /* if LEN or DIST, where in tree */
53 inflate_huft *ltree; /* literal/length/eob tree */
54 inflate_huft *dtree; /* distance tree */
119 c->sub.code.tree = c->ltree;
124 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
146 c->sub.code.tree = t + t->base;
165 c->sub.code.tree = c->dtree;
171 t = c->sub.code.tree
[all...]
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
91 /* The static literal tree. Since the bit lengths are imposed, there is no
93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
98 /* The static distance tree. (Actually a trivial tree since all codes use
122 const ct_data *static_tree; /* static tree or NULL */
125 int elems; /* max number of elements in the tree */
144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, in
495 ct_data *tree = desc->dyn_tree; local
624 ct_data *tree = desc->dyn_tree; local
[all...]

Completed in 551 milliseconds