1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251
|
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
#include <proton/types.hpp>
#include <proton/codec/encoder.hpp>
#include <proton/codec/decoder.hpp>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
// Examples of how to use the encoder and decoder to create and examine AMQP values.
//
// Print is defined at the end as an example of how to query and extract complex
// values from a decoder in terms of their simple components.
void print(proton::value&);
// Some helper templates to print map and std::vector results.
namespace std {
template<class T, class U> ostream& operator<<(ostream& o, const std::pair<T,U>& p) {
return o << p.first << ":" << p.second;
}
template<class T> ostream& operator<<(ostream& o, const std::vector<T>& v) {
o << "[ ";
ostream_iterator<T> oi(o, " ");
copy(v.begin(), v.end(), oi);
return o << "]";
}
template<class T> ostream& operator<<(ostream& o, const std::list<T>& v) {
o << "[ ";
ostream_iterator<T> oi(o, " ");
copy(v.begin(), v.end(), oi);
return o << "]";
}
template<class K, class T> ostream& operator<<(ostream& o, const map<K, T>& m) {
o << "{ ";
ostream_iterator<std::pair<K,T> > oi(o, " ");
copy(m.begin(), m.end(), oi);
return o << "}";
}
}
// Insert/extract native C++ containers with uniform type values.
static void uniform_containers() {
std::cout << std::endl << "== Array, list and map of uniform type." << std::endl;
proton::value v;
std::vector<int> a;
a.push_back(1);
a.push_back(2);
a.push_back(3);
// By default a C++ container is encoded as an AMQP array.
v = a;
print(v);
std::list<int> a1;
proton::get(v, a1);
std::cout << a1 << std::endl;
// You can specify that a container should be encoded as an AMQP list instead.
v = proton::codec::encoder::list(a1);
print(v);
std::cout << proton::get<std::vector<int> >(v) << std::endl;
// C++ map types (types with key_type, mapped_type) convert to an AMQP map by default.
std::map<std::string, int> m;
m["one"] = 1;
m["two"] = 2;
v = m;
print(v);
std::cout << proton::get<std::map<std::string, int> >(v) << std::endl;
// A sequence of pairs encodes as an AMQP MAP, which lets you control the encoded order.
std::vector<std::pair<std::string, int> > pairs;
pairs.push_back(std::make_pair("z", 3));
pairs.push_back(std::make_pair("a", 4));
v = pairs;
print(v);
// You can also decode an AMQP map as a sequence of pairs to preserve encode order.
std::vector<std::pair<std::string, int> > pairs2;
proton::codec::decoder d(v);
d >> pairs2;
std::cout << pairs2 << std::endl;
// A vector of proton::value is normally encoded as a mixed-type AMQP LIST,
// but you can encoded it as an array provided all the values match the array type.
std::vector<proton::value> vv;
vv.push_back(proton::value("a"));
vv.push_back(proton::value("b"));
vv.push_back(proton::value("c"));
v = vv;
print(v);
}
// Containers with mixed types use value to represent arbitrary AMQP types.
static void mixed_containers() {
std::cout << std::endl << "== List and map of mixed type values." << std::endl;
proton::value v;
std::vector<proton::value> l;
l.push_back(proton::value(42));
l.push_back(proton::value(std::string("foo")));
// By default, a sequence of proton::value is treated as an AMQP list.
v = l;
print(v);
std::vector<proton::value> l2 = proton::get<std::vector<proton::value> >(v);
std::cout << l2 << std::endl;
std::map<proton::value, proton::value> m;
m[proton::value("five")] = proton::value(5);
m[proton::value(4)] = proton::value("four"); v = m;
print(v);
typedef std::map<proton::value, proton::value> value_map;
value_map m2(proton::get<value_map>(v));
std::cout << m2 << std::endl;
}
// Insert using stream operators (see print_next for example of extracting with stream ops.)
static void insert_stream_operators() {
std::cout << std::endl << "== Insert with stream operators." << std::endl;
proton::value v;
// Create an array of INT with values [1, 2, 3]
proton::codec::encoder e(v);
e << proton::codec::start::array(proton::INT)
<< int32_t(1) << int32_t(2) << int32_t(3)
<< proton::codec::finish();
print(v);
// Create a mixed-type list of the values [42, 0, "x"].
proton::codec::encoder e2(v);
e2 << proton::codec::start::list()
<< int32_t(42) << false << proton::symbol("x")
<< proton::codec::finish();
print(v);
// Create a map { "k1":42, "k2": false }
proton::codec::encoder e3(v);
e3 << proton::codec::start::map()
<< "k1" << int32_t(42)
<< proton::symbol("k2") << false
<< proton::codec::finish();
print(v);
}
int main(int, char**) {
try {
uniform_containers();
mixed_containers();
insert_stream_operators();
return 0;
} catch (const std::exception& e) {
std::cerr << std::endl << "error: " << e.what() << std::endl;
}
return 1;
}
// print_next prints the next value from values by recursively descending into complex values.
//
// NOTE this is for example puroses only: There is a built in ostream operator<< for values.
//
//
static void print_next(proton::codec::decoder& d) {
proton::type_id type = d.next_type();
proton::codec::start s;
switch (type) {
case proton::ARRAY: {
d >> s;
std::cout << "array<" << s.element;
if (s.is_described) {
std::cout << ", descriptor=";
print_next(d);
}
std::cout << ">[";
for (size_t i = 0; i < s.size; ++i) {
if (i) std::cout << ", ";
print_next(d);
}
std::cout << "]";
d >> proton::codec::finish();
break;
}
case proton::LIST: {
d >> s;
std::cout << "list[";
for (size_t i = 0; i < s.size; ++i) {
if (i) std::cout << ", ";
print_next(d);
}
std::cout << "]";
d >> proton::codec::finish();
break;
}
case proton::MAP: {
d >> s;
std::cout << "map{";
for (size_t i = 0; i < s.size/2; ++i) {
if (i) std::cout << ", ";
print_next(d);
std::cout << ":"; // key:value
print_next(d);
}
std::cout << "}";
d >> proton::codec::finish();
break;
}
case proton::DESCRIBED: {
d >> s;
std::cout << "described(";
print_next(d); // Descriptor
print_next(d); // value
d >> proton::codec::finish();
break;
}
default:
// A simple type. We could continue the switch for all AMQP types but
// we will take a short cut and extract to another value and print that.
proton::value v2;
d >> v2;
std::cout << type << "(" << v2 << ")";
}
}
// Print a value, for example purposes. Normal code can use operator<<
void print(proton::value& v) {
proton::codec::decoder d(v);
d.rewind();
while (d.more()) {
print_next(d);
if (d.more()) std::cout << ", ";
}
std::cout << std::endl;
}
|