From ac65326242af579d6e1a7bd71730f1c78c8bde9b Mon Sep 17 00:00:00 2001 From: David Robillard Date: Sun, 19 Aug 2018 18:22:26 +0200 Subject: Reorganize headers to make a clear public/private distinction --- chilbert/Operations.hpp | 166 ------------------------------------------------ 1 file changed, 166 deletions(-) delete mode 100644 chilbert/Operations.hpp (limited to 'chilbert/Operations.hpp') diff --git a/chilbert/Operations.hpp b/chilbert/Operations.hpp deleted file mode 100644 index 24474cc..0000000 --- a/chilbert/Operations.hpp +++ /dev/null @@ -1,166 +0,0 @@ -/* - Copyright (C) 2018 David Robillard - Copyright (C) 2006-2007 Chris Hamilton - - This program is free software: you can redistribute it and/or modify it under - the terms of the GNU General Public License as published by the Free Software - Foundation, either version 2 of the License, or (at your option) any later - version. - - This program is distributed in the hope that it will be useful, but WITHOUT - ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS - FOR A PARTICULAR PURPOSE. See the GNU General Public License for more - details. - - You should have received a copy of the GNU General Public License along with - this program. If not, see . -*/ - -#ifndef CHILBERT_OPERATIONS_HPP -#define CHILBERT_OPERATIONS_HPP - -#include "chilbert/Operators.hpp" -#include "chilbert/Traits.hpp" - -#include -#include -#include -#include -#include - -namespace chilbert { - -/// Reset all bits in `field` -template -std::enable_if_t::value> -reset_bits(T& field) -{ - field = static_cast(0); -} - -/// Reset all bits in `field` -template -std::enable_if_t> -reset_bits(T& field) -{ - field.reset(); -} - -/// Return the `index`th bit in `field` -template -std::enable_if_t::value, bool> -test_bit(const T& field, const size_t index) -{ - assert(size_t(index) < sizeof(field) * CHAR_BIT); - return field & (T{1} << index); -} - -/// Return the `index`th bit in `field` -template -std::enable_if_t, bool> -test_bit(const T& field, const size_t index) -{ - return field.test(index); -} - -/// Set the `index`th bit in `field` -template -std::enable_if_t::value> -set_bit(T& field, const size_t index) -{ - assert(size_t(index) < sizeof(field) * CHAR_BIT); - field |= (T{1} << index); - assert(test_bit(field, index)); -} - -/// Set the `index`th bit in `field` to `value` -template -std::enable_if_t::value> -set_bit(T& field, const size_t index, const bool value) -{ - assert(size_t(index) < sizeof(field) * CHAR_BIT); - field ^= (-T{value} ^ field) & (T{1U} << index); - assert(test_bit(field, index) == value); -} - -/// Set the `index`th bit in `field` -template -std::enable_if_t> -set_bit(T& field, const size_t index) -{ - field.set(index); -} - -/// Set the `index`th bit in `field` to `value` -template -std::enable_if_t> -set_bit(T& field, const size_t index, const bool value) -{ - field.set(index, value); -} - -/// Return 1 + the index of the least significant 1-bit of `field`, or zero -template -int pop_count(const T& field); - -template <> -int -pop_count(const unsigned long& field) -{ - return __builtin_popcountl(field); -} - -template <> -int -pop_count(const unsigned long long& field) -{ - return __builtin_popcountll(field); -} - -/// Return 1 + the index of the least significant 1-bit of `field`, or zero -template -int find_first(const T field); - -template <> -int -find_first(const unsigned long field) -{ - return __builtin_ffsl(static_cast(field)); -} - -template <> -int -find_first(const unsigned long long field) -{ - return __builtin_ffsll(static_cast(field)); -} - -/// Calculates the Gray Code of `value` in place -template -std::enable_if_t> gray_code(T& value); - -/// Implementation of grayCode for any integral type -template -std::enable_if_t::value> -gray_code(T& value) -{ - value ^= (value >> 1); -} - -/// Calculates the inverse Gray Code of `value` in place -template -std::enable_if_t> gray_code_inv(T& value); - -/// Implementation of gray_code_inv for any integral type -template -std::enable_if_t::value> -gray_code_inv(T& value) -{ - for (T shift = 1; shift < sizeof(T) * CHAR_BIT; shift <<= 1) { - value ^= (value >> shift); - } -} - -} // namespace chilbert - -#endif -- cgit v1.2.1