1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
#include "defs.hh"
#include "heap.hh"
/*
Copyright (c) 2003-2015 Tommi Junttila
Released under the GNU Lesser General Public License version 3.
This file is part of bliss.
bliss is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, version 3 of the License.
bliss is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with bliss. If not, see <http://www.gnu.org/licenses/>.
*/
namespace bliss {
Heap::~Heap()
{
if(array)
{
free(array);
array = 0;
n = 0;
N = 0;
}
}
void Heap::upheap(unsigned int index)
{
const unsigned int v = array[index];
array[0] = 0;
while(array[index/2] > v)
{
array[index] = array[index/2];
index = index/2;
}
array[index] = v;
}
void Heap::downheap(unsigned int index)
{
const unsigned int v = array[index];
const unsigned int lim = n/2;
while(index <= lim)
{
unsigned int new_index = index + index;
if((new_index < n) and (array[new_index] > array[new_index+1]))
new_index++;
if(v <= array[new_index])
break;
array[index] = array[new_index];
index = new_index;
}
array[index] = v;
}
void Heap::init(const unsigned int size)
{
if(size > N)
{
if(array)
free(array);
array = (unsigned int*)malloc((size + 1) * sizeof(unsigned int));
N = size;
}
n = 0;
}
void Heap::insert(const unsigned int v)
{
array[++n] = v;
upheap(n);
}
unsigned int Heap::remove()
{
const unsigned int v = array[1];
array[1] = array[n--];
downheap(1);
return v;
}
} // namespace bliss
|
