msgpack/cpp/type/deque.hpp

57 lines
1.5 KiB
C++
Raw Normal View History

//
// MessagePack for C++ static resolution routine
//
2009-02-22 15:14:21 +09:00
// Copyright (C) 2008-2009 FURUHASHI Sadayuki
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
2009-08-10 18:26:01 +09:00
#ifndef MSGPACK_TYPE_DEQUE_HPP__
#define MSGPACK_TYPE_DEQUE_HPP__
#include "msgpack/object.hpp"
2009-08-10 18:26:01 +09:00
#include <deque>
namespace msgpack {
template <typename T>
2009-08-10 18:26:01 +09:00
inline std::deque<T>& operator>> (object o, std::deque<T>& v)
{
if(o.type != type::ARRAY) { throw type_error(); }
2009-02-15 18:39:30 +09:00
v.resize(o.via.array.size);
object* p = o.via.array.ptr;
object* const pend = o.via.array.ptr + o.via.array.size;
2009-08-10 18:26:01 +09:00
typename std::deque<T>::iterator it = v.begin();
for(; p < pend; ++p, ++it) {
2009-08-10 18:26:01 +09:00
p->convert(&*it);
}
return v;
}
template <typename Stream, typename T>
2009-08-10 18:26:01 +09:00
inline packer<Stream>& operator<< (packer<Stream>& o, const std::deque<T>& v)
{
o.pack_array(v.size());
2009-08-10 18:26:01 +09:00
for(typename std::deque<T>::const_iterator it(v.begin()), it_end(v.end());
it != it_end; ++it) {
o.pack(*it);
}
return o;
}
} // namespace msgpack
2009-08-10 18:26:01 +09:00
#endif /* msgpack/type/deque.hpp */