Modifying files to let assimp build under cygwin.

pull/544/head
U-ORADEV\albihern 2015-04-20 17:36:47 -05:00
parent eb1ee61420
commit 7043551068
22 changed files with 437 additions and 441 deletions

View File

@ -1,3 +1,4 @@
set(CMAKE_LEGACY_CYGWIN_WIN32 0) # Remove when CMake >= 2.8.4 is required
cmake_minimum_required( VERSION 2.8 ) cmake_minimum_required( VERSION 2.8 )
PROJECT( Assimp ) PROJECT( Assimp )
@ -61,9 +62,9 @@ if( CMAKE_COMPILER_IS_MINGW )
endif() endif()
if((CMAKE_COMPILER_IS_GNUCC OR CMAKE_COMPILER_IS_GNUCXX) AND NOT CMAKE_COMPILER_IS_MINGW) if((CMAKE_COMPILER_IS_GNUCC OR CMAKE_COMPILER_IS_GNUCXX) AND NOT CMAKE_COMPILER_IS_MINGW)
add_definitions(-fPIC) # this is a very important switch and some libraries seem now to have it.... set(CMAKE_CXX_FLAGS "-fPIC") # this is a very important switch and some libraries seem now to have it....
# hide all not-exported symbols # hide all not-exported symbols
add_definitions( -fvisibility=hidden -Wall ) set(CMAKE_CXX_FLAGS "-fvisibility=hidden -Wall" )
elseif(MSVC) elseif(MSVC)
# enable multi-core compilation with MSVC # enable multi-core compilation with MSVC
add_definitions(/MP) add_definitions(/MP)

View File

@ -46,7 +46,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "BaseImporter.h" #include "BaseImporter.h"
#include "FileSystemFilter.h" #include "FileSystemFilter.h"
#include "Importer.h" #include "Importer.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "../include/assimp/scene.h" #include "../include/assimp/scene.h"
#include "../include/assimp/Importer.hpp" #include "../include/assimp/Importer.hpp"
#include "../include/assimp/postprocess.h" #include "../include/assimp/postprocess.h"

View File

