/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* vim: set ts=8 sts=2 et sw=2 tw=80: */ /* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this file,
* You can obtain one at http://mozilla.org/MPL/2.0/. */
#include"mozilla/MathAlgorithms.h"
using mozilla::CeilingLog2; using mozilla::FloorLog2; using mozilla::RoundUpPow2;
staticvoid TestCeiling() { for (uint32_t i = 0; i <= 1; i++) {
MOZ_RELEASE_ASSERT(CeilingLog2(i) == 0);
} for (uint32_t i = 2; i <= 2; i++) {
MOZ_RELEASE_ASSERT(CeilingLog2(i) == 1);
} for (uint32_t i = 3; i <= 4; i++) {
MOZ_RELEASE_ASSERT(CeilingLog2(i) == 2);
} for (uint32_t i = 5; i <= 8; i++) {
MOZ_RELEASE_ASSERT(CeilingLog2(i) == 3);
} for (uint32_t i = 9; i <= 16; i++) {
MOZ_RELEASE_ASSERT(CeilingLog2(i) == 4);
}
}
staticvoid TestFloor() { for (uint32_t i = 0; i <= 1; i++) {
MOZ_RELEASE_ASSERT(FloorLog2(i) == 0);
} for (uint32_t i = 2; i <= 3; i++) {
MOZ_RELEASE_ASSERT(FloorLog2(i) == 1);
} for (uint32_t i = 4; i <= 7; i++) {
MOZ_RELEASE_ASSERT(FloorLog2(i) == 2);
} for (uint32_t i = 8; i <= 15; i++) {
MOZ_RELEASE_ASSERT(FloorLog2(i) == 3);
} for (uint32_t i = 16; i <= 31; i++) {
MOZ_RELEASE_ASSERT(FloorLog2(i) == 4);
}
}
size_t MaxPow2 = size_t(1) << (sizeof(size_t) * CHAR_BIT - 1);
MOZ_RELEASE_ASSERT(RoundUpPow2(MaxPow2 - 1) == MaxPow2);
MOZ_RELEASE_ASSERT(RoundUpPow2(MaxPow2) == MaxPow2); // not valid to round up when past the max power of two
}
int main() {
TestCeiling();
TestFloor();
TestRoundUpPow2(); return 0;
}
[ zur Elbe Produktseite wechseln0.15Quellennavigators
Analyse erneut starten
]