Incognito
Premium-
Posts
24 -
Joined
-
Last visited
-
Feedback
0%
Content Type
Forums
Store
Third Party - Providers Directory
Feature Plan
Release Notes
Docs
Events
Everything posted by Incognito
-
restart_here problem
Incognito replied to Incognito's topic in Community Support - Questions & Answers
Totally 0 errors, in test_server and debug mode too. -
restart_here problem
Incognito replied to Incognito's topic in Community Support - Questions & Answers
When it log me off it's calling CInputP2P::Relay 6-7 times. -
restart_here problem
Incognito replied to Incognito's topic in Community Support - Questions & Answers
I did not change this function. -
restart_here problem
Incognito replied to Incognito's topic in Community Support - Questions & Answers
Bump -
Hello, i have problem. When mob kills me 3-4 times and when i click restart here button i got logged off the server. No errors, do you know that problem?
-
Solved.
-
#ifndef __INC_METIN_II_STL_H__ #define __INC_METIN_II_STL_H__ #include <vector> #include <string> #include <map> #include <list> #include <functional> #include <stack> #include <set> #ifdef __GNUC__ #include <ext/functional> #endif #ifndef itertype #define itertype(v) typeof((v).begin()) #endif inline void stl_lowers(std::string& rstRet) { for (size_t i = 0; i < rstRet.length(); ++i) rstRet[i] = tolower(rstRet[i]); } struct stringhash { size_t operator () (const std::string & str) const { const unsigned char * s = (const unsigned char*) str.c_str(); const unsigned char * end = s + str.size(); size_t h = 0; while (s < end) { h *= 16777619; h ^= *(s++); } return h; } }; // code from tr1/functional_hash.h template<typename T> struct hash; template<typename _Tp> struct hash<_Tp*> : public std::unary_function<_Tp*, std::size_t> { std::size_t operator()(_Tp* __p) const { return reinterpret_cast<std::size_t>(__p); } }; namespace std { template <class container, class Pred> void erase_if (container & a, typename container::iterator first, typename container::iterator past, Pred pred) { while (first != past) if (pred(*first)) a.erase(first++); else ++first; } template <class container> void wipe(container & a) { typename container::iterator first, past; first = a.begin(); past = a.end(); while (first != past) delete *(first++); a.clear(); } template <class container> void wipe_second(container & a) { typename container::iterator first, past; first = a.begin(); past = a.end(); while (first != past) { delete first->second; ++first; } a.clear(); } template <typename T> T MIN(T a, T b) { return a < b ? a : b; } template <typename T> T MAX(T a, T b) { return a > b ? a : b; } template <typename T> T MINMAX(T min, T value, T max) { T tv; tv = (min > value ? min : value); return (max < tv) ? max : tv; } template <class _Ty> class void_mem_fun_t : public unary_function<_Ty *, void> { public: explicit void_mem_fun_t(void (_Ty::*_Pm)()) : _Ptr(_Pm) { } void operator()(_Ty* p) const { ((p->*_Ptr)()); } private: void (_Ty::*_Ptr)(); }; template<class _Ty> inline void_mem_fun_t<_Ty> void_mem_fun(void (_Ty::*_Pm)()) { return (void_mem_fun_t<_Ty>(_Pm)); } template<class _Ty> class void_mem_fun_ref_t : public unary_function<_Ty, void> { public: explicit void_mem_fun_ref_t(void (_Ty::*_Pm)()) : _Ptr(_Pm) {} void operator()(_Ty& x) const { return ((x.*_Ptr)()); } private: void (_Ty::*_Ptr)(); }; template<class _Ty> inline void_mem_fun_ref_t<_Ty> void_mem_fun_ref(void (_Ty::*_Pm)()) { return (void_mem_fun_ref_t< _Ty>(_Pm)); } }; #endif
-
Hello I have problem with db compilation. Boost version is 1.66, gcc 48 + clang11. Do you know where's the problem?
-
official [Old][Archive] - [Official] Unpacked Updates Metin2.de
Incognito replied to Shogun's topic in Guides & HowTo
Can somebody share link for first sashes patch? -
Hi, can anyone send me first patch with sashes? I'm thinking about new costumes window and basic sashes models. Thank you!
-
You can fix it without source code. @yagokurt if you want fix for old game file send me a PM.
-
Searching to Pet Level - Pet Attacking System
Incognito replied to frenzyboy's topic in Paid Support / Searching / Recruiting
Send me a PM.