| <!DOCTYPE html> |
| <!-- |
| - |
| - 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. |
| - |
| --> |
| <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"> |
| <head> |
| <title>encode_decode.cpp - Apache Qpid™</title> |
| <meta http-equiv="X-UA-Compatible" content="IE=edge"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"/> |
| <link rel="stylesheet" href="/site.css" type="text/css" async="async"/> |
| <link rel="stylesheet" href="/deferred.css" type="text/css" defer="defer"/> |
| <script type="text/javascript">var _deferredFunctions = [];</script> |
| <script type="text/javascript" src="/deferred.js" defer="defer"></script> |
| <!--[if lte IE 8]> |
| <link rel="stylesheet" href="/ie.css" type="text/css"/> |
| <script type="text/javascript" src="/html5shiv.js"></script> |
| <![endif]--> |
| |
| <!-- Redirects for `go get` and godoc.org --> |
| <meta name="go-import" |
| content="qpid.apache.org git https://git-wip-us.apache.org/repos/asf/qpid-proton.git"/> |
| <meta name="go-source" |
| content="qpid.apache.org |
| https://github.com/apache/qpid-proton/blob/go1/README.md |
| https://github.com/apache/qpid-proton/tree/go1{/dir} |
| https://github.com/apache/qpid-proton/blob/go1{/dir}/{file}#L{line}"/> |
| </head> |
| <body> |
| <div id="-content"> |
| <div id="-top" class="panel"> |
| <a id="-menu-link"><img width="16" height="16" src="" alt="Menu"/></a> |
| |
| <a id="-search-link"><img width="22" height="16" src="" alt="Search"/></a> |
| |
| <ul id="-global-navigation"> |
| <li><a id="-logotype" href="/index.html">Apache Qpid<sup>™</sup></a></li> |
| <li><a href="/documentation.html">Documentation</a></li> |
| <li><a href="/download.html">Download</a></li> |
| <li><a href="/discussion.html">Discussion</a></li> |
| </ul> |
| </div> |
| |
| <div id="-menu" class="panel" style="display: none;"> |
| <div class="flex"> |
| <section> |
| <h3>Project</h3> |
| |
| <ul> |
| <li><a href="/overview.html">Overview</a></li> |
| <li><a href="/components/index.html">Components</a></li> |
| <li><a href="/releases/index.html">Releases</a></li> |
| </ul> |
| </section> |
| |
| <section> |
| <h3>Messaging APIs</h3> |
| |
| <ul> |
| <li><a href="/proton/index.html">Qpid Proton</a></li> |
| <li><a href="/components/jms/index.html">Qpid JMS</a></li> |
| <li><a href="/components/messaging-api/index.html">Qpid Messaging API</a></li> |
| </ul> |
| </section> |
| |
| <section> |
| <h3>Servers and tools</h3> |
| |
| <ul> |
| <li><a href="/components/broker-j/index.html">Broker-J</a></li> |
| <li><a href="/components/cpp-broker/index.html">C++ broker</a></li> |
| <li><a href="/components/dispatch-router/index.html">Dispatch router</a></li> |
| </ul> |
| </section> |
| |
| <section> |
| <h3>Resources</h3> |
| |
| <ul> |
| <li><a href="/dashboard.html">Dashboard</a></li> |
| <li><a href="https://cwiki.apache.org/confluence/display/qpid/Index">Wiki</a></li> |
| <li><a href="/resources.html">More resources</a></li> |
| </ul> |
| </section> |
| </div> |
| </div> |
| |
| <div id="-search" class="panel" style="display: none;"> |
| <form action="http://www.google.com/search" method="get"> |
| <input type="hidden" name="sitesearch" value="qpid.apache.org"/> |
| <input type="text" name="q" maxlength="255" autofocus="autofocus" tabindex="1"/> |
| <button type="submit">Search</button> |
| <a href="/search.html">More ways to search</a> |
| </form> |
| </div> |
| |
| <div id="-middle" class="panel"> |
| <ul id="-path-navigation"><li><a href="/index.html">Home</a></li><li><a href="/releases/index.html">Releases</a></li><li><a href="/releases/qpid-proton-0.25.0/index.html">Qpid Proton 0.25.0</a></li><li><a href="/releases/qpid-proton-0.25.0/proton/cpp/examples/index.html">Proton C++ Examples</a></li><li>encode_decode.cpp</li></ul> |
| |
| <div id="-middle-content"> |
| |
| <h1>encode_decode.cpp</h1> |
| <div class="highlight"><pre><span></span><span class="cp">#include</span> <span class="cpf"><proton/types.hpp></span><span class="cp"></span> |
| <span class="cp">#include</span> <span class="cpf"><proton/codec/encoder.hpp></span><span class="cp"></span> |
| <span class="cp">#include</span> <span class="cpf"><proton/codec/decoder.hpp></span><span class="cp"></span> |
| |
| <span class="cp">#include</span> <span class="cpf"><algorithm></span><span class="cp"></span> |
| <span class="cp">#include</span> <span class="cpf"><iostream></span><span class="cp"></span> |
| <span class="cp">#include</span> <span class="cpf"><iterator></span><span class="cp"></span> |
| <span class="cp">#include</span> <span class="cpf"><sstream></span><span class="cp"></span> |
| |
| <span class="c1">// Examples of how to use the encoder and decoder to create and examine AMQP values.</span> |
| <span class="c1">//</span> |
| |
| <span class="c1">// Print is defined at the end as an example of how to query and extract complex</span> |
| <span class="c1">// values from a decoder in terms of their simple components.</span> |
| <span class="kt">void</span> <span class="nf">print</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">&</span><span class="p">);</span> |
| |
| <span class="c1">// Some helper templates to print map and std::vector results.</span> |
| <span class="k">namespace</span> <span class="n">std</span> <span class="p">{</span> |
| <span class="k">template</span><span class="o"><</span><span class="k">class</span> <span class="nc">T</span><span class="p">,</span> <span class="k">class</span> <span class="nc">U</span><span class="o">></span> <span class="n">ostream</span><span class="o">&</span> <span class="k">operator</span><span class="o"><<</span><span class="p">(</span><span class="n">ostream</span><span class="o">&</span> <span class="n">o</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">pair</span><span class="o"><</span><span class="n">T</span><span class="p">,</span><span class="n">U</span><span class="o">>&</span> <span class="n">p</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">return</span> <span class="n">o</span> <span class="o"><<</span> <span class="n">p</span><span class="p">.</span><span class="n">first</span> <span class="o"><<</span> <span class="s">":"</span> <span class="o"><<</span> <span class="n">p</span><span class="p">.</span><span class="n">second</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">template</span><span class="o"><</span><span class="k">class</span> <span class="nc">T</span><span class="o">></span> <span class="n">ostream</span><span class="o">&</span> <span class="k">operator</span><span class="o"><<</span><span class="p">(</span><span class="n">ostream</span><span class="o">&</span> <span class="n">o</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">T</span><span class="o">>&</span> <span class="n">v</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">o</span> <span class="o"><<</span> <span class="s">"[ "</span><span class="p">;</span> |
| <span class="n">ostream_iterator</span><span class="o"><</span><span class="n">T</span><span class="o">></span> <span class="n">oi</span><span class="p">(</span><span class="n">o</span><span class="p">,</span> <span class="s">" "</span><span class="p">);</span> |
| <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span> <span class="n">v</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span> <span class="n">oi</span><span class="p">);</span> |
| <span class="k">return</span> <span class="n">o</span> <span class="o"><<</span> <span class="s">"]"</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">template</span><span class="o"><</span><span class="k">class</span> <span class="nc">T</span><span class="o">></span> <span class="n">ostream</span><span class="o">&</span> <span class="k">operator</span><span class="o"><<</span><span class="p">(</span><span class="n">ostream</span><span class="o">&</span> <span class="n">o</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">list</span><span class="o"><</span><span class="n">T</span><span class="o">>&</span> <span class="n">v</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">o</span> <span class="o"><<</span> <span class="s">"[ "</span><span class="p">;</span> |
| <span class="n">ostream_iterator</span><span class="o"><</span><span class="n">T</span><span class="o">></span> <span class="n">oi</span><span class="p">(</span><span class="n">o</span><span class="p">,</span> <span class="s">" "</span><span class="p">);</span> |
| <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span> <span class="n">v</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span> <span class="n">oi</span><span class="p">);</span> |
| <span class="k">return</span> <span class="n">o</span> <span class="o"><<</span> <span class="s">"]"</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">template</span><span class="o"><</span><span class="k">class</span> <span class="nc">K</span><span class="p">,</span> <span class="k">class</span> <span class="nc">T</span><span class="o">></span> <span class="n">ostream</span><span class="o">&</span> <span class="k">operator</span><span class="o"><<</span><span class="p">(</span><span class="n">ostream</span><span class="o">&</span> <span class="n">o</span><span class="p">,</span> <span class="k">const</span> <span class="n">map</span><span class="o"><</span><span class="n">K</span><span class="p">,</span> <span class="n">T</span><span class="o">>&</span> <span class="n">m</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">o</span> <span class="o"><<</span> <span class="s">"{ "</span><span class="p">;</span> |
| <span class="n">ostream_iterator</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">pair</span><span class="o"><</span><span class="n">K</span><span class="p">,</span><span class="n">T</span><span class="o">></span> <span class="o">></span> <span class="n">oi</span><span class="p">(</span><span class="n">o</span><span class="p">,</span> <span class="s">" "</span><span class="p">);</span> |
| <span class="n">copy</span><span class="p">(</span><span class="n">m</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span> <span class="n">m</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span> <span class="n">oi</span><span class="p">);</span> |
| <span class="k">return</span> <span class="n">o</span> <span class="o"><<</span> <span class="s">"}"</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="p">}</span> |
| |
| <span class="c1">// Insert/extract native C++ containers with uniform type values.</span> |
| <span class="k">static</span> <span class="kt">void</span> <span class="n">uniform_containers</span><span class="p">()</span> <span class="p">{</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span> <span class="o"><<</span> <span class="s">"== Array, list and map of uniform type."</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">value</span> <span class="n">v</span><span class="p">;</span> |
| |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="kt">int</span><span class="o">></span> <span class="n">a</span><span class="p">;</span> |
| <span class="n">a</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span> |
| <span class="n">a</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="mi">2</span><span class="p">);</span> |
| <span class="n">a</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="mi">3</span><span class="p">);</span> |
| <span class="c1">// By default a C++ container is encoded as an AMQP array.</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">a</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">list</span><span class="o"><</span><span class="kt">int</span><span class="o">></span> <span class="n">a1</span><span class="p">;</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">get</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">a1</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">a1</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| |
| <span class="c1">// You can specify that a container should be encoded as an AMQP list instead.</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">encoder</span><span class="o">::</span><span class="n">list</span><span class="p">(</span><span class="n">a1</span><span class="p">);</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">get</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="kt">int</span><span class="o">></span> <span class="o">></span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| |
| <span class="c1">// C++ map types (types with key_type, mapped_type) convert to an AMQP map by default.</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="n">m</span><span class="p">;</span> |
| <span class="n">m</span><span class="p">[</span><span class="s">"one"</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> |
| <span class="n">m</span><span class="p">[</span><span class="s">"two"</span><span class="p">]</span> <span class="o">=</span> <span class="mi">2</span><span class="p">;</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">m</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">get</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="o">></span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| |
| <span class="c1">// A sequence of pairs encodes as an AMQP MAP, which lets you control the encoded order.</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">pair</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="o">></span> <span class="n">pairs</span><span class="p">;</span> |
| <span class="n">pairs</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">make_pair</span><span class="p">(</span><span class="s">"z"</span><span class="p">,</span> <span class="mi">3</span><span class="p">));</span> |
| <span class="n">pairs</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">make_pair</span><span class="p">(</span><span class="s">"a"</span><span class="p">,</span> <span class="mi">4</span><span class="p">));</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">pairs</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| |
| <span class="c1">// You can also decode an AMQP map as a sequence of pairs to preserve encode order.</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">pair</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="o">></span> <span class="n">pairs2</span><span class="p">;</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">decoder</span> <span class="n">d</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">pairs2</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">pairs2</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| |
| <span class="c1">// A vector of proton::value is normally encoded as a mixed-type AMQP LIST,</span> |
| <span class="c1">// but you can encoded it as an array provided all the values match the array type.</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="n">vv</span><span class="p">;</span> |
| <span class="n">vv</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="s">"a"</span><span class="p">));</span> |
| <span class="n">vv</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="s">"b"</span><span class="p">));</span> |
| <span class="n">vv</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="s">"c"</span><span class="p">));</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">vv</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="p">}</span> |
| |
| <span class="c1">// Containers with mixed types use value to represent arbitrary AMQP types.</span> |
| <span class="k">static</span> <span class="kt">void</span> <span class="n">mixed_containers</span><span class="p">()</span> <span class="p">{</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span> <span class="o"><<</span> <span class="s">"== List and map of mixed type values."</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">value</span> <span class="n">v</span><span class="p">;</span> |
| |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="n">l</span><span class="p">;</span> |
| <span class="n">l</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="mi">42</span><span class="p">));</span> |
| <span class="n">l</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">(</span><span class="s">"foo"</span><span class="p">)));</span> |
| <span class="c1">// By default, a sequence of proton::value is treated as an AMQP list.</span> |
| <span class="n">v</span> <span class="o">=</span> <span class="n">l</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="n">l2</span> <span class="o">=</span> <span class="n">proton</span><span class="o">::</span><span class="n">get</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="o">></span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">l2</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| |
| <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">,</span> <span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="n">m</span><span class="p">;</span> |
| <span class="n">m</span><span class="p">[</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="s">"five"</span><span class="p">)]</span> <span class="o">=</span> <span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="mi">5</span><span class="p">);</span> |
| <span class="n">m</span><span class="p">[</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="mi">4</span><span class="p">)]</span> <span class="o">=</span> <span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">(</span><span class="s">"four"</span><span class="p">);</span> <span class="n">v</span> <span class="o">=</span> <span class="n">m</span><span class="p">;</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="k">typedef</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="p">,</span> <span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">></span> <span class="n">value_map</span><span class="p">;</span> |
| <span class="n">value_map</span> <span class="nf">m2</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">get</span><span class="o"><</span><span class="n">value_map</span><span class="o">></span><span class="p">(</span><span class="n">v</span><span class="p">));</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">m2</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="p">}</span> |
| |
| <span class="c1">// Insert using stream operators (see print_next for example of extracting with stream ops.)</span> |
| <span class="k">static</span> <span class="kt">void</span> <span class="n">insert_stream_operators</span><span class="p">()</span> <span class="p">{</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span> <span class="o"><<</span> <span class="s">"== Insert with stream operators."</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">value</span> <span class="n">v</span><span class="p">;</span> |
| |
| <span class="c1">// Create an array of INT with values [1, 2, 3]</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">encoder</span> <span class="n">e</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">e</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">start</span><span class="o">::</span><span class="n">array</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">INT</span><span class="p">)</span> |
| <span class="o"><<</span> <span class="kt">int32_t</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="o"><<</span> <span class="kt">int32_t</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span> <span class="o"><<</span> <span class="kt">int32_t</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span> |
| <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| |
| <span class="c1">// Create a mixed-type list of the values [42, 0, "x"].</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">encoder</span> <span class="n">e2</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">e2</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">start</span><span class="o">::</span><span class="n">list</span><span class="p">()</span> |
| <span class="o"><<</span> <span class="kt">int32_t</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="o"><<</span> <span class="nb">false</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">symbol</span><span class="p">(</span><span class="s">"x"</span><span class="p">)</span> |
| <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| |
| <span class="c1">// Create a map { "k1":42, "k2": false }</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">encoder</span> <span class="n">e3</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">e3</span> <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">start</span><span class="o">::</span><span class="n">map</span><span class="p">()</span> |
| <span class="o"><<</span> <span class="s">"k1"</span> <span class="o"><<</span> <span class="kt">int32_t</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> |
| <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">symbol</span><span class="p">(</span><span class="s">"k2"</span><span class="p">)</span> <span class="o"><<</span> <span class="nb">false</span> |
| <span class="o"><<</span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="n">print</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="p">}</span> |
| |
| <span class="kt">int</span> <span class="n">main</span><span class="p">(</span><span class="kt">int</span><span class="p">,</span> <span class="kt">char</span><span class="o">**</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">try</span> <span class="p">{</span> |
| <span class="n">uniform_containers</span><span class="p">();</span> |
| <span class="n">mixed_containers</span><span class="p">();</span> |
| <span class="n">insert_stream_operators</span><span class="p">();</span> |
| <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> |
| <span class="p">}</span> <span class="k">catch</span> <span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">exception</span><span class="o">&</span> <span class="n">e</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cerr</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span> <span class="o"><<</span> <span class="s">"error: "</span> <span class="o"><<</span> <span class="n">e</span><span class="p">.</span><span class="n">what</span><span class="p">()</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> |
| <span class="p">}</span> |
| |
| <span class="c1">// print_next prints the next value from values by recursively descending into complex values.</span> |
| <span class="c1">//</span> |
| <span class="c1">// NOTE this is for example purposes only: There is a built in ostream operator<< for values.</span> |
| <span class="c1">//</span> |
| <span class="c1">//</span> |
| <span class="k">static</span> <span class="kt">void</span> <span class="n">print_next</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">decoder</span><span class="o">&</span> <span class="n">d</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">type_id</span> <span class="n">type</span> <span class="o">=</span> <span class="n">d</span><span class="p">.</span><span class="n">next_type</span><span class="p">();</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">start</span> <span class="n">s</span><span class="p">;</span> |
| <span class="k">switch</span> <span class="p">(</span><span class="n">type</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">case</span> <span class="n">proton</span><span class="o">::</span><span class="nl">ARRAY</span><span class="p">:</span> <span class="p">{</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">s</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"array<"</span> <span class="o"><<</span> <span class="n">s</span><span class="p">.</span><span class="n">element</span><span class="p">;</span> |
| <span class="k">if</span> <span class="p">(</span><span class="n">s</span><span class="p">.</span><span class="n">is_described</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">", descriptor="</span><span class="p">;</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="p">}</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">">["</span><span class="p">;</span> |
| <span class="k">for</span> <span class="p">(</span><span class="kt">size_t</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o"><</span> <span class="n">s</span><span class="p">.</span><span class="n">size</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">if</span> <span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">", "</span><span class="p">;</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="p">}</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"]"</span><span class="p">;</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="k">break</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">case</span> <span class="n">proton</span><span class="o">::</span><span class="nl">LIST</span><span class="p">:</span> <span class="p">{</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">s</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"list["</span><span class="p">;</span> |
| <span class="k">for</span> <span class="p">(</span><span class="kt">size_t</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o"><</span> <span class="n">s</span><span class="p">.</span><span class="n">size</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">if</span> <span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">", "</span><span class="p">;</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="p">}</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"]"</span><span class="p">;</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="k">break</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">case</span> <span class="n">proton</span><span class="o">::</span><span class="nl">MAP</span><span class="p">:</span> <span class="p">{</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">s</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"map{"</span><span class="p">;</span> |
| <span class="k">for</span> <span class="p">(</span><span class="kt">size_t</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o"><</span> <span class="n">s</span><span class="p">.</span><span class="n">size</span><span class="o">/</span><span class="mi">2</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span> |
| <span class="k">if</span> <span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">", "</span><span class="p">;</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">":"</span><span class="p">;</span> <span class="c1">// key:value</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="p">}</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"}"</span><span class="p">;</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="k">break</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">case</span> <span class="n">proton</span><span class="o">::</span><span class="nl">DESCRIBED</span><span class="p">:</span> <span class="p">{</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">s</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">"described("</span><span class="p">;</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> <span class="c1">// Descriptor</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> <span class="c1">// value</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">finish</span><span class="p">();</span> |
| <span class="k">break</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="k">default</span><span class="o">:</span> |
| <span class="c1">// A simple type. We could continue the switch for all AMQP types but</span> |
| <span class="c1">// we will take a short cut and extract to another value and print that.</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">value</span> <span class="n">v2</span><span class="p">;</span> |
| <span class="n">d</span> <span class="o">>></span> <span class="n">v2</span><span class="p">;</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">type</span> <span class="o"><<</span> <span class="s">"("</span> <span class="o"><<</span> <span class="n">v2</span> <span class="o"><<</span> <span class="s">")"</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="p">}</span> |
| |
| <span class="c1">// Print a value, for example purposes. Normal code can use operator<<</span> |
| <span class="kt">void</span> <span class="n">print</span><span class="p">(</span><span class="n">proton</span><span class="o">::</span><span class="n">value</span><span class="o">&</span> <span class="n">v</span><span class="p">)</span> <span class="p">{</span> |
| <span class="n">proton</span><span class="o">::</span><span class="n">codec</span><span class="o">::</span><span class="n">decoder</span> <span class="n">d</span><span class="p">(</span><span class="n">v</span><span class="p">);</span> |
| <span class="n">d</span><span class="p">.</span><span class="n">rewind</span><span class="p">();</span> |
| <span class="k">while</span> <span class="p">(</span><span class="n">d</span><span class="p">.</span><span class="n">more</span><span class="p">())</span> <span class="p">{</span> |
| <span class="n">print_next</span><span class="p">(</span><span class="n">d</span><span class="p">);</span> |
| <span class="k">if</span> <span class="p">(</span><span class="n">d</span><span class="p">.</span><span class="n">more</span><span class="p">())</span> <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="s">", "</span><span class="p">;</span> |
| <span class="p">}</span> |
| <span class="n">std</span><span class="o">::</span><span class="n">cout</span> <span class="o"><<</span> <span class="n">std</span><span class="o">::</span><span class="n">endl</span><span class="p">;</span> |
| <span class="p">}</span> |
| </pre></div> |
| |
| <p><a href="encode_decode.cpp">Download this file</a></p> |
| |
| |
| <hr/> |
| |
| <ul id="-apache-navigation"> |
| <li><a href="http://www.apache.org/">Apache</a></li> |
| <li><a href="http://www.apache.org/licenses/">License</a></li> |
| <li><a href="http://www.apache.org/foundation/sponsorship.html">Sponsorship</a></li> |
| <li><a href="http://www.apache.org/foundation/thanks.html">Thanks!</a></li> |
| <li><a href="/security.html">Security</a></li> |
| <li><a href="http://www.apache.org/"><img id="-apache-feather" width="48" height="14" src="" alt="Apache"/></a></li> |
| </ul> |
| |
| <p id="-legal"> |
| Apache Qpid, Messaging built on AMQP; Copyright © 2015 |
| The Apache Software Foundation; Licensed under |
| the <a href="http://www.apache.org/licenses/LICENSE-2.0">Apache |
| License, Version 2.0</a>; Apache Qpid, Qpid, Qpid Proton, |
| Proton, Apache, the Apache feather logo, and the Apache Qpid |
| project logo are trademarks of The Apache Software |
| Foundation; All other marks mentioned may be trademarks or |
| registered trademarks of their respective owners |
| </p> |
| </div> |
| </div> |
| </div> |
| </body> |
| </html> |
