| /dports/math/vtk9/VTK-9.1.0/ThirdParty/hdf5/vtkhdf5/src/ |
| H A D | H5HP.c | 96 heap->heap[loc].val = heap->heap[loc / 2].val; in H5HP__swim_max()
97 heap->heap[loc].obj = heap->heap[loc / 2].obj; in H5HP__swim_max()
153 heap->heap[loc].val = heap->heap[loc / 2].val; in H5HP__swim_min()
154 heap->heap[loc].obj = heap->heap[loc / 2].obj; in H5HP__swim_min()
221 heap->heap[loc].val = heap->heap[new_loc].val; in H5HP__sink_max()
222 heap->heap[loc].obj = heap->heap[new_loc].obj; in H5HP__sink_max()
289 heap->heap[loc].val = heap->heap[new_loc].val; in H5HP__sink_min()
290 heap->heap[loc].obj = heap->heap[new_loc].obj; in H5HP__sink_min()
484 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
602 heap->heap[1].val = heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/HDF5/src/itkhdf5/src/ |
| H A D | H5HP.c | 98 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_max()
99 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_max()
156 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_min()
157 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_min()
225 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_max()
226 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_max()
294 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_min()
295 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_min()
492 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
612 heap->heap[1].val=heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/science/hdf5-18/hdf5-1.8.21/src/ |
| H A D | H5HP.c | 98 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_max()
99 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_max()
156 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_min()
157 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_min()
225 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_max()
226 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_max()
294 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_min()
295 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_min()
492 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
612 heap->heap[1].val=heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/science/hdf5/hdf5-1.10.6/src/ |
| H A D | H5HP.c | 98 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_max()
99 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_max()
156 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_min()
157 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_min()
225 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_max()
226 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_max()
294 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_min()
295 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_min()
492 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
612 heap->heap[1].val=heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
| H A D | H5HP.c | 98 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_max()
99 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_max()
156 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_min()
157 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_min()
225 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_max()
226 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_max()
294 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_min()
295 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_min()
492 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
612 heap->heap[1].val=heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/math/vtk6/VTK-6.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
| H A D | H5HP.c | 100 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_max()
101 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_max()
158 heap->heap[loc].val=heap->heap[loc/2].val; in H5HP_swim_min()
159 heap->heap[loc].obj=heap->heap[loc/2].obj; in H5HP_swim_min()
227 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_max()
228 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_max()
296 heap->heap[loc].val=heap->heap[new_loc].val; in H5HP_sink_min()
297 heap->heap[loc].obj=heap->heap[new_loc].obj; in H5HP_sink_min()
494 heap->heap[heap->nobjs].obj->heap_loc = heap->nobjs; in H5HP_insert()
614 heap->heap[1].val=heap->heap[heap->nobjs].val; in H5HP_remove()
[all …]
|
| /dports/cad/pcb/pcb-4.2.0/src/ |
| H A D | heap.c | 102 return heap && (heap->max == 0 || heap->element) && in __heap_is_good()
104 (heap->max == 0 || heap->size < heap->max) && in __heap_is_good()
136 assert (heap && *heap); in heap_destroy()
151 for ( ; heap->size; heap->size--) in heap_free()
153 if (heap->element[heap->size].data) in heap_free()
165 assert (heap && heap->size < heap->max); in __upheap()
181 if (heap->size + 1 >= heap->max) in heap_insert()
190 assert (heap->size < heap->max); in heap_insert()
191 heap->element[heap->size].cost = cost; in heap_insert()
210 assert (heap && heap->size < heap->max); in __downheap()
[all …]
|
| /dports/net-mgmt/zabbix5-agent/zabbix-5.0.19/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix4-proxy/zabbix-4.0.30/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix54-proxy/zabbix-5.4.9/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix54-server/zabbix-5.4.9/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix54-agent/zabbix-5.4.9/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix5-server/zabbix-5.0.19/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix5-proxy/zabbix-5.0.19/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix5-java/zabbix-5.0.19/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix5-frontend/zabbix-5.0.19/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix54-java/zabbix-5.4.9/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix54-frontend/zabbix-5.4.9/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix4-java/zabbix-4.0.30/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix4-agent/zabbix-4.0.30/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix4-server/zabbix-4.0.30/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix4-frontend/zabbix-4.0.30/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
68 else if (heap->elems_num == heap->elems_alloc) in __binary_heap_ensure_free_space()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
[all …]
|
| /dports/net-mgmt/zabbix3-proxy/zabbix-3.0.32/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
309 heap->elems[index] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_direct()
[all …]
|
| /dports/net-mgmt/zabbix3-java/zabbix-3.0.32/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
309 heap->elems[index] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_direct()
[all …]
|
| /dports/net-mgmt/zabbix3-server/zabbix-3.0.32/src/libs/zbxalgo/ |
| H A D | binaryheap.c | 43 heap->elems[index_1] = heap->elems[index_2]; in swap()
89 if (heap->compare_func(&heap->elems[(index - 1) / 2], &heap->elems[index]) <= 0) in __binary_heap_bubble_up()
111 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
120 if (heap->compare_func(&heap->elems[left], &heap->elems[right]) <= 0) in __binary_heap_bubble_down()
122 if (heap->compare_func(&heap->elems[index], &heap->elems[left]) > 0) in __binary_heap_bubble_down()
132 if (heap->compare_func(&heap->elems[index], &heap->elems[right]) > 0) in __binary_heap_bubble_down()
188 heap->mem_free_func(heap->elems); in zbx_binary_heap_destroy()
199 heap->mem_free_func(heap->key_index); in zbx_binary_heap_destroy()
285 heap->elems[0] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_min()
309 heap->elems[index] = heap->elems[heap->elems_num]; in zbx_binary_heap_remove_direct()
[all …]
|