mirror of https://github.com/mosra/magnum.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
90 lines
3.0 KiB
90 lines
3.0 KiB
14 years ago
|
/*
|
||
|
|
Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>
|
||
|
|
|
||
|
|
This file is part of Magnum.
|
||
|
|
|
||
|
|
Magnum is free software: you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU Lesser General Public License version 3
|
||
|
|
only, as published by the Free Software Foundation.
|
||
|
|
|
||
|
|
Magnum 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 Lesser General Public License version 3 for more details.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "CompressIndicesTest.h"
|
||
|
|
|
||
|
|
#include <QtTest/QTest>
|
||
|
|
|
||
|
|
#include "Utility/Endianness.h"
|
||
|
|
#include "MeshTools/CompressIndices.h"
|
||
|
|
|
||
|
|
QTEST_APPLESS_MAIN(Magnum::MeshTools::Test::CompressIndicesTest)
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
using namespace Corrade::Utility;
|
||
|
|
|
||
|
|
namespace Magnum { namespace MeshTools { namespace Test {
|
||
|
|
|
||
|
|
void CompressIndicesTest::compressChar() {
|
||
|
|
CompressIndices::Result result = MeshTools::compressIndices(
|
||
|
|
vector<unsigned int>{1, 2, 3, 0, 4});
|
||
|
|
|
||
|
|
QVERIFY(result.indexCount == 5);
|
||
|
|
QVERIFY(result.indexType == Type::UnsignedByte);
|
||
|
|
QVERIFY((vector<char>(result.data, result.data+result.indexCount*TypeInfo::sizeOf(result.indexType)) ==
|
||
|
|
vector<char>{ 0x01, 0x02, 0x03, 0x00, 0x04 }));
|
||
|
|
|
||
|
|
delete[] result.data;
|
||
|
|
}
|
||
|
|
|
||
|
|
void CompressIndicesTest::compressShort() {
|
||
|
|
CompressIndices::Result result = MeshTools::compressIndices(
|
||
|
|
vector<unsigned int>{1, 256, 0, 5});
|
||
|
|
|
||
|
|
QVERIFY(result.indexCount == 4);
|
||
|
|
QVERIFY(result.indexType == Type::UnsignedShort);
|
||
|
|
if(!Endianness::isBigEndian()) {
|
||
|
|
QVERIFY((vector<char>(result.data, result.data+result.indexCount*TypeInfo::sizeOf(result.indexType)) ==
|
||
|
|
vector<char>{ 0x01, 0x00,
|
||
|
|
0x00, 0x01,
|
||
|
|
0x00, 0x00,
|
||
|
|
0x05, 0x00 }));
|
||
|
|
} else {
|
||
|
|
QVERIFY((vector<char>(result.data, result.data+result.indexCount*TypeInfo::sizeOf(result.indexType)) ==
|
||
|
|
vector<char>{ 0x00, 0x01,
|
||
|
|
0x01, 0x00,
|
||
|
|
0x00, 0x00,
|
||
|
|
0x00, 0x05 }));
|
||
|
|
}
|
||
|
|
|
||
|
|
delete[] result.data;
|
||
|
|
}
|
||
|
|
|
||
|
|
void CompressIndicesTest::compressInt() {
|
||
|
|
CompressIndices::Result result = MeshTools::compressIndices(
|
||
|
|
vector<unsigned int>{65536, 3, 2});
|
||
|
|
|
||
|
|
QVERIFY(result.indexCount == 3);
|
||
|
|
QVERIFY(result.indexType == Type::UnsignedInt);
|
||
|
|
|
||
|
|
if(!Endianness::isBigEndian()) {
|
||
|
|
QVERIFY((vector<char>(result.data, result.data+result.indexCount*TypeInfo::sizeOf(result.indexType)) ==
|
||
|
|
vector<char>{ 0x00, 0x00, 0x01, 0x00,
|
||
|
|
0x03, 0x00, 0x00, 0x00,
|
||
|
|
0x02, 0x00, 0x00, 0x00
|
||
|
|
}));
|
||
|
|
} else {
|
||
|
|
QVERIFY((vector<char>(result.data, result.data+result.indexCount*TypeInfo::sizeOf(result.indexType)) ==
|
||
|
|
vector<char>{ 0x00, 0x01, 0x00, 0x00,
|
||
|
|
0x00, 0x00, 0x00, 0x03,
|
||
|
|
0x00, 0x00, 0x00, 0x02
|
||
|
|
}));
|
||
|
|
}
|
||
|
|
|
||
|
|
delete[] result.data;
|
||
|
|
}
|
||
|
|
|
||
|
|
}}}
|