a2functional.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #ifndef _D_A2_FUNCTIONAL_H_
  36. #define _D_A2_FUNCTIONAL_H_
  37. #include <functional>
  38. #include <string>
  39. #include <algorithm>
  40. #include "SharedHandle.h"
  41. #include "A2STR.h"
  42. namespace aria2 {
  43. // mem_fun_t for SharedHandle
  44. template <class ReturnType, typename ClassType>
  45. class mem_fun_sh_t:public std::unary_function< SharedHandle<ClassType>, ReturnType>
  46. {
  47. private:
  48. ReturnType (ClassType::*f)();
  49. public:
  50. mem_fun_sh_t(ReturnType (ClassType::*f)()):f(f) {}
  51. ReturnType operator()(const SharedHandle<ClassType>& x) const
  52. {
  53. return (x.get()->*f)();
  54. }
  55. };
  56. // const_mem_fun_t for SharedHandle
  57. template <class ReturnType, typename ClassType>
  58. class const_mem_fun_sh_t:public std::unary_function< SharedHandle<ClassType>, ReturnType>
  59. {
  60. private:
  61. ReturnType (ClassType::*f)() const;
  62. public:
  63. const_mem_fun_sh_t(ReturnType (ClassType::*f)() const):f(f) {}
  64. ReturnType operator()(const SharedHandle<ClassType>& x) const
  65. {
  66. return (x.get()->*f)();
  67. }
  68. };
  69. template <class ReturnType, typename ClassType>
  70. mem_fun_sh_t<ReturnType, ClassType>
  71. mem_fun_sh(ReturnType (ClassType::*f)())
  72. {
  73. return mem_fun_sh_t<ReturnType, ClassType>(f);
  74. };
  75. template <class ReturnType, typename ClassType>
  76. const_mem_fun_sh_t<ReturnType, ClassType>
  77. mem_fun_sh(ReturnType (ClassType::*f)() const)
  78. {
  79. return const_mem_fun_sh_t<ReturnType, ClassType>(f);
  80. };
  81. // mem_fun1_t for SharedHandle
  82. template<typename ReturnType, typename ClassType, typename ArgType>
  83. class mem_fun1_sh_t:public std::binary_function<SharedHandle<ClassType>,
  84. ArgType,
  85. ReturnType>
  86. {
  87. private:
  88. ReturnType (ClassType::*f)(ArgType);
  89. public:
  90. mem_fun1_sh_t(ReturnType (ClassType::*f)(ArgType)):f(f) {}
  91. ReturnType operator()(const SharedHandle<ClassType>& x, ArgType a) const
  92. {
  93. return (x.get()->*f)(a);
  94. }
  95. };
  96. template<typename ReturnType, typename ClassType, typename ArgType>
  97. mem_fun1_sh_t<ReturnType, ClassType, ArgType>
  98. mem_fun_sh(ReturnType (ClassType::*f)(ArgType))
  99. {
  100. return mem_fun1_sh_t<ReturnType, ClassType, ArgType>(f);
  101. };
  102. template<class BinaryOp, class UnaryOp>
  103. class adopt2nd_t:public std::binary_function<typename BinaryOp::first_argument_type,
  104. typename UnaryOp::argument_type,
  105. typename BinaryOp::result_type> {
  106. private:
  107. BinaryOp binaryOp_;
  108. UnaryOp unaryOp_;
  109. public:
  110. adopt2nd_t(const BinaryOp& b, const UnaryOp& u):
  111. binaryOp_(b), unaryOp_(u) {}
  112. typename BinaryOp::result_type
  113. operator()(const typename BinaryOp::first_argument_type& x,
  114. const typename UnaryOp::argument_type& y)
  115. {
  116. return binaryOp_(x, unaryOp_(y));
  117. }
  118. };
  119. template <class BinaryOp, class UnaryOp>
  120. inline adopt2nd_t<BinaryOp, UnaryOp>
  121. adopt2nd(const BinaryOp& binaryOp, const UnaryOp& unaryOp)
  122. {
  123. return adopt2nd_t<BinaryOp, UnaryOp>(binaryOp, unaryOp);
  124. };
  125. template<typename Pair>
  126. class Ascend1st:public std::binary_function<Pair, Pair, bool>
  127. {
  128. public:
  129. bool operator()(const Pair& p1, const Pair& p2) const
  130. {
  131. return p1.first < p2.first;
  132. }
  133. };
  134. template<typename Pair>
  135. class select2nd
  136. {
  137. public:
  138. typename Pair::second_type operator()(const Pair& p) const
  139. {
  140. return p.second;
  141. }
  142. typename Pair::second_type operator()(Pair& p) const
  143. {
  144. return p.second;
  145. }
  146. };
  147. class Deleter {
  148. public:
  149. template<class T>
  150. void operator()(T* ptr) {
  151. delete ptr;
  152. }
  153. };
  154. template<typename T>
  155. class Append {
  156. private:
  157. T& to_;
  158. T delim_;
  159. public:
  160. template<typename S>
  161. Append(T& to, const S& delim):to_(to), delim_(delim) {}
  162. template<typename S>
  163. void operator()(const S& s) {
  164. to_ += s+delim_;
  165. }
  166. };
  167. typedef Append<std::string> StringAppend;
  168. template<typename T>
  169. class auto_delete {
  170. private:
  171. T obj_;
  172. void (*deleter_)(T);
  173. public:
  174. auto_delete(T obj, void (*deleter)(T)):obj_(obj), deleter_(deleter) {}
  175. ~auto_delete()
  176. {
  177. deleter_(obj_);
  178. }
  179. };
  180. template<class Container>
  181. class auto_delete_container {
  182. private:
  183. Container* c_;
  184. public:
  185. auto_delete_container(Container* c):c_(c) {}
  186. ~auto_delete_container()
  187. {
  188. std::for_each(c_->begin(), c_->end(), Deleter());
  189. delete c_;
  190. }
  191. };
  192. template<typename InputIterator, typename DelimiterType>
  193. std::string strjoin(InputIterator first, InputIterator last,
  194. const DelimiterType& delim)
  195. {
  196. std::string result;
  197. if(first == last) {
  198. return result;
  199. }
  200. InputIterator beforeLast = last-1;
  201. for(; first != beforeLast; ++first) {
  202. result += *first;
  203. result += delim;
  204. }
  205. result += *beforeLast;
  206. return result;
  207. }
  208. // Applies unaryOp through first to last and joins the result with
  209. // delimiter delim.
  210. template<typename InputIterator, typename DelimiterType, typename UnaryOp>
  211. std::string strjoin(InputIterator first, InputIterator last,
  212. const DelimiterType& delim, const UnaryOp& unaryOp)
  213. {
  214. std::string result;
  215. if(first == last) {
  216. return result;
  217. }
  218. InputIterator beforeLast = last-1;
  219. for(; first != beforeLast; ++first) {
  220. result += unaryOp(*first);
  221. result += delim;
  222. }
  223. result += unaryOp(*beforeLast);
  224. return result;
  225. }
  226. template<typename T1, typename T2>
  227. inline std::string strconcat(const T1& a1, const T2& a2)
  228. {
  229. std::string s(a1); s += a2; return s;
  230. }
  231. template<typename T1, typename T2, typename T3>
  232. inline std::string strconcat(const T1& a1, const T2& a2, const T3& a3)
  233. {
  234. std::string s(a1); s += a2; s += a3; return s;
  235. }
  236. template<typename T1, typename T2, typename T3, typename T4>
  237. inline std::string
  238. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4)
  239. {
  240. std::string s(a1); s += a2; s += a3; s += a4; return s;
  241. }
  242. template<typename T1, typename T2, typename T3, typename T4, typename T5>
  243. inline std::string
  244. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  245. const T5& a5)
  246. {
  247. std::string s(a1); s += a2; s += a3; s += a4; s += a5; return s;
  248. }
  249. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  250. typename T6>
  251. inline std::string
  252. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  253. const T5& a5, const T6& a6)
  254. {
  255. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; return s;
  256. }
  257. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  258. typename T6, typename T7>
  259. inline std::string
  260. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  261. const T5& a5, const T6& a6, const T7& a7)
  262. {
  263. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  264. return s;
  265. }
  266. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  267. typename T6, typename T7, typename T8>
  268. inline std::string
  269. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  270. const T5& a5, const T6& a6, const T7& a7, const T8& a8)
  271. {
  272. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  273. s += a8; return s;
  274. }
  275. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  276. typename T6, typename T7, typename T8, typename T9>
  277. inline std::string
  278. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  279. const T5& a5, const T6& a6, const T7& a7, const T8& a8,
  280. const T9& a9)
  281. {
  282. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  283. s += a8; s += a9; return s;
  284. }
  285. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  286. typename T6, typename T7, typename T8, typename T9, typename T10>
  287. inline std::string
  288. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  289. const T5& a5, const T6& a6, const T7& a7, const T8& a8,
  290. const T9& a9, const T10& a10)
  291. {
  292. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  293. s += a8; s += a9; s += a10; return s;
  294. }
  295. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  296. typename T6, typename T7, typename T8, typename T9, typename T10,
  297. typename T11>
  298. inline std::string
  299. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  300. const T5& a5, const T6& a6, const T7& a7, const T8& a8,
  301. const T9& a9, const T10& a10, const T11& a11)
  302. {
  303. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  304. s += a8; s += a9; s += a10; s += a11; return s;
  305. }
  306. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  307. typename T6, typename T7, typename T8, typename T9, typename T10,
  308. typename T11, typename T12>
  309. inline std::string
  310. strconcat(const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  311. const T5& a5, const T6& a6, const T7& a7, const T8& a8,
  312. const T9& a9, const T10& a10, const T11& a11,
  313. const T12& a12)
  314. {
  315. std::string s(a1); s += a2; s += a3; s += a4; s += a5; s += a6; s += a7;
  316. s += a8; s += a9; s += a10; s += a11; s += a12; return s;
  317. }
  318. template<typename T1, typename T2>
  319. inline void strappend(std::string& base, const T1& a1, const T2& a2)
  320. {
  321. base += a1; base += a2;
  322. }
  323. template<typename T1, typename T2, typename T3>
  324. inline void strappend(std::string& base,
  325. const T1& a1, const T2& a2, const T3& a3)
  326. {
  327. base += a1; base += a2; base += a3;
  328. }
  329. template<typename T1, typename T2, typename T3, typename T4>
  330. inline void strappend(std::string& base,
  331. const T1& a1, const T2& a2, const T3& a3, const T4& a4)
  332. {
  333. base += a1; base += a2; base += a3; base += a4;
  334. }
  335. template<typename T1, typename T2, typename T3, typename T4, typename T5>
  336. inline void strappend(std::string& base,
  337. const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  338. const T5& a5)
  339. {
  340. base += a1; base += a2; base += a3; base += a4; base += a5;
  341. }
  342. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  343. typename T6>
  344. inline void strappend(std::string& base,
  345. const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  346. const T5& a5, const T6& a6)
  347. {
  348. base += a1; base += a2; base += a3; base += a4; base += a5; base += a6;
  349. }
  350. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  351. typename T6, typename T7>
  352. inline void strappend(std::string& base,
  353. const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  354. const T5& a5, const T6& a6, const T7& a7)
  355. {
  356. base += a1; base += a2; base += a3; base += a4; base += a5; base += a6;
  357. base += a7;
  358. }
  359. template<typename T1, typename T2, typename T3, typename T4, typename T5,
  360. typename T6, typename T7, typename T8>
  361. inline void strappend(std::string& base,
  362. const T1& a1, const T2& a2, const T3& a3, const T4& a4,
  363. const T5& a5, const T6& a6, const T7& a7, const T8& a8)
  364. {
  365. base += a1; base += a2; base += a3; base += a4; base += a5; base += a6;
  366. base += a7; base += a8;
  367. }
  368. template<typename T>
  369. class LeastRecentAccess:public std::binary_function<T, T, bool> {
  370. public:
  371. bool operator()(const T& lhs, const T& rhs) const
  372. {
  373. return lhs.getLastAccessTime() < rhs.getLastAccessTime();
  374. }
  375. };
  376. template<typename T, typename S>
  377. bool in(T x, S s, S t)
  378. {
  379. return s <= x && x <= t;
  380. }
  381. } // namespace aria2
  382. #endif // _D_A2_FUNCTIONAL_H_