mirror of
https://port.numenaute.org/aleajactaest/khanat-code-old.git
synced 2024-11-26 16:56:19 +00:00
Fixed: #1096 Build error with gcc
This commit is contained in:
parent
66c6137eed
commit
742304e29e
2 changed files with 10 additions and 7 deletions
|
@ -25,6 +25,7 @@
|
|||
#include "nel/misc/o_xml.h"
|
||||
#include "nel/misc/file.h"
|
||||
#include "nel/misc/path.h"
|
||||
#include <limits>
|
||||
#include <vector>
|
||||
#include <string>
|
||||
|
||||
|
@ -151,7 +152,7 @@ public:
|
|||
_CurrentPrim(startPrim)
|
||||
{
|
||||
// mark the root node as non checked
|
||||
_IndexStack.push_back(~0);
|
||||
_IndexStack.push_back(std::numeric_limits<uint>::max());
|
||||
}
|
||||
|
||||
/** Each call to this method will return a primitive pointer that match
|
||||
|
@ -162,7 +163,7 @@ public:
|
|||
{
|
||||
while (!_IndexStack.empty())
|
||||
{
|
||||
if (_IndexStack.back() == ~0)
|
||||
if (_IndexStack.back() == std::numeric_limits<uint>::max())
|
||||
{
|
||||
_IndexStack.back() = 0;
|
||||
// we need to check the current node.
|
||||
|
@ -178,7 +179,7 @@ public:
|
|||
if (_CurrentPrim->getChild(child, _IndexStack.back()++))
|
||||
{
|
||||
// go down into this node
|
||||
_IndexStack.push_back(~0);
|
||||
_IndexStack.push_back(std::numeric_limits<uint>::max());
|
||||
_CurrentPrim = child;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -32,14 +32,16 @@ int main(int argc, char **argv)
|
|||
uint arg;
|
||||
for (arg=1; (sint)arg<argc; ++arg)
|
||||
{
|
||||
if (argv[arg] == "-hauto")
|
||||
if (strcmp(argv[arg], "-hauto") == 0)
|
||||
{
|
||||
GenerateHAuto = true;
|
||||
else if (argv[arg] == "-dbgmsg")
|
||||
}
|
||||
else if (strcmp(argv[arg], "-dbgmsg") == 0)
|
||||
{
|
||||
VerboseMode = true;
|
||||
GenerateDebugMessages = true;
|
||||
}
|
||||
else if (argv[arg] == "-onlylogs")
|
||||
else if (strcmp(argv[arg], "-onlylogs") == 0)
|
||||
{
|
||||
GenerateOnlyLogs = true;
|
||||
}
|
||||
|
@ -129,4 +131,4 @@ int main(int argc, char **argv)
|
|||
|
||||
return 0;
|
||||
*/
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue