Sha256: 8b9d7a0cb9c032495fb4c418205947bebae036b4ff12c2768db6151da1218218
Contents?: true
Size: 1.41 KB
Versions: 5
Compression:
Stored size: 1.41 KB
Contents
// File: lzham_utils.h
// See Copyright Notice and license at the end of include/lzham.h
#pragma once
#define LZHAM_GET_ALIGNMENT(v) ((!sizeof(v)) ? 1 : (__alignof(v) ? __alignof(v) : sizeof(uint32)))
#define LZHAM_MIN(a, b) (((a) < (b)) ? (a) : (b))
#define LZHAM_MAX(a, b) (((a) < (b)) ? (b) : (a))
template<class T, size_t N> T decay_array_to_subtype(T (&a)[N]);
#define LZHAM_ARRAY_SIZE(X) (sizeof(X) / sizeof(decay_array_to_subtype(X)))
namespace lzham
{
namespace utils
{
template<typename T> inline void swap(T& l, T& r)
{
T temp(l);
l = r;
r = temp;
}
template<typename T> inline void zero_object(T& obj)
{
memset(&obj, 0, sizeof(obj));
}
static inline uint32 swap32(uint32 x) { return ((x << 24U) | ((x << 8U) & 0x00FF0000U) | ((x >> 8U) & 0x0000FF00U) | (x >> 24U)); }
inline uint count_leading_zeros16(uint v)
{
LZHAM_ASSERT(v < 0x10000);
uint temp;
uint n = 16;
temp = v >> 8;
if (temp) { n -= 8; v = temp; }
temp = v >> 4;
if (temp) { n -= 4; v = temp; }
temp = v >> 2;
if (temp) { n -= 2; v = temp; }
temp = v >> 1;
if (temp) { n -= 1; v = temp; }
if (v & 1) n--;
return n;
}
} // namespace utils
} // namespace lzham
Version data entries
5 entries across 5 versions & 1 rubygems