/* * Copyright (c) 2018-2021, Andreas Kling * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this * list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #include #include constexpr unsigned round_up_to_power_of_two(unsigned value, unsigned power_of_two) { return ((value - 1) & ~(power_of_two - 1)) + power_of_two; } namespace std { // NOTE: This is in the "std" namespace since some compiler features rely on it. template constexpr T&& move(T& arg) { return static_cast(arg); } } using std::move; namespace AK { template auto declval() -> T; template constexpr T&& forward(RemoveReference& param) { return static_cast(param); } template constexpr T&& forward(RemoveReference&& param) noexcept { static_assert(!IsLvalueReference, "Can't forward an rvalue as an lvalue."); return static_cast(param); } template constexpr SizeType array_size(T (&)[N]) { return N; } template constexpr T min(const T& a, const T& b) { return b < a ? b : a; } template constexpr T max(const T& a, const T& b) { return a < b ? b : a; } template constexpr T clamp(const T& value, const T& min, const T& max) { VERIFY(max >= min); if (value > max) return max; if (value < min) return min; return value; } template constexpr T ceil_div(T a, U b) { static_assert(sizeof(T) == sizeof(U)); T result = a / b; if ((a % b) != 0) ++result; return result; } template inline void swap(T& a, U& b) { U tmp = move((U&)a); a = (T &&) move(b); b = move(tmp); } template constexpr T exchange(T& slot, U&& value) { T old_value = move(slot); slot = forward(value); return old_value; } } using AK::array_size; using AK::ceil_div; using AK::clamp; using AK::declval; using AK::exchange; using AK::forward; using AK::max; using AK::min; using AK::swap;