Sorting Network Verify and Draw
Check Whether Comparator Networks Sort and Draw Them
Helpers.cpp
Go to the documentation of this file.
1
3
4// MIT License
5//
6// Copyright (c) 2022 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 deal
10// in the Software without restriction, including without limitation the rights
11// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
12// 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 all
16// 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 FROM,
23// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
24// SOFTWARE.
25
26#include "Helpers.h"
27
31
32bool odd(const UINT n){
33 return n & 1; //obvious, really
34} //odd
35
39
40bool IsPowerOf2(const UINT n){
41 return n && !(n & (n - 1)); //tricksy
42} //IsPowerOf2
43
51
52UINT CeilLog2(const UINT n){
53 if(n == 0)return 0; //safety
54
55 DWORD k = 0; //for index of most significant 1
56 _BitScanReverse(&k, n); //find index of most significant 1
57
58 return IsPowerOf2(n)? k: k + 1;
59} //NextPowerOf2
bool odd(const UINT n)
Parity test.
Definition: Helpers.cpp:32
UINT CeilLog2(const UINT n)
Ceiling of log base 2.
Definition: Helpers.cpp:52
bool IsPowerOf2(const UINT n)
Power of 2 test.
Definition: Helpers.cpp:40
Header for useful helper functions.