Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-updates > by-pkgid > d5e62c01ae8d1e579463c6a871dd44bf > files > 331

qtbase5-doc-5.12.6-2.mga7.noarch.rpm

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html>
<html lang="en">
<head>
  <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<!-- qcborarray.cpp -->
  <title>QCborArray Class | Qt Core 5.12.6</title>
  <link rel="stylesheet" type="text/css" href="style/offline-simple.css" />
  <script type="text/javascript">
    document.getElementsByTagName("link").item(0).setAttribute("href", "style/offline.css");
    // loading style sheet breaks anchors that were jumped to before
    // so force jumping to anchor again
    setTimeout(function() {
        var anchor = location.hash;
        // need to jump to different anchor first (e.g. none)
        location.hash = "#";
        setTimeout(function() {
            location.hash = anchor;
        }, 0);
    }, 0);
  </script>
</head>
<body>
<div class="header" id="qtdocheader">
  <div class="main">
    <div class="main-rounded">
      <div class="navigationbar">
        <table><tr>
<td >Qt 5.12</td><td ><a href="qtcore-index.html">Qt Core</a></td><td ><a href="qtcore-module.html">C++ Classes</a></td><td >QCborArray</td></tr></table><table class="buildversion"><tr>
<td id="buildversion" width="100%" align="right"><a href="qtcore-index.html">Qt 5.12.6 Reference Documentation</a></td>
        </tr></table>
      </div>
    </div>
