mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-10 18:51:21 +03:00
113 lines
3.8 KiB
C++
Executable File
113 lines
3.8 KiB
C++
Executable File
// Created on: 2011-01-27
|
|
// Created by: KGV
|
|
// Copyright (c) 2011-2012 OPEN CASCADE SAS
|
|
//
|
|
// The content of this file is subject to the Open CASCADE Technology Public
|
|
// License Version 6.5 (the "License"). You may not use the content of this file
|
|
// except in compliance with the License. Please obtain a copy of the License
|
|
// at http://www.opencascade.org and read it completely before using this file.
|
|
//
|
|
// The Initial Developer of the Original Code is Open CASCADE S.A.S., having its
|
|
// main offices at: 1, place des Freres Montgolfier, 78280 Guyancourt, France.
|
|
//
|
|
// The Original Code and all software distributed under the License is
|
|
// distributed on an "AS IS" basis, without warranty of any kind, and the
|
|
// Initial Developer hereby disclaims all such warranties, including without
|
|
// limitation, any warranties of merchantability, fitness for a particular
|
|
// purpose or non-infringement. Please see the License for the specific terms
|
|
// and conditions governing the rights and limitations under the License.
|
|
|
|
|
|
#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*/
|