aboutsummaryrefslogtreecommitdiffstats
path: root/chilbert/GrayCodeRank.hpp
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2018-08-19 16:47:38 +0200
committerDavid Robillard <d@drobilla.net>2018-09-29 14:49:01 +0200
commit03f39c8be08d632d1f982f5ba5f2e95256be1122 (patch)
tree41ae78da247659bf8261bdd2397fadf32550d2d9 /chilbert/GrayCodeRank.hpp
parentfa3d8f677b6a30c2115e7d167d4938e293dfad81 (diff)
downloadchilbert-03f39c8be08d632d1f982f5ba5f2e95256be1122.tar.gz
chilbert-03f39c8be08d632d1f982f5ba5f2e95256be1122.tar.bz2
chilbert-03f39c8be08d632d1f982f5ba5f2e95256be1122.zip
Use consistent naming scheme
Diffstat (limited to 'chilbert/GrayCodeRank.hpp')
-rw-r--r--chilbert/GrayCodeRank.hpp42
1 files changed, 21 insertions, 21 deletions
diff --git a/chilbert/GrayCodeRank.hpp b/chilbert/GrayCodeRank.hpp
index 1e3895f..d7fbc77 100644
--- a/chilbert/GrayCodeRank.hpp
+++ b/chilbert/GrayCodeRank.hpp
@@ -31,17 +31,17 @@ namespace chilbert {
// at each level of precision.
template <class H, class HC>
inline void
-compactIndex(const size_t* const ms,
- const size_t* const ds,
- const size_t n,
- const size_t m,
- H& h,
- HC& hc)
+compact_index(const size_t* const ms,
+ const size_t* const ds,
+ const size_t n,
+ const size_t m,
+ H& h,
+ HC& hc)
{
assert(h.size() >= n * m);
assert(hc.size() >= std::accumulate(ms, ms + n, size_t(0)));
- resetBits(hc);
+ reset_bits(hc);
auto hm = h.mask(0);
auto hcm = hc.mask(0);
@@ -69,7 +69,7 @@ compactIndex(const size_t* const ms,
template <class I>
inline void
-grayCodeRank(const I& mask, const I& gi, const size_t n, I& r)
+gray_code_rank(const I& mask, const I& gi, const size_t n, I& r)
{
assert(mask.size() == n);
assert(gi.size() == n);
@@ -93,13 +93,13 @@ grayCodeRank(const I& mask, const I& gi, const size_t n, I& r)
template <class I>
inline void
-grayCodeRankInv(const I& mask,
- const I& ptrn,
- const I& r,
- const size_t n,
- const size_t b,
- I& g,
- I& gi)
+gray_code_rank_inv(const I& mask,
+ const I& ptrn,
+ const I& r,
+ const size_t n,
+ const size_t b,
+ I& g,
+ I& gi)
{
assert(mask.size() == n);
assert(ptrn.size() == n);
@@ -147,12 +147,12 @@ grayCodeRankInv(const I& mask,
template <class I>
inline void
-extractMask(const size_t* const ms,
- const size_t n,
- const size_t d,
- const size_t i,
- I& mask,
- size_t& b)
+extract_mask(const size_t* const ms,
+ const size_t n,
+ const size_t d,
+ const size_t i,
+ I& mask,
+ size_t& b)
{
assert(0 <= d && d < n);
assert(mask.size() == n);