Global.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347
  1. #pragma once
  2. // Standard include file
  3. // Contents:
  4. // Includes C/C++ libraries, STL libraries, IOStream and String libraries
  5. // Includes the most important boost headers
  6. // Defines the import + export, override and exception handling macros
  7. // Defines the vstd library
  8. // Includes the logger
  9. // This file shouldn't be changed, except if there is a important header file missing which is shared among several projects.
  10. /*
  11. * Global.h, part of VCMI engine
  12. *
  13. * Authors: listed in file AUTHORS in main folder
  14. *
  15. * License: GNU General Public License v2.0 or later
  16. * Full text of license available in license.txt file, in main folder
  17. *
  18. */
  19. #define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers
  20. #include <cstdio>
  21. #include <stdio.h>
  22. #ifdef _WIN32
  23. #include <tchar.h>
  24. #else
  25. #include "tchar_amigaos4.h"
  26. #endif
  27. #include <cmath>
  28. #include <cassert>
  29. #include <assert.h>
  30. #include <vector>
  31. #include <string>
  32. #include <map>
  33. #include <queue>
  34. #include <set>
  35. #include <utility>
  36. #include <numeric>
  37. #include <iostream>
  38. #include <fstream>
  39. #include <sstream>
  40. #include <iomanip>
  41. #include <algorithm>
  42. #include <memory>
  43. #include <cstdlib>
  44. //filesystem version 3 causes problems (and it's default as of boost 1.46)
  45. #define BOOST_FILESYSTEM_VERSION 2
  46. #include <boost/algorithm/string.hpp>
  47. #include <boost/assert.hpp>
  48. #include <boost/assign.hpp>
  49. #include <boost/bind.hpp>
  50. #include <boost/cstdint.hpp>
  51. #include <boost/date_time/posix_time/posix_time.hpp>
  52. #include <boost/filesystem.hpp>
  53. #include <boost/foreach.hpp>
  54. #include <boost/format.hpp>
  55. #include <boost/function.hpp>
  56. #include <boost/lexical_cast.hpp>
  57. #include <boost/logic/tribool.hpp>
  58. #include <boost/program_options.hpp>
  59. #include <boost/thread.hpp>
  60. #include <boost/unordered_set.hpp>
  61. #ifdef ANDROID
  62. #include <android/log.h>
  63. #endif
  64. // Integral data types
  65. typedef boost::uint64_t ui64; //unsigned int 64 bits (8 bytes)
  66. typedef boost::uint32_t ui32; //unsigned int 32 bits (4 bytes)
  67. typedef boost::uint16_t ui16; //unsigned int 16 bits (2 bytes)
  68. typedef boost::uint8_t ui8; //unsigned int 8 bits (1 byte)
  69. typedef boost::int64_t si64; //signed int 64 bits (8 bytes)
  70. typedef boost::int32_t si32; //signed int 32 bits (4 bytes)
  71. typedef boost::int16_t si16; //signed int 16 bits (2 bytes)
  72. typedef boost::int8_t si8; //signed int 8 bits (1 byte)
  73. // Import + Export macro declarations
  74. #ifdef _WIN32
  75. #define DLL_EXPORT __declspec(dllexport)
  76. #else
  77. #if defined(__GNUC__) && __GNUC__ >= 4
  78. #define DLL_EXPORT __attribute__ ((visibility("default")))
  79. #else
  80. #define DLL_EXPORT
  81. #endif
  82. #endif
  83. #ifdef _WIN32
  84. #define DLL_IMPORT __declspec(dllimport)
  85. #else
  86. #if defined(__GNUC__) && __GNUC__ >= 4
  87. #define DLL_IMPORT __attribute__ ((visibility("default")))
  88. #else
  89. #define DLL_IMPORT
  90. #endif
  91. #endif
  92. #ifdef VCMI_DLL
  93. #define DLL_LINKAGE DLL_EXPORT
  94. #else
  95. #define DLL_LINKAGE DLL_IMPORT
  96. #endif
  97. //defining available c++11 features
  98. //initialization lists - only gcc-4.4 or later
  99. #if defined(__GNUC__) && ( __GNUC__ > 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ >= 4 ))
  100. #define CPP11_USE_INITIALIZERS_LIST
  101. #endif
  102. //a normal std::map with a const operator[] for sanity
  103. template<typename KeyT, typename ValT>
  104. class bmap : public std::map<KeyT, ValT>
  105. {
  106. public:
  107. const ValT & operator[](KeyT key) const
  108. {
  109. return find(key)->second;
  110. }
  111. ValT & operator[](KeyT key)
  112. {
  113. return static_cast<std::map<KeyT, ValT> &>(*this)[key];
  114. }
  115. template <typename Handler> void serialize(Handler &h, const int version)
  116. {
  117. h & static_cast<std::map<KeyT, ValT> &>(*this);
  118. }
  119. };
  120. namespace vstd
  121. {
  122. //returns true if container c contains item i
  123. template <typename Container, typename Item>
  124. bool contains(const Container & c, const Item &i)
  125. {
  126. return std::find(c.begin(),c.end(),i) != c.end();
  127. }
  128. //returns true if map c contains item i
  129. template <typename V, typename Item, typename Item2>
  130. bool contains(const std::map<Item,V> & c, const Item2 &i)
  131. {
  132. return c.find(i)!=c.end();
  133. }
  134. //returns true if bmap c contains item i
  135. template <typename V, typename Item, typename Item2>
  136. bool contains(const bmap<Item,V> & c, const Item2 &i)
  137. {
  138. return c.find(i)!=c.end();
  139. }
  140. //returns true if unordered set c contains item i
  141. template <typename Item>
  142. bool contains(const boost::unordered_set<Item> & c, const Item &i)
  143. {
  144. return c.find(i)!=c.end();
  145. }
  146. //returns position of first element in vector c equal to s, if there is no such element, -1 is returned
  147. template <typename T1, typename T2>
  148. int find_pos(const std::vector<T1> & c, const T2 &s)
  149. {
  150. for(size_t i=0; i < c.size(); ++i)
  151. if(c[i] == s)
  152. return i;
  153. return -1;
  154. }
  155. //Func(T1,T2) must say if these elements matches
  156. template <typename T1, typename T2, typename Func>
  157. int find_pos(const std::vector<T1> & c, const T2 &s, const Func &f)
  158. {
  159. for(size_t i=0; i < c.size(); ++i)
  160. if(f(c[i],s))
  161. return i;
  162. return -1;
  163. }
  164. //returns iterator to the given element if present in container, end() if not
  165. template <typename Container, typename Item>
  166. typename Container::iterator find(Container & c, const Item &i)
  167. {
  168. return std::find(c.begin(),c.end(),i);
  169. }
  170. //returns const iterator to the given element if present in container, end() if not
  171. template <typename Container, typename Item>
  172. typename Container::const_iterator find(const Container & c, const Item &i)
  173. {
  174. return std::find(c.begin(),c.end(),i);
  175. }
  176. //removes element i from container c, returns false if c does not contain i
  177. template <typename Container, typename Item>
  178. typename Container::size_type operator-=(Container &c, const Item &i)
  179. {
  180. typename Container::iterator itr = find(c,i);
  181. if(itr == c.end())
  182. return false;
  183. c.erase(itr);
  184. return true;
  185. }
  186. //assigns greater of (a, b) to a and returns maximum of (a, b)
  187. template <typename t1, typename t2>
  188. t1 &amax(t1 &a, const t2 &b)
  189. {
  190. if(a >= b)
  191. return a;
  192. else
  193. {
  194. a = b;
  195. return a;
  196. }
  197. }
  198. //assigns smaller of (a, b) to a and returns minimum of (a, b)
  199. template <typename t1, typename t2>
  200. t1 &amin(t1 &a, const t2 &b)
  201. {
  202. if(a <= b)
  203. return a;
  204. else
  205. {
  206. a = b;
  207. return a;
  208. }
  209. }
  210. //makes a to fit the range <b, c>
  211. template <typename t1, typename t2, typename t3>
  212. t1 &abetween(t1 &a, const t2 &b, const t3 &c)
  213. {
  214. amax(a,b);
  215. amin(a,c);
  216. return a;
  217. }
  218. //checks if a is between b and c
  219. template <typename t1, typename t2, typename t3>
  220. bool isbetween(const t1 &a, const t2 &b, const t3 &c)
  221. {
  222. return a > b && a < c;
  223. }
  224. //checks if a is within b and c
  225. template <typename t1, typename t2, typename t3>
  226. bool iswithin(const t1 &a, const t2 &b, const t3 &c)
  227. {
  228. return a >= b && a <= c;
  229. }
  230. template <typename t1, typename t2>
  231. struct assigner
  232. {
  233. public:
  234. t1 &op1;
  235. t2 op2;
  236. assigner(t1 &a1, const t2 & a2)
  237. :op1(a1), op2(a2)
  238. {}
  239. void operator()()
  240. {
  241. op1 = op2;
  242. }
  243. };
  244. // Assigns value a2 to a1. The point of time of the real operation can be controlled
  245. // with the () operator.
  246. template <typename t1, typename t2>
  247. assigner<t1,t2> assigno(t1 &a1, const t2 &a2)
  248. {
  249. return assigner<t1,t2>(a1,a2);
  250. }
  251. //deleted pointer and sets it to NULL
  252. template <typename T>
  253. void clear_pointer(T* &ptr)
  254. {
  255. delete ptr;
  256. ptr = NULL;
  257. }
  258. template<typename T>
  259. std::unique_ptr<T> make_unique()
  260. {
  261. return std::unique_ptr<T>(new T());
  262. }
  263. template<typename T, typename Arg1>
  264. std::unique_ptr<T> make_unique(Arg1&& arg1)
  265. {
  266. return std::unique_ptr<T>(new T(std::forward<Arg1>(arg1)));
  267. }
  268. }
  269. using vstd::operator-=;
  270. // can be used for counting arrays
  271. template<typename T, size_t N> char (&_ArrayCountObj(const T (&)[N]))[N];
  272. #define ARRAY_COUNT(arr) (sizeof(_ArrayCountObj(arr)))
  273. //for explicit overrides
  274. #ifdef _MSC_VER
  275. #define OVERRIDE override
  276. #else
  277. #define OVERRIDE //is there any working counterpart?
  278. #endif
  279. //XXX pls dont - 'debug macros' are usually more trouble than it's worth
  280. #define HANDLE_EXCEPTION \
  281. catch (const std::exception& e) { \
  282. tlog1 << e.what() << std::endl; \
  283. throw; \
  284. } \
  285. catch (const std::exception * e) \
  286. { \
  287. tlog1 << e->what()<< std::endl; \
  288. throw; \
  289. } \
  290. catch (const std::string& e) { \
  291. tlog1 << e << std::endl; \
  292. throw; \
  293. }
  294. #define HANDLE_EXCEPTIONC(COMMAND) \
  295. catch (const std::exception& e) { \
  296. COMMAND; \
  297. tlog1 << e.what() << std::endl; \
  298. throw; \
  299. } \
  300. catch (const std::string &e) \
  301. { \
  302. COMMAND; \
  303. tlog1 << e << std::endl; \
  304. throw; \
  305. }
  306. #include "lib/CLogger.h"