mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-16 10:08:36 +03:00
d5f74e42d6
License statement text corrected; compiler warnings caused by Bison 2.41 disabled for MSVC; a few other compiler warnings on 54-bit Windows eliminated by appropriate type cast Wrong license statements corrected in several files. Copyright and license statements added in XSD and GLSL files. Copyright year updated in some files. Obsolete documentation files removed from DrawResources.
108 lines
3.5 KiB
C++
108 lines
3.5 KiB
C++
// Created on: 2011-01-27
|
|
// Created by: KGV
|
|
// Copyright (c) 2011-2014 OPEN CASCADE SAS
|
|
//
|
|
// This file is part of Open CASCADE Technology software library.
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU Lesser General Public License version 2.1 as published
|
|
// by the Free Software Foundation, with special exception defined in the file
|
|
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
|
// distribution for complete text of the license and disclaimer of any warranty.
|
|
//
|
|
// Alternatively, this file may be used under the terms of Open CASCADE
|
|
// commercial license or contractual agreement.
|
|
|
|
#ifndef _NCollection_QuickSort_HeaderFile
|
|
#define _NCollection_QuickSort_HeaderFile
|
|
|
|
#include <NCollection_Comparator.hxx>
|
|
#include <Standard_Integer.hxx>
|
|
|
|
/**
|
|
* Perform sorting of enumerable collection with QuickSort algorithm.
|
|
* Enumerable collection should provide the random access to its values
|
|
* by index number with methods Value(theId) and ChangeValue(theId).
|
|
* Currently it supposed to be used with NCollection_Sequence and NCollection_Vector.
|
|
*
|
|
* Usage sample:
|
|
* // input sequence
|
|
* NCollection_Sequence<Standard_Real> aSequence;
|
|
* // perform sorting for the whole sequence.
|
|
* NCollection_QuickSort<NCollection_Sequence<Standard_Real>, Standard_Real>
|
|
* ::Perform (aSequence, NCollection_Comparator<Standard_Real>(),
|
|
* 1, aSequence.Size());
|
|
*/
|
|
template<class TheCollType, class TheItemType>
|
|
class NCollection_QuickSort
|
|
{
|
|
public:
|
|
|
|
//! Main entry call to perform sorting
|
|
static void Perform (TheCollType& theEnumColl,
|
|
const NCollection_Comparator<TheItemType>& theComparator,
|
|
const Standard_Integer theLower,
|
|
const Standard_Integer theUpper)
|
|
{
|
|
if (theLower < theUpper)
|
|
{
|
|
Standard_Integer aPivotPosition = Partition (theEnumColl, theComparator,
|
|
theLower, theUpper);
|
|
if (theLower < aPivotPosition)
|
|
{
|
|
// recursive call
|
|
Perform (theEnumColl, theComparator,
|
|
theLower, aPivotPosition - 1);
|
|
}
|
|
// recursive call
|
|
Perform (theEnumColl, theComparator,
|
|
aPivotPosition + 1, theUpper);
|
|
}
|
|
}
|
|
|
|
private:
|
|
|
|
//! Auxiliary function
|
|
static void SwapValues (TheItemType& x, TheItemType& y)
|
|
{
|
|
TheItemType aCopy = x;
|
|
x = y;
|
|
y = aCopy;
|
|
}
|
|
|
|
static Standard_Integer Partition (TheCollType& theEnumColl,
|
|
const NCollection_Comparator<TheItemType>& theComparator,
|
|
const Standard_Integer theLower,
|
|
const Standard_Integer theUpper)
|
|
{
|
|
Standard_Integer anIdLeft (theLower), anIdRight (theUpper);
|
|
const TheItemType aPivot = theEnumColl.Value (theLower);
|
|
|
|
while (anIdLeft < anIdRight)
|
|
{
|
|
while (theComparator.IsGreater (theEnumColl.Value (anIdRight), aPivot))
|
|
{
|
|
--anIdRight;
|
|
}
|
|
while ((anIdLeft < anIdRight) &&
|
|
theComparator.IsLowerEqual (theEnumColl.Value (anIdLeft), aPivot))
|
|
{
|
|
++anIdLeft;
|
|
}
|
|
|
|
if (anIdLeft < anIdRight)
|
|
{
|
|
SwapValues (theEnumColl.ChangeValue (anIdLeft),
|
|
theEnumColl.ChangeValue (anIdRight));
|
|
}
|
|
}
|
|
|
|
theEnumColl.ChangeValue (theLower) = theEnumColl.Value (anIdRight);
|
|
theEnumColl.ChangeValue (anIdRight) = aPivot;
|
|
return anIdRight;
|
|
}
|
|
|
|
};
|
|
|
|
#endif /*_NCollection_QuickSort_HeaderFile*/
|