Sorting Network Search
Backtracking for Small Sorting Networks
Matching.h
Go to the documentation of this file.
1
3
4// MIT License
5//
6// Copyright (c) 2023 Ian Parberry
7//
8// Permission is hereby granted, free of charge, to any person obtaining a copy
9// of this software and associated documentation files (the "Software"), to
10// deal in the Software without restriction, including without limitation the
11// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
12// sell copies of the Software, and to permit persons to whom the Software is
13// furnished to do so, subject to the following conditions:
14//
15// The above copyright notice and this permission notice shall be included in
16// all copies or substantial portions of the Software.
17//
18// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
21// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
23// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24// IN THE SOFTWARE.
25
26#ifndef __Matching_h__
27#define __Matching_h__
28
29#include <string>
30
31#include "Defines.h"
32#include "Settings.h"
33
38
39class CMatching: public CSettings{
40 private:
41 size_t m_nMatching[MAXINPUTS + 1] = {0};
42 size_t m_nMap[MAXINPUTS + 1] = {0};
43 int m_nStack[MAXINPUTS + 1] = {0};
44
45 void SwapPair(int[], size_t, size_t);
46
47 public:
48 CMatching();
49 CMatching(const CMatching&);
50
51 void Initialize();
52 bool Next();
53
54 void Swap(const size_t, const size_t);
55
56 void Normalize();
57
58 size_t& operator[](const size_t);
59 const size_t operator[](const size_t) const;
60 operator std::string() const;
61}; //CMatching
62
63#endif //__Matching_h__
Useful definitions.
#define MAXINPUTS
Maximum width, that is, number of inputs.
Definition: Defines.h:29
Settings.
Perfect matching.
Definition: Matching.h:39
bool Next()
Advance to next matching.
Definition: Matching.cpp:62
void Normalize()
Normalize.
Definition: Matching.cpp:117
CMatching()
Void constructor.
Definition: Matching.cpp:32
int m_nStack[MAXINPUTS+1]
Stack to remove recursion from permutation.
Definition: Matching.h:43
void Initialize()
Initialize.
Definition: Matching.cpp:50
size_t & operator[](const size_t)
Overloaded index operator.
Definition: Matching.cpp:185
void Swap(const size_t, const size_t)
Swap.
Definition: Matching.cpp:148
size_t m_nMap[MAXINPUTS+1]
Matching index map.
Definition: Matching.h:42
size_t m_nMatching[MAXINPUTS+1]
Matching.
Definition: Matching.h:41
void SwapPair(int[], size_t, size_t)
Swap pair.
Definition: Matching.cpp:99
The common variables class.
Definition: Settings.h:37