// Created on: 2014-01-10
// Created by: Denis BOGOLEPOV
// Copyright (c) 2013-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 BVH_Sorter_HeaderFile
#define BVH_Sorter_HeaderFile

#include <BVH_Set.hxx>

//! Tool object to sort abstract primitive set.
template <class T, int N>
class BVH_Sorter
{
public:
  //! Performs default initialization.
  BVH_Sorter()
      : myIsParallel(false)
  {
  }

  //! Releases resources of BVH sorter.
  virtual ~BVH_Sorter() = default;

  //! Sorts the set.
  virtual void Perform(BVH_Set<T, N>* theSet) = 0;

  //! Sorts the given (inclusive) range in the set.
  virtual void Perform(BVH_Set<T, N>* theSet, const int theStart, const int theFinal) = 0;

  //! Returns parallel flag.
  inline bool IsParallel() const { return myIsParallel; }

  //! Set parallel flag controlling possibility of parallel execution.
  inline void SetParallel(const bool isParallel) { myIsParallel = isParallel; }

private:
  bool myIsParallel;
};

#endif // _BVH_Sorter_Header