<div class="content">
<div class="line">
<div class="content mainContent">
<div class="sidebar">
<div class="toc">
<h3><a name="toc">Contents</a></h3>
<ul>
<li class="level1"><a href="#public-types">Public Types</a></li>
<li class="level1"><a href="#public-functions">Public Functions</a></li>
<li class="level1"><a href="#static-public-members">Static Public Members</a></li>
<li class="level1"><a href="#details">Detailed Description</a></li>
</ul>
</div>
<div class="sidebar-content" id="sidebar-content"></div></div>
<h1 class="title">QCborArray Class</h1>
<!-- $$$QCborArray-brief -->
<p>The <a href="qcborarray.html">QCborArray</a> class is used to hold an array of CBOR elements. <a href="#details">More...</a></p>
<!-- @@@QCborArray -->
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> Header:</td><td class="memItemRight bottomAlign">   <span class="preprocessor">#include &lt;QCborArray&gt;</span>
</td></tr><tr><td class="memItemLeft rightAlign topAlign"> qmake:</td><td class="memItemRight bottomAlign"> QT += core</td></tr><tr><td class="memItemLeft rightAlign topAlign"> Since:</td><td class="memItemRight bottomAlign">  Qt 5.12</td></tr></table></div><ul>
<li><a href="qcborarray-members.html">List of all members, including inherited members</a></li>
</ul>
<p><b>Note:</b> All functions in this class are reentrant.</p>
<a name="public-types"></a>
<h2 id="public-types">Public Types</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> class </td><td class="memItemRight bottomAlign"><b><a href="qcborarray-constiterator.html">ConstIterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> class </td><td class="memItemRight bottomAlign"><b><a href="qcborarray-iterator.html">Iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#const_iterator-typedef">const_iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#const_pointer-typedef">const_pointer</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#const_reference-typedef">const_reference</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#difference_type-typedef">difference_type</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#iterator-typedef">iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#pointer-typedef">pointer</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#reference-typedef">reference</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#size_type-typedef">size_type</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#value_type-typedef">value_type</a></b></td></tr>
</table></div>
<a name="public-functions"></a>
<h2 id="public-functions">Public Functions</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#QCborArray">QCborArray</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#QCborArray-1">QCborArray</a></b>(const QCborArray &amp;<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#QCborArray-2">QCborArray</a></b>(std::initializer_list&lt;QCborValue&gt; <i>args</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#dtor.QCborArray">~QCborArray</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#append">append</a></b>(const QCborValue &amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#append-1">append</a></b>(QCborValue &amp;&amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#at">at</a></b>(qsizetype <i>i</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#begin">begin</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#begin-1">begin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#cbegin">cbegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#cend">cend</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#clear">clear</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#compare">compare</a></b>(const QCborArray &amp;<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#constBegin">constBegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#constEnd">constEnd</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#contains">contains</a></b>(const QCborValue &amp;<i>value</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#empty">empty</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#end">end</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#end-1">end</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#erase">erase</a></b>(QCborArray::iterator <i>it</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#erase-1">erase</a></b>(QCborArray::const_iterator <i>it</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#extract">extract</a></b>(QCborArray::ConstIterator <i>it</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#extract-1">extract</a></b>(QCborArray::Iterator <i>it</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#first">first</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValueRef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#first-1">first</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#insert">insert</a></b>(qsizetype <i>i</i>, const QCborValue &amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#insert-1">insert</a></b>(qsizetype <i>i</i>, QCborValue &amp;&amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#insert-2">insert</a></b>(QCborArray::iterator <i>before</i>, const QCborValue &amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray::iterator </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#insert-3">insert</a></b>(QCborArray::const_iterator <i>before</i>, const QCborValue &amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#isEmpty">isEmpty</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#last">last</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValueRef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#last-1">last</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#pop_back">pop_back</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#pop_front">pop_front</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#prepend">prepend</a></b>(const QCborValue &amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#prepend-1">prepend</a></b>(QCborValue &amp;&amp;<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#push_back">push_back</a></b>(const QCborValue &amp;<i>t</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#push_front">push_front</a></b>(const QCborValue &amp;<i>t</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#removeAt">removeAt</a></b>(qsizetype <i>i</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#removeFirst">removeFirst</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#removeLast">removeLast</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> qsizetype </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#size">size</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#swap">swap</a></b>(QCborArray &amp;<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#takeAt">takeAt</a></b>(qsizetype <i>i</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#takeFirst">takeFirst</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#takeLast">takeLast</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#toCborValue">toCborValue</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QJsonArray </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#toJsonArray">toJsonArray</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QVariantList </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#toVariantList">toVariantList</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-not-eq">operator!=</a></b>(const QCborArray &amp;<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-2b">operator+</a></b>(const QCborValue &amp;<i>v</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray &amp;</td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-2b-eq">operator+=</a></b>(const QCborValue &amp;<i>v</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-lt">operator&lt;</a></b>(const QCborArray &amp;<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray &amp;</td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-lt-lt">operator&lt;&lt;</a></b>(const QCborValue &amp;<i>v</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray &amp;</td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-eq">operator=</a></b>(const QCborArray &amp;<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-eq-eq">operator==</a></b>(const QCborArray &amp;<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const QCborValue </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-5b-5d">operator[]</a></b>(qsizetype <i>i</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborValueRef </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#operator-5b-5d-1">operator[]</a></b>(qsizetype <i>i</i>)</td></tr>
</table></div>
<a name="static-public-members"></a>
<h2 id="static-public-members">Static Public Members</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#fromJsonArray">fromJsonArray</a></b>(const QJsonArray &amp;<i>array</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#fromStringList">fromStringList</a></b>(const QStringList &amp;<i>list</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QCborArray </td><td class="memItemRight bottomAlign"><b><a href="qcborarray.html#fromVariantList">fromVariantList</a></b>(const QVariantList &amp;<i>list</i>)</td></tr>
</table></div>
<a name="details"></a>
<!-- $$$QCborArray-description -->
<div class="descr">
<h2 id="details">Detailed Description</h2>
<p>The <a href="qcborarray.html">QCborArray</a> class is used to hold an array of CBOR elements.</p>
<p>This class can be used to hold one sequential container in CBOR (an array). CBOR is the Concise Binary Object Representation, a very compact form of binary data encoding that is a superset of JSON. It was created by the IETF Constrained RESTful Environments (CoRE) WG, which has used it in many new RFCs. It is meant to be used alongside the <a href="https://tools.ietf.org/html/rfc7252">CoAP protocol</a>.</p>
<p><a href="qcborarray.html">QCborArray</a> is very similar to <a href="qvariant.html#QVariantList-typedef">QVariantList</a> and <a href="qjsonarray.html">QJsonArray</a> and its API is almost identical to those two classes. It can also be converted to and from those two, though there may be loss of information in some conversions.</p>
</div>
<p><b>See also </b><a href="qcborvalue.html">QCborValue</a>, <a href="qcbormap.html">QCborMap</a>, <a href="qjsonarray.html">QJsonArray</a>, <a href="qlist.html">QList</a>, and <a href="qvector.html">QVector</a>.</p>
<!-- @@@QCborArray -->
<div class="types">
<h2>Member Type Documentation</h2>
<!-- $$$const_iterator -->
<h3 class="fn" id="const_iterator-typedef"><a name="const_iterator-typedef"></a>typedef QCborArray::<span class="name">const_iterator</span></h3>
<p>A synonym to <a href="qcborarray-constiterator.html">QCborArray::ConstIterator</a>.</p>
<!-- @@@const_iterator -->
<!-- $$$const_pointer -->
<h3 class="fn" id="const_pointer-typedef"><a name="const_pointer-typedef"></a>typedef QCborArray::<span class="name">const_pointer</span></h3>
<p>A typedef to <code>const QCborValue *</code>, for compatibility with generic algorithms.</p>
<!-- @@@const_pointer -->
<!-- $$$const_reference -->
<h3 class="fn" id="const_reference-typedef"><a name="const_reference-typedef"></a>typedef QCborArray::<span class="name">const_reference</span></h3>
<p>A typedef to <code>const QCborValue &amp;</code>, for compatibility with generic algorithms.</p>
<!-- @@@const_reference -->
<!-- $$$difference_type -->
<h3 class="fn" id="difference_type-typedef"><a name="difference_type-typedef"></a>typedef QCborArray::<span class="name">difference_type</span></h3>
<p>A typedef to qsizetype.</p>
<!-- @@@difference_type -->
<!-- $$$iterator -->
<h3 class="fn" id="iterator-typedef"><a name="iterator-typedef"></a>typedef QCborArray::<span class="name">iterator</span></h3>
<p>A synonym to <a href="qcborarray-iterator.html">QCborArray::Iterator</a>.</p>
<!-- @@@iterator -->
<!-- $$$pointer -->
<h3 class="fn" id="pointer-typedef"><a name="pointer-typedef"></a>typedef QCborArray::<span class="name">pointer</span></h3>
<p>A typedef to <code>QCborValue *</code>, for compatibility with generic algorithms.</p>
<!-- @@@pointer -->
<!-- $$$reference -->
<h3 class="fn" id="reference-typedef"><a name="reference-typedef"></a>typedef QCborArray::<span class="name">reference</span></h3>
<p>A typedef to <code>QCborValue &amp;</code>, for compatibility with generic algorithms.</p>
<!-- @@@reference -->
<!-- $$$size_type -->
<h3 class="fn" id="size_type-typedef"><a name="size_type-typedef"></a>typedef QCborArray::<span class="name">size_type</span></h3>
<p>A typedef to qsizetype.</p>
<!-- @@@size_type -->
<!-- $$$value_type -->
<h3 class="fn" id="value_type-typedef"><a name="value_type-typedef"></a>typedef QCborArray::<span class="name">value_type</span></h3>
<p>The type of values that can be held in a <a href="qcborarray.html">QCborArray</a>: that is, <a href="qcborvalue.html">QCborValue</a>.</p>
<!-- @@@value_type -->
</div>
<div class="func">
<h2>Member Function Documentation</h2>
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="erase"><a name="erase"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">erase</span>(<span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> <i>it</i>)</h3><h3 class="fn fngroupitem" id="erase-1"><a name="erase-1"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">erase</span>(<span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> <i>it</i>)</h3></div>
<p>Removes the element pointed to by the array iterator <i>it</i> from this array, then returns an iterator to the next element (the one that took the same position in the array that <i>it</i> used to occupy).</p>
<p><b>See also </b><a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#takeAt">takeAt</a>(), <a href="qcborarray.html#takeFirst">takeFirst</a>(), and <a href="qcborarray.html#takeLast">takeLast</a>().</p>
<!-- @@@ -->
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="insert-2"><a name="insert-2"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">insert</span>(<span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> <i>before</i>, const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>)</h3><h3 class="fn fngroupitem" id="insert-3"><a name="insert-3"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">insert</span>(<span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> <i>before</i>, const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>)</h3></div>
<p>This is an overloaded function.</p>
<p>Inserts <i>value</i> into this array before element <i>before</i> and returns an array iterator pointing to the just-inserted element.</p>
<p><b>See also </b><a href="qcborarray.html#erase">erase</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@ -->
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="append"><a name="append"></a><span class="type">void</span> QCborArray::<span class="name">append</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>)</h3><h3 class="fn fngroupitem" id="append-1"><a name="append-1"></a><span class="type">void</span> QCborArray::<span class="name">append</span>(<span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;&amp;<i>value</i>)</h3></div>
<p>Appends <i>value</i> into the array after all other elements it may already contain.</p>
<p><b>See also </b><a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@ -->
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="prepend"><a name="prepend"></a><span class="type">void</span> QCborArray::<span class="name">prepend</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>)</h3><h3 class="fn fngroupitem" id="prepend-1"><a name="prepend-1"></a><span class="type">void</span> QCborArray::<span class="name">prepend</span>(<span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;&amp;<i>value</i>)</h3></div>
<p>Prepends <i>value</i> into the array before any other elements it may already contain.</p>
<p><b>See also </b><a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@ -->
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="extract-1"><a name="extract-1"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">extract</span>(<span class="type"><a href="qcborarray-iterator.html">QCborArray::Iterator</a></span> <i>it</i>)</h3><h3 class="fn fngroupitem" id="extract"><a name="extract"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">extract</span>(<span class="type"><a href="qcborarray-constiterator.html">QCborArray::ConstIterator</a></span> <i>it</i>)</h3></div>
<p>Extracts a value from the array at the position indicated by iterator <i>it</i> and returns the value so extracted.</p>
<p><b>See also </b><a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#erase">erase</a>(), <a href="qcborarray.html#takeAt">takeAt</a>(), and <a href="qcborarray.html#removeAt">removeAt</a>().</p>
<!-- @@@ -->
<!-- $$$ -->
<div class="fngroup">
<h3 class="fn fngroupitem" id="insert"><a name="insert"></a><span class="type">void</span> QCborArray::<span class="name">insert</span>(<span class="type">qsizetype</span> <i>i</i>, const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>)</h3><h3 class="fn fngroupitem" id="insert-1"><a name="insert-1"></a><span class="type">void</span> QCborArray::<span class="name">insert</span>(<span class="type">qsizetype</span> <i>i</i>, <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;&amp;<i>value</i>)</h3></div>
<p>Inserts <i>value</i> into the array at position <i>i</i> in this array. If <i>i</i> is -1, the entry is appended to the array. Pads the array with invalid entries if <i>i</i> is greater than the prior size of the array.</p>
<p><b>See also </b><a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#takeAt">takeAt</a>(), and <a href="qcborarray.html#extract">extract</a>().</p>
<!-- @@@ -->
<!-- $$$QCborArray[overload1]$$$QCborArray -->
<h3 class="fn" id="QCborArray"><a name="QCborArray"></a>QCborArray::<span class="name">QCborArray</span>()</h3>
<p>Constructs an empty <a href="qcborarray.html">QCborArray</a>.</p>
<!-- @@@QCborArray -->
<!-- $$$QCborArray$$$QCborArrayconstQCborArray& -->
<h3 class="fn" id="QCborArray-1"><a name="QCborArray-1"></a>QCborArray::<span class="name">QCborArray</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>)</h3>
<p>Copies the contents of <i>other</i> into this object.</p>
<!-- @@@QCborArray -->
<!-- $$$QCborArray$$$QCborArraystd::initializer_list<QCborValue> -->
<h3 class="fn" id="QCborArray-2"><a name="QCborArray-2"></a>QCborArray::<span class="name">QCborArray</span>(<span class="type">std::initializer_list</span>&lt;<span class="type"><a href="qcborvalue.html">QCborValue</a></span>&gt; <i>args</i>)</h3>
<p>Initializes this <a href="qcborarray.html">QCborArray</a> from the C++ brace-enclosed list found in <i>args</i>, as in the following example:</p>
<pre class="cpp">

  <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> a <span class="operator">=</span> { null<span class="operator">,</span> <span class="number">0</span><span class="operator">,</span> <span class="number">1</span><span class="operator">,</span> <span class="number">1.5</span><span class="operator">,</span> <span class="number">2</span><span class="operator">,</span> <span class="string">&quot;Hello&quot;</span><span class="operator">,</span> <span class="type"><a href="qbytearray.html">QByteArray</a></span>(<span class="string">&quot;World&quot;</span>) };

