deque.hpp 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. //
  2. // MessagePack for C++ static resolution routine
  3. //
  4. // Copyright (C) 2008-2015 FURUHASHI Sadayuki
  5. //
  6. // Distributed under the Boost Software License, Version 1.0.
  7. // (See accompanying file LICENSE_1_0.txt or copy at
  8. // http://www.boost.org/LICENSE_1_0.txt)
  9. //
  10. #ifndef MSGPACK_V1_TYPE_DEQUE_HPP
  11. #define MSGPACK_V1_TYPE_DEQUE_HPP
  12. #include "msgpack/versioning.hpp"
  13. #include "msgpack/adaptor/adaptor_base.hpp"
  14. #include "msgpack/adaptor/check_container_size.hpp"
  15. #include <deque>
  16. namespace msgpack {
  17. /// @cond
  18. MSGPACK_API_VERSION_NAMESPACE(v1) {
  19. /// @endcond
  20. namespace adaptor {
  21. #if !defined(MSGPACK_USE_CPP03)
  22. template <typename T, typename Alloc>
  23. struct as<std::deque<T, Alloc>, typename std::enable_if<msgpack::has_as<T>::value>::type> {
  24. std::deque<T, Alloc> operator()(const msgpack::object& o) const {
  25. if (o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
  26. std::deque<T, Alloc> v;
  27. if (o.via.array.size > 0) {
  28. msgpack::object* p = o.via.array.ptr;
  29. msgpack::object* const pend = o.via.array.ptr + o.via.array.size;
  30. do {
  31. v.push_back(p->as<T>());
  32. ++p;
  33. } while (p < pend);
  34. }
  35. return v;
  36. }
  37. };
  38. #endif // !defined(MSGPACK_USE_CPP03)
  39. template <typename T, typename Alloc>
  40. struct convert<std::deque<T, Alloc> > {
  41. msgpack::object const& operator()(msgpack::object const& o, std::deque<T, Alloc>& v) const {
  42. if(o.type != msgpack::type::ARRAY) { throw msgpack::type_error(); }
  43. v.resize(o.via.array.size);
  44. msgpack::object* p = o.via.array.ptr;
  45. msgpack::object* const pend = o.via.array.ptr + o.via.array.size;
  46. typename std::deque<T, Alloc>::iterator it = v.begin();
  47. for(; p < pend; ++p, ++it) {
  48. p->convert(*it);
  49. }
  50. return o;
  51. }
  52. };
  53. template <typename T, typename Alloc>
  54. struct pack<std::deque<T, Alloc> > {
  55. template <typename Stream>
  56. msgpack::packer<Stream>& operator()(msgpack::packer<Stream>& o, const std::deque<T, Alloc>& v) const {
  57. uint32_t size = checked_get_container_size(v.size());
  58. o.pack_array(size);
  59. for(typename std::deque<T, Alloc>::const_iterator it(v.begin()), it_end(v.end());
  60. it != it_end; ++it) {
  61. o.pack(*it);
  62. }
  63. return o;
  64. }
  65. };
  66. template <typename T, typename Alloc>
  67. struct object_with_zone<std::deque<T, Alloc> > {
  68. void operator()(msgpack::object::with_zone& o, const std::deque<T, Alloc>& v) const {
  69. o.type = msgpack::type::ARRAY;
  70. if(v.empty()) {
  71. o.via.array.ptr = MSGPACK_NULLPTR;
  72. o.via.array.size = 0;
  73. } else {
  74. uint32_t size = checked_get_container_size(v.size());
  75. msgpack::object* p = static_cast<msgpack::object*>(o.zone.allocate_align(sizeof(msgpack::object)*size, MSGPACK_ZONE_ALIGNOF(msgpack::object)));
  76. msgpack::object* const pend = p + size;
  77. o.via.array.ptr = p;
  78. o.via.array.size = size;
  79. typename std::deque<T, Alloc>::const_iterator it(v.begin());
  80. do {
  81. *p = msgpack::object(*it, o.zone);
  82. ++p;
  83. ++it;
  84. } while(p < pend);
  85. }
  86. }
  87. };
  88. } // namespace adaptor
  89. /// @cond
  90. } // MSGPACK_API_VERSION_NAMESPACE(v1)
  91. /// @endcond
  92. } // namespace msgpack
  93. #endif // MSGPACK_V1_TYPE_DEQUE_HPP