backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
d5/dab/structdata__structures_1_1list__array_1_1list.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::list_array::list&lt; N &gt; Struct Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -115,36 +115,35 @@ Collaboration diagram for data_structures::list_array::list&lt; N &gt;:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
<tr class="memitem:a412bdb3910181f3c384d86aee7e217cf" id="r_a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
<tr class="memdesc:a412bdb3910181f3c384d86aee7e217cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element in the list using binarySearch. <br /></td></tr>
<tr class="separator:a412bdb3910181f3c384d86aee7e217cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9" id="r_ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
<tr class="memdesc:ad202ae68fe8d98082afa9dafea9e22b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element using linear search. <br /></td></tr>
<tr class="separator:ad202ae68fe8d98082afa9dafea9e22b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b5d794b245ba8e126220171cc8ef7fb"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b5d794b245ba8e126220171cc8ef7fb">search</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:a0b5d794b245ba8e126220171cc8ef7fb" id="r_a0b5d794b245ba8e126220171cc8ef7fb"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b5d794b245ba8e126220171cc8ef7fb">search</a> (const uint64_t &amp;val)</td></tr>
<tr class="separator:a0b5d794b245ba8e126220171cc8ef7fb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a133635ad53bd89e3947ca02448819180"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">sort</a> ()</td></tr>
<tr class="memitem:a133635ad53bd89e3947ca02448819180" id="r_a133635ad53bd89e3947ca02448819180"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">sort</a> ()</td></tr>
<tr class="memdesc:a133635ad53bd89e3947ca02448819180"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sort the list. <br /></td></tr>
<tr class="separator:a133635ad53bd89e3947ca02448819180"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa960d714d449612f25256850d72325f1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:aa960d714d449612f25256850d72325f1" id="r_aa960d714d449612f25256850d72325f1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a> (const uint64_t &amp;val)</td></tr>
<tr class="memdesc:aa960d714d449612f25256850d72325f1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert the new element in the list. <br /></td></tr>
<tr class="separator:aa960d714d449612f25256850d72325f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:a98f7d9079c0868e0f4e67d5c52174fb6" id="r_a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a> (const uint64_t &amp;val)</td></tr>
<tr class="memdesc:a98f7d9079c0868e0f4e67d5c52174fb6"><td class="mdescLeft">&#160;</td><td class="mdescRight">To remove the element from the list. <br /></td></tr>
<tr class="separator:a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b7acf65026df1e9dd13eebf309dda5e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a> ()</td></tr>
<tr class="memitem:a0b7acf65026df1e9dd13eebf309dda5e" id="r_a0b7acf65026df1e9dd13eebf309dda5e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a> ()</td></tr>
<tr class="memdesc:a0b7acf65026df1e9dd13eebf309dda5e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print array. <br /></td></tr>
<tr class="separator:a0b7acf65026df1e9dd13eebf309dda5e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top"><a id="a0c9737eb5b4938531d3633b4915e9e00" name="a0c9737eb5b4938531d3633b4915e9e00"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> {}</td></tr>
<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00" id="r_a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0c9737eb5b4938531d3633b4915e9e00">data</a> {}</td></tr>
<tr class="separator:a0c9737eb5b4938531d3633b4915e9e00"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memItemLeft" align="right" valign="top"><a id="ad6835623d5397d0c22e68bf0cdd7c3dc" name="ad6835623d5397d0c22e68bf0cdd7c3dc"></a>
<tr class="memitem:ad6835623d5397d0c22e68bf0cdd7c3dc" id="r_ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memItemLeft" align="right" valign="top"><a id="ad6835623d5397d0c22e68bf0cdd7c3dc" name="ad6835623d5397d0c22e68bf0cdd7c3dc"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
<tr class="separator:ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a02fb664c4f6f50459e103a1433f8a3d1"><td class="memItemLeft" align="right" valign="top"><a id="a02fb664c4f6f50459e103a1433f8a3d1" name="a02fb664c4f6f50459e103a1433f8a3d1"></a>
<tr class="memitem:a02fb664c4f6f50459e103a1433f8a3d1" id="r_a02fb664c4f6f50459e103a1433f8a3d1"><td class="memItemLeft" align="right" valign="top"><a id="a02fb664c4f6f50459e103a1433f8a3d1" name="a02fb664c4f6f50459e103a1433f8a3d1"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false</td></tr>
<tr class="separator:a02fb664c4f6f50459e103a1433f8a3d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -555,6 +554,24 @@ Here is the call graph for this function:</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg" width="274" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a0c9737eb5b4938531d3633b4915e9e00" name="a0c9737eb5b4938531d3633b4915e9e00"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0c9737eb5b4938531d3633b4915e9e00">&#9670;&#160;</a></span>data</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;uint64_t N&gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;uint64_t, N&gt; <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::data {}</td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 34</span>{}; <span class="comment">// Array that implement list</span></div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this struct was generated from the following file:<ul>
@@ -566,7 +583,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>list_array</b></li><li class="navelem"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>

2
d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="data_structures::list_array::list::sort" name="data_structures::list_array::list::sort">
<area shape="rect" id="Node000001" title="Sort the list." alt="" coords="5,5,142,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="190,13,268,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,23,175,23,175,28,142,28"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,23,174,23,174,28,142,28"/>
</map>

6
d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
<svg width="205pt" height="39pt"
@@ -41,8 +41,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.9,-15.25 119.32,-15.25 127.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.99,-18.75 136.99,-15.25 126.99,-11.75 126.99,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.72,-15.25 118.93,-15.25 126.68,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-18.75 136.48,-15.25 126.48,-11.75 126.48,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

6
d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
<svg width="205pt" height="39pt"
@@ -31,8 +31,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.9,-15.25 119.32,-15.25 127.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.99,-18.75 136.99,-15.25 126.99,-11.75 126.99,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.72,-15.25 118.93,-15.25 126.68,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-18.75 136.48,-15.25 126.48,-11.75 126.48,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.map
View File

@@ -1,4 +1,4 @@
<map id="data_structures::list_array::list::BinarySearch" name="data_structures::list_array::list::BinarySearch">
<area shape="rect" id="Node000001" title="Search an element in the list using binarySearch." alt="" coords="5,29,174,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,109,5,119,12,117,16,107,10,89,8,74,10,64,14,61,20,62,28"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,108,5,119,11,116,16,106,10,89,8,74,10,64,14,61,20,62,28"/>
</map>

6
d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
<svg width="134pt" height="57pt"
@@ -32,8 +32,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 74.08,-48.5 81.24,-45.83 84.59,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.15,-42.24 85.5,-31.99 81.17,-41.66 88.15,-42.24"/>
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

6
d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
<svg width="134pt" height="57pt"
@@ -22,8 +22,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 74.08,-48.5 81.24,-45.83 84.59,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.15,-42.24 85.5,-31.99 81.17,-41.66 88.15,-42.24"/>
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB