Sorting Network Search
Backtracking for Small Sorting Networks
2NF.cpp
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#include "2NF.h"
27#include "Defines.h"
28
32
33C2NF::C2NF(CMatching& L2Matching, const size_t index):
35 m_nLevel2Index(index)
36{
37 m_nStack[0] = 0;
38 InitMatchingRepresentations(0); //the level 1 matching is the identity
39
40 for(int j=0; j<m_nWidth; j++)
41 m_cMatching[1][j] = L2Matching[j]; //install second level candidate
42} //constructor
43
46
49 SynchMatchingRepresentations(1); //synch representation for testing
50 FirstComparatorNetwork(2); //initialize from there down
51 Search(); //begin actual search
52} //Backtrack
53
60
62 std::string filename = //construct file name
63 "w" + std::to_string(m_nWidth) +
64 "d" + std::to_string(m_nDepth) +
65 "x" + std::to_string(m_nLevel2Index) +
66 "n" + std::to_string(m_nCount) + ".txt";
67
68 CComparatorNetwork::Save(filename); //save to file with that name
69} //Save
Interface for the searchable second normal form sorting network C2NF.
Useful definitions.
#define odd(n)
Oddness test.
Definition: Defines.h:32
void Save()
Save comparator network.
Definition: 2NF.cpp:61
C2NF(CMatching &, const size_t)
Constructor.
Definition: 2NF.cpp:33
void Backtrack()
Backtracking search.
Definition: 2NF.cpp:47
size_t m_nLevel2Index
Index of current level 2 candidate.
Definition: 2NF.h:40
void Save(const std::string &)
Save to file.
Perfect matching.
Definition: Matching.h:39
Searchable sorting network.
Definition: Searchable.h:39
size_t m_nCount
Number of comparator networks found that sort.
Definition: Searchable.h:41
void InitMatchingRepresentations(size_t)
Initialize the two different matching representations.
Definition: Searchable.cpp:120
int m_nStack[MAXDEPTH]
Stack to remove recursion from search.
Definition: Searchable.h:45
CMatching m_cMatching[MAXDEPTH]
Matchings that make up comparator network in a form that makes searching faster.
Definition: Searchable.h:43
void SynchMatchingRepresentations(size_t)
Synchronize the two different matching representations.
Definition: Searchable.cpp:102
void FirstComparatorNetwork(size_t)
Set to first comparator network.
Definition: Searchable.cpp:91
void Search()
Do the actual search.
Definition: Searchable.cpp:70
static size_t m_nWidth
Comparator network width.
Definition: Settings.h:39
static size_t m_nDepth
Comparator network depth.
Definition: Settings.h:40