summaryrefslogtreecommitdiff
path: root/src/heap.h
blob: 0ca4422dce4b1e948ffad566340d9f6acd5a0b31 (plain)
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
/*
 * Copyright (C) 2007-2008 Xagasoft, All rights reserved.
 *
 * This file is part of the libbu++ library and is released under the
 * terms of the license contained in the file LICENSE.
 */

#ifndef BU_HEAP_H
#define BU_HEAP_H

#include <stddef.h>
#include <string.h>
#include <memory>
#include <iostream>
#include "bu/util.h"

namespace Bu
{
	template<typename item>
	struct __basicLTCmp
	{
		bool operator()( const item &a, const item &b )
		{
			return a <= b;
		}
	};

	template<typename item, typename cmpfunc=__basicLTCmp<item>, typename itemalloc=std::allocator<item> >
	class Heap
	{
	public:
		Heap() :
			iSize( 40 ),
			iFill( 0 ),
			aItem( new item[iSize] )
		{
		}

		virtual ~Heap()
		{
			delete[] aItem;
			aItem = NULL;
		}

		void push( item i )
		{
			for( int j = 0; j < iFill; )
			{
				if( cmp( i, aItem[j] ) )
				{
					swap( i, aItem[j] );
				}

				if( cmp( i, aItem[j*2+1] ) )
				{
					j = j*2+1;
				}
				else
				{
					j = j*2+2;
				}
			}
			aItem[iFill] = i;
			for( int j = iFill; j >= 0; )
			{
				int k = (j-1)/2;
				if( cmp( aItem[k], aItem[j] ) )
					break;

				swap( aItem[k], aItem[j] );
				j = k;
			}
			iFill++;
		}

		item &peek()
		{
			return aItem[0];
		}

		void pop()
		{
			int j;
			for( j = 0; j < iFill; )
			{
				if( cmp( aItem[j*2+2], aItem[j*2+1] ) && j*2+2 < iFill )
				{
					aItem[j] = aItem[j*2+2];
					j = j*2+2;
				}
				else if( j*2+1 < iFill )
				{
					aItem[j] = aItem[j*2+1];
					j = j*2+1;
				}
				else
					break;
			}
			aItem[j] = aItem[iFill-1];
			iFill--;
		}

		void print()
		{
			printf("graph G {\n");
			for( int j = 0; j < iFill; j++ )
			{
				if( j*2+1 < iFill )
					printf("    %d -- %d;\n",
							j, j*2+1
						  );
				if( j*2+2 < iFill )
					printf("    %d -- %d;\n",
							j, j*2+2
						  );
			}
			for( int j = 0; j < iFill; j++ )
			{
				printf("    %d [label=\"%d\"];\n",
						j, aItem[j]
					  );
			}
			printf("}\n");
		}		

	private:
		int iSize;
		int iFill;
		item *aItem;
		cmpfunc cmp;
	};
};

#endif