Home
last modified time | relevance | path

Searched refs:heapb (Results 1 – 25 of 56) sorted by relevance

123

/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dfibonacci_heap.h246 fibonacci_heap *union_with (fibonacci_heap *heapb);
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
506 gcc_checking_assert (m_allocator == heapb->m_allocator); in union_with()
512 return heapb; in union_with()
514 if ((b_root = heapb->m_root) == NULL) in union_with()
516 delete (heapb); in union_with()
524 heapa->m_nodes += heapb->m_nodes; in union_with()
527 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
528 heapa->m_min = heapb->m_min; in union_with()
531 heapb->m_min = NULL; in union_with()
[all …]
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/binutils/libiberty/
H A Dfibheap.c157 fibheap_union (heapa, heapb) in fibheap_union() argument
159 fibheap_t heapb;
167 return heapb;
169 if ((b_root = heapb->root) == NULL)
171 free (heapb);
181 heapa->nodes += heapb->nodes;
184 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0)
185 heapa->min = heapb->min;
187 free (heapb);
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libiberty/
H A Dfibheap.c157 fibheap_union (heapa, heapb) in fibheap_union() argument
159 fibheap_t heapb;
167 return heapb;
169 if ((b_root = heapb->root) == NULL)
171 free (heapb);
181 heapa->nodes += heapb->nodes;
184 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0)
185 heapa->min = heapb->min;
187 free (heapb);
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/binutils-2.16.1/libiberty/
H A Dfibheap.c157 fibheap_union (heapa, heapb) in fibheap_union() argument
159 fibheap_t heapb;
167 return heapb;
169 if ((b_root = heapb->root) == NULL)
171 free (heapb);
181 heapa->nodes += heapb->nodes;
184 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0)
185 heapa->min = heapb->min;
187 free (heapb);
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/binutils/libiberty/
H A Dfibheap.c157 fibheap_union (heapa, heapb) in fibheap_union() argument
159 fibheap_t heapb;
167 return heapb;
169 if ((b_root = heapb->root) == NULL)
171 free (heapb);
181 heapa->nodes += heapb->nodes;
184 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0)
185 heapa->min = heapb->min;
187 free (heapb);
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/libiberty/
H A Dfibheap.c157 fibheap_union (heapa, heapb) in fibheap_union() argument
159 fibheap_t heapb;
167 return heapb;
169 if ((b_root = heapb->root) == NULL)
171 free (heapb);
181 heapa->nodes += heapb->nodes;
184 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0)
185 heapa->min = heapb->min;
187 free (heapb);
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dfibonacci_heap.h227 fibonacci_heap *union_with (fibonacci_heap *heapb);
471 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb) in union_with() argument
481 return heapb; in union_with()
483 if ((b_root = heapb->m_root) == NULL) in union_with()
485 delete (heapb); in union_with()
493 heapa->m_nodes += heapb->m_nodes; in union_with()
496 if (heapb->m_min->compare (heapa->m_min) < 0) in union_with()
497 heapa->m_min = heapb->m_min; in union_with()
500 heapb->m_min = NULL; in union_with()
501 delete (heapb); in union_with()
/dports/lang/gcc6-aux/gcc-6-20180516/libiberty/
H A Dfibheap.c144 fibheap_union (fibheap_t heapa, fibheap_t heapb) in fibheap_union() argument
152 return heapb; in fibheap_union()
154 if ((b_root = heapb->root) == NULL) in fibheap_union()
156 free (heapb); in fibheap_union()
166 heapa->nodes += heapb->nodes; in fibheap_union()
169 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0) in fibheap_union()
170 heapa->min = heapb->min; in fibheap_union()
172 free (heapb); in fibheap_union()
/dports/lang/gcc12-devel/gcc-12-20211205/libiberty/
H A Dfibheap.c144 fibheap_union (fibheap_t heapa, fibheap_t heapb) in fibheap_union() argument
152 return heapb; in fibheap_union()
154 if ((b_root = heapb->root) == NULL) in fibheap_union()
156 free (heapb); in fibheap_union()
166 heapa->nodes += heapb->nodes; in fibheap_union()
169 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0) in fibheap_union()
170 heapa->min = heapb->min; in fibheap_union()
172 free (heapb); in fibheap_union()
/dports/lang/gcc8/gcc-8.5.0/libiberty/
H A Dfibheap.c144 fibheap_union (fibheap_t heapa, fibheap_t heapb) in fibheap_union() argument
152 return heapb; in fibheap_union()
154 if ((b_root = heapb->root) == NULL) in fibheap_union()
156 free (heapb); in fibheap_union()
166 heapa->nodes += heapb->nodes; in fibheap_union()
169 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0) in fibheap_union()
170 heapa->min = heapb->min; in fibheap_union()
172 free (heapb); in fibheap_union()
/dports/lang/gcc48/gcc-4.8.5/libiberty/
H A Dfibheap.c144 fibheap_union (fibheap_t heapa, fibheap_t heapb) in fibheap_union() argument
152 return heapb; in fibheap_union()
154 if ((b_root = heapb->root) == NULL) in fibheap_union()
156 free (heapb); in fibheap_union()
166 heapa->nodes += heapb->nodes; in fibheap_union()
169 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0) in fibheap_union()
170 heapa->min = heapb->min; in fibheap_union()
172 free (heapb); in fibheap_union()

123