</pre>
<!-- @@@QCborArray -->
<!-- $$$~QCborArray[overload1]$$$~QCborArray -->
<h3 class="fn" id="dtor.QCborArray"><a name="dtor.QCborArray"></a>QCborArray::<span class="name">~QCborArray</span>()</h3>
<p>Destroys this <a href="qcborarray.html">QCborArray</a> and frees any associated resources.</p>
<!-- @@@~QCborArray -->
<!-- $$$at[overload1]$$$atqsizetype -->
<h3 class="fn" id="at"><a name="at"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">at</span>(<span class="type">qsizetype</span> <i>i</i>) const</h3>
<p>Returns the <a href="qcborvalue.html">QCborValue</a> element at position <i>i</i> in the array.</p>
<p>If the array is smaller than <i>i</i> elements, this function returns a <a href="qcborvalue.html">QCborValue</a> containing an undefined value. For that reason, it is not possible with this function to tell apart the situation where the array is not large enough from the case where the array starts with an undefined value.</p>
<p><b>See also </b><a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@at -->
<!-- $$$begin[overload1]$$$begin -->
<h3 class="fn" id="begin"><a name="begin"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">begin</span>()</h3>
<p>Returns an array iterator pointing to the first item in this array. If the array is empty, then this function returns the same as <a href="qcborarray.html#end">end</a>().</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#end">end</a>().</p>
<!-- @@@begin -->
<!-- $$$begin$$$begin -->
<h3 class="fn" id="begin-1"><a name="begin-1"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">begin</span>() const</h3>
<p>Returns an array iterator pointing to the first item in this array. If the array is empty, then this function returns the same as <a href="qcborarray.html#end">end</a>().</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@begin -->
<!-- $$$cbegin[overload1]$$$cbegin -->
<h3 class="fn" id="cbegin"><a name="cbegin"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">cbegin</span>() const</h3>
<p>Returns an array iterator pointing to the first item in this array. If the array is empty, then this function returns the same as <a href="qcborarray.html#end">end</a>().</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@cbegin -->
<!-- $$$cend[overload1]$$$cend -->
<h3 class="fn" id="cend"><a name="cend"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">cend</span>() const</h3>
<p>Returns an array iterator pointing to just after the last element in this array.</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@cend -->
<!-- $$$clear[overload1]$$$clear -->
<h3 class="fn" id="clear"><a name="clear"></a><span class="type">void</span> QCborArray::<span class="name">clear</span>()</h3>
<p>Empties this array.</p>
<p><b>See also </b><a href="qcborarray.html#isEmpty">isEmpty</a>().</p>
<!-- @@@clear -->
<!-- $$$compare[overload1]$$$compareconstQCborArray& -->
<h3 class="fn" id="compare"><a name="compare"></a><span class="type">int</span> QCborArray::<span class="name">compare</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>) const</h3>
<p>Compares this array and <i>other</i>, comparing each element in sequence, and returns an integer that indicates whether this array should be sorted before (if the result is negative) or after <i>other</i> (if the result is positive). If this function returns 0, the two arrays are equal and contain the same elements.</p>
<p>For more information on CBOR sorting order, see <a href="qcborvalue.html#compare">QCborValue::compare</a>().</p>
<p><b>See also </b><a href="qcborvalue.html#compare">QCborValue::compare</a>(), <a href="qcbormap.html#compare">QCborMap::compare</a>(), and <a href="qcborarray.html#operator-eq-eq">operator==</a>().</p>
<!-- @@@compare -->
<!-- $$$constBegin[overload1]$$$constBegin -->
<h3 class="fn" id="constBegin"><a name="constBegin"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">constBegin</span>() const</h3>
<p>Returns an array iterator pointing to the first item in this array. If the array is empty, then this function returns the same as <a href="qcborarray.html#end">end</a>().</p>
<p><b>See also </b><a href="qcborarray.html#begin">begin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@constBegin -->
<!-- $$$constEnd[overload1]$$$constEnd -->
<h3 class="fn" id="constEnd"><a name="constEnd"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">constEnd</span>() const</h3>
<p>Returns an array iterator pointing to just after the last element in this array.</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#end">end</a>().</p>
<!-- @@@constEnd -->
<!-- $$$contains[overload1]$$$containsconstQCborValue& -->
<h3 class="fn" id="contains"><a name="contains"></a><span class="type">bool</span> QCborArray::<span class="name">contains</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>value</i>) const</h3>
<p>Returns true if this array contains an element that is equal to <i>value</i>.</p>
<!-- @@@contains -->
<!-- $$$empty[overload1]$$$empty -->
<h3 class="fn" id="empty"><a name="empty"></a><span class="type">bool</span> QCborArray::<span class="name">empty</span>() const</h3>
<p>Synonym for <a href="qcborarray.html#isEmpty">isEmpty</a>(). This function is provided for compatibility with generic code that uses the Standard Library API.</p>
<p>Returns true if this array is empty (<a href="qcborarray.html#size">size</a>() == 0).</p>
<p><b>See also </b><a href="qcborarray.html#isEmpty">isEmpty</a>() and <a href="qcborarray.html#size">size</a>().</p>
<!-- @@@empty -->
<!-- $$$end[overload1]$$$end -->
<h3 class="fn" id="end"><a name="end"></a><span class="type"><a href="qcborarray.html#iterator-typedef">QCborArray::iterator</a></span> QCborArray::<span class="name">end</span>()</h3>
<p>Returns an array iterator pointing to just after the last element in this array.</p>
<p><b>See also </b><a href="qcborarray.html#begin">begin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@end -->
<!-- $$$end$$$end -->
<h3 class="fn" id="end-1"><a name="end-1"></a><span class="type"><a href="qcborarray.html#const_iterator-typedef">QCborArray::const_iterator</a></span> QCborArray::<span class="name">end</span>() const</h3>
<p>Returns an array iterator pointing to just after the last element in this array.</p>
<p><b>See also </b><a href="qcborarray.html#constBegin">constBegin</a>() and <a href="qcborarray.html#constEnd">constEnd</a>().</p>
<!-- @@@end -->
<!-- $$$first[overload1]$$$first -->
<h3 class="fn" id="first"><a name="first"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">first</span>() const</h3>
<p>Returns the first <a href="qcborvalue.html">QCborValue</a> of this array.</p>
<p>If the array is empty, this function returns a <a href="qcborvalue.html">QCborValue</a> containing an undefined value. For that reason, it is not possible with this function to tell apart the situation where the array is not large enough from the case where the array ends with an undefined value.</p>
<p><b>See also </b><a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@first -->
<!-- $$$first$$$first -->
<h3 class="fn" id="first-1"><a name="first-1"></a><span class="type">QCborValueRef</span> QCborArray::<span class="name">first</span>()</h3>
<p>Returns a reference to the first <a href="qcborvalue.html">QCborValue</a> of this array. The array must not be empty.</p>
<p><a href="qcborvalue.html#qcborvalueref">QCborValueRef</a> has the exact same API as <a href="qcborvalue.html">QCborValue</a>, with one important difference: if you assign new values to it, this map will be updated with that new value.</p>
<p><b>See also </b><a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@first -->
<!-- $$$fromJsonArray[overload1]$$$fromJsonArrayconstQJsonArray& -->
<h3 class="fn" id="fromJsonArray"><a name="fromJsonArray"></a><code>[static] </code><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> QCborArray::<span class="name">fromJsonArray</span>(const <span class="type"><a href="qjsonarray.html">QJsonArray</a></span> &amp;<i>array</i>)</h3>
<p>Converts all JSON items found in the <i>array</i> array to CBOR using QCborValue::fromJson(), and returns the CBOR array composed of those elements.</p>
<p>This conversion is lossless, as the CBOR type system is a superset of JSON's. Moreover, the array returned by this function can be converted back to the original <i>array</i> by using <a href="qcborarray.html#toJsonArray">toJsonArray</a>().</p>
<p><b>See also </b><a href="qcborarray.html#toJsonArray">toJsonArray</a>(), <a href="qcborarray.html#toVariantList">toVariantList</a>(), <a href="qcborvalue.html#fromJsonValue">QCborValue::fromJsonValue</a>(), and <a href="qcbormap.html#fromJsonObject">QCborMap::fromJsonObject</a>().</p>
<!-- @@@fromJsonArray -->
<!-- $$$fromStringList[overload1]$$$fromStringListconstQStringList& -->
<h3 class="fn" id="fromStringList"><a name="fromStringList"></a><code>[static] </code><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> QCborArray::<span class="name">fromStringList</span>(const <span class="type"><a href="qstringlist.html">QStringList</a></span> &amp;<i>list</i>)</h3>
<p>Returns a <a href="qcborarray.html">QCborArray</a> containing all the strings found in the <i>list</i> list.</p>
<p><b>See also </b><a href="qcborarray.html#fromVariantList">fromVariantList</a>() and <a href="qcborarray.html#fromJsonArray">fromJsonArray</a>().</p>
<!-- @@@fromStringList -->
<!-- $$$fromVariantList[overload1]$$$fromVariantListconstQVariantList& -->
<h3 class="fn" id="fromVariantList"><a name="fromVariantList"></a><code>[static] </code><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> QCborArray::<span class="name">fromVariantList</span>(const <span class="type"><a href="qvariant.html#QVariantList-typedef">QVariantList</a></span> &amp;<i>list</i>)</h3>
<p>Converts all the items in the <i>list</i> to CBOR using <a href="qcborvalue.html#fromVariant">QCborValue::fromVariant</a>() and returns the array composed of those elements.</p>
<p>Conversion from <a href="qvariant.html">QVariant</a> is not completely lossless. Please see the documentation in <a href="qcborvalue.html#fromVariant">QCborValue::fromVariant</a>() for more information.</p>
<p><b>See also </b><a href="qcborarray.html#toVariantList">toVariantList</a>(), <a href="qcborarray.html#fromStringList">fromStringList</a>(), <a href="qcborarray.html#fromJsonArray">fromJsonArray</a>(), and <a href="qcbormap.html#fromVariantMap">QCborMap::fromVariantMap</a>().</p>
<!-- @@@fromVariantList -->
<!-- $$$isEmpty[overload1]$$$isEmpty -->
<h3 class="fn" id="isEmpty"><a name="isEmpty"></a><span class="type">bool</span> QCborArray::<span class="name">isEmpty</span>() const</h3>
<p>Returns true if this <a href="qcborarray.html">QCborArray</a> is empty (that is if <a href="qcborarray.html#size">size</a>() is 0).</p>
<p><b>See also </b><a href="qcborarray.html#size">size</a>() and <a href="qcborarray.html#clear">clear</a>().</p>
<!-- @@@isEmpty -->
<!-- $$$last[overload1]$$$last -->
<h3 class="fn" id="last"><a name="last"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">last</span>() const</h3>
<p>Returns the last <a href="qcborvalue.html">QCborValue</a> of this array.</p>
<p>If the array is empty, this function returns a <a href="qcborvalue.html">QCborValue</a> containing an undefined value. For that reason, it is not possible with this function to tell apart the situation where the array is not large enough from the case where the array ends with an undefined value.</p>
<p><b>See also </b><a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@last -->
<!-- $$$last$$$last -->
<h3 class="fn" id="last-1"><a name="last-1"></a><span class="type">QCborValueRef</span> QCborArray::<span class="name">last</span>()</h3>
<p>Returns a reference to the last <a href="qcborvalue.html">QCborValue</a> of this array. The array must not be empty.</p>
<p><a href="qcborvalue.html#qcborvalueref">QCborValueRef</a> has the exact same API as <a href="qcborvalue.html">QCborValue</a>, with one important difference: if you assign new values to it, this map will be updated with that new value.</p>
<p><b>See also </b><a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@last -->
<!-- $$$pop_back[overload1]$$$pop_back -->
<h3 class="fn" id="pop_back"><a name="pop_back"></a><span class="type">void</span> QCborArray::<span class="name">pop_back</span>()</h3>
<p>Synonym for <a href="qcborarray.html#removeLast">removeLast</a>(). This function is provided for compatibility with generic code that uses the Standard Library API.</p>
<p>Removes the last element of this array. The array must not be empty before the removal</p>
<p><b>See also </b><a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#takeLast">takeLast</a>(), <a href="qcborarray.html#pop_front">pop_front</a>(), <a href="qcborarray.html#push_back">push_back</a>(), <a href="qcborarray.html#append">append</a>(), and <a href="qcborarray.html#insert">insert</a>().</p>
<!-- @@@pop_back -->
<!-- $$$pop_front[overload1]$$$pop_front -->
<h3 class="fn" id="pop_front"><a name="pop_front"></a><span class="type">void</span> QCborArray::<span class="name">pop_front</span>()</h3>
<p>Synonym for <a href="qcborarray.html#removeFirst">removeFirst</a>(). This function is provided for compatibility with generic code that uses the Standard Library API.</p>
<p>Removes the first element of this array. The array must not be empty before the removal</p>
<p><b>See also </b><a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#takeFirst">takeFirst</a>(), <a href="qcborarray.html#pop_back">pop_back</a>(), <a href="qcborarray.html#push_front">push_front</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#insert">insert</a>().</p>
<!-- @@@pop_front -->
<!-- $$$push_back[overload1]$$$push_backconstQCborValue& -->
<h3 class="fn" id="push_back"><a name="push_back"></a><span class="type">void</span> QCborArray::<span class="name">push_back</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>t</i>)</h3>
<p>Synonym for <a href="qcborarray.html#append">append</a>(). This function is provided for compatibility with generic code that uses the Standard Library API.</p>
<p>Appends the element <i>t</i> to this array.</p>
<p><b>See also </b><a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#push_front">push_front</a>(), <a href="qcborarray.html#pop_back">pop_back</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#insert">insert</a>().</p>
<!-- @@@push_back -->
<!-- $$$push_front[overload1]$$$push_frontconstQCborValue& -->
<h3 class="fn" id="push_front"><a name="push_front"></a><span class="type">void</span> QCborArray::<span class="name">push_front</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>t</i>)</h3>
<p>Synonym for <a href="qcborarray.html#prepend">prepend</a>(). This function is provided for compatibility with generic code that uses the Standard Library API.</p>
<p>Prepends the element <i>t</i> to this array.</p>
<p><b>See also </b><a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#push_back">push_back</a>(), <a href="qcborarray.html#pop_front">pop_front</a>(), <a href="qcborarray.html#append">append</a>(), and <a href="qcborarray.html#insert">insert</a>().</p>
<!-- @@@push_front -->
<!-- $$$removeAt[overload1]$$$removeAtqsizetype -->
<h3 class="fn" id="removeAt"><a name="removeAt"></a><span class="type">void</span> QCborArray::<span class="name">removeAt</span>(<span class="type">qsizetype</span> <i>i</i>)</h3>
<p>Removes the item at position <i>i</i> from the array. The array must have more than <i>i</i> elements before the removal.</p>
<p><b>See also </b><a href="qcborarray.html#takeAt">takeAt</a>(), <a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@removeAt -->
<!-- $$$removeFirst[overload1]$$$removeFirst -->
<h3 class="fn" id="removeFirst"><a name="removeFirst"></a><span class="type">void</span> QCborArray::<span class="name">removeFirst</span>()</h3>
<p>Removes the first item in the array, making the second element become the first. The array must not be empty before this call.</p>
<p><b>See also </b><a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#takeFirst">takeFirst</a>(), <a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@removeFirst -->
<!-- $$$removeLast[overload1]$$$removeLast -->
<h3 class="fn" id="removeLast"><a name="removeLast"></a><span class="type">void</span> QCborArray::<span class="name">removeLast</span>()</h3>
<p>Removes the last item in the array. The array must not be empty before this call.</p>
<p><b>See also </b><a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#takeLast">takeLast</a>(), <a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@removeLast -->
<!-- $$$size[overload1]$$$size -->
<h3 class="fn" id="size"><a name="size"></a><span class="type">qsizetype</span> QCborArray::<span class="name">size</span>() const</h3>
<p>Returns the size of this array.</p>
<p><b>See also </b><a href="qcborarray.html#isEmpty">isEmpty</a>().</p>
<!-- @@@size -->
<!-- $$$swap[overload1]$$$swapQCborArray& -->
<h3 class="fn" id="swap"><a name="swap"></a><span class="type">void</span> QCborArray::<span class="name">swap</span>(<span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>)</h3>
<p>Swaps the contents of this object and <i>other</i>.</p>
<!-- @@@swap -->
<!-- $$$takeAt[overload1]$$$takeAtqsizetype -->
<h3 class="fn" id="takeAt"><a name="takeAt"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">takeAt</span>(<span class="type">qsizetype</span> <i>i</i>)</h3>
<p>Removes the item at position <i>i</i> from the array and returns it. The array must have more than <i>i</i> elements before the removal.</p>
<p><b>See also </b><a href="qcborarray.html#removeAt">removeAt</a>(), <a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@takeAt -->
<!-- $$$takeFirst[overload1]$$$takeFirst -->
<h3 class="fn" id="takeFirst"><a name="takeFirst"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">takeFirst</span>()</h3>
<p>Removes the first item in the array and returns it, making the second element become the first. The array must not be empty before this call.</p>
<p><b>See also </b><a href="qcborarray.html#takeAt">takeAt</a>(), <a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@takeFirst -->
<!-- $$$takeLast[overload1]$$$takeLast -->
<h3 class="fn" id="takeLast"><a name="takeLast"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">takeLast</span>()</h3>
<p>Removes the last item in the array and returns it. The array must not be empty before this call.</p>
<p><b>See also </b><a href="qcborarray.html#takeAt">takeAt</a>(), <a href="qcborarray.html#removeLast">removeLast</a>(), <a href="qcborarray.html#removeFirst">removeFirst</a>(), <a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#operator-5b-5d">operator[]</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@takeLast -->
<!-- $$$toCborValue[overload1]$$$toCborValue -->
<h3 class="fn" id="toCborValue"><a name="toCborValue"></a><span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">toCborValue</span>() const</h3>
<p>Explicitly construcuts a <a href="qcborvalue.html">QCborValue</a> object that represents this array. This function is usually not necessary since <a href="qcborvalue.html">QCborValue</a> has a constructor for <a href="qcborarray.html">QCborArray</a>, so the conversion is implicit.</p>
<p>Converting <a href="qcborarray.html">QCborArray</a> to <a href="qcborvalue.html">QCborValue</a> allows it to be used in any context where QCborValues can be used, including as items in QCborArrays and as keys and mapped types in <a href="qcbormap.html">QCborMap</a>. Converting an array to <a href="qcborvalue.html">QCborValue</a> allows access to <a href="qcborvalue.html#toCbor">QCborValue::toCbor</a>().</p>
<p><b>See also </b><a href="qcborvalue.html#QCborValue-11">QCborValue::QCborValue</a>(const QCborArray &amp;).</p>
<!-- @@@toCborValue -->
<!-- $$$toJsonArray[overload1]$$$toJsonArray -->
<h3 class="fn" id="toJsonArray"><a name="toJsonArray"></a><span class="type"><a href="qjsonarray.html">QJsonArray</a></span> QCborArray::<span class="name">toJsonArray</span>() const</h3>
<p>Recursively converts every <a href="qcborvalue.html">QCborValue</a> element in this array to JSON using <a href="qcborvalue.html#toJsonValue">QCborValue::toJsonValue</a>() and returns the corresponding <a href="qjsonarray.html">QJsonArray</a> composed of those elements.</p>
<p>Please note that CBOR contains a richer and wider type set than JSON, so some information may be lost in this conversion. For more details on what conversions are applied, see <a href="qcborvalue.html#toJsonValue">QCborValue::toJsonValue</a>().</p>
<p><b>See also </b><a href="qcborarray.html#fromJsonArray">fromJsonArray</a>(), <a href="qcborvalue.html#toJsonValue">QCborValue::toJsonValue</a>(), <a href="qcbormap.html#toJsonObject">QCborMap::toJsonObject</a>(), and <a href="qcborarray.html#toVariantList">toVariantList</a>().</p>
<!-- @@@toJsonArray -->
<!-- $$$toVariantList[overload1]$$$toVariantList -->
<h3 class="fn" id="toVariantList"><a name="toVariantList"></a><span class="type"><a href="qvariant.html#QVariantList-typedef">QVariantList</a></span> QCborArray::<span class="name">toVariantList</span>() const</h3>
<p>Recursively converts each <a href="qcborvalue.html">QCborValue</a> in this array using <a href="qcborvalue.html#toVariant">QCborValue::toVariant</a>() and returns the <a href="qvariant.html#QVariantList-typedef">QVariantList</a> composed of the converted items.</p>
<p>Conversion to <a href="qvariant.html">QVariant</a> is not completely lossless. Please see the documentation in <a href="qcborvalue.html#toVariant">QCborValue::toVariant</a>() for more information.</p>
<p><b>See also </b><a href="qcborarray.html#fromVariantList">fromVariantList</a>(), <a href="qcborarray.html#fromStringList">fromStringList</a>(), <a href="qcborarray.html#toJsonArray">toJsonArray</a>(), <a href="qcborvalue.html#toVariant">QCborValue::toVariant</a>(), and <a href="qcbormap.html#toVariantMap">QCborMap::toVariantMap</a>().</p>
<!-- @@@toVariantList -->
<!-- $$$operator!=[overload1]$$$operator!=constQCborArray& -->
<h3 class="fn" id="operator-not-eq"><a name="operator-not-eq"></a><span class="type">bool</span> QCborArray::<span class="name">operator!=</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>) const</h3>
<p>Compares this array and <i>other</i>, comparing each element in sequence, and returns true if the two arrays' contents are different, false otherwise.</p>
<p>For more information on CBOR equality in Qt, see, <a href="qcborvalue.html#compare">QCborValue::compare</a>().</p>
<p><b>See also </b><a href="qcborarray.html#compare">compare</a>(), <a href="qcborvalue.html#operator-eq-eq">QCborValue::operator==</a>(), <a href="qcbormap.html#operator-eq-eq">QCborMap::operator==</a>(), <a href="qcborarray.html#operator-eq-eq">operator==</a>(), and <a href="qcborarray.html#operator-lt">operator&lt;</a>().</p>
<!-- @@@operator!= -->
<!-- $$$operator+[overload1]$$$operator+constQCborValue& -->
<h3 class="fn" id="operator-2b"><a name="operator-2b"></a><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> QCborArray::<span class="name">operator+</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>v</i>) const</h3>
<p>Returns a new <a href="qcborarray.html">QCborArray</a> containing the same elements as this array, plus <i>v</i> appended as the last element.</p>
<p><b>See also </b><a href="qcborarray.html#operator-2b-eq">operator+=</a>(), <a href="qcborarray.html#operator-lt-lt">operator&lt;&lt;</a>(), and <a href="qcborarray.html#append">append</a>().</p>
<!-- @@@operator+ -->
<!-- $$$operator+=[overload1]$$$operator+=constQCborValue& -->
<h3 class="fn" id="operator-2b-eq"><a name="operator-2b-eq"></a><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;QCborArray::<span class="name">operator+=</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>v</i>)</h3>
<p>Appends <i>v</i> to this array and returns a reference to this array.</p>
<p><b>See also </b><a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#operator-2b">operator+</a>(), and <a href="qcborarray.html#operator-lt-lt">operator&lt;&lt;</a>().</p>
<!-- @@@operator+= -->
<!-- $$$operator<[overload1]$$$operator<constQCborArray& -->
<h3 class="fn" id="operator-lt"><a name="operator-lt"></a><span class="type">bool</span> QCborArray::<span class="name">operator&lt;</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>) const</h3>
<p>Compares this array and <i>other</i>, comparing each element in sequence, and returns true if this array should be sorted before <i>other</i>, false otherwise.</p>
<p>For more information on CBOR sorting order, see <a href="qcborvalue.html#compare">QCborValue::compare</a>().</p>
<p><b>See also </b><a href="qcborarray.html#compare">compare</a>(), <a href="qcborvalue.html#operator-eq-eq">QCborValue::operator==</a>(), <a href="qcbormap.html#operator-eq-eq">QCborMap::operator==</a>(), <a href="qcborarray.html#operator-eq-eq">operator==</a>(), and <a href="qcborarray.html#operator-not-eq">operator!=</a>().</p>
<!-- @@@operator< -->
<!-- $$$operator<<[overload1]$$$operator<<constQCborValue& -->
<h3 class="fn" id="operator-lt-lt"><a name="operator-lt-lt"></a><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;QCborArray::<span class="name">operator&lt;&lt;</span>(const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> &amp;<i>v</i>)</h3>
<p>Appends <i>v</i> to this array and returns a reference to this array.</p>
<p><b>See also </b><a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#operator-2b">operator+</a>(), and <a href="qcborarray.html#operator-2b-eq">operator+=</a>().</p>
<!-- @@@operator<< -->
<!-- $$$operator=[overload1]$$$operator=constQCborArray& -->
<h3 class="fn" id="operator-eq"><a name="operator-eq"></a><span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;QCborArray::<span class="name">operator=</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>)</h3>
<p>Replaces the contents of this array with that found in <i>other</i>, then returns a reference to this object.</p>
<!-- @@@operator= -->
<!-- $$$operator==[overload1]$$$operator==constQCborArray& -->
<h3 class="fn" id="operator-eq-eq"><a name="operator-eq-eq"></a><span class="type">bool</span> QCborArray::<span class="name">operator==</span>(const <span class="type"><a href="qcborarray.html#QCborArray">QCborArray</a></span> &amp;<i>other</i>) const</h3>
<p>Compares this array and <i>other</i>, comparing each element in sequence, and returns true if both arrays contains the same elements, false otherwise.</p>
<p>For more information on CBOR equality in Qt, see, <a href="qcborvalue.html#compare">QCborValue::compare</a>().</p>
<p><b>See also </b><a href="qcborarray.html#compare">compare</a>(), <a href="qcborvalue.html#operator-eq-eq">QCborValue::operator==</a>(), <a href="qcbormap.html#operator-eq-eq">QCborMap::operator==</a>(), <a href="qcborarray.html#operator-not-eq">operator!=</a>(), and <a href="qcborarray.html#operator-lt">operator&lt;</a>().</p>
<!-- @@@operator== -->
<!-- $$$operator[][overload1]$$$operator[]qsizetype -->
<h3 class="fn" id="operator-5b-5d"><a name="operator-5b-5d"></a>const <span class="type"><a href="qcborvalue.html">QCborValue</a></span> QCborArray::<span class="name">operator[]</span>(<span class="type">qsizetype</span> <i>i</i>) const</h3>
<p>Returns the <a href="qcborvalue.html">QCborValue</a> element at position <i>i</i> in the array.</p>
<p>If the array is smaller than <i>i</i> elements, this function returns a <a href="qcborvalue.html">QCborValue</a> containing an undefined value. For that reason, it is not possible with this function to tell apart the situation where the array is not large enough from the case where the array contains an undefined value at position <i>i</i>.</p>
<p><b>See also </b><a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@operator[] -->
<!-- $$$operator[]$$$operator[]qsizetype -->
<h3 class="fn" id="operator-5b-5d-1"><a name="operator-5b-5d-1"></a><span class="type">QCborValueRef</span> QCborArray::<span class="name">operator[]</span>(<span class="type">qsizetype</span> <i>i</i>)</h3>
<p>Returns a reference to the <a href="qcborvalue.html">QCborValue</a> element at position <i>i</i> in the array. Indices beyond the end of the array will grow the array, filling with undefined entries, until it has an entry at the specified index.</p>
<p><a href="qcborvalue.html#qcborvalueref">QCborValueRef</a> has the exact same API as <a href="qcborvalue.html">QCborValue</a>, with one important difference: if you assign new values to it, this map will be updated with that new value.</p>
<p><b>See also </b><a href="qcborarray.html#at">at</a>(), <a href="qcborarray.html#first">first</a>(), <a href="qcborarray.html#last">last</a>(), <a href="qcborarray.html#insert">insert</a>(), <a href="qcborarray.html#prepend">prepend</a>(), <a href="qcborarray.html#append">append</a>(), <a href="qcborarray.html#removeAt">removeAt</a>(), and <a href="qcborarray.html#takeAt">takeAt</a>().</p>
<!-- @@@operator[] -->
</div>
        </div>
       </div>
   </div>
   </div>
</div>
<div class="footer">
   <p>
   <acronym title="Copyright">&copy;</acronym> 2019 The Qt Company Ltd.
   Documentation contributions included herein are the copyrights of
   their respective owners.<br/>    The documentation provided herein is licensed under the terms of the    <a href="http://www.gnu.org/licenses/fdl.html">GNU Free Documentation    License version 1.3</a> as published by the Free Software Foundation.<br/>    Qt and respective logos are trademarks of The Qt Company Ltd.     in Finland and/or other countries worldwide. All other trademarks are property
   of their respective owners. </p>
</div>
</body>
</html>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional