// // MessagePack for C++ static resolution routine // // 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. // #ifndef MSGPACK_TYPE_TUPLE_HPP__ #define MSGPACK_TYPE_TUPLE_HPP__ #include "msgpack/object.hpp" namespace msgpack { namespace type { // FIXME operator== // FIXME operator!= <% GENERATION_LIMIT = 15 %> template , typename A<%=i%> = void<%}%>> struct tuple; template struct tuple_element; template struct const_tuple_element; template struct tuple_type { typedef T type; typedef T value_type; typedef T& reference; typedef const T& const_reference; typedef const T& transparent_reference; }; template struct tuple_type { typedef T type; typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef T& transparent_reference; }; template struct tuple_type { typedef T type; typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef const T& transparent_reference; }; <%0.upto(GENERATION_LIMIT) {|i|%> <%0.upto(i) {|j|%> template , typename A<%=k%><%}%>> struct tuple_element, A<%=k%><%}%>>, <%=j%>> : tuple_type> { tuple_element(tuple, A<%=k%> <%}%>>& x) : _x(x.a<%=j%>) {} typename tuple_type>::reference get() { return _x; } typename tuple_type>::const_reference get() const { return _x; } private: typename tuple_type>::reference _x; }; <%}%> <%}%> <%0.upto(GENERATION_LIMIT) {|i|%> <%0.upto(i) {|j|%> template , typename A<%=k%><%}%>> struct const_tuple_element, A<%=k%><%}%>>, <%=j%>> : tuple_type> { const_tuple_element(const tuple, A<%=k%><%}%>>& x) : _x(x.a<%=j%>) {} typename tuple_type>::const_reference get() const { return _x; } private: typename tuple_type>::const_reference _x; }; <%}%> <%}%> <%0.upto(GENERATION_LIMIT) {|i|%> template , typename A<%=j%><%}%>> tuple, A<%=j%><%}%>> make_tuple(typename tuple_type::transparent_reference a0<%1.upto(i) {|j|%>, typename tuple_type>::transparent_reference a<%=j%><%}%>) { return tuple, A<%=j%><%}%>>(a0<%1.upto(i) {|j|%>, a<%=j%><%}%>); } <%}%> template <> struct tuple<> { }; <%0.upto(GENERATION_LIMIT) {|i|%> template , typename A<%=j%><%}%>> struct tuple, A<%=j%><%}%>> { typedef tuple, A<%=j%><%}%>> value_type; tuple() {} tuple(typename tuple_type::transparent_reference _a0<%1.upto(i) {|j|%>, typename tuple_type>::transparent_reference _a<%=j%><%}%>) : a0(_a0)<%1.upto(i) {|j|%>, a<%=j%>(_a<%=j%>)<%}%> {} tuple(object o) { o.convert(this); } template typename tuple_element::reference get() { return tuple_element(*this).get(); } template typename const_tuple_element::const_reference get() const { return const_tuple_element(*this).get(); } <%0.upto(i) {|j|%> A<%=j%> a<%=j%>;<%}%> }; <%}%> } // namespace type inline type::tuple<>& operator>> ( object o, type::tuple<>& v) { if(o.type != type::ARRAY) { throw type_error(); } return v; } <%0.upto(GENERATION_LIMIT) {|i|%> template , typename A<%=j%><%}%>> type::tuple, A<%=j%><%}%>>& operator>> ( object o, type::tuple, A<%=j%><%}%>>& v) { if(o.type != type::ARRAY) { throw type_error(); } if(o.via.array.size < <%=i+1%>) { throw type_error(); } <%0.upto(i) {|j|%> o.via.array.ptr[<%=j%>].convert>(&v.template get<<%=j%>>());<%}%> return v; } <%}%> template const packer& operator<< ( packer& o, const type::tuple<>& v) { o.pack_array(0); return o; } <%0.upto(GENERATION_LIMIT) {|i|%> template , typename A<%=j%><%}%>> const packer& operator<< ( packer& o, const type::tuple, A<%=j%><%}%>>& v) { o.pack_array(<%=i+1%>); <%0.upto(i) {|j|%> o.pack(v.template get<<%=j%>>());<%}%> return o; } <%}%> } // namespace msgpack #endif /* msgpack/type/tuple.hpp */