Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 40) sorted by relevance

12

/PHP-5.6/sapi/phpdbg/
H A Dphpdbg_btree.h44 phpdbg_btree *tree; member
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_ulon…
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_BT… argument
62 #define phpdbg_btree_update(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BT… argument
63 #define phpdbg_btree_overwrite(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG… argument
H A Dphpdbg_btree.c34 tree->depth = depth; in phpdbg_btree_init()
35 tree->branch = NULL; in phpdbg_btree_init()
36 tree->count = 0; in phpdbg_btree_init()
41 int i = tree->depth - 1; in phpdbg_btree_find()
86 i = tree->depth - 1; in phpdbg_btree_find_closest()
121 pos.tree = tree; in phpdbg_btree_find_between()
163 tree->count++; in phpdbg_btree_insert_or_update()
176 int i = tree->depth; in phpdbg_btree_delete()
196 tree->count--; in phpdbg_btree_delete()
199 efree(tree->branch); in phpdbg_btree_delete()
[all …]
/PHP-5.6/ext/dom/
H A Ddocumentfragment.c89 static void php_dom_xmlSetTreeDoc(xmlNodePtr tree, xmlDocPtr doc) /* {{{ */ in php_dom_xmlSetTreeDoc() argument
94 if (tree) { in php_dom_xmlSetTreeDoc()
95 if(tree->type == XML_ELEMENT_NODE) { in php_dom_xmlSetTreeDoc()
96 prop = tree->properties; in php_dom_xmlSetTreeDoc()
109 if (tree->children != NULL) { in php_dom_xmlSetTreeDoc()
110 cur = tree->children; in php_dom_xmlSetTreeDoc()
116 tree->doc = doc; in php_dom_xmlSetTreeDoc()
H A Delement.c698 static xmlNsPtr _dom_new_reconNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns) /* {{{ */ in _dom_new_reconNs() argument
704 if ((tree == NULL) || (ns == NULL) || (ns->type != XML_NAMESPACE_DECL)) { in _dom_new_reconNs()
718 def = xmlSearchNs(doc, tree, prefix); in _dom_new_reconNs()
726 def = xmlSearchNs(doc, tree, prefix); in _dom_new_reconNs()
732 def = xmlNewNs(tree, ns->href, prefix); in _dom_new_reconNs()
/PHP-5.6/Zend/tests/
H A Dbug60138.phpt5 $tree = array(array("f"));
6 $category =& $tree[0];
9 new RecursiveArrayIterator($tree),
/PHP-5.6/ext/intl/tests/
H A Dmsgfmt_format.phpt16 …n_US' => "{0,number,integer} monkeys on {1,number,integer} trees make {2,number} monkeys per tree",
19 …_UK' => "{0,number,integer} monkeys on {1,number,integer} trees make {2,number} monkeys per tree",
50 '4,560 monkeys on 123 trees make 37.073 monkeys per tree'
51 '4,560 monkeys on 123 trees make 37.073 monkeys per tree'
62 '4,560 monkeys on 123 trees make 37.073 monkeys per tree'
63 '4,560 monkeys on 123 trees make 37.073 monkeys per tree'
H A Dmsgfmt_parse.phpt16 …n_US' => "{0,number,integer} monkeys on {1,number,integer} trees make {2,number} monkeys per tree",
19 …_UK' => "{0,number,integer} monkeys on {1,number,integer} trees make {2,number} monkeys per tree",
25 'en_US' => "4,560 monkeys on 123 trees make 37.073 monkeys per tree",
28 'en_UK' => "4,560 monkeys on 123 trees make 37.073 monkeys per tree",
29 'root' => "4,560 monkeys on 123 trees make 37.073 monkeys per tree",
/PHP-5.6/ext/phar/phar/
H A Ddirectorytreeiterator.inc38 $tree = '';
40 $tree .= $this->getSubIterator($l)->hasNext() ? '| ' : ' ';
42 return $tree . ($this->getSubIterator($l)->hasNext() ? '|-' : '\-')
H A Ddirectorygraphiterator.inc13 * @brief A tree iterator that only shows directories.
/PHP-5.6/ext/spl/examples/
H A Ddirectorytreeiterator.inc38 $tree = '';
40 $tree .= $this->getSubIterator($l)->hasNext() ? '| ' : ' ';
42 return $tree . ($this->getSubIterator($l)->hasNext() ? '|-' : '\-')
H A Ddirectorygraphiterator.inc13 * @brief A tree iterator that only shows directories.
/PHP-5.6/ext/tidy/examples/
H A Ddumpit5.php21 $tree = $tidy->root(); variable
22 dump_tree($tree);
/PHP-5.6/ext/spl/tests/
H A Dbug65328.phpt193 throw new \RuntimeException("Node uid is not unique in assigned node tree");
211 $tree = new Tree($headNode);
213 return !$tree->find($uid);
289 $tree = new Tree();
291 $tree->getHead()->addChild($node1);
295 print_r($tree->findAll(2)->offsetGet(0));
/PHP-5.6/ext/dom/tests/
H A DDOMNode_replaceChild_basic.phpt22 // If the newChild is already in the tree, it is first removed.
25 echo "Existing child is removed from tree:\n" . $document->saveXML();
39 Existing child is removed from tree:
H A DDOMNode_cloneNode_basic.phpt40 // strip all text nodes from this tree
/PHP-5.6/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-5.6/sapi/pi3web/
H A DREADME11 PHP CVS tree into the Pi3Web source directory called 'PHP5' first. Then
21 You must also checkout the TSRM and the ZEND module from the ZEND cvs tree
/PHP-5.6/ext/standard/tests/file/
H A Drename_variation1.phpt18 /* Testing simple directory tree */
H A Drename_variation1-win32.phpt23 /* Testing simple directory tree */
/PHP-5.6/sapi/cgi/
H A DCHANGES24 web tree and people will not be able
/PHP-5.6/ext/snmp/tests/
H A Dsnmp2_real_walk.phpt85 …'%s': No more variables left in this MIB View (It is past the end of the MIB tree) in %s on line %d
H A Dsnmp2_walk.phpt98 …'%s': No more variables left in this MIB View (It is past the end of the MIB tree) in %s on line %d
/PHP-5.6/ext/exif/
H A Dtest.txt111 // Searches for $file in document tree. The path is ignored.
137 // Searches for $file in document tree. The path is ignored.
/PHP-5.6/ext/imap/
H A Dphp_imap.c4686 static void build_thread_tree_helper(THREADNODE *cur, zval *tree, long *numNodes, char *buf) in build_thread_tree_helper() argument
4693 add_assoc_long(tree, buf, cur->num); in build_thread_tree_helper()
4698 add_assoc_long(tree, buf, *numNodes); in build_thread_tree_helper()
4699 build_thread_tree_helper(cur->next, tree, numNodes, buf); in build_thread_tree_helper()
4701 add_assoc_long(tree, buf, 0); in build_thread_tree_helper()
4707 add_assoc_long(tree, buf, *numNodes); in build_thread_tree_helper()
4708 build_thread_tree_helper(cur->branch, tree, numNodes, buf); in build_thread_tree_helper()
4710 add_assoc_long(tree, buf, 0); in build_thread_tree_helper()
4717 static int build_thread_tree(THREADNODE *top, zval **tree) in build_thread_tree() argument
4722 array_init(*tree); in build_thread_tree()
[all …]
/PHP-5.6/ext/mbstring/oniguruma/
H A DREADME127 regtrav.c capture history tree data traverse functions.

Completed in 44 milliseconds

12