/usr/include/vdk2/vdk/vdkheap.h is in libvdk2-dev 2.4.0-5.3ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*
* ===========================
* VDK Visual Development Kit
* Version 0.4
* October 1998
* ===========================
*
* Copyright (C) 1998, Mario Motta
* Developed by Mario Motta <mmotta@guest.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-130
*/
#ifndef VDKHEAP_H
#define VDKHEAP_H
#include <vdk/container.h>
inline int parent(int i) { return ((i-1) >> 1); }
inline int left(int i) { return ((i << 1) + 1); }
inline int right(int i) { return ((i << 1) + 2); }
/*!
\class VDKHeap
\brief provide a templatized Heap
\par Description
VDKHeap<T> class has a value semantic, all objects are copied
from original values.
All managed type T objects should provide:
\arg a default constructor: T::T()
\arg a copy initializer: T::T(T& t)
\arg an assignement operator: T& T::operator=(T& t)
\arg an equality and less-than operators:
\arg bool T::operator==(T& t)
\arg bool T::operator<(T& t)
\par Implementation notes
I suggest to use typedef's like:
\code
typedef VDKHeap<someClass> SomeClassHeap;
\endcode
*/
template <class T> class VDKHeap: public VDKContainer<T>
{
public:
/*!
Constructor
makes an empty heap
*/
VDKHeap(): VDKContainer<T>(0) {}
/*!
Constructor
\param source an array of type T obejcts
\param array size
*/
VDKHeap(T* source, int size);
/*!
Destructor
*/
virtual ~VDKHeap() {}
/*!
Sorts on nlog(n) time
*/
void Sort(void);
protected:
void Heapify(int i,int heapsize);
void BuildHeap(void);
};
// make an heap copyng data from T type source vector
template <class T>
VDKHeap<T>::VDKHeap(T* source, int size): VDKContainer<T>(size)
{
for(int i = 0; i < size; i++)
this->data[i] = source[i];
BuildHeap();
}
// HEAPIFY
template <class T>
void VDKHeap<T>::Heapify(int i, int heapsize)
{
int l = left(i), r = right(i), largest = i;
if( (l < heapsize) && (this->data[l] > this->data[i])) largest = l;
if( (r < heapsize) && (this->data[r] > this->data[largest])) largest = r;
if(largest != i)
{
T temp = this->data[i];
this->data[i] = this->data[largest];
this->data[largest] = temp;
Heapify(largest,heapsize);
}
}
// BUILDHEAP
template <class T>
void VDKHeap<T>::BuildHeap(void)
{
for (int i = (this->size()-1)/2 ; i >= 0; i--)
Heapify(i,this->size());
}
// HEAPSORT
template <class T>
void VDKHeap<T>::Sort(void)
{
int heapsize = this->size();
int i = heapsize-1;
for(; i > 0; i--)
{
T temp = this->data[0];
this->data[0] = this->data[i];
this->data[i] = temp;
heapsize--;
Heapify(0,heapsize);
}
}
#endif
|