ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-27 22:45:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy: 9d89d4c188

Browse Source
This commit is contained in:
manojsdoshi
2021-03-12 22:34:28 +00:00
parent 1664f589f1
commit dffdcfc0e7
4802 changed files with 108249 additions and 108053 deletions
Download Patch File Download Diff File Expand all files Collapse all files

267
SHAMapDelta_8cpp_source.html
View File

@@ -149,7 +149,7 @@ $(function() {
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; }</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (item-&gt;peekData() != otherMapItem-&gt;peekData())</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (item-&gt;slice() != otherMapItem-&gt;slice())</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; {</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="comment">// non-matching items with same tag</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">if</span> (isFirstMap)</div>
@@ -227,138 +227,137 @@ $(function() {
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;key() == other-&gt;peekItem()-&gt;key())</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;peekData() !=</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; other-&gt;peekItem()-&gt;peekData())</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; {</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(ours-&gt;peekItem(), other-&gt;peekItem())));</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; }</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; {</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; ours-&gt;peekItem(),</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>())));</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; </div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; other-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; other-&gt;peekItem())));</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; }</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; }</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; {</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; ours, other-&gt;peekItem(), <span class="keyword">true</span>, differences, maxCount))</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; }</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; {</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; other, ours-&gt;peekItem(), <span class="keyword">false</span>, differences, maxCount))</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; {</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; <span class="keywordflow">if</span> (ours-&gt;getChildHash(i) != other-&gt;getChildHash(i))</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="keywordflow">if</span> (other-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <span class="comment">// We have a branch, the other tree does not</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = descendThrow(ours, i);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; iNode,</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keyword">true</span>,</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; differences,</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; maxCount))</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; }</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ours-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; {</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="comment">// The other tree has a branch, we do not</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i);</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; iNode,</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; differences,</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; maxCount))</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; }</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; {descendThrow(ours, i),</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i)});</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; }</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; }</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; assert(<span class="keyword">false</span>);</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; }</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; </div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;}</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; </div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00249"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 249</a></span>&#160;SHAMap::walkMap(<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapMissingNode&gt;</a>&amp; missingNodes, <span class="keywordtype">int</span> maxMissing)<span class="keyword"></span></div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160;<span class="keyword"> const</span></div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordflow">if</span> (!root_-&gt;isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; </div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt; nodeStack;</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; </div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(std::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_));</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keywordflow">while</span> (!nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; {</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a> node = std::move(nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>());</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; {</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; {</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> nextNode =</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; descendNoStore(node, i);</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; </div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <span class="keywordflow">if</span> (nextNode)</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; {</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="keywordflow">if</span> (nextNode-&gt;isInner())</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; std::static_pointer_cast&lt;SHAMapInnerNode&gt;(</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; nextNode));</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; }</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; {</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; missingNodes.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(type_, node-&gt;getChildHash(i));</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; <span class="keywordflow">if</span> (--maxMissing &lt;= 0)</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; }</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; }</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; }</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160;}</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; </div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;} <span class="comment">// namespace ripple</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;slice() != other-&gt;peekItem()-&gt;slice())</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; {</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(ours-&gt;peekItem(), other-&gt;peekItem())));</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; }</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; {</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; ours-&gt;peekItem(),</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>())));</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; </div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; other-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; other-&gt;peekItem())));</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; }</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; }</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; {</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; ours, other-&gt;peekItem(), <span class="keyword">true</span>, differences, maxCount))</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; }</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; other, ours-&gt;peekItem(), <span class="keyword">false</span>, differences, maxCount))</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; }</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; {</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <span class="keywordflow">if</span> (ours-&gt;getChildHash(i) != other-&gt;getChildHash(i))</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; {</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <span class="keywordflow">if</span> (other-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; {</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="comment">// We have a branch, the other tree does not</span></div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = descendThrow(ours, i);</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; iNode,</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <span class="keyword">true</span>,</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; differences,</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; maxCount))</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; }</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ours-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; {</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <span class="comment">// The other tree has a branch, we do not</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; iNode,</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; differences,</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; maxCount))</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; }</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; {descendThrow(ours, i),</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i)});</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; }</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; assert(<span class="keyword">false</span>);</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; }</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; </div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;}</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 248</a></span>&#160;SHAMap::walkMap(<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapMissingNode&gt;</a>&amp; missingNodes, <span class="keywordtype">int</span> maxMissing)<span class="keyword"></span></div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160;<span class="keyword"> const</span></div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <span class="keywordflow">if</span> (!root_-&gt;isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; </div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt; nodeStack;</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; </div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(std::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_));</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; </div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; <span class="keywordflow">while</span> (!nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; {</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a> node = std::move(nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>());</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; </div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; {</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; {</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> nextNode =</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; descendNoStore(node, i);</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; </div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <span class="keywordflow">if</span> (nextNode)</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; {</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keywordflow">if</span> (nextNode-&gt;isInner())</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; std::static_pointer_cast&lt;SHAMapInnerNode&gt;(</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; nextNode));</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; }</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; {</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; missingNodes.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(type_, node-&gt;getChildHash(i));</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; <span class="keywordflow">if</span> (--maxMissing &lt;= 0)</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; }</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; }</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; }</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; }</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160;}</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; </div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160;} <span class="comment">// namespace ripple</span></div>
</div><!-- fragment --></div><!-- contents -->
<div class="ttc" id="aclassripple_1_1SHAMap_html_aa36f13285448ce66cdc04a0b7f4d8af7"><div class="ttname"><a href="classripple_1_1SHAMap.html#aa36f13285448ce66cdc04a0b7f4d8af7">ripple::SHAMap::isValid</a></div><div class="ttdeci">bool isValid() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00580">SHAMap.h:580</a></div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
@@ -375,7 +374,7 @@ $(function() {
<div class="ttc" id="aclassripple_1_1SHAMap_html"><div class="ttname"><a href="classripple_1_1SHAMap.html">ripple::SHAMap</a></div><div class="ttdoc">A SHAMap is both a radix tree with a fan-out of 16 and a Merkle tree.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00095">SHAMap.h:95</a></div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html">ripple::SHAMapTreeNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00133">SHAMapTreeNode.h:133</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html">ripple::SHAMapTreeNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00134">SHAMapTreeNode.h:134</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a26f587d4b772fd02113deb67ff052e20"><div class="ttname"><a href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">ripple::SHAMap::descendThrow</a></div><div class="ttdeci">SHAMapTreeNode * descendThrow(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00283">SHAMap.cpp:283</a></div></div>
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>