Sorting Network Search
Backtracking for Small Sorting Networks
Src
Defines.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 __Defines_h__
27
#define __Defines_h__
28
29
#define MAXINPUTS 12
30
#define MAXDEPTH 7
31
32
#define odd(n) ((n) & 1)
33
#define xor(i, j) (((i) && (j)) || !((i) || (j)))
34
35
#define oddfloor(n) (odd(n)?(n):((n)-1))
36
#define evenfloor(n) (odd(n)?(n)-1:((n)))
37
38
#define evenceil(n) (odd(n)?((n)+1):(n))
39
40
#endif
//__Defines_h__
Generated on Mon May 15 2023 13:01:18 for Sorting Network Search by
1.9.4