Home
last modified time | relevance | path

Searched refs:insert_root (Results 1 – 25 of 34) sorted by relevance

12

/dports/devel/py-opengrok-tools/opengrok-1.3.16/opengrok-tools/src/main/python/opengrok_tools/utils/
H A Dxml.py52 insert_root = insert_tree.getroot()
54 for elem in list(insert_root.findall('.')):
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dfibonacci_heap.h234 void insert_root (fibonacci_node_t *node);
349 insert_root (node); in insert()
492 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
518 insert_root (node); in cut()
562 insert_root (x); in extract_minimum_node()
626 insert_root (a[i]); in consolidate()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dfibonacci_heap.h237 void insert_root (fibonacci_node_t *node);
361 insert_root (node); in insert_node()
510 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
536 insert_root (node); in cut()
581 insert_root (x); in extract_minimum_node()
645 insert_root (a[i]); in consolidate()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dfibonacci_heap.h234 void insert_root (fibonacci_node_t *node);
349 insert_root (node); in insert()
492 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
518 insert_root (node); in cut()
562 insert_root (x); in extract_minimum_node()
626 insert_root (a[i]); in consolidate()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dfibonacci_heap.h256 void insert_root (fibonacci_node_t *node);
386 insert_root (node); in insert_node()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node) in insert_root() function
567 insert_root (node); in cut()
612 insert_root (x); in extract_minimum_node()
678 insert_root (a[i]); in consolidate()
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/lib/
H A Drooting.cpp58 void insert_root(tree& t, index lchild, index rchild, bool reverse) { in insert_root() function
99 insert_root(out, node_idx, t[node_idx].parent(), is_node_rchild); in reroot_at_node()
/dports/games/ufoai/ufoai-2.5-source/src/tools/radiant/radiant/map/
H A DMapFileChooserPreview.cpp75 GlobalSceneGraph().insert_root(*root); in setMapName()
/dports/games/ufoai/ufoai-2.5-source/src/tools/radiant/radiant/scenegraph/
H A DCompiledGraph.h60 void insert_root (scene::Node& root);
/dports/games/gtkradiant/GPL/GtkRadiant/include/
H A Discenegraph.h93 virtual void insert_root(Node& root) = 0;
/dports/games/netradiant/netradiant-20150621-src/include/
H A Discenegraph.h89 virtual void insert_root( Node& root ) = 0;
/dports/games/ufoai/ufoai-2.5-source/src/tools/radiant/include/
H A Discenegraph.h150 virtual void insert_root (Node& root) = 0;

12