@ -49,7 +49,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "Bitmap.h" #include "Bitmap.h"
#include "../include/assimp/texture.h" #include "../include/assimp/texture.h"
#include "../include/assimp/IOStream.hpp" #include "../include/assimp/IOStream.hpp"
#include "ByteSwap.h" #include "ByteSwapper.h"
namespace Assimp { namespace Assimp {

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,38 +23,38 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
*/ */
/** @file Helper class tp perform various byte oder swappings /** @file Helper class tp perform various byte oder swappings
(e.g. little to big endian) */ (e.g. little to big endian) */
#ifndef AI_BYTESWAP_H_INC #ifndef AI_BYTESWAPPER_H_INC
#define AI_BYTESWAP_H_INC #define AI_BYTESWAPPER_H_INC
#include "../include/assimp/ai_assert.h" #include "../include/assimp/ai_assert.h"
#include "../include/assimp/types.h" #include "../include/assimp/types.h"
#include <stdint.h> #include <stdint.h>
#if _MSC_VER >= 1400 #if _MSC_VER >= 1400
#include <stdlib.h> #include <stdlib.h>
#endif #endif
namespace Assimp { namespace Assimp {
// -------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------
/** Defines some useful byte order swap routines. /** Defines some useful byte order swap routines.
* *
* This is required to read big-endian model formats on little-endian machines, * This is required to read big-endian model formats on little-endian machines,
* and vice versa. Direct use of this class is DEPRECATED. Use #StreamReader instead. */ * and vice versa. Direct use of this class is DEPRECATED. Use #StreamReader instead. */
// -------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------
@ -167,7 +167,7 @@ public:
// ---------------------------------------------------------------------- // ----------------------------------------------------------------------
//! Templatized ByteSwap //! Templatized ByteSwap
//! \returns param tOut as swapped //! \returns param tOut as swapped
template<typename Type> template<typename Type>
static inline Type Swapped(Type tOut) static inline Type Swapped(Type tOut)
{ {
return _swapper<Type,sizeof(Type)>()(tOut); return _swapper<Type,sizeof(Type)>()(tOut);
@ -180,28 +180,28 @@ private:
template <typename T> struct ByteSwap::_swapper<T,2> { template <typename T> struct ByteSwap::_swapper<T,2> {
T operator() (T tOut) { T operator() (T tOut) {
Swap2(&tOut); Swap2(&tOut);
return tOut; return tOut;
} }
}; };
template <typename T> struct ByteSwap::_swapper<T,4> { template <typename T> struct ByteSwap::_swapper<T,4> {
T operator() (T tOut) { T operator() (T tOut) {
Swap4(&tOut); Swap4(&tOut);
return tOut; return tOut;
} }
}; };
template <typename T> struct ByteSwap::_swapper<T,8> { template <typename T> struct ByteSwap::_swapper<T,8> {
T operator() (T tOut) { T operator() (T tOut) {
Swap8(&tOut); Swap8(&tOut);
return tOut; return tOut;
} }
}; };
// -------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------
// ByteSwap macros for BigEndian/LittleEndian support // ByteSwap macros for BigEndian/LittleEndian support
// -------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------
#if (defined AI_BUILD_BIG_ENDIAN) #if (defined AI_BUILD_BIG_ENDIAN)
# define AI_LE(t) (t) # define AI_LE(t) (t)
@ -250,7 +250,7 @@ struct ByteSwapper {
} }
}; };
template <typename T> template <typename T>
struct ByteSwapper<T,false> { struct ByteSwapper<T,false> {
void operator() (T*) { void operator() (T*) {
} }
@ -272,7 +272,7 @@ struct Getter {
} }
}; };
template <bool SwapEndianess, typename T> template <bool SwapEndianess, typename T>
struct Getter<SwapEndianess,T,false> { struct Getter<SwapEndianess,T,false> {
void operator() (T* inout, bool /*le*/) { void operator() (T* inout, bool /*le*/) {
@ -283,4 +283,4 @@ struct Getter<SwapEndianess,T,false> {
} // end Intern } // end Intern
} // end Assimp } // end Assimp
#endif //!! AI_BYTESWAP_H_INC #endif //!! AI_BYTESWAPPER_H_INC

View File

@ -98,7 +98,7 @@ SET( Common_SRCS
ScenePrivate.h ScenePrivate.h
PostStepRegistry.cpp PostStepRegistry.cpp
ImporterRegistry.cpp ImporterRegistry.cpp
ByteSwap.h ByteSwapper.h
DefaultProgressHandler.h DefaultProgressHandler.h
DefaultIOStream.cpp DefaultIOStream.cpp
DefaultIOStream.h DefaultIOStream.h

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,16 +23,16 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
@ -50,7 +50,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "../include/assimp/defs.h" #include "../include/assimp/defs.h"
#include <stdint.h> #include <stdint.h>
#include "Exceptional.h" #include "Exceptional.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
namespace Assimp { namespace Assimp {
namespace FBX { namespace FBX {
@ -58,7 +58,7 @@ namespace FBX {
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
Token::Token(const char* sbegin, const char* send, TokenType type, unsigned int offset) Token::Token(const char* sbegin, const char* send, TokenType type, unsigned int offset)
: :
#ifdef DEBUG #ifdef DEBUG
contents(sbegin, static_cast<size_t>(send-sbegin)), contents(sbegin, static_cast<size_t>(send-sbegin)),
#endif #endif
@ -108,7 +108,7 @@ uint32_t ReadWord(const char* input, const char*& cursor, const char* end)
{ {
if(Offset(cursor, end) < 4) { if(Offset(cursor, end) < 4) {
TokenizeError("cannot ReadWord, out of bounds",input, cursor); TokenizeError("cannot ReadWord, out of bounds",input, cursor);
} }
uint32_t word = *reinterpret_cast<const uint32_t*>(cursor); uint32_t word = *reinterpret_cast<const uint32_t*>(cursor);
AI_SWAP4(word); AI_SWAP4(word);
@ -124,7 +124,7 @@ uint8_t ReadByte(const char* input, const char*& cursor, const char* end)
{ {
if(Offset(cursor, end) < 1) { if(Offset(cursor, end) < 1) {
TokenizeError("cannot ReadByte, out of bounds",input, cursor); TokenizeError("cannot ReadByte, out of bounds",input, cursor);
} }
uint8_t word = *reinterpret_cast<const uint8_t*>(cursor); uint8_t word = *reinterpret_cast<const uint8_t*>(cursor);
++cursor; ++cursor;
@ -134,14 +134,14 @@ uint8_t ReadByte(const char* input, const char*& cursor, const char* end)
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
unsigned int ReadString(const char*& sbegin_out, const char*& send_out, const char* input, const char*& cursor, const char* end, unsigned int ReadString(const char*& sbegin_out, const char*& send_out, const char* input, const char*& cursor, const char* end,
bool long_length = false, bool long_length = false,
bool allow_null = false) bool allow_null = false)
{ {
const uint32_t len_len = long_length ? 4 : 1; const uint32_t len_len = long_length ? 4 : 1;
if(Offset(cursor, end) < len_len) { if(Offset(cursor, end) < len_len) {
TokenizeError("cannot ReadString, out of bounds reading length",input, cursor); TokenizeError("cannot ReadString, out of bounds reading length",input, cursor);
} }
const uint32_t length = long_length ? ReadWord(input, cursor, end) : ReadByte(input, cursor, end); const uint32_t length = long_length ? ReadWord(input, cursor, end) : ReadByte(input, cursor, end);
@ -172,7 +172,7 @@ void ReadData(const char*& sbegin_out, const char*& send_out, const char* input,
{ {
if(Offset(cursor, end) < 1) { if(Offset(cursor, end) < 1) {
TokenizeError("cannot ReadData, out of bounds reading length",input, cursor); TokenizeError("cannot ReadData, out of bounds reading length",input, cursor);
} }
const char type = *cursor; const char type = *cursor;
sbegin_out = cursor++; sbegin_out = cursor++;
@ -211,14 +211,14 @@ void ReadData(const char*& sbegin_out, const char*& send_out, const char* input,
// note: do not write cursor += ReadWord(...cursor) as this would be UB // note: do not write cursor += ReadWord(...cursor) as this would be UB
// raw binary data // raw binary data
case 'R': case 'R':
{ {
const uint32_t length = ReadWord(input, cursor, end); const uint32_t length = ReadWord(input, cursor, end);
cursor += length; cursor += length;
break; break;
} }
case 'b': case 'b':
// TODO: what is the 'b' type code? Right now we just skip over it / // TODO: what is the 'b' type code? Right now we just skip over it /
// take the full range we could get // take the full range we could get
cursor = end; cursor = end;
@ -229,7 +229,7 @@ void ReadData(const char*& sbegin_out, const char*& send_out, const char* input,
case 'd': case 'd':
case 'l': case 'l':
case 'i': { case 'i': {
const uint32_t length = ReadWord(input, cursor, end); const uint32_t length = ReadWord(input, cursor, end);
const uint32_t encoding = ReadWord(input, cursor, end); const uint32_t encoding = ReadWord(input, cursor, end);
@ -259,7 +259,7 @@ void ReadData(const char*& sbegin_out, const char*& send_out, const char* input,
} }
} }
// zip/deflate algorithm (encoding==1)? take given length. anything else? die // zip/deflate algorithm (encoding==1)? take given length. anything else? die
else if (encoding != 1) { else if (encoding != 1) {
TokenizeError("cannot ReadData, unknown encoding",input, cursor); TokenizeError("cannot ReadData, unknown encoding",input, cursor);
} }
cursor += comp_len; cursor += comp_len;
@ -279,7 +279,7 @@ void ReadData(const char*& sbegin_out, const char*& send_out, const char* input,
if(cursor > end) { if(cursor > end) {
TokenizeError("cannot ReadData, the remaining size is too small for the data type: " + std::string(&type, 1),input, cursor); TokenizeError("cannot ReadData, the remaining size is too small for the data type: " + std::string(&type, 1),input, cursor);
} }
// the type code is contained in the returned range // the type code is contained in the returned range
send_out = cursor; send_out = cursor;
@ -291,10 +291,10 @@ bool ReadScope(TokenList& output_tokens, const char* input, const char*& cursor,
{ {
// the first word contains the offset at which this block ends // the first word contains the offset at which this block ends
const uint32_t end_offset = ReadWord(input, cursor, end); const uint32_t end_offset = ReadWord(input, cursor, end);
// we may get 0 if reading reached the end of the file - // we may get 0 if reading reached the end of the file -
// fbx files have a mysterious extra footer which I don't know // fbx files have a mysterious extra footer which I don't know
// how to extract any information from, but at least it always // how to extract any information from, but at least it always
// starts with a 0. // starts with a 0.
if(!end_offset) { if(!end_offset) {
return false; return false;

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,16 +23,16 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
@ -59,7 +59,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "ParsingUtils.h" #include "ParsingUtils.h"
#include "fast_atof.h" #include "fast_atof.h"
#include <boost/foreach.hpp> #include <boost/foreach.hpp>
#include "ByteSwap.h" #include "ByteSwapper.h"
using namespace Assimp; using namespace Assimp;
using namespace Assimp::FBX; using namespace Assimp::FBX;
@ -189,7 +189,7 @@ Scope::Scope(Parser& parser,bool topLevel)
TokenPtr t = parser.CurrentToken(); TokenPtr t = parser.CurrentToken();
if (t->Type() != TokenType_OPEN_BRACKET) { if (t->Type() != TokenType_OPEN_BRACKET) {
ParseError("expected open bracket",t); ParseError("expected open bracket",t);
} }
} }
TokenPtr n = parser.AdvanceToNextToken(); TokenPtr n = parser.AdvanceToNextToken();
@ -384,7 +384,7 @@ float ParseTokenAsFloat(const Token& t, const char*& err_out)
} }
// need to copy the input string to a temporary buffer // need to copy the input string to a temporary buffer
// first - next in the fbx token stream comes ',', // first - next in the fbx token stream comes ',',
// which fast_atof could interpret as decimal point. // which fast_atof could interpret as decimal point.
#define MAX_FLOAT_LENGTH 31 #define MAX_FLOAT_LENGTH 31
char temp[MAX_FLOAT_LENGTH + 1]; char temp[MAX_FLOAT_LENGTH + 1];
@ -515,7 +515,7 @@ namespace {
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
// read the type code and element count of a binary data array and stop there // read the type code and element count of a binary data array and stop there
void ReadBinaryDataArrayHead(const char*& data, const char* end, char& type, uint32_t& count, void ReadBinaryDataArrayHead(const char*& data, const char* end, char& type, uint32_t& count,
const Element& el) const Element& el)
{ {
if (static_cast<size_t>(end-data) < 5) { if (static_cast<size_t>(end-data) < 5) {
@ -536,8 +536,8 @@ void ReadBinaryDataArrayHead(const char*& data, const char* end, char& type, uin
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
// read binary data array, assume cursor points to the 'compression mode' field (i.e. behind the header) // read binary data array, assume cursor points to the 'compression mode' field (i.e. behind the header)
void ReadBinaryDataArray(char type, uint32_t count, const char*& data, const char* end, void ReadBinaryDataArray(char type, uint32_t count, const char*& data, const char* end,
std::vector<char>& buff, std::vector<char>& buff,
const Element& /*el*/) const Element& /*el*/)
{ {
BE_NCONST uint32_t encmode = SafeParse<uint32_t>(data, end); BE_NCONST uint32_t encmode = SafeParse<uint32_t>(data, end);
@ -581,7 +581,7 @@ void ReadBinaryDataArray(char type, uint32_t count, const char*& data, const cha
else if(encmode == 1) { else if(encmode == 1) {
// zlib/deflate, next comes ZIP head (0x78 0x01) // zlib/deflate, next comes ZIP head (0x78 0x01)
// see http://www.ietf.org/rfc/rfc1950.txt // see http://www.ietf.org/rfc/rfc1950.txt
z_stream zstream; z_stream zstream;
zstream.opaque = Z_NULL; zstream.opaque = Z_NULL;
zstream.zalloc = Z_NULL; zstream.zalloc = Z_NULL;
@ -631,7 +631,7 @@ void ParseVectorDataArray(std::vector<aiVector3D>& out, const Element& el)
if(tok.empty()) { if(tok.empty()) {
ParseError("unexpected empty element",&el); ParseError("unexpected empty element",&el);
} }
if(tok[0]->IsBinary()) { if(tok[0]->IsBinary()) {
const char* data = tok[0]->begin(), *end = tok[0]->end(); const char* data = tok[0]->begin(), *end = tok[0]->end();
@ -653,7 +653,7 @@ void ParseVectorDataArray(std::vector<aiVector3D>& out, const Element& el)
std::vector<char> buff; std::vector<char> buff;
ReadBinaryDataArray(type, count, data, end, buff, el); ReadBinaryDataArray(type, count, data, end, buff, el);
ai_assert(data == end); ai_assert(data == end);
ai_assert(buff.size() == count * (type == 'd' ? 8 : 4)); ai_assert(buff.size() == count * (type == 'd' ? 8 : 4));
@ -1095,7 +1095,7 @@ void ParseVectorDataArray(std::vector<uint64_t>& out, const Element& el)
for (TokenList::const_iterator it = a.Tokens().begin(), end = a.Tokens().end(); it != end; ) { for (TokenList::const_iterator it = a.Tokens().begin(), end = a.Tokens().end(); it != end; ) {
const uint64_t ival = ParseTokenAsID(**it++); const uint64_t ival = ParseTokenAsID(**it++);
out.push_back(ival); out.push_back(ival);
} }
} }
@ -1211,7 +1211,7 @@ std::string ParseTokenAsString(const Token& t)
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
// extract a required element from a scope, abort if the element cannot be found // extract a required element from a scope, abort if the element cannot be found
const Element& GetRequiredElement(const Scope& sc, const std::string& index, const Element* element /*= NULL*/) const Element& GetRequiredElement(const Scope& sc, const std::string& index, const Element* element /*= NULL*/)
{ {
const Element* el = sc[index]; const Element* el = sc[index];
if(!el) { if(!el) {
@ -1249,7 +1249,7 @@ const Token& GetRequiredToken(const Element& el, unsigned int index)
// ------------------------------------------------------------------------------------------------ // ------------------------------------------------------------------------------------------------
// wrapper around ParseTokenAsID() with ParseError handling // wrapper around ParseTokenAsID() with ParseError handling
uint64_t ParseTokenAsID(const Token& t) uint64_t ParseTokenAsID(const Token& t)
{ {
const char* err; const char* err;
const uint64_t i = ParseTokenAsID(t,err); const uint64_t i = ParseTokenAsID(t,err);
@ -1316,4 +1316,3 @@ int64_t ParseTokenAsInt64(const Token& t)
} // !Assimp } // !Assimp
#endif #endif

View File

@ -1,5 +1,3 @@
// Definitions for the Interchange File Format (IFF) // Definitions for the Interchange File Format (IFF)
// Alexander Gessler, 2006 // Alexander Gessler, 2006
// Adapted to Assimp August 2008 // Adapted to Assimp August 2008
@ -7,7 +5,7 @@
#ifndef AI_IFF_H_INCLUDED #ifndef AI_IFF_H_INCLUDED
#define AI_IFF_H_INCLUDED #define AI_IFF_H_INCLUDED
#include "ByteSwap.h" #include "ByteSwapper.h"
namespace Assimp { namespace Assimp {
namespace IFF { namespace IFF {
@ -81,12 +79,12 @@ inline SubChunkHeader LoadSubChunk(uint8_t*& outFile)
///////////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////////
//! Read the file header and return the type of the file and its size //! Read the file header and return the type of the file and its size
//! @param outFile Pointer to the file data. The buffer must at //! @param outFile Pointer to the file data. The buffer must at
//! least be 12 bytes large. //! least be 12 bytes large.
//! @param fileType Receives the type of the file //! @param fileType Receives the type of the file
//! @return 0 if everything was OK, otherwise an error message //! @return 0 if everything was OK, otherwise an error message
///////////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////////
inline const char* ReadHeader(uint8_t* outFile, uint32_t& fileType) inline const char* ReadHeader(uint8_t* outFile, uint32_t& fileType)
{ {
ChunkHeader head = LoadChunk(outFile); ChunkHeader head = LoadChunk(outFile);
if(AI_IFF_FOURCC_FORM != head.type) if(AI_IFF_FOURCC_FORM != head.type)

View File

@ -50,7 +50,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "LWOLoader.h" #include "LWOLoader.h"
#include "StringComparison.h" #include "StringComparison.h"
#include "SGSpatialSort.h" #include "SGSpatialSort.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "ProcessHelper.h" #include "ProcessHelper.h"
#include "ConvertToLHProcess.h" #include "ConvertToLHProcess.h"
#include <boost/scoped_ptr.hpp> #include <boost/scoped_ptr.hpp>

View File

@ -44,7 +44,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
/** @file Implementation of the MD2 importer class */ /** @file Implementation of the MD2 importer class */
#include "MD2Loader.h" #include "MD2Loader.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "MD2NormalTable.h" // shouldn't be included by other units #include "MD2NormalTable.h" // shouldn't be included by other units
#include "../include/assimp/DefaultLogger.hpp" #include "../include/assimp/DefaultLogger.hpp"
#include "../include/assimp/Importer.hpp" #include "../include/assimp/Importer.hpp"

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,16 +23,16 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
@ -46,7 +46,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "BaseImporter.h" #include "BaseImporter.h"
#include "../include/assimp/types.h" #include "../include/assimp/types.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "MD2FileData.h" #include "MD2FileData.h"
struct aiNode; struct aiNode;
@ -69,7 +69,7 @@ public:
public: public:
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Returns whether the class can handle the format of the given file. /** Returns whether the class can handle the format of the given file.
* See BaseImporter::CanRead() for details. */ * See BaseImporter::CanRead() for details. */
bool CanRead( const std::string& pFile, IOSystem* pIOHandler, bool CanRead( const std::string& pFile, IOSystem* pIOHandler,
bool checkSig) const; bool checkSig) const;
@ -91,10 +91,10 @@ protected:
const aiImporterDesc* GetInfo () const; const aiImporterDesc* GetInfo () const;
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Imports the given file into the given scene structure. /** Imports the given file into the given scene structure.
* See BaseImporter::InternReadFile() for details * See BaseImporter::InternReadFile() for details
*/ */
void InternReadFile( const std::string& pFile, aiScene* pScene, void InternReadFile( const std::string& pFile, aiScene* pScene,
IOSystem* pIOHandler); IOSystem* pIOHandler);

View File

@ -52,7 +52,6 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef ASSIMP_BUILD_NO_MD3_IMPORTER #ifndef ASSIMP_BUILD_NO_MD3_IMPORTER
#include "MD3Loader.h" #include "MD3Loader.h"
#include "ByteSwap.h"
#include "SceneCombiner.h" #include "SceneCombiner.h"
#include "GenericProperty.h" #include "GenericProperty.h"
#include "RemoveComments.h" #include "RemoveComments.h"

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,16 +23,16 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
@ -45,7 +45,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#define AI_MD3LOADER_H_INCLUDED #define AI_MD3LOADER_H_INCLUDED
#include "BaseImporter.h" #include "BaseImporter.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "MD3FileData.h" #include "MD3FileData.h"
#include "StringComparison.h" #include "StringComparison.h"
#include "../include/assimp/types.h" #include "../include/assimp/types.h"
@ -99,7 +99,7 @@ enum ShaderCullMode
enum BlendFunc enum BlendFunc
{ {
BLEND_NONE, BLEND_NONE,
BLEND_GL_ONE, BLEND_GL_ONE,
BLEND_GL_ZERO, BLEND_GL_ZERO,
BLEND_GL_DST_COLOR, BLEND_GL_DST_COLOR,
BLEND_GL_ONE_MINUS_DST_COLOR, BLEND_GL_ONE_MINUS_DST_COLOR,
@ -114,7 +114,7 @@ enum AlphaTestFunc
{ {
AT_NONE, AT_NONE,
AT_GT0, AT_GT0,
AT_LT128, AT_LT128,
AT_GE128 AT_GE128
}; };
@ -223,7 +223,7 @@ public:
public: public:
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Returns whether the class can handle the format of the given file. /** Returns whether the class can handle the format of the given file.
* See BaseImporter::CanRead() for details. */ * See BaseImporter::CanRead() for details. */
bool CanRead( const std::string& pFile, IOSystem* pIOHandler, bool CanRead( const std::string& pFile, IOSystem* pIOHandler,
bool checkSig) const; bool checkSig) const;
@ -245,10 +245,10 @@ protected:
const aiImporterDesc* GetInfo () const; const aiImporterDesc* GetInfo () const;
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Imports the given file into the given scene structure. /** Imports the given file into the given scene structure.
* See BaseImporter::InternReadFile() for details * See BaseImporter::InternReadFile() for details
*/ */
void InternReadFile( const std::string& pFile, aiScene* pScene, void InternReadFile( const std::string& pFile, aiScene* pScene,
IOSystem* pIOHandler); IOSystem* pIOHandler);
// ------------------------------------------------------------------- // -------------------------------------------------------------------
@ -281,7 +281,7 @@ protected:
* @param[in] header_path Base path specified in MD3 header * @param[in] header_path Base path specified in MD3 header
* @param[out] out Receives the converted output string * @param[out] out Receives the converted output string
*/ */
void ConvertPath(const char* texture_name, const char* header_path, void ConvertPath(const char* texture_name, const char* header_path,
std::string& out) const; std::string& out) const;
protected: protected:

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,23 +23,23 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
*/ */
/** @file MDCLoader.h /** @file MDCLoader.h
* @brief Definition of the MDC importer class. * @brief Definition of the MDC importer class.
*/ */
#ifndef AI_MDCLOADER_H_INCLUDED #ifndef AI_MDCLOADER_H_INCLUDED
#define AI_MDCLOADER_H_INCLUDED #define AI_MDCLOADER_H_INCLUDED
@ -48,7 +48,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "BaseImporter.h" #include "BaseImporter.h"
#include "MDCFileData.h" #include "MDCFileData.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
namespace Assimp { namespace Assimp {
using namespace MDC; using namespace MDC;
@ -66,7 +66,7 @@ public:
public: public:
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Returns whether the class can handle the format of the given file. /** Returns whether the class can handle the format of the given file.
* See BaseImporter::CanRead() for details. */ * See BaseImporter::CanRead() for details. */
bool CanRead( const std::string& pFile, IOSystem* pIOHandler, bool CanRead( const std::string& pFile, IOSystem* pIOHandler,
bool checkSig) const; bool checkSig) const;
@ -87,7 +87,7 @@ protected:
const aiImporterDesc* GetInfo () const; const aiImporterDesc* GetInfo () const;
// ------------------------------------------------------------------- // -------------------------------------------------------------------
/** Imports the given file into the given scene structure. /** Imports the given file into the given scene structure.
* See BaseImporter::InternReadFile() for details * See BaseImporter::InternReadFile() for details
*/ */
void InternReadFile( const std::string& pFile, aiScene* pScene, void InternReadFile( const std::string& pFile, aiScene* pScene,
@ -125,4 +125,3 @@ protected:
} // end of namespace Assimp } // end of namespace Assimp
#endif // AI_3DSIMPORTER_H_INC #endif // AI_3DSIMPORTER_H_INC

View File

@ -5,8 +5,8 @@ Open Asset Import Library (assimp)
Copyright (c) 2006-2012, assimp team Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the with or without modification, are permitted provided that the
following conditions are met: following conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -23,16 +23,16 @@ following conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------- ----------------------------------------------------------------------
@ -41,7 +41,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
/** /**
* @file MDLFileData.h * @file MDLFileData.h
* @brief Definition of in-memory structures for the MDL file format. * @brief Definition of in-memory structures for the MDL file format.
* *
* The specification has been taken from various sources on the internet. * The specification has been taken from various sources on the internet.
* - http://tfc.duke.free.fr/coding/mdl-specs-en.html * - http://tfc.duke.free.fr/coding/mdl-specs-en.html
@ -52,7 +52,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef AI_MDLFILEHELPER_H_INC #ifndef AI_MDLFILEHELPER_H_INC
#define AI_MDLFILEHELPER_H_INC #define AI_MDLFILEHELPER_H_INC
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "./../include/assimp/anim.h" #include "./../include/assimp/anim.h"
#include "./../include/assimp/mesh.h" #include "./../include/assimp/mesh.h"
#include "./../include/assimp/Compiler/pushpack1.h" #include "./../include/assimp/Compiler/pushpack1.h"
@ -99,13 +99,13 @@ namespace MDL {
# define AI_MDL_MAX_FRAMES 256 # define AI_MDL_MAX_FRAMES 256
#endif #endif
#if (!defined AI_MDL_MAX_UVS) #if (!defined AI_MDL_MAX_UVS)
# define AI_MDL_MAX_UVS 1024 # define AI_MDL_MAX_UVS 1024
#endif #endif
#if (!defined AI_MDL_MAX_VERTS) #if (!defined AI_MDL_MAX_VERTS)
# define AI_MDL_MAX_VERTS 1024 # define AI_MDL_MAX_VERTS 1024
#endif #endif
#if (!defined AI_MDL_MAX_TRIANGLES) #if (!defined AI_MDL_MAX_TRIANGLES)
# define AI_MDL_MAX_TRIANGLES 2048 # define AI_MDL_MAX_TRIANGLES 2048
#endif #endif
// material key that is set for dummy materials that are // material key that is set for dummy materials that are
@ -121,47 +121,47 @@ namespace MDL {
struct Header struct Header
{ {
//! magic number: "IDPO" //! magic number: "IDPO"
uint32_t ident; uint32_t ident;
//! version number: 6 //! version number: 6
int32_t version; int32_t version;
//! scale factors for each axis //! scale factors for each axis
aiVector3D scale; aiVector3D scale;
//! translation factors for each axis //! translation factors for each axis
aiVector3D translate; aiVector3D translate;
//! bounding radius of the mesh //! bounding radius of the mesh
float boundingradius; float boundingradius;
//! Position of the viewer's exe. Ignored //! Position of the viewer's exe. Ignored
aiVector3D vEyePos; aiVector3D vEyePos;
//! Number of textures //! Number of textures
int32_t num_skins; int32_t num_skins;
//! Texture width in pixels //! Texture width in pixels
int32_t skinwidth; int32_t skinwidth;
//! Texture height in pixels //! Texture height in pixels
int32_t skinheight; int32_t skinheight;
//! Number of vertices contained in the file //! Number of vertices contained in the file
int32_t num_verts; int32_t num_verts;
//! Number of triangles contained in the file //! Number of triangles contained in the file
int32_t num_tris; int32_t num_tris;
//! Number of frames contained in the file //! Number of frames contained in the file
int32_t num_frames; int32_t num_frames;
//! 0 = synchron, 1 = random . Ignored //! 0 = synchron, 1 = random . Ignored
//! (MDLn formats: number of texture coordinates) //! (MDLn formats: number of texture coordinates)
int32_t synctype; int32_t synctype;
//! State flag //! State flag
int32_t flags; int32_t flags;
//! Could be the total size of the file (and not a float) //! Could be the total size of the file (and not a float)
float size; float size;
@ -175,10 +175,10 @@ struct Header
struct Header_MDL7 struct Header_MDL7
{ {
//! magic number: "MDL7" //! magic number: "MDL7"
char ident[4]; char ident[4];
//! Version number. Ignored //! Version number. Ignored
int32_t version; int32_t version;
//! Number of bones in file //! Number of bones in file
uint32_t bones_num; uint32_t bones_num;
@ -187,13 +187,13 @@ struct Header_MDL7
uint32_t groups_num; uint32_t groups_num;
//! Size of data in the file //! Size of data in the file
uint32_t data_size; uint32_t data_size;
//! Ignored. Used to store entity specific information //! Ignored. Used to store entity specific information
int32_t entlump_size; int32_t entlump_size;
//! Ignored. Used to store MED related data //! Ignored. Used to store MED related data
int32_t medlump_size; int32_t medlump_size;
//! Size of the Bone_MDL7 data structure used in the file //! Size of the Bone_MDL7 data structure used in the file
uint16_t bone_stc_size; uint16_t bone_stc_size;
@ -237,7 +237,7 @@ struct Bone_MDL7
//! Index of the parent bone of *this* bone. 0xffff means: //! Index of the parent bone of *this* bone. 0xffff means:
//! "hey, I have no parent, I'm an orphan" //! "hey, I have no parent, I'm an orphan"
uint16_t parent_index; uint16_t parent_index;
uint8_t _unused_[2]; uint8_t _unused_[2];
//! Relative position of the bone (relative to the //! Relative position of the bone (relative to the
//! parent bone) //! parent bone)
@ -270,21 +270,21 @@ struct Bone_MDL7
struct Group_MDL7 struct Group_MDL7
{ {
//! = '1' -> triangle based Mesh //! = '1' -> triangle based Mesh
unsigned char typ; unsigned char typ;
int8_t deformers; int8_t deformers;
int8_t max_weights; int8_t max_weights;
int8_t _unused_; int8_t _unused_;
//! size of data for this group in bytes ( MD7_GROUP stc. included). //! size of data for this group in bytes ( MD7_GROUP stc. included).
int32_t groupdata_size; int32_t groupdata_size;
char name[AI_MDL7_MAX_GROUPNAMESIZE]; char name[AI_MDL7_MAX_GROUPNAMESIZE];
//! Number of skins //! Number of skins
int32_t numskins; int32_t numskins;
//! Number of texture coordinates //! Number of texture coordinates
int32_t num_stpts; int32_t num_stpts;
//! Number of triangles //! Number of triangles
int32_t numtris; int32_t numtris;
@ -327,7 +327,7 @@ struct Deformer_MDL7
struct DeformerElement_MDL7 struct DeformerElement_MDL7
{ {
//! bei deformer_typ==0 (==bones) element_index == bone index //! bei deformer_typ==0 (==bones) element_index == bone index
int32_t element_index; int32_t element_index;
char element_name[AI_MDL7_MAX_BONENAMESIZE]; char element_name[AI_MDL7_MAX_BONENAMESIZE];
int32_t weights; int32_t weights;
} PACK_STRUCT; } PACK_STRUCT;
@ -340,7 +340,7 @@ struct DeformerElement_MDL7
struct DeformerWeight_MDL7 struct DeformerWeight_MDL7
{ {
//! for deformer_typ==0 (==bones) index == vertex index //! for deformer_typ==0 (==bones) index == vertex index
int32_t index; int32_t index;
float weight; float weight;
} PACK_STRUCT; } PACK_STRUCT;
@ -364,19 +364,19 @@ struct ColorValue_MDL7
struct Material_MDL7 struct Material_MDL7
{ {
//! Diffuse base color of the material //! Diffuse base color of the material
ColorValue_MDL7 Diffuse; ColorValue_MDL7 Diffuse;
//! Ambient base color of the material //! Ambient base color of the material
ColorValue_MDL7 Ambient; ColorValue_MDL7 Ambient;
//! Specular base color of the material //! Specular base color of the material
ColorValue_MDL7 Specular; ColorValue_MDL7 Specular;
//! Emissive base color of the material //! Emissive base color of the material
ColorValue_MDL7 Emissive; ColorValue_MDL7 Emissive;
//! Phong power //! Phong power
float Power; float Power;
} PACK_STRUCT; } PACK_STRUCT;
@ -391,16 +391,16 @@ struct Skin
//! fore the size of the data to skip: //! fore the size of the data to skip:
//------------------------------------------------------- //-------------------------------------------------------
//! 2 for 565 RGB, //! 2 for 565 RGB,
//! 3 for 4444 ARGB, //! 3 for 4444 ARGB,
//! 10 for 565 mipmapped, //! 10 for 565 mipmapped,
//! 11 for 4444 mipmapped (bpp = 2), //! 11 for 4444 mipmapped (bpp = 2),
//! 12 for 888 RGB mipmapped (bpp = 3), //! 12 for 888 RGB mipmapped (bpp = 3),
//! 13 for 8888 ARGB mipmapped (bpp = 4) //! 13 for 8888 ARGB mipmapped (bpp = 4)
//------------------------------------------------------- //-------------------------------------------------------
int32_t group; int32_t group;
//! Texture data //! Texture data
uint8_t *data; uint8_t *data;
} PACK_STRUCT; } PACK_STRUCT;
@ -411,8 +411,8 @@ struct Skin
*/ */
struct Skin_MDL5 struct Skin_MDL5
{ {
int32_t size, width, height; int32_t size, width, height;
uint8_t *data; uint8_t *data;
} PACK_STRUCT; } PACK_STRUCT;
// maximum length of texture file name // maximum length of texture file name
@ -430,7 +430,7 @@ struct Skin_MDL7
int8_t _unused_[3]; int8_t _unused_[3];
int32_t width; int32_t width;
int32_t height; int32_t height;
char texture_name[AI_MDL7_MAX_TEXNAMESIZE]; char texture_name[AI_MDL7_MAX_TEXNAMESIZE];
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -463,16 +463,16 @@ struct ARGB4
struct GroupSkin struct GroupSkin
{ {
//! 0 = single (Skin), 1 = group (GroupSkin) //! 0 = single (Skin), 1 = group (GroupSkin)
int32_t group; int32_t group;
//! Number of images //! Number of images
int32_t nb; int32_t nb;
//! Time for each image //! Time for each image
float *time; float *time;
//! Data of each image //! Data of each image
uint8_t **data; uint8_t **data;
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -498,10 +498,10 @@ struct TexCoord
struct TexCoord_MDL3 struct TexCoord_MDL3
{ {
//! position, horizontally in range 0..skinwidth-1 //! position, horizontally in range 0..skinwidth-1
int16_t u; int16_t u;
//! position, vertically in range 0..skinheight-1 //! position, vertically in range 0..skinheight-1
int16_t v; int16_t v;
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -511,10 +511,10 @@ struct TexCoord_MDL3
struct TexCoord_MDL7 struct TexCoord_MDL7
{ {
//! position, horizontally in range 0..1 //! position, horizontally in range 0..1
float u; float u;
//! position, vertically in range 0..1 //! position, vertically in range 0..1
float v; float v;
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -527,10 +527,10 @@ struct TexCoord_MDL7
struct SkinSet_MDL7 struct SkinSet_MDL7
{ {
//! Index into the UV coordinate list //! Index into the UV coordinate list
uint16_t st_index[3]; // size 6 uint16_t st_index[3]; // size 6
//! Material index //! Material index
int32_t material; // size 4 int32_t material; // size 4
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -540,10 +540,10 @@ struct SkinSet_MDL7
struct Triangle struct Triangle
{ {
//! 0 = backface, 1 = frontface //! 0 = backface, 1 = frontface
int32_t facesfront; int32_t facesfront;
//! Vertex indices //! Vertex indices
int32_t vertex[3]; int32_t vertex[3];
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -556,7 +556,7 @@ struct Triangle_MDL3
uint16_t index_xyz[3]; uint16_t index_xyz[3];
//! Index of 3 skin vertices in range 0..numskinverts //! Index of 3 skin vertices in range 0..numskinverts
uint16_t index_uv[3]; uint16_t index_uv[3];
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -570,17 +570,17 @@ struct Triangle_MDL7
//! Two skinsets. The second will be used for multi-texturing //! Two skinsets. The second will be used for multi-texturing
SkinSet_MDL7 skinsets[2]; SkinSet_MDL7 skinsets[2];
} PACK_STRUCT; } PACK_STRUCT;
#if (!defined AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV) #if (!defined AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV)
# define AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV (6+sizeof(SkinSet_MDL7)-sizeof(uint32_t)) # define AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV (6+sizeof(SkinSet_MDL7)-sizeof(uint32_t))
#endif #endif
#if (!defined AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV_WITH_MATINDEX) #if (!defined AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV_WITH_MATINDEX)
# define AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV_WITH_MATINDEX (6+sizeof(SkinSet_MDL7)) # define AI_MDL7_TRIANGLE_STD_SIZE_ONE_UV_WITH_MATINDEX (6+sizeof(SkinSet_MDL7))
#endif #endif
#if (!defined AI_MDL7_TRIANGLE_STD_SIZE_TWO_UV) #if (!defined AI_MDL7_TRIANGLE_STD_SIZE_TWO_UV)
# define AI_MDL7_TRIANGLE_STD_SIZE_TWO_UV (6+2*sizeof(SkinSet_MDL7)) # define AI_MDL7_TRIANGLE_STD_SIZE_TWO_UV (6+2*sizeof(SkinSet_MDL7))
#endif #endif
// Helper constants for Triangle::facesfront // Helper constants for Triangle::facesfront
#if (!defined AI_MDL_BACKFACE) #if (!defined AI_MDL_BACKFACE)
@ -634,10 +634,10 @@ struct Vertex_MDL7
struct BoneTransform_MDL7 struct BoneTransform_MDL7
{ {
//! 4*3 //! 4*3
float m [4*4]; float m [4*4];
//! the index of this vertex, 0.. header::bones_num - 1 //! the index of this vertex, 0.. header::bones_num - 1
uint16_t bone_index; uint16_t bone_index;
//! I HATE 3DGS AND THE SILLY DEVELOPER WHO DESIGNED //! I HATE 3DGS AND THE SILLY DEVELOPER WHO DESIGNED
//! THIS STUPID FILE FORMAT! //! THIS STUPID FILE FORMAT!
@ -655,8 +655,8 @@ struct BoneTransform_MDL7
struct Frame_MDL7 struct Frame_MDL7
{ {
char frame_name[AI_MDL7_MAX_FRAMENAMESIZE]; char frame_name[AI_MDL7_MAX_FRAMENAMESIZE];
uint32_t vertices_count; uint32_t vertices_count;
uint32_t transmatrix_count; uint32_t transmatrix_count;
}; };
@ -667,16 +667,16 @@ struct Frame_MDL7
struct SimpleFrame struct SimpleFrame
{ {
//! Minimum vertex of the bounding box //! Minimum vertex of the bounding box
Vertex bboxmin; Vertex bboxmin;
//! Maximum vertex of the bounding box //! Maximum vertex of the bounding box
Vertex bboxmax; Vertex bboxmax;
//! Name of the frame //! Name of the frame
char name[16]; char name[16];
//! Vertex list of the frame //! Vertex list of the frame
Vertex *verts; Vertex *verts;
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -686,10 +686,10 @@ struct SimpleFrame
struct Frame struct Frame
{ {
//! 0 = simple frame, !0 = group frame //! 0 = simple frame, !0 = group frame
int32_t type; int32_t type;
//! Frame data //! Frame data
SimpleFrame frame; SimpleFrame frame;
} PACK_STRUCT; } PACK_STRUCT;
@ -697,16 +697,16 @@ struct Frame
struct SimpleFrame_MDLn_SP struct SimpleFrame_MDLn_SP
{ {
//! Minimum vertex of the bounding box //! Minimum vertex of the bounding box
Vertex_MDL4 bboxmin; Vertex_MDL4 bboxmin;
//! Maximum vertex of the bounding box //! Maximum vertex of the bounding box
Vertex_MDL4 bboxmax; Vertex_MDL4 bboxmax;
//! Name of the frame //! Name of the frame
char name[16]; char name[16];
//! Vertex list of the frame //! Vertex list of the frame
Vertex_MDL4 *verts; Vertex_MDL4 *verts;
} PACK_STRUCT; } PACK_STRUCT;
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -716,19 +716,19 @@ struct SimpleFrame_MDLn_SP
struct GroupFrame struct GroupFrame
{ {
//! 0 = simple frame, !0 = group frame //! 0 = simple frame, !0 = group frame
int32_t type; int32_t type;
//! Minimum vertex for all single frames //! Minimum vertex for all single frames
Vertex min; Vertex min;
//! Maximum vertex for all single frames //! Maximum vertex for all single frames
Vertex max; Vertex max;
//! Time for all single frames //! Time for all single frames
float *time; float *time;
//! List of single frames //! List of single frames
SimpleFrame *frames; SimpleFrame *frames;
} PACK_STRUCT; } PACK_STRUCT;
#include "./../include/assimp/Compiler/poppack1.h" #include "./../include/assimp/Compiler/poppack1.h"
@ -752,7 +752,7 @@ struct IntFace_MDL7
//! Material index (maximally two channels, which are joined later) //! Material index (maximally two channels, which are joined later)
unsigned int iMatIndex[2]; unsigned int iMatIndex[2];
}; };
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
/** \struct IntMaterial_MDL7 /** \struct IntMaterial_MDL7
@ -812,7 +812,7 @@ struct IntBone_MDL7 : aiBone
struct IntFrameInfo_MDL7 struct IntFrameInfo_MDL7
{ {
//! Construction from an existing frame header //! Construction from an existing frame header
IntFrameInfo_MDL7(BE_NCONST MDL::Frame_MDL7* _pcFrame,unsigned int _iIndex) IntFrameInfo_MDL7(BE_NCONST MDL::Frame_MDL7* _pcFrame,unsigned int _iIndex)
: iIndex(_iIndex) : iIndex(_iIndex)
, pcFrame(_pcFrame) , pcFrame(_pcFrame)
{} {}
@ -821,7 +821,7 @@ struct IntFrameInfo_MDL7
unsigned int iIndex; unsigned int iIndex;
//! Points to the header of the frame //! Points to the header of the frame
BE_NCONST MDL::Frame_MDL7* pcFrame; BE_NCONST MDL::Frame_MDL7* pcFrame;
}; };
// ------------------------------------------------------------------------------------- // -------------------------------------------------------------------------------------
@ -829,7 +829,7 @@ struct IntFrameInfo_MDL7
struct IntGroupInfo_MDL7 struct IntGroupInfo_MDL7
{ {
//! Default constructor //! Default constructor
IntGroupInfo_MDL7() IntGroupInfo_MDL7()
: iIndex(0) : iIndex(0)
, pcGroup(NULL) , pcGroup(NULL)
, pcGroupUVs(NULL) , pcGroupUVs(NULL)
@ -847,13 +847,13 @@ struct IntGroupInfo_MDL7
unsigned int iIndex; unsigned int iIndex;
//! Points to the header of the group //! Points to the header of the group
BE_NCONST MDL::Group_MDL7* pcGroup; BE_NCONST MDL::Group_MDL7* pcGroup;
//! Points to the beginning of the uv coordinate section //! Points to the beginning of the uv coordinate section
BE_NCONST MDL::TexCoord_MDL7* pcGroupUVs; BE_NCONST MDL::TexCoord_MDL7* pcGroupUVs;
//! Points to the beginning of the triangle section //! Points to the beginning of the triangle section
MDL::Triangle_MDL7* pcGroupTris; MDL::Triangle_MDL7* pcGroupTris;
//! Points to the beginning of the vertex section //! Points to the beginning of the vertex section
BE_NCONST MDL::Vertex_MDL7* pcGroupVerts; BE_NCONST MDL::Vertex_MDL7* pcGroupVerts;
@ -868,16 +868,16 @@ struct IntGroupData_MDL7
{} {}
//! Array of faces that belong to the group //! Array of faces that belong to the group
MDL::IntFace_MDL7* pcFaces; MDL::IntFace_MDL7* pcFaces;
//! Array of vertex positions //! Array of vertex positions
std::vector<aiVector3D> vPositions; std::vector<aiVector3D> vPositions;
//! Array of vertex normals //! Array of vertex normals
std::vector<aiVector3D> vNormals; std::vector<aiVector3D> vNormals;
//! Array of bones indices //! Array of bones indices
std::vector<unsigned int> aiBones; std::vector<unsigned int> aiBones;
//! First UV coordinate set //! First UV coordinate set
std::vector<aiVector3D> vTextureCoords1; std::vector<aiVector3D> vTextureCoords1;
@ -895,7 +895,7 @@ struct IntGroupData_MDL7
struct IntSharedData_MDL7 struct IntSharedData_MDL7
{ {
//! Default constructor //! Default constructor
IntSharedData_MDL7() IntSharedData_MDL7()
{ {
abNeedMaterials.reserve(10); abNeedMaterials.reserve(10);
} }
@ -929,7 +929,7 @@ struct IntSharedData_MDL7
//! Contains input data for GenerateOutputMeshes_3DGS_MDL7 //! Contains input data for GenerateOutputMeshes_3DGS_MDL7
struct IntSplitGroupData_MDL7 struct IntSplitGroupData_MDL7
{ {
//! Construction from a given shared data set //! Construction from a given shared data set
IntSplitGroupData_MDL7(IntSharedData_MDL7& _shared, IntSplitGroupData_MDL7(IntSharedData_MDL7& _shared,
std::vector<aiMesh*>& _avOutList) std::vector<aiMesh*>& _avOutList)
@ -955,7 +955,7 @@ struct IntSplitGroupData_MDL7
//! Shared data for all groups of the model //! Shared data for all groups of the model
IntSharedData_MDL7& shared; IntSharedData_MDL7& shared;
//! List of meshes //! List of meshes
std::vector<aiMesh*>& avOutList; std::vector<aiMesh*>& avOutList;
}; };

View File

@ -47,7 +47,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "PlyLoader.h" #include "PlyLoader.h"
#include "fast_atof.h" #include "fast_atof.h"
#include "../include/assimp/DefaultLogger.hpp" #include "../include/assimp/DefaultLogger.hpp"
#include "ByteSwap.h" #include "ByteSwapper.h"
using namespace Assimp; using namespace Assimp;

View File

@ -49,7 +49,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "../include/assimp/Exporter.hpp" #include "../include/assimp/Exporter.hpp"
#include <boost/scoped_ptr.hpp> #include <boost/scoped_ptr.hpp>
#include "Exceptional.h" #include "Exceptional.h"
#include "ByteSwap.h" #include "ByteSwapper.h"
using namespace Assimp; using namespace Assimp;
namespace Assimp { namespace Assimp {

View File

@ -7,8 +7,8 @@ Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the following with or without modification, are permitted provided that the following
conditions are met: conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -25,16 +25,16 @@ conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--------------------------------------------------------------------------- ---------------------------------------------------------------------------
*/ */
@ -45,7 +45,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef AI_STREAMREADER_H_INCLUDED #ifndef AI_STREAMREADER_H_INCLUDED
#define AI_STREAMREADER_H_INCLUDED #define AI_STREAMREADER_H_INCLUDED
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "Exceptional.h" #include "Exceptional.h"
#include <boost/shared_ptr.hpp> #include <boost/shared_ptr.hpp>
#include "../include/assimp/IOStream.hpp" #include "../include/assimp/IOStream.hpp"
@ -54,12 +54,12 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
namespace Assimp { namespace Assimp {
// -------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------
/** Wrapper class around IOStream to allow for consistent reading of binary data in both /** Wrapper class around IOStream to allow for consistent reading of binary data in both
* little and big endian format. Don't attempt to instance the template directly. Use * little and big endian format. Don't attempt to instance the template directly. Use
* StreamReaderLE to read from a little-endian stream and StreamReaderBE to read from a * StreamReaderLE to read from a little-endian stream and StreamReaderBE to read from a
* BE stream. The class expects that the endianess of any input data is known at * BE stream. The class expects that the endianess of any input data is known at
* compile-time, which should usually be true (#BaseImporter::ConvertToUTF8 implements * compile-time, which should usually be true (#BaseImporter::ConvertToUTF8 implements
* runtime endianess conversions for text files). * runtime endianess conversions for text files).
* *
* XXX switch from unsigned int for size types to size_t? or ptrdiff_t?*/ * XXX switch from unsigned int for size types to size_t? or ptrdiff_t?*/
// -------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------
@ -71,7 +71,7 @@ public:
// FIXME: use these data types throughout the whole library, // FIXME: use these data types throughout the whole library,
// then change them to 64 bit values :-) // then change them to 64 bit values :-)
typedef int diff; typedef int diff;
typedef unsigned int pos; typedef unsigned int pos;
@ -80,7 +80,7 @@ public:
// --------------------------------------------------------------------- // ---------------------------------------------------------------------
/** Construction from a given stream with a well-defined endianess. /** Construction from a given stream with a well-defined endianess.
* *
* The StreamReader holds a permanent strong reference to the * The StreamReader holds a permanent strong reference to the
* stream, which is released upon destruction. * stream, which is released upon destruction.
* @param stream Input stream. The stream is not restarted if * @param stream Input stream. The stream is not restarted if
@ -94,7 +94,7 @@ public:
: stream(stream) : stream(stream)
, le(le) , le(le)
{ {
ai_assert(stream); ai_assert(stream);
InternBegin(); InternBegin();
} }
@ -213,8 +213,8 @@ public:
// --------------------------------------------------------------------- // ---------------------------------------------------------------------
/** Set current file pointer (Get it from #GetPtr). This is if you /** Set current file pointer (Get it from #GetPtr). This is if you
* prefer to do pointer arithmetics on your own or want to copy * prefer to do pointer arithmetics on your own or want to copy
* large chunks of data at once. * large chunks of data at once.
* @param p The new pointer, which is validated against the size * @param p The new pointer, which is validated against the size
* limit and buffer boundaries. */ * limit and buffer boundaries. */
void SetPtr(int8_t* p) { void SetPtr(int8_t* p) {
@ -250,7 +250,7 @@ public:
// --------------------------------------------------------------------- // ---------------------------------------------------------------------
/** Setup a temporary read limit /** Setup a temporary read limit
* *
* @param limit Maximum number of bytes to be read from * @param limit Maximum number of bytes to be read from
* the beginning of the file. Specifying UINT_MAX * the beginning of the file. Specifying UINT_MAX
* resets the limit to the original end of the stream. */ * resets the limit to the original end of the stream. */
@ -285,7 +285,7 @@ public:
/** overload operator>> and allow chaining of >> ops. */ /** overload operator>> and allow chaining of >> ops. */
template <typename T> template <typename T>
StreamReader& operator >> (T& f) { StreamReader& operator >> (T& f) {
f = Get<T>(); f = Get<T>();
return *this; return *this;
} }
@ -304,7 +304,7 @@ private:
memcpy (&f, current, sizeof(T)); memcpy (&f, current, sizeof(T));
#else #else
T f = *((const T*)current); T f = *((const T*)current);
#endif #endif
Intern :: Getter<SwapEndianess,T,RuntimeSwitch>() (&f,le); Intern :: Getter<SwapEndianess,T,RuntimeSwitch>() (&f,le);
current += sizeof(T); current += sizeof(T);

View File

@ -7,8 +7,8 @@ Copyright (c) 2006-2012, assimp team
All rights reserved. All rights reserved.
Redistribution and use of this software in source and binary forms, Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the following with or without modification, are permitted provided that the following
conditions are met: conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
@ -25,16 +25,16 @@ conditions are met:
derived from this software without specific prior derived from this software without specific prior
written permission of the assimp team. written permission of the assimp team.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--------------------------------------------------------------------------- ---------------------------------------------------------------------------
*/ */
@ -45,7 +45,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef AI_STREAMWRITER_H_INCLUDED #ifndef AI_STREAMWRITER_H_INCLUDED
#define AI_STREAMWRITER_H_INCLUDED #define AI_STREAMWRITER_H_INCLUDED
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "../include/assimp/IOStream.hpp" #include "../include/assimp/IOStream.hpp"
#include <boost/shared_ptr.hpp> #include <boost/shared_ptr.hpp>
@ -54,9 +54,9 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
namespace Assimp { namespace Assimp {
// -------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------
/** Wrapper class around IOStream to allow for consistent writing of binary data in both /** Wrapper class around IOStream to allow for consistent writing of binary data in both
* little and big endian format. Don't attempt to instance the template directly. Use * little and big endian format. Don't attempt to instance the template directly. Use
* StreamWriterLE to read from a little-endian stream and StreamWriterBE to read from a * StreamWriterLE to read from a little-endian stream and StreamWriterBE to read from a
* BE stream. Alternatively, there is StreamWriterAny if the endianess of the output * BE stream. Alternatively, there is StreamWriterAny if the endianess of the output
* stream is to be determined at runtime. * stream is to be determined at runtime.
*/ */
@ -72,7 +72,7 @@ public:
// --------------------------------------------------------------------- // ---------------------------------------------------------------------
/** Construction from a given stream with a well-defined endianess. /** Construction from a given stream with a well-defined endianess.
* *
* The StreamReader holds a permanent strong reference to the * The StreamReader holds a permanent strong reference to the
* stream, which is released upon destruction. * stream, which is released upon destruction.
* @param stream Input stream. The stream is not re-seeked and writing * @param stream Input stream. The stream is not re-seeked and writing
@ -86,7 +86,7 @@ public:
, le(le) , le(le)
, cursor() , cursor()
{ {
ai_assert(stream); ai_assert(stream);
buffer.reserve(INITIAL_CAPACITY); buffer.reserve(INITIAL_CAPACITY);
} }
@ -175,7 +175,7 @@ public:
/** overload operator<< and allow chaining of MM ops. */ /** overload operator<< and allow chaining of MM ops. */
template <typename T> template <typename T>
StreamWriter& operator << (T f) { StreamWriter& operator << (T f) {
Put(f); Put(f);
return *this; return *this;
} }
@ -196,7 +196,7 @@ private:
template <typename T> template <typename T>
void Put(T f) { void Put(T f) {
Intern :: Getter<SwapEndianess,T,RuntimeSwitch>() (&f, le); Intern :: Getter<SwapEndianess,T,RuntimeSwitch>() (&f, le);
if (cursor + sizeof(T) >= buffer.size()) { if (cursor + sizeof(T) >= buffer.size()) {
buffer.resize(cursor + sizeof(T)); buffer.resize(cursor + sizeof(T));
} }

View File

@ -50,7 +50,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "Exceptional.h" #include "Exceptional.h"
#include <boost/format.hpp> #include <boost/format.hpp>
#include <boost/lexical_cast.hpp> #include <boost/lexical_cast.hpp>
#include "ByteSwap.h" #include "ByteSwapper.h"
#include "../include/assimp/DefaultLogger.hpp" #include "../include/assimp/DefaultLogger.hpp"

330
doc/dox.h
View File

@ -9,14 +9,14 @@
@section intro Introduction @section intro Introduction
assimp is a library to load and process geometric scenes from various data formats. It is tailored at typical game assimp is a library to load and process geometric scenes from various data formats. It is tailored at typical game
scenarios by supporting a node hierarchy, static or skinned meshes, materials, bone animations and potential texture data. scenarios by supporting a node hierarchy, static or skinned meshes, materials, bone animations and potential texture data.
The library is *not* designed for speed, it is primarily useful for importing assets from various sources once and The library is *not* designed for speed, it is primarily useful for importing assets from various sources once and
storing it in a engine-specific format for easy and fast every-day-loading. assimp is also able to apply various post storing it in a engine-specific format for easy and fast every-day-loading. assimp is also able to apply various post
processing steps to the imported data such as conversion to indexed meshes, calculation of normals or tangents/bitangents processing steps to the imported data such as conversion to indexed meshes, calculation of normals or tangents/bitangents
or conversion from right-handed to left-handed coordinate systems. or conversion from right-handed to left-handed coordinate systems.
assimp currently supports the following file formats (note that some loaders lack some features of their formats because assimp currently supports the following file formats (note that some loaders lack some features of their formats because
some file formats contain data not supported by assimp, some stuff would require so much conversion work some file formats contain data not supported by assimp, some stuff would require so much conversion work
that it has not been implemented yet and some (most ...) formats lack proper specifications): that it has not been implemented yet and some (most ...) formats lack proper specifications):
<hr> <hr>
@ -39,15 +39,15 @@ that it has not been implemented yet and some (most ...) formats lack proper spe
<b>Quake 3 BSP</b> ( <i>*.pk3</i> ) <sup>1</sup> <br> <b>Quake 3 BSP</b> ( <i>*.pk3</i> ) <sup>1</sup> <br>
<b>RtCW</b> ( <i>*.mdc</i> )<br> <b>RtCW</b> ( <i>*.mdc</i> )<br>
<b>Doom 3</b> ( <i>*.md5mesh;*.md5anim;*.md5camera</i> ) <br> <b>Doom 3</b> ( <i>*.md5mesh;*.md5anim;*.md5camera</i> ) <br>
<b>DirectX X </b> ( <i>*.x</i> ). <br> <b>DirectX X </b> ( <i>*.x</i> ). <br>
<b>Quick3D </b> ( <i>*.q3o;*q3s</i> ). <br> <b>Quick3D </b> ( <i>*.q3o;*q3s</i> ). <br>
<b>Raw Triangles </b> ( <i>*.raw</i> ). <br> <b>Raw Triangles </b> ( <i>*.raw</i> ). <br>
<b>AC3D </b> ( <i>*.ac</i> ). <br> <b>AC3D </b> ( <i>*.ac</i> ). <br>
<b>Stereolithography </b> ( <i>*.stl</i> ). <br> <b>Stereolithography </b> ( <i>*.stl</i> ). <br>
<b>Autodesk DXF </b> ( <i>*.dxf</i> ). <br> <b>Autodesk DXF </b> ( <i>*.dxf</i> ). <br>
<b>Irrlicht Mesh </b> ( <i>*.irrmesh;*.xml</i> ). <br> <b>Irrlicht Mesh </b> ( <i>*.irrmesh;*.xml</i> ). <br>
<b>Irrlicht Scene </b> ( <i>*.irr;*.xml</i> ). <br> <b>Irrlicht Scene </b> ( <i>*.irr;*.xml</i> ). <br>
<b>Object File Format </b> ( <i>*.off</i> ). <br> <b>Object File Format </b> ( <i>*.off</i> ). <br>
<b>Terragen Terrain </b> ( <i>*.ter</i> ) <br> <b>Terragen Terrain </b> ( <i>*.ter</i> ) <br>
<b>3D GameStudio Model </b> ( <i>*.mdl</i> ) <br> <b>3D GameStudio Model </b> ( <i>*.mdl</i> ) <br>
<b>3D GameStudio Terrain</b> ( <i>*.hmp</i> )<br> <b>3D GameStudio Terrain</b> ( <i>*.hmp</i> )<br>
@ -60,9 +60,9 @@ that it has not been implemented yet and some (most ...) formats lack proper spe
<b>Stanford Ply</b> ( <i>*.ply</i> )<br> <b>Stanford Ply</b> ( <i>*.ply</i> )<br>
<b>TrueSpace</b> ( <i>*.cob, *.scn</i> )<sup>2</sup><br><br> <b>TrueSpace</b> ( <i>*.cob, *.scn</i> )<sup>2</sup><br><br>
</tt> </tt>
See the @link importer_notes Importer Notes Page @endlink for informations, what a specific importer can do and what not. See the @link importer_notes Importer Notes Page @endlink for informations, what a specific importer can do and what not.
Note that although this paper claims to be the official documentation, Note that although this paper claims to be the official documentation,
http://assimp.sourceforge.net/main_features_formats.html http://assimp.sourceforge.net/main_features_formats.html
<br>is usually the most up-to-date list of file formats supported by the library. <br> <br>is usually the most up-to-date list of file formats supported by the library. <br>
<sup>1</sup>: Experimental loaders<br> <sup>1</sup>: Experimental loaders<br>
@ -71,12 +71,12 @@ http://assimp.sourceforge.net/main_features_formats.html
<br> <br>
<hr> <hr>
assimp is independent of the Operating System by nature, providing a C++ interface for easy integration assimp is independent of the Operating System by nature, providing a C++ interface for easy integration
with game engines and a C interface to allow bindings to other programming languages. At the moment the library runs with game engines and a C interface to allow bindings to other programming languages. At the moment the library runs
on any little-endian platform including X86/Windows/Linux/Mac and X64/Windows/Linux/Mac. Special attention on any little-endian platform including X86/Windows/Linux/Mac and X64/Windows/Linux/Mac. Special attention
was paid to keep the library as free as possible from dependencies. was paid to keep the library as free as possible from dependencies.
Big endian systems such as PPC-Macs or PPC-Linux systems are not officially supported at the moment. However, most Big endian systems such as PPC-Macs or PPC-Linux systems are not officially supported at the moment. However, most
formats handle the required endian conversion correctly, so large parts of the library should work. formats handle the required endian conversion correctly, so large parts of the library should work.
The assimp linker library and viewer application are provided under the BSD 3-clause license. This basically means The assimp linker library and viewer application are provided under the BSD 3-clause license. This basically means
@ -89,14 +89,14 @@ but not all of them are *open-source*. If there's an accompagning '<file>\source
@section main_install Installation @section main_install Installation
assimp can be used in two ways: linking against the pre-built libraries or building the library on your own. The former assimp can be used in two ways: linking against the pre-built libraries or building the library on your own. The former
option is the easiest, but the assimp distribution contains pre-built libraries only for Visual C++ 2005 and 2008. For other option is the easiest, but the assimp distribution contains pre-built libraries only for Visual C++ 2005 and 2008. For other
compilers you'll have to build assimp for yourself. Which is hopefully as hassle-free as the other way, but needs a bit compilers you'll have to build assimp for yourself. Which is hopefully as hassle-free as the other way, but needs a bit
more work. Both ways are described at the @link install Installation page. @endlink more work. Both ways are described at the @link install Installation page. @endlink
@section main_usage Usage @section main_usage Usage
When you're done integrating the library into your IDE / project, you can now start using it. There are two separate When you're done integrating the library into your IDE / project, you can now start using it. There are two separate
interfaces by which you can access the library: a C++ interface and a C interface using flat functions. While the former interfaces by which you can access the library: a C++ interface and a C interface using flat functions. While the former
is easier to handle, the latter also forms a point where other programming languages can connect to. Upto the moment, though, is easier to handle, the latter also forms a point where other programming languages can connect to. Upto the moment, though,
there are no bindings for any other language provided. Have a look at the @link usage Usage page @endlink for a detailed explanation and code examples. there are no bindings for any other language provided. Have a look at the @link usage Usage page @endlink for a detailed explanation and code examples.
@ -104,7 +104,7 @@ there are no bindings for any other language provided. Have a look at the @link
@section main_data Data Structures @section main_data Data Structures
When the importer successfully completed its job, the imported data is returned in an aiScene structure. This is the root When the importer successfully completed its job, the imported data is returned in an aiScene structure. This is the root
point from where you can access all the various data types that a scene/model file can possibly contain. The point from where you can access all the various data types that a scene/model file can possibly contain. The
@link data Data Structures page @endlink describes how to interpret this data. @link data Data Structures page @endlink describes how to interpret this data.
@section ext Extending the library @section ext Extending the library
@ -118,7 +118,7 @@ See the @link extend Extending the library @endlink page for more information.
@section main_support Support & Feedback @section main_support Support & Feedback
If you have any questions/comments/suggestions/bug reports you're welcome to post them in our If you have any questions/comments/suggestions/bug reports you're welcome to post them in our
<a href="https://sourceforge.net/forum/forum.php?forum_id=817653">forums</a>. Alternatively there's <a href="https://sourceforge.net/forum/forum.php?forum_id=817653">forums</a>. Alternatively there's
a mailing list, <a href="https://sourceforge.net/mailarchive/forum.php?forum_name=assimp-discussions"> a mailing list, <a href="https://sourceforge.net/mailarchive/forum.php?forum_name=assimp-discussions">
assimp-discussions</a>. assimp-discussions</a>.
@ -146,18 +146,18 @@ project configs. For static linking, use release/debug. See the sections below o
other build configs. other build configs.
If done correctly you should now be able to compile, link, If done correctly you should now be able to compile, link,
run and use the application. If the linker complains about some integral functions being defined twice you propably have run and use the application. If the linker complains about some integral functions being defined twice you propably have
mixed the runtimes. Recheck the project configuration (project properties -&gt; C++ -&gt; Code generation -&gt; Runtime) if you use mixed the runtimes. Recheck the project configuration (project properties -&gt; C++ -&gt; Code generation -&gt; Runtime) if you use
static runtimes (Multithreaded / Multithreaded Debug) or dynamic runtimes (Multithreaded DLL / Multithreaded Debug DLL). static runtimes (Multithreaded / Multithreaded Debug) or dynamic runtimes (Multithreaded DLL / Multithreaded Debug DLL).
Choose the assimp linker lib accordingly. Choose the assimp linker lib accordingly.
<br><br> <br><br>
Please don't forget to also read the @ref assimp_stl section on MSVC and the STL. Please don't forget to also read the @ref assimp_stl section on MSVC and the STL.
@section assimp_stl Microsoft Compilers and the C++ Standard Library @section assimp_stl Microsoft Compilers and the C++ Standard Library
In VC8 and VC9 Microsoft introduced some Standard Library debugging features. A good example are improved iterator checks and In VC8 and VC9 Microsoft introduced some Standard Library debugging features. A good example are improved iterator checks and
various useful debug checks. The problem is the performance penalty that incurs with those extra checks. various useful debug checks. The problem is the performance penalty that incurs with those extra checks.
Most of these security enhancements are active in release builds by default, rendering assimp several times Most of these security enhancements are active in release builds by default, rendering assimp several times
slower. However, it is possible to disable them by setting slower. However, it is possible to disable them by setting
@code @code
@ -168,39 +168,39 @@ _SECURE_SCL=0
in the preprocessor options (or alternatively in the source code, just before the STL is included for the first time). in the preprocessor options (or alternatively in the source code, just before the STL is included for the first time).
<b>assimp's vc8 and vc9 configs enable these flags by default</b>. <b>assimp's vc8 and vc9 configs enable these flags by default</b>.
<i>If you're linking statically against assimp:</i> Make sure your applications uses the same STl settings! <i>If you're linking statically against assimp:</i> Make sure your applications uses the same STl settings!
If you do not, there are two binary incompatible STL versions mangled together and you'll crash. If you do not, there are two binary incompatible STL versions mangled together and you'll crash.
Alternatively you can disable the fast STL settings for assimp by removing the 'FastSTL' property sheet from Alternatively you can disable the fast STL settings for assimp by removing the 'FastSTL' property sheet from
the vc project file. the vc project file.
<i>If you're using assimp in a DLL/SO:</i> It's ok. There's no STL used in the binary DLL/SO interface, so it doesn't care whether <i>If you're using assimp in a DLL/SO:</i> It's ok. There's no STL used in the binary DLL/SO interface, so it doesn't care whether
your application uses the same STL settings or not. your application uses the same STL settings or not.
<br><br> <br><br>
Another option is to build against a different STL implementation, for example STlport. There's a special Another option is to build against a different STL implementation, for example STlport. There's a special
@ref assimp_stlport section that has a description how to achieve this. @ref assimp_stlport section that has a description how to achieve this.
@section install_own Building the library from scratch @section install_own Building the library from scratch
To build the library on your own you first have to get hold of the dependencies. Fortunately, special attention was paid to To build the library on your own you first have to get hold of the dependencies. Fortunately, special attention was paid to
keep the list of dependencies short. Unfortunately, the only dependency is <a href="http://www.boost.org">boost</a> which keep the list of dependencies short. Unfortunately, the only dependency is <a href="http://www.boost.org">boost</a> which
can be a bit painful to set up for certain development environments. Boost is a widely used collection of classes and can be a bit painful to set up for certain development environments. Boost is a widely used collection of classes and
functions for various purposes. Chances are that it was already installed along with your compiler. If not, you have to install functions for various purposes. Chances are that it was already installed along with your compiler. If not, you have to install
it for yourself. Read the "Getting Started" section of the Boost documentation for how to setup boost. VisualStudio users it for yourself. Read the "Getting Started" section of the Boost documentation for how to setup boost. VisualStudio users
can use a comfortable installer from <a href="http://www.boost-consulting.com/products/free"> can use a comfortable installer from <a href="http://www.boost-consulting.com/products/free">
http://www.boost-consulting.com/products/free</a>. Choose the appropriate version of boost for your runtime of choice. http://www.boost-consulting.com/products/free</a>. Choose the appropriate version of boost for your runtime of choice.
<b>If you don't want to use boost</b>, you can build against our <i>"Boost-Workaround"</i>. It consists of very small <b>If you don't want to use boost</b>, you can build against our <i>"Boost-Workaround"</i>. It consists of very small
implementations of the various boost utility classes used. However, you'll lose functionality (e.g. threading) by doing this. implementations of the various boost utility classes used. However, you'll lose functionality (e.g. threading) by doing this.
So, if you can use boost, you should use boost. Otherwise, See the @link use_noboost NoBoost-Section @endlink So, if you can use boost, you should use boost. Otherwise, See the @link use_noboost NoBoost-Section @endlink
later on this page for the details of the workaround. later on this page for the details of the workaround.
Once boost is working, you have to set up a project for the assimp library in your favorite IDE. If you use VC2005 or Once boost is working, you have to set up a project for the assimp library in your favorite IDE. If you use VC2005 or
VC2008, you can simply load the solution or project files in the workspaces/ folder, otherwise you have to create a new VC2008, you can simply load the solution or project files in the workspaces/ folder, otherwise you have to create a new
package and add all the headers and source files from the include/ and code/ directories. Set the temporary output folder package and add all the headers and source files from the include/ and code/ directories. Set the temporary output folder
to obj/, for example, and redirect the output folder to bin/. Then build the library - it should compile and link fine. to obj/, for example, and redirect the output folder to bin/. Then build the library - it should compile and link fine.
The last step is to integrate the library into your project. This is basically the same task as described in the The last step is to integrate the library into your project. This is basically the same task as described in the
"Using the pre-built libraries" section above: add the include/ and bin/ directories to your IDE's paths so that the compiler can find "Using the pre-built libraries" section above: add the include/ and bin/ directories to your IDE's paths so that the compiler can find
the library files. Alternatively you can simply add the assimp project to your project's overall solution and build it inside the library files. Alternatively you can simply add the assimp project to your project's overall solution and build it inside
your solution. your solution.
@ -221,7 +221,7 @@ The Boost-Workaround consists of dummy replacements for some boost utility templ
These implementations are very limited and are not intended for use outside assimp. A compiler These implementations are very limited and are not intended for use outside assimp. A compiler
with full support for partial template specializations is required. To enable the workaround, put the following in with full support for partial template specializations is required. To enable the workaround, put the following in
your compiler's list of predefined macros: your compiler's list of predefined macros:
@code @code
#define ASSIMP_BUILD_BOOST_WORKAROUND #define ASSIMP_BUILD_BOOST_WORKAROUND
@endcode @endcode
@ -240,7 +240,7 @@ for more details.
assimp can be built as DLL. You just need to select a -dll config from the list of project assimp can be built as DLL. You just need to select a -dll config from the list of project
configs and you're fine. configs and you're fine.
<b>NOTE:</b> Theoretically, assimp-dll can be used with multithreaded (non-dll) runtime libraries, <b>NOTE:</b> Theoretically, assimp-dll can be used with multithreaded (non-dll) runtime libraries,
as long as you don't utilize any non-public stuff from the code folder. However, if you happen as long as you don't utilize any non-public stuff from the code folder. However, if you happen
to encounter *very* strange problems, try changing the runtime to <i>Multithreaded (Debug) DLL</i>. to encounter *very* strange problems, try changing the runtime to <i>Multithreaded (Debug) DLL</i>.
@ -260,19 +260,19 @@ C++ Standard Library.
*/ */
/** /**
@page usage Usage @page usage Usage
@section access_cpp Access by C++ class interface @section access_cpp Access by C++ class interface
The assimp library can be accessed by both a class or flat function interface. The C++ class The assimp library can be accessed by both a class or flat function interface. The C++ class
interface is the preferred way of interaction: you create an instance of class Assimp::Importer, interface is the preferred way of interaction: you create an instance of class Assimp::Importer,
maybe adjust some settings of it and then call Assimp::Importer::ReadFile(). The class will maybe adjust some settings of it and then call Assimp::Importer::ReadFile(). The class will
read the files and process its data, handing back the imported data as a pointer to an aiScene read the files and process its data, handing back the imported data as a pointer to an aiScene
to you. You can now extract the data you need from the file. The importer manages all the resources to you. You can now extract the data you need from the file. The importer manages all the resources
for itsself. If the importer is destroyed, all the data that was created/read by it will be for itsself. If the importer is destroyed, all the data that was created/read by it will be
destroyed, too. So the easiest way to use the Importer is to create an instance locally, use its destroyed, too. So the easiest way to use the Importer is to create an instance locally, use its
results and then simply let it go out of scope. results and then simply let it go out of scope.
C++ example: C++ example:
@code @code
@ -286,14 +286,14 @@ bool DoTheImportThing( const std::string& pFile)
Assimp::Importer importer; Assimp::Importer importer;
// And have it read the given file with some example postprocessing // And have it read the given file with some example postprocessing
// Usually - if speed is not the most important aspect for you - you'll // Usually - if speed is not the most important aspect for you - you'll
// propably to request more postprocessing than we do in this example. // propably to request more postprocessing than we do in this example.
const aiScene* scene = importer.ReadFile( pFile, const aiScene* scene = importer.ReadFile( pFile,
aiProcess_CalcTangentSpace | aiProcess_CalcTangentSpace |
aiProcess_Triangulate | aiProcess_Triangulate |
aiProcess_JoinIdenticalVertices | aiProcess_JoinIdenticalVertices |
aiProcess_SortByPType); aiProcess_SortByPType);
// If the import failed, report it // If the import failed, report it
if( !scene) if( !scene)
{ {
@ -301,7 +301,7 @@ bool DoTheImportThing( const std::string& pFile)
return false; return false;
} }
// Now we can access the file's contents. // Now we can access the file's contents.
DoTheSceneProcessing( scene); DoTheSceneProcessing( scene);
// We're done. Everything will be cleaned up by the importer destructor // We're done. Everything will be cleaned up by the importer destructor
@ -312,9 +312,9 @@ bool DoTheImportThing( const std::string& pFile)
What exactly is read from the files and how you interpret it is described at the @ref data page. @endlink The post processing steps that the assimp library can apply to the What exactly is read from the files and how you interpret it is described at the @ref data page. @endlink The post processing steps that the assimp library can apply to the
imported data are listed at #aiPostProcessSteps. See the @ref pp Post proccessing page for more details. imported data are listed at #aiPostProcessSteps. See the @ref pp Post proccessing page for more details.
Note that the aiScene data structure returned is declared 'const'. Yes, you can get rid of Note that the aiScene data structure returned is declared 'const'. Yes, you can get rid of
these 5 letters with a simple cast. Yes, you may do that. No, it's not recommended (and it's these 5 letters with a simple cast. Yes, you may do that. No, it's not recommended (and it's
suicide in DLL builds if you try to use new or delete on any of the arrays in the scene). suicide in DLL builds if you try to use new or delete on any of the arrays in the scene).
@section access_c Access by plain-c function interface @section access_c Access by plain-c function interface
@ -336,8 +336,8 @@ bool DoTheImportThing( const char* pFile)
// Start the import on the given file with some example postprocessing // Start the import on the given file with some example postprocessing
// Usually - if speed is not the most important aspect for you - you'll t // Usually - if speed is not the most important aspect for you - you'll t
// probably to request more postprocessing than we do in this example. // probably to request more postprocessing than we do in this example.
const aiScene* scene = aiImportFile( pFile, const aiScene* scene = aiImportFile( pFile,
aiProcess_CalcTangentSpace | aiProcess_CalcTangentSpace |
aiProcess_Triangulate | aiProcess_Triangulate |
aiProcess_JoinIdenticalVertices | aiProcess_JoinIdenticalVertices |
aiProcess_SortByPType); aiProcess_SortByPType);
@ -363,7 +363,7 @@ bool DoTheImportThing( const char* pFile)
The assimp library needs to access files internally. This of course applies to the file you want The assimp library needs to access files internally. This of course applies to the file you want
to read, but also to additional files in the same folder for certain file formats. By default, to read, but also to additional files in the same folder for certain file formats. By default,
standard C/C++ IO logic is used to access these files. If your application works in a special standard C/C++ IO logic is used to access these files. If your application works in a special
environment where custom logic is needed to access the specified files, you have to supply environment where custom logic is needed to access the specified files, you have to supply
custom implementations of IOStream and IOSystem. A shortened example might look like this: custom implementations of IOStream and IOSystem. A shortened example might look like this:
@code @code
@ -397,25 +397,25 @@ class MyIOSystem : public Assimp::IOSystem
// Check whether a specific file exists // Check whether a specific file exists
bool Exists( const std::string& pFile) const { bool Exists( const std::string& pFile) const {
.. ..
} }
// Get the path delimiter character we'd like to see // Get the path delimiter character we'd like to see
char GetOsSeparator() const { char GetOsSeparator() const {
return '/'; return '/';
} }
// ... and finally a method to open a custom stream // ... and finally a method to open a custom stream
IOStream* Open( const std::string& pFile, const std::string& pMode) { IOStream* Open( const std::string& pFile, const std::string& pMode) {
return new MyIOStream( ... ); return new MyIOStream( ... );
} }
void Close( IOStream* pFile) { delete pFile; } void Close( IOStream* pFile) { delete pFile; }
}; };
@endcode @endcode
Now that your IO system is implemented, supply an instance of it to the Importer object by calling Now that your IO system is implemented, supply an instance of it to the Importer object by calling
Assimp::Importer::SetIOHandler(). Assimp::Importer::SetIOHandler().
@code @code
void DoTheImportThing( const std::string& pFile) void DoTheImportThing( const std::string& pFile)
@ -441,18 +441,18 @@ surely enough for almost any purpose. The process is simple:
<li> .. and pass it as parameter to #aiImportFileEx <li> .. and pass it as parameter to #aiImportFileEx
</ul> </ul>
@section logging Logging @section logging Logging
The assimp library provides an easy mechanism to log messages. For instance if you want to check the state of your The assimp library provides an easy mechanism to log messages. For instance if you want to check the state of your
import and you just want to see, after which preprocessing step the import-process was aborted you can take a look import and you just want to see, after which preprocessing step the import-process was aborted you can take a look
into the log. into the log.
Per default the assimp-library provides a default log implementation, where you can log your user specific message Per default the assimp-library provides a default log implementation, where you can log your user specific message
by calling it as a singleton with the requested logging-type. To see how this works take a look to this: by calling it as a singleton with the requested logging-type. To see how this works take a look to this:
@code @code
using namespace Assimp; using namespace Assimp;
// Create a logger instance // Create a logger instance
DefaultLogger::create("",Logger::VERBOSE); DefaultLogger::create("",Logger::VERBOSE);
// Now I am ready for logging my stuff // Now I am ready for logging my stuff
@ -462,12 +462,12 @@ DefaultLogger::get()->info("this is my info-call");
DefaultLogger::kill(); DefaultLogger::kill();
@endcode @endcode
At first you have to create the default-logger-instance (create). Now you are ready to rock and can log a At first you have to create the default-logger-instance (create). Now you are ready to rock and can log a
little bit around. After that you should kill it to release the singleton instance. little bit around. After that you should kill it to release the singleton instance.
If you want to integrate the assimp-log into your own GUI it my be helpful to have a mechanism writing If you want to integrate the assimp-log into your own GUI it my be helpful to have a mechanism writing
the logs into your own log windows. The logger interface provides this by implementing an interface called LogStream. the logs into your own log windows. The logger interface provides this by implementing an interface called LogStream.
You can attach and detach this log stream to the default-logger instance or any implementation derived from Logger. You can attach and detach this log stream to the default-logger instance or any implementation derived from Logger.
Just derivate your own logger from the abstract base class LogStream and overwrite the write-method: Just derivate your own logger from the abstract base class LogStream and overwrite the write-method:
@code @code
@ -481,7 +481,7 @@ public:
{ {
// empty // empty
} }
// Destructor // Destructor
~myStream() ~myStream()
{ {
@ -504,9 +504,9 @@ Assimp::DefaultLogger::get()->attachStream( new myStream(), severity );
@endcode @endcode
The severity level controls the kind of message which will be written into The severity level controls the kind of message which will be written into
the attached stream. If you just want to log errors and warnings set the warn the attached stream. If you just want to log errors and warnings set the warn
and error severity flag for those severities. It is also possible to remove and error severity flag for those severities. It is also possible to remove
a self defined logstream from an error severity by detaching it with the severity a self defined logstream from an error severity by detaching it with the severity
flag set: flag set:
@code @code
@ -519,10 +519,10 @@ Assimp::DefaultLogger::get()->attachStream( new myStream(), severity );
@endcode @endcode
If you want to implement your own logger just derive from the abstract base class If you want to implement your own logger just derive from the abstract base class
#Logger and overwrite the methods debug, info, warn and error. #Logger and overwrite the methods debug, info, warn and error.
If you want to see the debug-messages in a debug-configured build, the Logger-interface If you want to see the debug-messages in a debug-configured build, the Logger-interface
provides a logging-severity. You can set it calling the following method: provides a logging-severity. You can set it calling the following method:
@code @code
@ -531,17 +531,17 @@ Assimp::DefaultLogger::get()->setLogSeverity( LogSeverity log_severity );
@endcode @endcode
The normal logging severity supports just the basic stuff like, info, warnings and errors. The normal logging severity supports just the basic stuff like, info, warnings and errors.
In the verbose level very fine-grained debug messages will be logged, too. Note that this In the verbose level very fine-grained debug messages will be logged, too. Note that this
kind kind of logging might decrease import performance. kind kind of logging might decrease import performance.
*/ */
/** /**
@page data Data Structures @page data Data Structures
The assimp library returns the imported data in a collection of structures. aiScene forms the root The assimp library returns the imported data in a collection of structures. aiScene forms the root
of the data, from here you gain access to all the nodes, meshes, materials, animations or textures of the data, from here you gain access to all the nodes, meshes, materials, animations or textures
that were read from the imported file. The aiScene is returned from a successful call to that were read from the imported file. The aiScene is returned from a successful call to
assimp::Importer::ReadFile(), aiImportFile() or aiImportFileEx() - see the @link usage Usage page @endlink assimp::Importer::ReadFile(), aiImportFile() or aiImportFileEx() - see the @link usage Usage page @endlink
for further information on how to use the library. for further information on how to use the library.
@ -555,17 +555,17 @@ DirectX. If you need the imported data to be in a left-handed coordinate system,
The output face winding is counter clockwise. Use #aiProcess_FlipWindingOrder to get CW data. The output face winding is counter clockwise. Use #aiProcess_FlipWindingOrder to get CW data.
@code @code
x2 x2
x1 x1
x0 x0
@endcode @endcode
Outputted polygons can be literally everything: they're probably concave, self-intersecting or non-planar, Outputted polygons can be literally everything: they're probably concave, self-intersecting or non-planar,
although our built-in triangulation (#aiProcess_Triangulate postprocessing step) doesn't handle the two latter. although our built-in triangulation (#aiProcess_Triangulate postprocessing step) doesn't handle the two latter.
The output UV coordinate system has its origin in the lower-left corner: The output UV coordinate system has its origin in the lower-left corner:
@code @code
0y|1y ---------- 1x|1y 0y|1y ---------- 1x|1y
| | | |
| | | |
| | | |
@ -582,31 +582,31 @@ X3 Y3 Z3 T3
0 0 0 1 0 0 0 1
@endcode @endcode
... with (X1, X2, X3) being the X base vector, (Y1, Y2, Y3) being the Y base vector, (Z1, Z2, Z3) ... with (X1, X2, X3) being the X base vector, (Y1, Y2, Y3) being the Y base vector, (Z1, Z2, Z3)
being the Z base vector and (T1, T2, T3) being the translation part. If you want to use these matrices being the Z base vector and (T1, T2, T3) being the translation part. If you want to use these matrices
in DirectX functions, you have to transpose them. in DirectX functions, you have to transpose them.
<hr> <hr>
<b>11.24.09:</b> We changed the orientation of our quaternions to the most common convention to avoid confusion. <b>11.24.09:</b> We changed the orientation of our quaternions to the most common convention to avoid confusion.
However, if you're a previous user of Assimp and you update the library to revisions beyond SVNREV 502, However, if you're a previous user of Assimp and you update the library to revisions beyond SVNREV 502,
you have to adapt your animation loading code to match the new quaternion orientation. you have to adapt your animation loading code to match the new quaternion orientation.
<hr> <hr>
@section hierarchy The Node Hierarchy @section hierarchy The Node Hierarchy
Nodes are little named entities in the scene that have a place and orientation relative to their parents. Nodes are little named entities in the scene that have a place and orientation relative to their parents.
Starting from the scene's root node all nodes can have 0 to x child nodes, thus forming a hierarchy. Starting from the scene's root node all nodes can have 0 to x child nodes, thus forming a hierarchy.
They form the base on which the scene is built on: a node can refer to 0..x meshes, can be referred to They form the base on which the scene is built on: a node can refer to 0..x meshes, can be referred to
by a bone of a mesh or can be animated by a key sequence of an animation. DirectX calls them "frames", by a bone of a mesh or can be animated by a key sequence of an animation. DirectX calls them "frames",
others call them "objects", we call them aiNode. others call them "objects", we call them aiNode.
A node can potentially refer to single or multiple meshes. The meshes are not stored inside the node, but A node can potentially refer to single or multiple meshes. The meshes are not stored inside the node, but
instead in an array of aiMesh inside the aiScene. A node only refers to them by their array index. This also means instead in an array of aiMesh inside the aiScene. A node only refers to them by their array index. This also means
that multiple nodes can refer to the same mesh, which provides a simple form of instancing. A mesh referred to that multiple nodes can refer to the same mesh, which provides a simple form of instancing. A mesh referred to
by this way lives in the node's local coordinate system. If you want the mesh's orientation in global by this way lives in the node's local coordinate system. If you want the mesh's orientation in global
space, you'd have to concatenate the transformations from the referring node and all of its parents. space, you'd have to concatenate the transformations from the referring node and all of its parents.
Most of the file formats don't really support complex scenes, though, but a single model only. But there are Most of the file formats don't really support complex scenes, though, but a single model only. But there are
more complex formats such as .3ds, .x or .collada scenes which may contain an arbitrary complex more complex formats such as .3ds, .x or .collada scenes which may contain an arbitrary complex
@ -646,7 +646,7 @@ void CopyNodesWithMeshes( aiNode node, SceneObject targetParent, Matrix4x4 accTr
This function copies a node into the scene graph if it has children. If yes, a new scene object This function copies a node into the scene graph if it has children. If yes, a new scene object
is created for the import node and the node's meshes are copied over. If not, no object is created. is created for the import node and the node's meshes are copied over. If not, no object is created.
Potential child objects will be added to the old targetParent, but there transformation will be correct Potential child objects will be added to the old targetParent, but there transformation will be correct
in respect to the global space. This function also works great in filtering the bone nodes - nodes in respect to the global space. This function also works great in filtering the bone nodes - nodes
that form the bone hierarchy for another mesh/node, but don't have any mesh themselves. that form the bone hierarchy for another mesh/node, but don't have any mesh themselves.
@section meshes Meshes @section meshes Meshes
@ -662,7 +662,7 @@ An aiMesh is defined by a series of data channels. The presence of these data ch
by the contents of the imported file: by default there are only those data channels present in the mesh by the contents of the imported file: by default there are only those data channels present in the mesh
that were also found in the file. The only channels guarenteed to be always present are aiMesh::mVertices that were also found in the file. The only channels guarenteed to be always present are aiMesh::mVertices
and aiMesh::mFaces. You can test for the presence of other data by testing the pointers against NULL and aiMesh::mFaces. You can test for the presence of other data by testing the pointers against NULL
or use the helper functions provided by aiMesh. You may also specify several post processing flags or use the helper functions provided by aiMesh. You may also specify several post processing flags
at Importer::ReadFile() to let assimp calculate or recalculate additional data channels for you. at Importer::ReadFile() to let assimp calculate or recalculate additional data channels for you.
At the moment, a single aiMesh may contain a set of triangles and polygons. A single vertex does always At the moment, a single aiMesh may contain a set of triangles and polygons. A single vertex does always
@ -677,9 +677,9 @@ See the @link materials Material System Page. @endlink
@section bones Bones @section bones Bones
A mesh may have a set of bones in the form of aiBone structures.. Bones are a means to deform a mesh A mesh may have a set of bones in the form of aiBone structures.. Bones are a means to deform a mesh
according to the movement of a skeleton. Each bone has a name and a set of vertices on which it has influence. according to the movement of a skeleton. Each bone has a name and a set of vertices on which it has influence.
Its offset matrix declares the transformation needed to transform from mesh space to the local space of this bone. Its offset matrix declares the transformation needed to transform from mesh space to the local space of this bone.
Using the bones name you can find the corresponding node in the node hierarchy. This node in relation Using the bones name you can find the corresponding node in the node hierarchy. This node in relation
to the other bones' nodes defines the skeleton of the mesh. Unfortunately there might also be to the other bones' nodes defines the skeleton of the mesh. Unfortunately there might also be
@ -687,7 +687,7 @@ nodes which are not used by a bone in the mesh, but still affect the pose of the
they have child nodes which are bones. So when creating the skeleton hierarchy for a mesh I they have child nodes which are bones. So when creating the skeleton hierarchy for a mesh I
suggest the following method: suggest the following method:
a) Create a map or a similar container to store which nodes are necessary for the skeleton. a) Create a map or a similar container to store which nodes are necessary for the skeleton.
Pre-initialise it for all nodes with a "no". <br> Pre-initialise it for all nodes with a "no". <br>
b) For each bone in the mesh: <br> b) For each bone in the mesh: <br>
b1) Find the corresponding node in the scene's hierarchy by comparing their names. <br> b1) Find the corresponding node in the scene's hierarchy by comparing their names. <br>
@ -697,11 +697,11 @@ c) Recursively iterate over the node hierarchy <br>
c1) If the node is marked as necessary, copy it into the skeleton and check its children <br> c1) If the node is marked as necessary, copy it into the skeleton and check its children <br>
c2) If the node is marked as not necessary, skip it and do not iterate over its children. <br> c2) If the node is marked as not necessary, skip it and do not iterate over its children. <br>
Reasons: you need all the parent nodes to keep the transformation chain intact. For most Reasons: you need all the parent nodes to keep the transformation chain intact. For most
file formats and modelling packages the node hierarchy of the skeleton is either a child file formats and modelling packages the node hierarchy of the skeleton is either a child
of the mesh node or a sibling of the mesh node but this is by no means a requirement so you shouldn't rely on it. of the mesh node or a sibling of the mesh node but this is by no means a requirement so you shouldn't rely on it.
The node closest to the root node is your skeleton root, from there you The node closest to the root node is your skeleton root, from there you
start copying the hierarchy. You can skip every branch without a node being a bone in the mesh - start copying the hierarchy. You can skip every branch without a node being a bone in the mesh -
that's why the algorithm skips the whole branch if the node is marked as "not necessary". that's why the algorithm skips the whole branch if the node is marked as "not necessary".
You should now have a mesh in your engine with a skeleton that is a subset of the imported hierarchy. You should now have a mesh in your engine with a skeleton that is a subset of the imported hierarchy.
@ -719,12 +719,12 @@ though, that certain combinations of file format and exporter don't always store
in the exported file. In this case, mTicksPerSecond is set to 0 to indicate the lack of knowledge. in the exported file. In this case, mTicksPerSecond is set to 0 to indicate the lack of knowledge.
The aiAnimation consists of a series of aiNodeAnim's. Each bone animation affects a single node in The aiAnimation consists of a series of aiNodeAnim's. Each bone animation affects a single node in
the node hierarchy only, the name specifying which node is affected. For this node the structure the node hierarchy only, the name specifying which node is affected. For this node the structure
stores three separate key sequences: a vector key sequence for the position, a quaternion key sequence stores three separate key sequences: a vector key sequence for the position, a quaternion key sequence
for the rotation and another vector key sequence for the scaling. All 3d data is local to the for the rotation and another vector key sequence for the scaling. All 3d data is local to the
coordinate space of the node's parent, that means in the same space as the node's transformation matrix. coordinate space of the node's parent, that means in the same space as the node's transformation matrix.
There might be cases where animation tracks refer to a non-existent node by their name, but this There might be cases where animation tracks refer to a non-existent node by their name, but this
should not be the case in your every-day data. should not be the case in your every-day data.
To apply such an animation you need to identify the animation tracks that refer to actual bones To apply such an animation you need to identify the animation tracks that refer to actual bones
in your mesh. Then for every track: <br> in your mesh. Then for every track: <br>
@ -733,7 +733,7 @@ b) Optional: interpolate between these and the following keys. <br>
c) Combine the calculated position, rotation and scaling to a tranformation matrix <br> c) Combine the calculated position, rotation and scaling to a tranformation matrix <br>
d) Set the affected node's transformation to the calculated matrix. <br> d) Set the affected node's transformation to the calculated matrix. <br>
If you need hints on how to convert to or from quaternions, have a look at the If you need hints on how to convert to or from quaternions, have a look at the
<a href="http://www.j3d.org/matrix_faq/matrfaq_latest.html">Matrix&Quaternion FAQ</a>. I suggest <a href="http://www.j3d.org/matrix_faq/matrfaq_latest.html">Matrix&Quaternion FAQ</a>. I suggest
using logarithmic interpolation for the scaling keys if you happen to need them - usually you don't using logarithmic interpolation for the scaling keys if you happen to need them - usually you don't
need them at all. need them at all.
@ -742,7 +742,7 @@ need them at all.
Normally textures used by assets are stored in separate files, however, Normally textures used by assets are stored in separate files, however,
there are file formats embedding their textures directly into the model file. there are file formats embedding their textures directly into the model file.
Such textures are loaded into an aiTexture structure. Such textures are loaded into an aiTexture structure.
<br> <br>
There are two cases: There are two cases:
<br> <br>
@ -769,12 +769,12 @@ set if assimp is able to determine the file format.
@page materials Material System @page materials Material System
@section General Overview @section General Overview
All materials are stored in an array of aiMaterial inside the aiScene. All materials are stored in an array of aiMaterial inside the aiScene.
Each aiMesh refers to one Each aiMesh refers to one
material by its index in the array. Due to the vastly diverging definitions and usages of material material by its index in the array. Due to the vastly diverging definitions and usages of material
parameters there is no hard definition of a material structure. Instead a material is defined by parameters there is no hard definition of a material structure. Instead a material is defined by
a set of properties accessible by their names. Have a look at assimp/material.h to see what types of a set of properties accessible by their names. Have a look at assimp/material.h to see what types of
properties are defined. In this file there are also various functions defined to test for the properties are defined. In this file there are also various functions defined to test for the
presence of certain properties in a material and retrieve their values. presence of certain properties in a material and retrieve their values.
@ -788,13 +788,13 @@ Textures are organized in stacks, each stack being evaluated independently. The
------------------------ ------------------------
| Constant base color | color | Constant base color | color
------------------------ ------------------------
| Blend operation 0 | + | Blend operation 0 | +
------------------------ ------------------------
| Strength factor 0 | 0.25* | Strength factor 0 | 0.25*
------------------------ ------------------------
| Texture 0 | texture_0 | Texture 0 | texture_0
------------------------ ------------------------
| Blend operation 1 | * | Blend operation 1 | *
------------------------ ------------------------
| Strength factor 1 | 1.0* | Strength factor 1 | 1.0*
@ -807,7 +807,7 @@ Textures are organized in stacks, each stack being evaluated independently. The
@section keys Constants @section keys Constants
All material key constants start with 'AI_MATKEY' (it's an ugly macro for historical reasons, don't ask). All material key constants start with 'AI_MATKEY' (it's an ugly macro for historical reasons, don't ask).
<table border="1"> <table border="1">
<tr> <tr>
@ -857,7 +857,7 @@ All material key constants start with 'AI_MATKEY' (it's an ugly macro for histor
<td><tt>COLOR_TRANSPARENT</tt></td> <td><tt>COLOR_TRANSPARENT</tt></td>
<td>aiColor3D</td> <td>aiColor3D</td>
<td>black (0,0,0)</td> <td>black (0,0,0)</td>
<td>Defines the transparent color of the material, this is the color to be multiplied with the color of <td>Defines the transparent color of the material, this is the color to be multiplied with the color of
translucent light to construct the final 'destination color' for a particular position in the screen buffer. T </td> translucent light to construct the final 'destination color' for a particular position in the screen buffer. T </td>
<td>---</tt></td> <td>---</tt></td>
</tr> </tr>
@ -1034,7 +1034,7 @@ mat->Get(AI_MATKEY_COLOR_DIFFUSE,color);
@endcode @endcode
<b>Note:</b> Get() is actually a template with explicit specializations for aiColor3D, aiColor4D, aiString, float, int and some others. <b>Note:</b> Get() is actually a template with explicit specializations for aiColor3D, aiColor4D, aiString, float, int and some others.
Make sure that the type of the second parameter matches the expected data type of the material property (no compile-time check yet!). Make sure that the type of the second parameter matches the expected data type of the material property (no compile-time check yet!).
Don't follow this advice if you wish to encounter very strange results. Don't follow this advice if you wish to encounter very strange results.
@section C C-API @section C C-API
@ -1085,15 +1085,15 @@ for all textures
have uvwsrc for this texture? have uvwsrc for this texture?
assign channel specified in uvwsrc assign channel specified in uvwsrc
else else
assign channels in ascending order for all texture stacks, assign channels in ascending order for all texture stacks,
i.e. diffuse1 gets channel 1, opacity0 gets channel 0. i.e. diffuse1 gets channel 1, opacity0 gets channel 0.
@endverbatim @endverbatim
@section pseudo Pseudo Code Listing @section pseudo Pseudo Code Listing
For completeness, the following is a very rough pseudo-code sample showing how to evaluate Assimp materials in your For completeness, the following is a very rough pseudo-code sample showing how to evaluate Assimp materials in your
shading pipeline. You'll probably want to limit your handling of all those material keys to a reasonable subset suitable for your purposes shading pipeline. You'll probably want to limit your handling of all those material keys to a reasonable subset suitable for your purposes
(for example most 3d engines won't support highly complex multi-layer materials, but many 3d modellers do). (for example most 3d engines won't support highly complex multi-layer materials, but many 3d modellers do).
Also note that this sample is targeted at a (shader-based) rendering pipeline for real time graphics. Also note that this sample is targeted at a (shader-based) rendering pipeline for real time graphics.
@ -1111,7 +1111,7 @@ float3 EvaluateStack(stack)
for (every texture in stack) for (every texture in stack)
{ {
// assuming we have explicit & pretransformed UVs for this texture // assuming we have explicit & pretransformed UVs for this texture
float3 color = SampleTexture(texture,uv); float3 color = SampleTexture(texture,uv);
// scale by texture blend factor // scale by texture blend factor
color *= texture.blend; color *= texture.blend;
@ -1207,7 +1207,7 @@ float4 PimpMyPixel (float4 prev)
// Get all single light contribution terms // Get all single light contribution terms
float3 diff = ComputeDiffuseContribution(); float3 diff = ComputeDiffuseContribution();
float3 spec = ComputeSpecularContribution(); float3 spec = ComputeSpecularContribution();
float3 ambi = ComputeAmbientContribution(); float3 ambi = ComputeAmbientContribution();
// .. and compute the final color value for this pixel // .. and compute the final color value for this pixel
@ -1231,7 +1231,7 @@ float4 PimpMyPixel (float4 prev)
/** /**
@page perf Performance @page perf Performance
@section perf_overview Overview @section perf_overview Overview
@ -1243,9 +1243,9 @@ This page discusses general performance issues related to assimp.
assimp has built-in support for <i>very</i> basic profiling and time measurement. To turn it on, set the <tt>GLOB_MEASURE_TIME</tt> assimp has built-in support for <i>very</i> basic profiling and time measurement. To turn it on, set the <tt>GLOB_MEASURE_TIME</tt>
configuration switch to <tt>true</tt> (nonzero). Results are dumped to the log file, so you need to setup configuration switch to <tt>true</tt> (nonzero). Results are dumped to the log file, so you need to setup
an appropriate logger implementation with at least one output stream first (see the @link logging Logging Page @endlink an appropriate logger implementation with at least one output stream first (see the @link logging Logging Page @endlink
for the details.). for the details.).
Note that these measurements are based on a single run of the importer and each of the post processing steps, so Note that these measurements are based on a single run of the importer and each of the post processing steps, so
a single result set is far away from being significant in a statistic sense. While precision can be improved a single result set is far away from being significant in a statistic sense. While precision can be improved
by running the test multiple times, the low accuracy of the timings may render the results useless by running the test multiple times, the low accuracy of the timings may render the results useless
for smaller files. for smaller files.
@ -1269,7 +1269,7 @@ Info, T5488: Entering post processing pipeline
Debug, T5488: START `postprocess` Debug, T5488: START `postprocess`
Debug, T5488: RemoveRedundantMatsProcess begin Debug, T5488: RemoveRedundantMatsProcess begin
Debug, T5488: RemoveRedundantMatsProcess finished Debug, T5488: RemoveRedundantMatsProcess finished
Debug, T5488: END `postprocess`, dt= 0.001 s Debug, T5488: END `postprocess`, dt= 0.001 s
@ -1306,7 +1306,7 @@ Debug, T5488: START `postprocess`
Debug, T5488: ImproveCacheLocalityProcess begin Debug, T5488: ImproveCacheLocalityProcess begin
Debug, T5488: Mesh 0 | ACMR in: 0.851622 out: 0.718139 | ~15.7 Debug, T5488: Mesh 0 | ACMR in: 0.851622 out: 0.718139 | ~15.7
Info, T5488: Cache relevant are 1 meshes (251904 faces). Average output ACMR is 0.718139 Info, T5488: Cache relevant are 1 meshes (251904 faces). Average output ACMR is 0.718139
Debug, T5488: ImproveCacheLocalityProcess finished. Debug, T5488: ImproveCacheLocalityProcess finished.
Debug, T5488: END `postprocess`, dt= 1.903 s Debug, T5488: END `postprocess`, dt= 1.903 s
@ -1315,13 +1315,13 @@ Debug, T5488: END `total`, dt= 11.269 s
@endverbatim @endverbatim
In this particular example only one fourth of the total import time was spent on the actual importing, while the rest of the In this particular example only one fourth of the total import time was spent on the actual importing, while the rest of the
time got consumed by the #aiProcess_Triangulate, #aiProcess_JoinIdenticalVertices and #aiProcess_ImproveCacheLocality time got consumed by the #aiProcess_Triangulate, #aiProcess_JoinIdenticalVertices and #aiProcess_ImproveCacheLocality
postprocessing steps. A wise selection of postprocessing steps is therefore essential to getting good performance. postprocessing steps. A wise selection of postprocessing steps is therefore essential to getting good performance.
Of course this depends on the individual requirements of your application, in many of the typical use cases of assimp performance won't Of course this depends on the individual requirements of your application, in many of the typical use cases of assimp performance won't
matter (i.e. in an offline content pipeline). matter (i.e. in an offline content pipeline).
*/ */
/** /**
@page threading Threading @page threading Threading
@section overview Overview @section overview Overview
@ -1332,7 +1332,7 @@ use it from multiple threads concurrently.
@section threadsafety Thread-safety / using Assimp concurrently from several threads @section threadsafety Thread-safety / using Assimp concurrently from several threads
The library can be accessed by multiple threads simultaneously, as long as the The library can be accessed by multiple threads simultaneously, as long as the
following prerequisites are fulfilled: following prerequisites are fulfilled:
- Users of the C++-API should ensure that they use a dedicated #Assimp::Importer instance for each thread. Constructing instances of #Assimp::Importer is expensive, so it might be a good idea to - Users of the C++-API should ensure that they use a dedicated #Assimp::Importer instance for each thread. Constructing instances of #Assimp::Importer is expensive, so it might be a good idea to
let every thread maintain its own thread-local instance (which can be used to let every thread maintain its own thread-local instance (which can be used to
@ -1344,9 +1344,9 @@ following prerequisites are fulfilled:
Multiple concurrent imports may or may not be beneficial, however. For certain file formats in conjunction with Multiple concurrent imports may or may not be beneficial, however. For certain file formats in conjunction with
little or no post processing IO times tend to be the performance bottleneck. Intense post processing together little or no post processing IO times tend to be the performance bottleneck. Intense post processing together
with 'slow' file formats like X or Collada might scale well with multiple concurrent imports. with 'slow' file formats like X or Collada might scale well with multiple concurrent imports.
@section automt Internal threading @section automt Internal threading
@ -1357,8 +1357,8 @@ Internal multi-threading is not currently implemented.
/** /**
@page res Resources @page res Resources
This page lists some useful resources for assimp. Note that, even though the core team has an eye on them, This page lists some useful resources for assimp. Note that, even though the core team has an eye on them,
we cannot guarantee the accuracy of third-party information. If in doubt, it's best to ask either on the we cannot guarantee the accuracy of third-party information. If in doubt, it's best to ask either on the
mailing list or on our forums on SF.net. mailing list or on our forums on SF.net.
- assimp comes with some sample applications, these can be found in the <i>./samples</i> folder. Don't forget to read the <i>README</i> file. - assimp comes with some sample applications, these can be found in the <i>./samples</i> folder. Don't forget to read the <i>README</i> file.
@ -1376,14 +1376,14 @@ mailing list or on our forums on SF.net.
<hr> <hr>
@section blender Blender @section blender Blender
This section contains implementation notes for the Blender3D importer. This section contains implementation notes for the Blender3D importer.
@subsection bl_overview Overview @subsection bl_overview Overview
assimp provides a self-contained reimplementation of Blender's so called SDNA system (http://www.blender.org/development/architecture/notes-on-sdna/). assimp provides a self-contained reimplementation of Blender's so called SDNA system (http://www.blender.org/development/architecture/notes-on-sdna/).
SDNA allows Blender to be fully backward and forward compatible and to exchange SDNA allows Blender to be fully backward and forward compatible and to exchange
files across all platforms. The BLEND format is thus a non-trivial binary monster and the loader tries to read the most of it, files across all platforms. The BLEND format is thus a non-trivial binary monster and the loader tries to read the most of it,
naturally limited by the scope of the #aiScene output data structure. naturally limited by the scope of the #aiScene output data structure.
Consequently, if Blender is the only modeling tool in your asset work flow, consider writing a Consequently, if Blender is the only modeling tool in your asset work flow, consider writing a
custom exporter from Blender if assimps format coverage does not meet the requirements. custom exporter from Blender if assimps format coverage does not meet the requirements.
@subsection bl_status Current status @subsection bl_status Current status
@ -1397,12 +1397,12 @@ When filing bugs on the Blender loader, always give the Blender version (or, eve
<hr> <hr>
@section ifc IFC @section ifc IFC
This section contains implementation notes on the IFC-STEP importer. This section contains implementation notes on the IFC-STEP importer.
@subsection ifc_overview Overview @subsection ifc_overview Overview
The library provides a partial implementation of the IFC2x3 industry standard for automatized exchange of CAE/architectural The library provides a partial implementation of the IFC2x3 industry standard for automatized exchange of CAE/architectural
data sets. See http://en.wikipedia.org/wiki/Industry_Foundation_Classes for more information on the format. We aim data sets. See http://en.wikipedia.org/wiki/Industry_Foundation_Classes for more information on the format. We aim
at getting as much 3D data out of the files as possible. at getting as much 3D data out of the files as possible.
@subsection ifc_status Current status @subsection ifc_status Current status
@ -1413,23 +1413,23 @@ IFC support is new and considered experimental. Please report any bugs you may e
- Only the STEP-based encoding is supported. IFCZIP and IFCXML are not (but IFCZIP can simply be unzipped to get a STEP file). - Only the STEP-based encoding is supported. IFCZIP and IFCXML are not (but IFCZIP can simply be unzipped to get a STEP file).
- The importer leaves vertex coordinates untouched, but applies a global scaling to the root transform to - The importer leaves vertex coordinates untouched, but applies a global scaling to the root transform to
convert from whichever unit the IFC file uses to <i>metres</i>. convert from whichever unit the IFC file uses to <i>metres</i>.
- If multiple geometric representations are provided, the choice which one to load is based on how expensive a representation seems - If multiple geometric representations are provided, the choice which one to load is based on how expensive a representation seems
to be in terms of import time. The loader also avoids representation types for which it has known deficits. to be in terms of import time. The loader also avoids representation types for which it has known deficits.
- Not supported are arbitrary binary operations (binary clipping is implemented, though). - Not supported are arbitrary binary operations (binary clipping is implemented, though).
- Of the various relationship types that IFC knows, only aggregation, containment and material assignment are resolved and mapped to - Of the various relationship types that IFC knows, only aggregation, containment and material assignment are resolved and mapped to
the output graph. the output graph.
- The implementation knows only about IFC2X3 and applies this rule set to all models it encounters, - The implementation knows only about IFC2X3 and applies this rule set to all models it encounters,
regardless of their actual version. Loading of older or newer files may fail with parsing errors. regardless of their actual version. Loading of older or newer files may fail with parsing errors.
@subsection ifc_metadata Metadata @subsection ifc_metadata Metadata
IFC file properties (IfcPropertySet) are kept as per-node metadata, see aiNode::mMetaData. IFC file properties (IfcPropertySet) are kept as per-node metadata, see aiNode::mMetaData.
<hr> <hr>
@section ogre Ogre @section ogre Ogre
*ATTENTION*: The Ogre-Loader is currently under development, many things have changed after this documentation was written, but they are not final enough to rewrite the documentation. So things may have changed by now! *ATTENTION*: The Ogre-Loader is currently under development, many things have changed after this documentation was written, but they are not final enough to rewrite the documentation. So things may have changed by now!
This section contains implementations notes for the OgreXML importer. This section contains implementations notes for the OgreXML importer.
@subsection overview Overview @subsection overview Overview
Ogre importer is currently optimized for the Blender Ogre exporter, because thats the only one that I use. You can find the Blender Ogre exporter at: http://www.ogre3d.org/forums/viewtopic.php?f=8&t=45922 Ogre importer is currently optimized for the Blender Ogre exporter, because thats the only one that I use. You can find the Blender Ogre exporter at: http://www.ogre3d.org/forums/viewtopic.php?f=8&t=45922
@ -1481,12 +1481,12 @@ Just look in OgreImporterMaterial.cpp
- IMPORT_OGRE_TEXTURETYPE_FROM_FILENAME: Normally, a texture is loaded as a colormap, if no - IMPORT_OGRE_TEXTURETYPE_FROM_FILENAME: Normally, a texture is loaded as a colormap, if no
target is specified in the target is specified in the
materialfile. Is this switch is enabled, texture names ending with _n, _l, _s materialfile. Is this switch is enabled, texture names ending with _n, _l, _s
are used as normalmaps, lightmaps or specularmaps. are used as normalmaps, lightmaps or specularmaps.
<br> <br>
Property type: Bool. Default value: false. Property type: Bool. Default value: false.
- IMPORT_OGRE_MATERIAL_FILE: Ogre Meshes contain only the MaterialName, not the MaterialFile. - IMPORT_OGRE_MATERIAL_FILE: Ogre Meshes contain only the MaterialName, not the MaterialFile.
If there If there
is no material file with the same name as the material, Ogre Importer will is no material file with the same name as the material, Ogre Importer will
try to load this file and search the material in it. try to load this file and search the material in it.
<br> <br>
Property type: String. Default value: guessed. Property type: String. Default value: guessed.
@ -1515,8 +1515,8 @@ OK, that sounds too easy :-). The whole procedure for a new loader merely looks
<li>Add them to the following workspaces: vc8 and vc9 (the files are in the workspaces directory), CMAKE (code/CMakeLists.txt, create a new <li>Add them to the following workspaces: vc8 and vc9 (the files are in the workspaces directory), CMAKE (code/CMakeLists.txt, create a new
source group for your importer and put them also to ADD_LIBRARY( assimp SHARED))</li> source group for your importer and put them also to ADD_LIBRARY( assimp SHARED))</li>
<li>Include <i>AssimpPCH.h</i> - this is the PCH file, and it includes already most Assimp-internal stuff. </li> <li>Include <i>AssimpPCH.h</i> - this is the PCH file, and it includes already most Assimp-internal stuff. </li>
<li>Open Importer.cpp and include your header just below the <i>(include_new_importers_here)</i> line, <li>Open Importer.cpp and include your header just below the <i>(include_new_importers_here)</i> line,
guarded by a #define guarded by a #define
@code @code
#if (!defined assimp_BUILD_NO_FormatName_IMPORTER) #if (!defined assimp_BUILD_NO_FormatName_IMPORTER)
... ...
@ -1525,14 +1525,14 @@ guarded by a #define
Wrap the same guard around your .cpp!</li> Wrap the same guard around your .cpp!</li>
<li>Now advance to the <i>(register_new_importers_here)</i> line in the Importer.cpp and register your importer there - just like all the others do.</li> <li>Now advance to the <i>(register_new_importers_here)</i> line in the Importer.cpp and register your importer there - just like all the others do.</li>
<li>Setup a suitable test environment (i.e. use AssimpView or your own application), make sure to enable <li>Setup a suitable test environment (i.e. use AssimpView or your own application), make sure to enable
the #aiProcess_ValidateDataStructure flag and enable verbose logging. That is, simply call before you import anything: the #aiProcess_ValidateDataStructure flag and enable verbose logging. That is, simply call before you import anything:
@code @code
DefaultLogger::create("AssimpLog.txt",Logger::VERBOSE) DefaultLogger::create("AssimpLog.txt",Logger::VERBOSE)
@endcode @endcode
</li> </li>
<li> <li>
Implement the Assimp::BaseImporter::CanRead(), Assimp::BaseImporter::InternReadFile() and Assimp::BaseImporter::GetExtensionList(). Implement the Assimp::BaseImporter::CanRead(), Assimp::BaseImporter::InternReadFile() and Assimp::BaseImporter::GetExtensionList().
Just copy'n'paste the template from Appendix A and adapt it for your needs. Just copy'n'paste the template from Appendix A and adapt it for your needs.
</li> </li>
<li>For error handling, throw a dynamic allocated ImportErrorException (see Appendix A) for critical errors, and log errors, warnings, infos and debuginfos <li>For error handling, throw a dynamic allocated ImportErrorException (see Appendix A) for critical errors, and log errors, warnings, infos and debuginfos
@ -1566,7 +1566,7 @@ store the properties as a member variable of your importer, they are thread safe
<li>Try to make your parser as flexible as possible. Don't rely on particular layout, whitespace/tab style, <li>Try to make your parser as flexible as possible. Don't rely on particular layout, whitespace/tab style,
except if the file format has a strict definition, in which case you should always warn about spec violations. except if the file format has a strict definition, in which case you should always warn about spec violations.
But the general rule of thumb is <i>be strict in what you write and tolerant in what you accept</i>.</li> But the general rule of thumb is <i>be strict in what you write and tolerant in what you accept</i>.</li>
<li>Call Assimp::BaseImporter::ConvertToUTF8() before you parse anything to convert foreign encodings to UTF-8. <li>Call Assimp::BaseImporter::ConvertToUTF8() before you parse anything to convert foreign encodings to UTF-8.
That's not necessary for XML importers, which must use the provided IrrXML for reading. </li> That's not necessary for XML importers, which must use the provided IrrXML for reading. </li>
</ul> </ul>
@ -1586,11 +1586,11 @@ Don't trust the input data! Check all offsets!
Mixed stuff for internal use by loaders, mostly documented (most of them are already included by <i>AssimpPCH.h</i>): Mixed stuff for internal use by loaders, mostly documented (most of them are already included by <i>AssimpPCH.h</i>):
<ul> <ul>
<li><b>ByteSwap</b> (<i>ByteSwap.h</i>) - manual byte swapping stuff for binary loaders.</li> <li><b>ByteSwapper</b> (<i>ByteSwapper.h</i>) - manual byte swapping stuff for binary loaders.</li>
<li><b>StreamReader</b> (<i>StreamReader.h</i>) - safe, endianess-correct, binary reading.</li> <li><b>StreamReader</b> (<i>StreamReader.h</i>) - safe, endianess-correct, binary reading.</li>
<li><b>IrrXML</b> (<i>irrXMLWrapper.h</i>) - for XML-parsing (SAX.</li> <li><b>IrrXML</b> (<i>irrXMLWrapper.h</i>) - for XML-parsing (SAX.</li>
<li><b>CommentRemover</b> (<i>RemoveComments.h</i>) - remove single-line and multi-line comments from a text file.</li> <li><b>CommentRemover</b> (<i>RemoveComments.h</i>) - remove single-line and multi-line comments from a text file.</li>
<li>fast_atof, strtoul10, strtoul16, SkipSpaceAndLineEnd, SkipToNextToken .. large family of low-level <li>fast_atof, strtoul10, strtoul16, SkipSpaceAndLineEnd, SkipToNextToken .. large family of low-level
parsing functions, mostly declared in <i>fast_atof.h</i>, <i>StringComparison.h</i> and <i>ParsingUtils.h</i> (a collection that grew parsing functions, mostly declared in <i>fast_atof.h</i>, <i>StringComparison.h</i> and <i>ParsingUtils.h</i> (a collection that grew
historically, so don't expect perfect organization). </li> historically, so don't expect perfect organization). </li>
<li><b>ComputeNormalsWithSmoothingsGroups()</b> (<i>SmoothingGroups.h</i>) - Computes normal vectors from plain old smoothing groups. </li> <li><b>ComputeNormalsWithSmoothingsGroups()</b> (<i>SmoothingGroups.h</i>) - Computes normal vectors from plain old smoothing groups. </li>
@ -1640,8 +1640,8 @@ The boost whitelist:
@code @code
// ------------------------------------------------------------------------------- // -------------------------------------------------------------------------------
// Returns whether the class can handle the format of the given file. // Returns whether the class can handle the format of the given file.
bool xxxxImporter::CanRead( const std::string& pFile, IOSystem* pIOHandler, bool xxxxImporter::CanRead( const std::string& pFile, IOSystem* pIOHandler,
bool checkSig) const bool checkSig) const
{ {
const std::string extension = GetExtension(pFile); const std::string extension = GetExtension(pFile);
@ -1649,8 +1649,8 @@ bool xxxxImporter::CanRead( const std::string& pFile, IOSystem* pIOHandler,
return true; return true;
} }
if (!extension.length() || checkSig) { if (!extension.length() || checkSig) {
// no extension given, or we're called a second time because no // no extension given, or we're called a second time because no
// suitable loader was found yet. This means, we're trying to open // suitable loader was found yet. This means, we're trying to open
// the file and look for and hints to identify the file format. // the file and look for and hints to identify the file format.
// #Assimp::BaseImporter provides some utilities: // #Assimp::BaseImporter provides some utilities:
// //
@ -1659,11 +1659,11 @@ bool xxxxImporter::CanRead( const std::string& pFile, IOSystem* pIOHandler,
// against a given list of 'magic' strings. // against a given list of 'magic' strings.
// //
// #Assimp::BaseImporter::CheckMagicToken - for binary files. It goes // #Assimp::BaseImporter::CheckMagicToken - for binary files. It goes
// to a particular offset in the file and and compares the next words // to a particular offset in the file and and compares the next words
// against a given list of 'magic' tokens. // against a given list of 'magic' tokens.
// These checks MUST be done (even if !checkSig) if the file extension // These checks MUST be done (even if !checkSig) if the file extension
// is not exclusive to your format. For example, .xml is very common // is not exclusive to your format. For example, .xml is very common
// and (co)used by many formats. // and (co)used by many formats.
} }
return false; return false;
@ -1677,7 +1677,7 @@ void xxxxImporter::GetExtensionList(std::set<std::string>& extensions)
} }
// ------------------------------------------------------------------------------- // -------------------------------------------------------------------------------
void xxxxImporter::InternReadFile( const std::string& pFile, void xxxxImporter::InternReadFile( const std::string& pFile,
aiScene* pScene, IOSystem* pIOHandler) aiScene* pScene, IOSystem* pIOHandler)
{ {
boost::scoped_ptr<IOStream> file( pIOHandler->Open( pFile, "rb")); boost::scoped_ptr<IOStream> file( pIOHandler->Open( pFile, "rb"));
@ -1686,20 +1686,20 @@ void xxxxImporter::InternReadFile( const std::string& pFile,
if( file.get() == NULL) { if( file.get() == NULL) {
throw DeadlyImportError( "Failed to open xxxx file " + pFile + "."); throw DeadlyImportError( "Failed to open xxxx file " + pFile + ".");
} }
// Your task: fill pScene // Your task: fill pScene
// Throw a ImportErrorException with a meaningful (!) error message if // Throw a ImportErrorException with a meaningful (!) error message if
// something goes wrong. // something goes wrong.
} }
@endcode @endcode
*/ */
/** /**
@page AnimationOverview Animation Overview @page AnimationOverview Animation Overview
\section Transformations \section Transformations
This diagram shows how you can calculate your transformationmatrices for an animated character: This diagram shows how you can calculate your transformationmatrices for an animated character:
<img src="AnimationOverview.png" /> <img src="AnimationOverview.png" />
**/ **/

View File

@ -117,11 +117,11 @@
2B7F478E1708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; }; 2B7F478E1708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; };
2B7F478F1708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; }; 2B7F478F1708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; };
2B7F47901708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; }; 2B7F47901708365200A106A9 /* tuple.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45961708365100A106A9 /* tuple.hpp */; };
2B7F479B1708365200A106A9 /* ByteSwap.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwap.h */; }; 2B7F479B1708365200A106A9 /* ByteSwapper.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwapper.h */; };
2B7F479C1708365200A106A9 /* ByteSwap.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwap.h */; }; 2B7F479C1708365200A106A9 /* ByteSwapper.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwapper.h */; };
2B7F479D1708365200A106A9 /* ByteSwap.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwap.h */; }; 2B7F479D1708365200A106A9 /* ByteSwapper.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwapper.h */; };
2B7F479E1708365200A106A9 /* ByteSwap.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwap.h */; }; 2B7F479E1708365200A106A9 /* ByteSwapper.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwapper.h */; };
2B7F479F1708365200A106A9 /* ByteSwap.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwap.h */; }; 2B7F479F1708365200A106A9 /* ByteSwapper.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B7F45991708365100A106A9 /* ByteSwapper.h */; };
2B7F47A01708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; }; 2B7F47A01708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; };
2B7F47A11708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; }; 2B7F47A11708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; };
2B7F47A21708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; }; 2B7F47A21708365200A106A9 /* CalcTangentsProcess.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */; };
@ -2018,7 +2018,7 @@
2B7F45931708365100A106A9 /* static_assert.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = static_assert.hpp; sourceTree = "<group>"; }; 2B7F45931708365100A106A9 /* static_assert.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = static_assert.hpp; sourceTree = "<group>"; };
2B7F45941708365100A106A9 /* timer.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = timer.hpp; sourceTree = "<group>"; }; 2B7F45941708365100A106A9 /* timer.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = timer.hpp; sourceTree = "<group>"; };
2B7F45961708365100A106A9 /* tuple.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = tuple.hpp; sourceTree = "<group>"; }; 2B7F45961708365100A106A9 /* tuple.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = tuple.hpp; sourceTree = "<group>"; };
2B7F45991708365100A106A9 /* ByteSwap.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ByteSwap.h; sourceTree = "<group>"; }; 2B7F45991708365100A106A9 /* ByteSwapper.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ByteSwapper.h; sourceTree = "<group>"; };
2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = CalcTangentsProcess.cpp; sourceTree = "<group>"; }; 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = CalcTangentsProcess.cpp; sourceTree = "<group>"; };
2B7F459B1708365100A106A9 /* CalcTangentsProcess.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CalcTangentsProcess.h; sourceTree = "<group>"; }; 2B7F459B1708365100A106A9 /* CalcTangentsProcess.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CalcTangentsProcess.h; sourceTree = "<group>"; };
2B7F459C1708365100A106A9 /* CInterfaceIOWrapper.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CInterfaceIOWrapper.h; sourceTree = "<group>"; }; 2B7F459C1708365100A106A9 /* CInterfaceIOWrapper.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CInterfaceIOWrapper.h; sourceTree = "<group>"; };
@ -2509,7 +2509,7 @@
2B7F45761708365100A106A9 /* BaseProcess.cpp */, 2B7F45761708365100A106A9 /* BaseProcess.cpp */,
2B7F45771708365100A106A9 /* BaseProcess.h */, 2B7F45771708365100A106A9 /* BaseProcess.h */,
2B7F45831708365100A106A9 /* BlobIOSystem.h */, 2B7F45831708365100A106A9 /* BlobIOSystem.h */,
2B7F45991708365100A106A9 /* ByteSwap.h */, 2B7F45991708365100A106A9 /* ByteSwapper.h */,
2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */, 2B7F459A1708365100A106A9 /* CalcTangentsProcess.cpp */,
2B7F459B1708365100A106A9 /* CalcTangentsProcess.h */, 2B7F459B1708365100A106A9 /* CalcTangentsProcess.h */,
2B7F459C1708365100A106A9 /* CInterfaceIOWrapper.h */, 2B7F459C1708365100A106A9 /* CInterfaceIOWrapper.h */,
@ -3517,7 +3517,7 @@
2B7F47841708365200A106A9 /* static_assert.hpp in Headers */, 2B7F47841708365200A106A9 /* static_assert.hpp in Headers */,
2B7F47891708365200A106A9 /* timer.hpp in Headers */, 2B7F47891708365200A106A9 /* timer.hpp in Headers */,
2B7F478E1708365200A106A9 /* tuple.hpp in Headers */, 2B7F478E1708365200A106A9 /* tuple.hpp in Headers */,
2B7F479D1708365200A106A9 /* ByteSwap.h in Headers */, 2B7F479D1708365200A106A9 /* ByteSwapper.h in Headers */,
2B7F47A71708365200A106A9 /* CalcTangentsProcess.h in Headers */, 2B7F47A71708365200A106A9 /* CalcTangentsProcess.h in Headers */,
2B7F47AC1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */, 2B7F47AC1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */,
2B7F47C51708365200A106A9 /* ColladaExporter.h in Headers */, 2B7F47C51708365200A106A9 /* ColladaExporter.h in Headers */,
@ -3765,7 +3765,7 @@
2B7F47851708365200A106A9 /* static_assert.hpp in Headers */, 2B7F47851708365200A106A9 /* static_assert.hpp in Headers */,
2B7F478A1708365200A106A9 /* timer.hpp in Headers */, 2B7F478A1708365200A106A9 /* timer.hpp in Headers */,
2B7F478F1708365200A106A9 /* tuple.hpp in Headers */, 2B7F478F1708365200A106A9 /* tuple.hpp in Headers */,
2B7F479E1708365200A106A9 /* ByteSwap.h in Headers */, 2B7F479E1708365200A106A9 /* ByteSwapper.h in Headers */,
2B7F47A81708365200A106A9 /* CalcTangentsProcess.h in Headers */, 2B7F47A81708365200A106A9 /* CalcTangentsProcess.h in Headers */,
2B7F47AD1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */, 2B7F47AD1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */,
2B7F47C61708365200A106A9 /* ColladaExporter.h in Headers */, 2B7F47C61708365200A106A9 /* ColladaExporter.h in Headers */,
@ -4013,7 +4013,7 @@
2B7F47861708365200A106A9 /* static_assert.hpp in Headers */, 2B7F47861708365200A106A9 /* static_assert.hpp in Headers */,
2B7F478B1708365200A106A9 /* timer.hpp in Headers */, 2B7F478B1708365200A106A9 /* timer.hpp in Headers */,
2B7F47901708365200A106A9 /* tuple.hpp in Headers */, 2B7F47901708365200A106A9 /* tuple.hpp in Headers */,
2B7F479F1708365200A106A9 /* ByteSwap.h in Headers */, 2B7F479F1708365200A106A9 /* ByteSwapper.h in Headers */,
2B7F47A91708365200A106A9 /* CalcTangentsProcess.h in Headers */, 2B7F47A91708365200A106A9 /* CalcTangentsProcess.h in Headers */,
2B7F47AE1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */, 2B7F47AE1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */,
2B7F47C71708365200A106A9 /* ColladaExporter.h in Headers */, 2B7F47C71708365200A106A9 /* ColladaExporter.h in Headers */,
@ -4261,7 +4261,7 @@
2B7F47821708365200A106A9 /* static_assert.hpp in Headers */, 2B7F47821708365200A106A9 /* static_assert.hpp in Headers */,
2B7F47871708365200A106A9 /* timer.hpp in Headers */, 2B7F47871708365200A106A9 /* timer.hpp in Headers */,
2B7F478C1708365200A106A9 /* tuple.hpp in Headers */, 2B7F478C1708365200A106A9 /* tuple.hpp in Headers */,
2B7F479B1708365200A106A9 /* ByteSwap.h in Headers */, 2B7F479B1708365200A106A9 /* ByteSwapper.h in Headers */,
2B7F47A51708365200A106A9 /* CalcTangentsProcess.h in Headers */, 2B7F47A51708365200A106A9 /* CalcTangentsProcess.h in Headers */,
2B7F47AA1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */, 2B7F47AA1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */,
2B7F47C31708365200A106A9 /* ColladaExporter.h in Headers */, 2B7F47C31708365200A106A9 /* ColladaExporter.h in Headers */,
@ -4509,7 +4509,7 @@
2B7F47831708365200A106A9 /* static_assert.hpp in Headers */, 2B7F47831708365200A106A9 /* static_assert.hpp in Headers */,
2B7F47881708365200A106A9 /* timer.hpp in Headers */, 2B7F47881708365200A106A9 /* timer.hpp in Headers */,
2B7F478D1708365200A106A9 /* tuple.hpp in Headers */, 2B7F478D1708365200A106A9 /* tuple.hpp in Headers */,
2B7F479C1708365200A106A9 /* ByteSwap.h in Headers */, 2B7F479C1708365200A106A9 /* ByteSwapper.h in Headers */,
2B7F47A61708365200A106A9 /* CalcTangentsProcess.h in Headers */, 2B7F47A61708365200A106A9 /* CalcTangentsProcess.h in Headers */,
2B7F47AB1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */, 2B7F47AB1708365200A106A9 /* CInterfaceIOWrapper.h in Headers */,
2B7F47C41708365200A106A9 /* ColladaExporter.h in Headers */, 2B7F47C41708365200A106A9 /* ColladaExporter.h in Headers */,