137 lines
4.4 KiB
C
137 lines
4.4 KiB
C
|
/*
|
||
|
Open Asset Import Library (assimp)
|
||
|
----------------------------------------------------------------------
|
||
|
|
||
|
Copyright (c) 2006-2019, assimp team
|
||
|
|
||
|
|
||
|
All rights reserved.
|
||
|
|
||
|
Redistribution and use of this software in source and binary forms,
|
||
|
with or without modification, are permitted provided that the
|
||
|
following conditions are met:
|
||
|
|
||
|
* Redistributions of source code must retain the above
|
||
|
copyright notice, this list of conditions and the
|
||
|
following disclaimer.
|
||
|
|
||
|
* Redistributions in binary form must reproduce the above
|
||
|
copyright notice, this list of conditions and the
|
||
|
following disclaimer in the documentation and/or other
|
||
|
materials provided with the distribution.
|
||
|
|
||
|
* Neither the name of the assimp team, nor the names of its
|
||
|
contributors may be used to endorse or promote products
|
||
|
derived from this software without specific prior
|
||
|
written permission of the assimp team.
|
||
|
|
||
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
----------------------------------------------------------------------
|
||
|
*/
|
||
|
|
||
|
#ifndef AI_OGREPARSINGUTILS_H_INC
|
||
|
#define AI_OGREPARSINGUTILS_H_INC
|
||
|
|
||
|
#ifndef ASSIMP_BUILD_NO_OGRE_IMPORTER
|
||
|
|
||
|
#include <assimp/ParsingUtils.h>
|
||
|
#include <functional>
|
||
|
#include <algorithm>
|
||
|
#include <stdint.h>
|
||
|
#include <sstream>
|
||
|
#include <cctype>
|
||
|
|
||
|
namespace Assimp {
|
||
|
namespace Ogre {
|
||
|
|
||
|
/// Returns a lower cased copy of @s.
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string ToLower(std::string s)
|
||
|
{
|
||
|
std::transform(s.begin(), s.end(), s.begin(), ::tolower);
|
||
|
return s;
|
||
|
}
|
||
|
|
||
|
/// Returns if @c s ends with @c suffix. If @c caseSensitive is false, both strings will be lower cased before matching.
|
||
|
static AI_FORCE_INLINE
|
||
|
bool EndsWith(const std::string &s, const std::string &suffix, bool caseSensitive = true) {
|
||
|
if (s.empty() || suffix.empty()) {
|
||
|
return false;
|
||
|
} else if (s.length() < suffix.length()) {
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
if (!caseSensitive) {
|
||
|
return EndsWith(ToLower(s), ToLower(suffix), true);
|
||
|
}
|
||
|
|
||
|
size_t len = suffix.length();
|
||
|
std::string sSuffix = s.substr(s.length()-len, len);
|
||
|
|
||
|
return (ASSIMP_stricmp(sSuffix, suffix) == 0);
|
||
|
}
|
||
|
|
||
|
// Below trim functions adapted from http://stackoverflow.com/questions/216823/whats-the-best-way-to-trim-stdstring
|
||
|
|
||
|
/// Trim from start
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string &TrimLeft(std::string &s, bool newlines = true) {
|
||
|
if (!newlines) {
|
||
|
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](char c) { return !Assimp::IsSpace<char>(c); }));
|
||
|
} else {
|
||
|
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](char c) { return !Assimp::IsSpaceOrNewLine<char>(c); }));
|
||
|
}
|
||
|
return s;
|
||
|
}
|
||
|
|
||
|
/// Trim from end
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string &TrimRight(std::string &s, bool newlines = true) {
|
||
|
if (!newlines) {
|
||
|
s.erase(std::find_if(s.rbegin(), s.rend(), [](char c) { return !Assimp::IsSpace<char>(c); }).base(),s.end());
|
||
|
} else {
|
||
|
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](char c) { return !Assimp::IsSpaceOrNewLine<char>(c); }));
|
||
|
}
|
||
|
return s;
|
||
|
}
|
||
|
|
||
|
/// Trim from both ends
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string &Trim(std::string &s, bool newlines = true) {
|
||
|
return TrimLeft(TrimRight(s, newlines), newlines);
|
||
|
}
|
||
|
|
||
|
/// Skips a line from current @ss position until a newline. Returns the skipped part.
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string SkipLine(std::stringstream &ss) {
|
||
|
std::string skipped;
|
||
|
getline(ss, skipped);
|
||
|
return skipped;
|
||
|
}
|
||
|
|
||
|
/// Skips a line and reads next element from @c ss to @c nextElement.
|
||
|
/** @return Skipped line content until newline. */
|
||
|
static AI_FORCE_INLINE
|
||
|
std::string NextAfterNewLine(std::stringstream &ss, std::string &nextElement) {
|
||
|
std::string skipped = SkipLine(ss);
|
||
|
ss >> nextElement;
|
||
|
return skipped;
|
||
|
}
|
||
|
|
||
|
} // Ogre
|
||
|
} // Assimp
|
||
|
|
||
|
#endif // ASSIMP_BUILD_NO_OGRE_IMPORTER
|
||
|
#endif // AI_OGREPARSINGUTILS_H_INC
|