Bitonic.h

Go to the documentation of this file.

 
 
// MIT License
//
// Copyright (c) 2022 Ian Parberry
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
 
#ifndef __Bitonic_h__
#define __Bitonic_h__
 
#include "SortingNetwork.h"
 
 
class CComparator{
  public:
    UINT m_nMin = 0; 
    UINT m_nMax = 0; 
 
 
    CComparator(UINT nMin, UINT nMax): m_nMin(nMin), m_nMax(nMax){}; 
}; //CComparator
 
 
class CBitonicSort: public CSortingNetwork{
  private:
    void CreateComparators(std::vector<CComparator>*); 
    void MakeAllMinMax(std::vector<CComparator>*); 
    void Twist(std::vector<CComparator>*, UINT, UINT, UINT); 
    void CreateMatchArray(std::vector<CComparator>*); 
 
  public:
    CBitonicSort(const UINT); 
    const std::wstring GetName() const; 
}; //CBitonicSort
 
#endif //__Bitonic_h__