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

/PHP_TRUNK/ext/phar/phar/
H A Ddirectorygraphiterator.inc13 * @brief A tree iterator that only shows directories.
H A Ddirectorytreeiterator.inc38 $tree = '';
40 $tree .= $this->getSubIterator($l)->hasNext() ? '| ' : ' ';
42 return $tree . ($this->getSubIterator($l)->hasNext() ? '|-' : '\-')
H A Dpharcommand.inc783 * @return string The description of a directory tree for a Phar archive.
787 return "Get a directory tree for a PHAR archive.";
/PHP_TRUNK/ext/spl/examples/
H A Ddirectorygraphiterator.inc13 * @brief A tree iterator that only shows directories.
H A Ddirectorytreeiterator.inc38 $tree = '';
40 $tree .= $this->getSubIterator($l)->hasNext() ? '| ' : ' ';
42 return $tree . ($this->getSubIterator($l)->hasNext() ? '|-' : '\-')
/PHP_TRUNK/ext/spl/internal/
H A Drecursivetreeiterator.inc72 $tree = '';
75 $tree .= $this->getSubIterator($level)->hasNext() ? $this->prefix[1] : $this->prefix[2];
77 $tree .= $this->getSubIterator($level)->hasNext() ? $this->prefix[3] : $this->prefix[4];
79 return $this->prefix[0] . $tree . $this->prefix[5];
/PHP_TRUNK/ext/tidy/examples/
H A Ddumpit5.php21 $tree = $tidy->root(); variable
22 dump_tree($tree);
/PHP_TRUNK/ext/xml/
H A Dexpat_compat.h38 #include <libxml/tree.h>
/PHP_TRUNK/ext/sqlite3/libsqlite/
H A Dsqlite3.c219 ** hash of the entire source tree.
1815 ** the canonical SQLite source tree.</dd>
3145 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^
7575 ** The maximum depth of an expression tree. This is limited to
8751 sqlite3_vfs *pVfs, /* VFS to use with this b-tree */
8767 #define BTREE_SINGLE 4 /* The file contains at most 1 b-tree */
11150 ** Each node of an expression in the parse tree is an instance
11157 ** tree.
11239 int nHeight; /* Height of the tree headed by this node */
11353 ** the parse tree fo
145454 Rtree tree; local
[all...]
/PHP_TRUNK/sapi/phpdbg/
H A Dphpdbg_btree.c33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { argument
34 tree->depth = depth;
35 tree->branch = NULL;
36 tree->count = 0;
39 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { argument
40 phpdbg_btree_branch *branch = tree->branch;
41 int i = tree->depth - 1;
66 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { argument
67 phpdbg_btree_branch *branch = tree->branch;
68 int i = tree
118 phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulong higher_idx) argument
140 phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) argument
175 phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) argument
[all...]
H A Dphpdbg_btree.h44 phpdbg_btree *tree; member in struct:__anon4
49 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth);
50 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx);
51 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx);
52 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulong higher_idx);
54 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx);
60 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags);
61 #define phpdbg_btree_insert(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_INSERT)
62 #define phpdbg_btree_update(tree, id
[all...]
/PHP_TRUNK/ext/dom/
H A Dphp_dom.h35 #include <libxml/tree.h>
H A Ddocumentfragment.c87 static void php_dom_xmlSetTreeDoc(xmlNodePtr tree, xmlDocPtr doc) /* {{{ */ argument
92 if (tree) {
93 if(tree->type == XML_ELEMENT_NODE) {
94 prop = tree->properties;
107 if (tree->children != NULL) {
108 cur = tree->children;
114 tree->doc = doc;
H A Delement.c697 static xmlNsPtr _dom_new_reconNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns) /* {{{ */ argument
703 if ((tree == NULL) || (ns == NULL) || (ns->type != XML_NAMESPACE_DECL)) {
717 def = xmlSearchNs(doc, tree, prefix);
725 def = xmlSearchNs(doc, tree, prefix);
731 def = xmlNewNs(tree, ns->href, prefix);
/PHP_TRUNK/ext/libxml/
H A Dphp_libxml.h38 #include <libxml/tree.h>
H A Dlibxml.c41 #include <libxml/tree.h>
/PHP_TRUNK/ext/simplexml/
H A Dphp_simplexml.h34 #include <libxml/tree.h>
/PHP_TRUNK/ext/xmlwriter/
H A Dphp_xmlwriter.h32 #include <libxml/tree.h>
/PHP_TRUNK/ext/imap/
H A Dphp_imap.c4623 static void build_thread_tree_helper(THREADNODE *cur, zval *tree, long *numNodes, char *buf) argument
4630 add_assoc_long(tree, buf, cur->num);
4635 add_assoc_long(tree, buf, *numNodes);
4636 build_thread_tree_helper(cur->next, tree, numNodes, buf);
4638 add_assoc_long(tree, buf, 0);
4644 add_assoc_long(tree, buf, *numNodes);
4645 build_thread_tree_helper(cur->branch, tree, numNodes, buf);
4647 add_assoc_long(tree, buf, 0);
4654 static int build_thread_tree(THREADNODE *top, zval **tree) argument
4659 array_init(*tree);
[all...]

Completed in 188 milliseconds