mirror of
https://github.com/minetest/irrlicht.git
synced 2024-12-25 02:00:30 +01:00
0c6385cb92
Usually something like __IRR_SOME_GUARD_INCLUDED__ replaced by IRR_SOME_GUARD_INCLUDED. Removing underscores at the end wasn't necessary, but more symmetric (probably the reason they got added there as well). While this touches every header it shouldn't affect users (I hope). Also a few whitespace changes to unify whitespace usage a bit. And a bunch of spelling fixes in comments. git-svn-id: svn://svn.code.sf.net/p/irrlicht/code/trunk@6252 dfc29bdd-3216-0410-991c-e03cc46cb475
71 lines
1.4 KiB
C++
71 lines
1.4 KiB
C++
// Copyright (C) 2002-2012 Nikolaus Gebhardt
|
|
// This file is part of the "Irrlicht Engine".
|
|
// For conditions of distribution and use, see copyright notice in irrlicht.h
|
|
|
|
#ifndef IRR_HEAPSORT_H_INCLUDED
|
|
#define IRR_HEAPSORT_H_INCLUDED
|
|
|
|
#include "irrTypes.h"
|
|
|
|
namespace irr
|
|
{
|
|
namespace core
|
|
{
|
|
|
|
//! Sinks an element into the heap.
|
|
template<class T>
|
|
inline void heapsink(T*array, s32 element, s32 max)
|
|
{
|
|
while ((element<<1) < max) // there is a left child
|
|
{
|
|
s32 j = (element<<1);
|
|
|
|
if (j+1 < max && array[j] < array[j+1])
|
|
j = j+1; // take right child
|
|
|
|
if (array[element] < array[j])
|
|
{
|
|
T t = array[j]; // swap elements
|
|
array[j] = array[element];
|
|
array[element] = t;
|
|
element = j;
|
|
}
|
|
else
|
|
return;
|
|
}
|
|
}
|
|
|
|
|
|
//! Sorts an array with size 'size' using heapsort.
|
|
template<class T>
|
|
inline void heapsort(T* array_, s32 size)
|
|
{
|
|
// for heapsink we pretend this is not c++, where
|
|
// arrays start with index 0. So we decrease the array pointer,
|
|
// the maximum always +2 and the element always +1
|
|
|
|
T* virtualArray = array_ - 1;
|
|
s32 virtualSize = size + 2;
|
|
s32 i;
|
|
|
|
// build heap
|
|
|
|
for (i=((size-1)/2); i>=0; --i)
|
|
heapsink(virtualArray, i+1, virtualSize-1);
|
|
|
|
// sort array, leave out the last element (0)
|
|
for (i=size-1; i>0; --i)
|
|
{
|
|
T t = array_[0];
|
|
array_[0] = array_[i];
|
|
array_[i] = t;
|
|
heapsink(virtualArray, 1, i + 1);
|
|
}
|
|
}
|
|
|
|
} // end namespace core
|
|
} // end namespace irr
|
|
|
|
#endif
|
|
|