Home
last modified time | relevance | path

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

12

/PHP-8.3/sapi/phpdbg/
H A Dphpdbg_btree.c34 tree->depth = depth; in phpdbg_btree_init()
35 tree->branch = NULL; in phpdbg_btree_init()
36 tree->persistent = 0; in phpdbg_btree_init()
37 tree->count = 0; in phpdbg_btree_init()
125 pos.tree = tree; in phpdbg_btree_find_between()
167 tree->count++; in phpdbg_btree_insert_or_update()
200 tree->count--; in phpdbg_btree_delete()
203 pefree(tree->branch, tree->persistent); in phpdbg_btree_delete()
241 phpdbg_btree_clean_recursive(tree->branch, tree->depth, tree->persistent); in phpdbg_btree_clean()
243 tree->count = 0; in phpdbg_btree_clean()
[all …]
H A Dphpdbg_btree.h43 phpdbg_btree *tree; member
48 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth);
49 void phpdbg_btree_clean(phpdbg_btree *tree);
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);
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
[all …]
/PHP-8.3/Zend/tests/
H A Dbug78502.phpt6 $tree = [
17 function tree_map($tree, $recursive_attr, closure $callback){
18 if(isset($tree[$recursive_attr])){
19 $tree[$recursive_attr] = array_map(function($c) use($recursive_attr, $callback){
21 }, $tree[$recursive_attr]);
23 return $callback($tree);
26 tree_map($tree, 'children', function ($node) {});
H A Dbug60138.phpt5 $tree = array(array("f"));
6 $category =& $tree[0];
9 new RecursiveArrayIterator($tree),
/PHP-8.3/ext/standard/tests/serialize/
H A Dbug78438.phpt56 $serialized = serialize($tree);
59 $tree = unserialize($serialized);
64 $nodes = [$tree];
83 Testcase tree 3 x 1
88 Testcase tree 3 x 2
93 Testcase tree 3 x 3
98 Testcase tree 3 x 4
103 Testcase tree 3 x 5
108 Testcase tree 3 x 6
113 Testcase tree 3 x 7
[all …]
/PHP-8.3/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 …n_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 …n_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-8.3/ext/ffi/tests/
H A Dbug79576.phpt12 FFI::cdef('struct tree *get_tree(const oid *, size_t, struct tree *);');
17 FFI::cdef('struct tree *get_tree(oid, size_t, struct tree *);');
/PHP-8.3/ext/dom/tests/
H A DDOMNode_isEqualNode.phpt31 <tree>
39 </tree>
155 $tree = $xpath->query("//tree")[0];
157 <tree>
165 </tree>
169 <tree>
177 </tree>
181 <tree>
188 </tree>
192 <tree>
[all …]
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 Dgh16039.phpt2 GH-16039 (Segmentation fault (access null pointer) in ext/dom/parentnode/tree.c)
H A Dgh16151.phpt2 GH-16151 (Assertion failure in ext/dom/parentnode/tree.c)
/PHP-8.3/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-8.3/ext/opcache/tests/jit/
H A Dbug80447.phpt31 $tree = createTree(12);
32 var_dump(checkTree($tree));
/PHP-8.3/ext/spl/tests/
H A Dbug65328.phpt190 throw new \RuntimeException("Node uid is not unique in assigned node tree");
208 $tree = new Tree($headNode);
210 return !$tree->find($uid);
265 $tree = new Tree();
267 $tree->getHead()->addChild($node1);
271 print_r($tree->findAll(2)->offsetGet(0));
/PHP-8.3/.github/scripts/windows/
H A Dbuild.bat36 …git --git-dir="%PHP_BUILD_CACHE_SDK_DIR%\.git" --work-tree="%PHP_BUILD_CACHE_SDK_DIR%" fetch --pru…
38 …git --git-dir="%PHP_BUILD_CACHE_SDK_DIR%\.git" --work-tree="%PHP_BUILD_CACHE_SDK_DIR%" checkout --…
/PHP-8.3/ext/xmlreader/
H A Dconfig.w328 CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_XMLREADER", PHP_PHP_BUILD + "\\include\\libxml2")
/PHP-8.3/scripts/dev/
H A Dmakedist33 makedist [options] <tree-ish>
39 <tree-ish> The Git tree or Git commit to produce an archive for. This
/PHP-8.3/ext/soap/
H A Dconfig.w329 CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_SOAP", PHP_PHP_BUILD + "\\include\\libxml2")
/PHP-8.3/ext/xml/
H A Dconfig.w329 CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_XML", PHP_PHP_BUILD + "\\include\\libxml2")
/PHP-8.3/ext/simplexml/
H A Dconfig.w328 …CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_SIMPLEXML", PHP_PHP_BUILD + "\\include\\libxml2")
/PHP-8.3/ext/libxml/
H A Dconfig.w329 …CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_LIBXML", PHP_PHP_BUILD + "\\include\\libxml2") &&
/PHP-8.3/ext/xsl/
H A Dconfig.w329 && CHECK_HEADER_ADD_INCLUDE("libxml/tree.h", "CFLAGS_XSL", PHP_PHP_BUILD + "\\include\\libxml2")
/PHP-8.3/ext/standard/tests/file/
H A Drename_variation1.phpt18 /* Testing simple directory tree */

Completed in 23 milliseconds

12