svf-tools 1.0.613 → 1.0.615

package/SVF-doxygen/html/html/classSVF_1_1VersionedFlowSensitive_1_1SCC.html

@@ -270,7 +270,7 @@ Static Private Member Functions</h2></td></tr>
 <p class="definition">Definition at line <a class="el" href="VersionedFlowSensitive_8cpp_source.html#l00984">984</a> of file <a class="el" href="VersionedFlowSensitive_8cpp_source.html">VersionedFlowSensitive.cpp</a>.</p>
 <div class="fragment"><div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;{</div><div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;    <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> vId = v-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>();</div><div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;</div><div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;    nodeData[vId].index = <a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;    nodeData[vId].lowlink = <a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;    ++<a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;    stack.push(v);</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;    nodeData[vId].onStack = <span class="keyword">true</span>;</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGEdge.html">SVFGEdge</a> *e : v-&gt;<a class="code" href="classSVF_1_1GenericNode.html#a2d9cd758d6f8c5189d9b90b74f43e009">getOutEdges</a>())</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;    {</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;        <span class="keyword">const</span> <a class="code" href="classSVF_1_1IndirectSVFGEdge.html">IndirectSVFGEdge</a> *ie = <a class="code" href="namespaceSVF_1_1SVFUtil.html#af6e96694d983643a66c238cce01bff0e">SVFUtil::dyn_cast</a>&lt;<a class="code" href="classSVF_1_1IndirectSVFGEdge.html">IndirectSVFGEdge</a>&gt;(e);</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;        <span class="keywordflow">if</span> (!ie) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;        <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a> *w = ie-&gt;<a class="code" href="classSVF_1_1GenericEdge.html#aeaa31a2c8479e831b36ce2e2582ceb86">getDstNode</a>();</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;        <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> wId = w-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>();</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;        <span class="comment">// If object is not part of the edge, there is no edge from v to w.</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;        <span class="keywordflow">if</span> (!ie-&gt;<a class="code" href="classSVF_1_1IndirectSVFGEdge.html#a30aca718d25924f1babdf348bb0ace71">getPointsTo</a>().<a class="code" href="classSVF_1_1SparseBitVector.html#a112f2ede1240c95f9fe810f2882fab80">test</a>(<span class="keywordtype">object</span>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;        <span class="comment">// Even if we don&#39;t count edges to stores and deltas for SCCs&#39; sake, they</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;        <span class="comment">// are relevant to the footprint as a propagation still occurs over such edges.</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;        footprint.push_back(ie);</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;        <span class="comment">// Ignore edges to delta nodes because they are prelabeled so cannot</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;        <span class="comment">// be part of the SCC v is in (already in nodesTodo from the prelabeled set).</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;        <span class="comment">// Similarly, store nodes.</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;        <span class="keywordflow">if</span> (vfs-&gt;<a class="code" href="classSVF_1_1VersionedFlowSensitive.html#a9f9b00551c157f42d1d995e8c4efb54b">delta</a>(wId) || vfs-&gt;<a class="code" href="classSVF_1_1VersionedFlowSensitive.html#aac920c9a5f13dd147e3c130425e005eb">isStore</a>(wId)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;        <span class="keywordflow">if</span> (nodeData[wId].<a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1)</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;        {</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;            <a class="code" href="classSVF_1_1VersionedFlowSensitive_1_1SCC.html#af7ba77d72962b930a8107752e259008b">visit</a>(vfs, <span class="keywordtype">object</span>, partOf, footprint, nodeData, stack, <a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, currentSCC, w);</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;            nodeData[vId].lowlink = std::min(nodeData[vId].lowlink, nodeData[wId].lowlink);</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;        }</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nodeData[wId].onStack)</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;        {</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;            nodeData[vId].lowlink = std::min(nodeData[vId].lowlink, nodeData[wId].<a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;        }</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;    }</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;    <span class="keywordflow">if</span> (nodeData[vId].lowlink == nodeData[vId].<a class="code" href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;    {</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;        <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a> *w = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;        {</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;            w = stack.top();</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;            stack.pop();</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;            <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> wId = w-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>();</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;            nodeData[wId].onStack = <span class="keyword">false</span>;</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;            partOf[wId] = currentSCC;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;        }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;        <span class="keywordflow">while</span> (w != v);</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;        <span class="comment">// For the next SCC.</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;        ++currentSCC;</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;    }</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;}</div><div class="ttc" id="cJSON_8h_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="cJSON_8h.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="cJSON_8h_source.html#l00170">cJSON.h:170</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a350ae9bf8606bdfe23c8679681b969dc"><div class="ttname"><a href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">SVF::NodeID</a></div><div class="ttdeci">unsigned NodeID</div><div class="ttdef"><b>Definition:</b> <a href="include_2MTA_2MTAResultValidator_8h_source.html#l00020">MTAResultValidator.h:20</a></div></div>
-<div class="ttc" id="classSVF_1_1SparseBitVector_html_a112f2ede1240c95f9fe810f2882fab80"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a112f2ede1240c95f9fe810f2882fab80">SVF::SparseBitVector::test</a></div><div class="ttdeci">bool test(unsigned Idx) const</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00708">SparseBitVector.h:708</a></div></div>
+<div class="ttc" id="classSVF_1_1SparseBitVector_html_a112f2ede1240c95f9fe810f2882fab80"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a112f2ede1240c95f9fe810f2882fab80">SVF::SparseBitVector::test</a></div><div class="ttdeci">bool test(unsigned Idx) const</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00700">SparseBitVector.h:700</a></div></div>
 <div class="ttc" id="classSVF_1_1VersionedFlowSensitive_html_aac920c9a5f13dd147e3c130425e005eb"><div class="ttname"><a href="classSVF_1_1VersionedFlowSensitive.html#aac920c9a5f13dd147e3c130425e005eb">SVF::VersionedFlowSensitive::isStore</a></div><div class="ttdeci">virtual bool isStore(const NodeID l) const</div><div class="ttdoc">Returns true if l is a store node. </div><div class="ttdef"><b>Definition:</b> <a href="VersionedFlowSensitive_8cpp_source.html#l00455">VersionedFlowSensitive.cpp:455</a></div></div>
 <div class="ttc" id="classSVF_1_1VersionedFlowSensitive_html_a9f9b00551c157f42d1d995e8c4efb54b"><div class="ttname"><a href="classSVF_1_1VersionedFlowSensitive.html#a9f9b00551c157f42d1d995e8c4efb54b">SVF::VersionedFlowSensitive::delta</a></div><div class="ttdeci">virtual bool delta(const NodeID l) const</div><div class="ttdef"><b>Definition:</b> <a href="VersionedFlowSensitive_8cpp_source.html#l00432">VersionedFlowSensitive.cpp:432</a></div></div>
 <div class="ttc" id="namespaceSVF_1_1SVFUtil_html_af6e96694d983643a66c238cce01bff0e"><div class="ttname"><a href="namespaceSVF_1_1SVFUtil.html#af6e96694d983643a66c238cce01bff0e">SVF::SVFUtil::dyn_cast</a></div><div class="ttdeci">LLVM_NODISCARD std::enable_if_t&lt;!is_simple_type&lt; Y &gt;::value, typename cast_retty&lt; X, const Y &gt;::ret_type &gt; dyn_cast(const Y &amp;Val)</div><div class="ttdef"><b>Definition:</b> <a href="Casting_8h_source.html#l00405">Casting.h:405</a></div></div>

package/SVF-doxygen/html/html/classSVF_1_1VersionedPTData.html

@@ -348,7 +348,7 @@ template<typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#af39232f64ff0ede20161c7f265da6cf5">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ae4877cf4db5b1da5e7d05fe65ae8ed32">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#af39232f64ff0ede20161c7f265da6cf5">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a3ca0f6fcfdf2f8c471ea47501bec08fe">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -439,7 +439,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#aaf3df7501f84233f6a687ef9f2f0ae90">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a78f2b0ee440ed5b358928ee775e95564">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#aaf3df7501f84233f6a687ef9f2f0ae90">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a7560a47f1e8894b9025b779c4794138c">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -479,7 +479,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a21e823484199946541b8b79d736b2601">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#afe724603022a8fed7469f9ecd633febc">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a21e823484199946541b8b79d736b2601">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a64e3dbd840184eb8e829c4d003b5b4cf">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -509,7 +509,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#afcc34f6cedca6a8f151b1a7251832818">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a9b81d20e54d08e36edbff43549b1e820">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#afcc34f6cedca6a8f151b1a7251832818">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ae705d46ac78d39f0779c0bf05e39f8b3">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -539,7 +539,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#afaef5c61bee74cbd649c787cfdef2a03">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a2adcebb6cf561eb00e3e05d486c86a9c">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#afaef5c61bee74cbd649c787cfdef2a03">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#acabb81409a3767f31227f46e106cb2d0">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -579,7 +579,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a56e752a83620f482a4b1e2f8d395dd75">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ab0299bcfee10af8b6ea59444c4d0299d">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a56e752a83620f482a4b1e2f8d395dd75">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ae0eafb4667af1ba821247f9f4199d52f">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -619,7 +619,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a5647b7fad5c14f7ec57d3de3480758eb">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a8ba8e547bf572cd7403cb4fe52c19908">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a5647b7fad5c14f7ec57d3de3480758eb">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a5e6ab689e9a9eefdd5f6bf04ab279940">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -659,7 +659,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a9967c530d3955a0a726b7a00653ef0ba">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a83b7e86c11b03889d70b4dff46138987">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#a9967c530d3955a0a726b7a00653ef0ba">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#adb56e144709cab8efe057c3215e30b9b">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>
@@ -699,7 +699,7 @@ template&lt;typename Key , typename KeySet , typename Data , typename DataSet ,
 </table>
 </div><div class="memdoc">
 
-<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#aa9d24a4defb025c075e4ec5bc7f3b618">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ac4b8dc40514b50a77565a385b9a13ca5">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
+<p>Implemented in <a class="el" href="classSVF_1_1MutableVersionedPTData.html#aa9d24a4defb025c075e4ec5bc7f3b618">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>, and <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ab4828e2b42d646463bfd23c2154c3b8f">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>.</p>
 
 </div>
 </div>

package/SVF-doxygen/html/html/classSVF_1_1WPAFSSolver-members.html

@@ -92,7 +92,7 @@ $(function() {
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">pushIntoWorklist</a>(NodeID id)</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#ac460772d9236a2fefe17b2557023b883">reanalyze</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> typedef</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">scc</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
+  <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">scc</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#a2d4cfae34bd4a55f1fe03881c87f8708">SCCDetect</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a16d371c8f6a9bdb1ca984bcb287d6c5a">SVF::WPASolver::SCCDetect</a>(NodeSet &amp;candidates)</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#a0bbaffd1673cc3850217afad0ca56e42">sccRepNode</a>(NodeID id) const</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
@@ -103,7 +103,7 @@ $(function() {
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#a3bab50f0e94f516204d6622420de7db7">WPAFSSolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a0c5616b0e340955dafc2ab2f21740abd">WPASolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#ab3c7f670b0f0e055d5398e69b61194f8">~WPAFSSolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">~WPASolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">~WPASolver</a>()=default</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
 </table></div><!-- contents -->
 <!-- start footer part -->
 <hr class="footer"/><address class="footer"><small>

package/SVF-doxygen/html/html/classSVF_1_1WPAFSSolver.html

@@ -109,9 +109,9 @@ Protected Member Functions</h2></td></tr>
 <tr class="memitem:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a0c5616b0e340955dafc2ab2f21740abd">WPASolver</a> ()</td></tr>
 <tr class="memdesc:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor.  <a href="classSVF_1_1WPASolver.html#a0c5616b0e340955dafc2ab2f21740abd">More...</a><br /></td></tr>
 <tr class="separator:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">~WPASolver</a> ()</td></tr>
-<tr class="memdesc:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor.  <a href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">More...</a><br /></td></tr>
-<tr class="separator:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">~WPASolver</a> ()=default</td></tr>
+<tr class="memdesc:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor.  <a href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">More...</a><br /></td></tr>
+<tr class="separator:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a> () const</td></tr>
 <tr class="memdesc:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get SCC detector.  <a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">More...</a><br /></td></tr>
 <tr class="separator:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -168,9 +168,9 @@ Protected Attributes</h2></td></tr>
 <tr class="memitem:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">GraphType&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a87e9adb7fb0e0a42abaf90adac27a9c0">_graph</a></td></tr>
 <tr class="memdesc:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Graph.  <a href="classSVF_1_1WPASolver.html#a87e9adb7fb0e0a42abaf90adac27a9c0">More...</a><br /></td></tr>
 <tr class="separator:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">scc</a></td></tr>
-<tr class="memdesc:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCC.  <a href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">More...</a><br /></td></tr>
-<tr class="separator:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">scc</a></td></tr>
+<tr class="memdesc:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCC.  <a href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">More...</a><br /></td></tr>
+<tr class="separator:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a624e9156b2d3a4f284548cbaaf650334">WorkList</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a1775717a8c8d5d125b7561bc1ae6abf5">worklist</a></td></tr>
 <tr class="memdesc:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Worklist for resolution.  <a href="classSVF_1_1WPASolver.html#a1775717a8c8d5d125b7561bc1ae6abf5">More...</a><br /></td></tr>
 <tr class="separator:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -299,7 +299,7 @@ template&lt;class GraphType &gt; </div>
 
 <p>Reimplemented from <a class="el" href="classSVF_1_1WPASolver.html#aaa932894d00b69cfa741f9987a9cc6b8">SVF::WPASolver&lt; GraphType &gt;</a>.</p>
 
-<p>Reimplemented in <a class="el" href="classSVF_1_1FlowSensitive.html#a5f8a1493f7550a3f7a295e25d87bce12">SVF::FlowSensitive</a>.</p>
+<p>Reimplemented in <a class="el" href="classSVF_1_1FlowSensitive.html#a3fcdbd3e6718cd5b3a339d34198dd0e6">SVF::FlowSensitive</a>.</p>
 
 <p class="definition">Definition at line <a class="el" href="WPAFSSolver_8h_source.html#l00067">67</a> of file <a class="el" href="WPAFSSolver_8h_source.html">WPAFSSolver.h</a>.</p>
 <div class="fragment"><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    {</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a>()-&gt;<a class="code" href="classSVF_1_1SCCDetection.html#a123b5006a6da7053e5e357140da3c5a3">find</a>();</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <a class="code" href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">NodeStack</a> revTopoStack;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <a class="code" href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">NodeStack</a>&amp; topoStack = this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a>()-&gt;<a class="code" href="classSVF_1_1SCCDetection.html#a6502c0a765ac1653474ffee651949f93">topoNodeStack</a>();</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">while</span> (!topoStack.empty())</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        {</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;            <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> nodeId = topoStack.top();</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            topoStack.pop();</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#aa7b6a13e52671de8524b130738aeb564">NodeBS</a>&amp; subNodes = this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a>()-&gt;<a class="code" href="classSVF_1_1SCCDetection.html#a6ab5eff6a576e6d8703c1ea29b7f425d">subNodes</a>(nodeId);</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">NodeBS::iterator</a> it = subNodes.begin(), eit = subNodes.end(); it != eit; ++it)</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;                revTopoStack.push(*it);</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            }</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        }</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        assert(<a class="code" href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">nodeStack</a>.empty() &amp;&amp; <span class="stringliteral">&quot;node stack is not empty, some nodes are not popped properly.&quot;</span>);</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">while</span> (!revTopoStack.empty())</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        {</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> nodeId = revTopoStack.top();</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            revTopoStack.pop();</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <a class="code" href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">nodeStack</a>.push(nodeId);</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        }</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">nodeStack</a>;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    }</div><div class="ttc" id="classSVF_1_1SCCDetection_html_a6ab5eff6a576e6d8703c1ea29b7f425d"><div class="ttname"><a href="classSVF_1_1SCCDetection.html#a6ab5eff6a576e6d8703c1ea29b7f425d">SVF::SCCDetection::subNodes</a></div><div class="ttdeci">const NodeBS &amp; subNodes(NodeID n) const</div><div class="ttdoc">get all subnodes in one scc, if size is empty insert itself into the set </div><div class="ttdef"><b>Definition:</b> <a href="SCC_8h_source.html#l00173">SCC.h:173</a></div></div>
@@ -307,8 +307,8 @@ template&lt;class GraphType &gt; </div>
 <div class="ttc" id="namespaceSVF_html_a350ae9bf8606bdfe23c8679681b969dc"><div class="ttname"><a href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">SVF::NodeID</a></div><div class="ttdeci">unsigned NodeID</div><div class="ttdef"><b>Definition:</b> <a href="include_2MTA_2MTAResultValidator_8h_source.html#l00020">MTAResultValidator.h:20</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a1811127aebdb9c926e39d155e20b3dc0"><div class="ttname"><a href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">SVF::NodeStack</a></div><div class="ttdeci">std::stack&lt; NodeID &gt; NodeStack</div><div class="ttdef"><b>Definition:</b> <a href="SVFType_8h_source.html#l00115">SVFType.h:115</a></div></div>
 <div class="ttc" id="classSVF_1_1SCCDetection_html_a123b5006a6da7053e5e357140da3c5a3"><div class="ttname"><a href="classSVF_1_1SCCDetection.html#a123b5006a6da7053e5e357140da3c5a3">SVF::SCCDetection::find</a></div><div class="ttdeci">void find(void)</div><div class="ttdef"><b>Definition:</b> <a href="SCC_8h_source.html#l00308">SCC.h:308</a></div></div>
-<div class="ttc" id="classSVF_1_1SparseBitVector_html_a0421e3336137b232edc442ece00a8a9c"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">SVF::SparseBitVector::iterator</a></div><div class="ttdeci">SparseBitVectorIterator iterator</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00675">SparseBitVector.h:675</a></div></div>
-<div class="ttc" id="classSVF_1_1WPASolver_html_a37ca8a99b8f83fba796293e6e13b0953"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">SVF::WPASolver::getSCCDetector</a></div><div class="ttdeci">SCC * getSCCDetector() const</div><div class="ttdoc">Get SCC detector. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00071">WPASolver.h:71</a></div></div>
+<div class="ttc" id="classSVF_1_1SparseBitVector_html_a0421e3336137b232edc442ece00a8a9c"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">SVF::SparseBitVector::iterator</a></div><div class="ttdeci">SparseBitVectorIterator iterator</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00667">SparseBitVector.h:667</a></div></div>
+<div class="ttc" id="classSVF_1_1WPASolver_html_a37ca8a99b8f83fba796293e6e13b0953"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">SVF::WPASolver::getSCCDetector</a></div><div class="ttdeci">SCC * getSCCDetector() const</div><div class="ttdoc">Get SCC detector. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00067">WPASolver.h:67</a></div></div>
 <div class="ttc" id="namespaceSVF_html_aa7b6a13e52671de8524b130738aeb564"><div class="ttname"><a href="namespaceSVF.html#aa7b6a13e52671de8524b130738aeb564">SVF::NodeBS</a></div><div class="ttdeci">SparseBitVector NodeBS</div><div class="ttdef"><b>Definition:</b> <a href="SVFType_8h_source.html#l00061">SVFType.h:61</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAFSSolver_html_a2cb80102611c663c4daddd68b4f4b75f"><div class="ttname"><a href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">SVF::WPAFSSolver::nodeStack</a></div><div class="ttdeci">NodeStack nodeStack</div><div class="ttdoc">stack used for processing nodes. </div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00064">WPAFSSolver.h:64</a></div></div>
 </div><!-- fragment -->

package/SVF-doxygen/html/html/classSVF_1_1WPAMinimumSolver-members.html

@@ -99,7 +99,7 @@ $(function() {
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#ac460772d9236a2fefe17b2557023b883">reanalyze</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPAMinimumSolver.html#aa6d8de95ddf703fdac33ef1216ce4aff">removeCandidates</a>(const NodeBS &amp;nodes)</td><td class="entry"><a class="el" href="classSVF_1_1WPAMinimumSolver.html">SVF::WPAMinimumSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> typedef</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">scc</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">scc</a></td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#a2d4cfae34bd4a55f1fe03881c87f8708">SCCDetect</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a16d371c8f6a9bdb1ca984bcb287d6c5a">SVF::WPASolver::SCCDetect</a>(NodeSet &amp;candidates)</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#a0bbaffd1673cc3850217afad0ca56e42">sccRepNode</a>(NodeID id) const</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
@@ -116,7 +116,7 @@ $(function() {
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html#ab3c7f670b0f0e055d5398e69b61194f8">~WPAFSSolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAFSSolver.html">SVF::WPAFSSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
   <tr><td class="entry"><a class="el" href="classSVF_1_1WPAMinimumSolver.html#aabec5ac808a24b8d24aa008d8e15fc2a">~WPAMinimumSolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPAMinimumSolver.html">SVF::WPAMinimumSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classSVF_1_1WPASCCSolver.html#ab1d7c474209aab41d55fe8a3d13562a6">~WPASCCSolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPASCCSolver.html">SVF::WPASCCSolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
-  <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">~WPASolver</a>()</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
+  <tr><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">~WPASolver</a>()=default</td><td class="entry"><a class="el" href="classSVF_1_1WPASolver.html">SVF::WPASolver&lt; GraphType &gt;</a></td><td class="entry"><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
 </table></div><!-- contents -->
 <!-- start footer part -->
 <hr class="footer"/><address class="footer"><small>

package/SVF-doxygen/html/html/classSVF_1_1WPAMinimumSolver.html

@@ -161,9 +161,9 @@ Protected Member Functions</h2></td></tr>
 <tr class="memitem:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a0c5616b0e340955dafc2ab2f21740abd">WPASolver</a> ()</td></tr>
 <tr class="memdesc:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor.  <a href="classSVF_1_1WPASolver.html#a0c5616b0e340955dafc2ab2f21740abd">More...</a><br /></td></tr>
 <tr class="separator:a0c5616b0e340955dafc2ab2f21740abd inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">~WPASolver</a> ()</td></tr>
-<tr class="memdesc:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor.  <a href="classSVF_1_1WPASolver.html#ac88ef07e88b453a1b35684b59a7dd04a">More...</a><br /></td></tr>
-<tr class="separator:ac88ef07e88b453a1b35684b59a7dd04a inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">~WPASolver</a> ()=default</td></tr>
+<tr class="memdesc:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor.  <a href="classSVF_1_1WPASolver.html#a99571af72e62bcf535a05095835bddfb">More...</a><br /></td></tr>
+<tr class="separator:a99571af72e62bcf535a05095835bddfb inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a> () const</td></tr>
 <tr class="memdesc:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get SCC detector.  <a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">More...</a><br /></td></tr>
 <tr class="separator:a37ca8a99b8f83fba796293e6e13b0953 inherit pro_methods_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -242,9 +242,9 @@ Additional Inherited Members</h2></td></tr>
 <tr class="memitem:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">GraphType&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a87e9adb7fb0e0a42abaf90adac27a9c0">_graph</a></td></tr>
 <tr class="memdesc:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Graph.  <a href="classSVF_1_1WPASolver.html#a87e9adb7fb0e0a42abaf90adac27a9c0">More...</a><br /></td></tr>
 <tr class="separator:a87e9adb7fb0e0a42abaf90adac27a9c0 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">scc</a></td></tr>
-<tr class="memdesc:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCC.  <a href="classSVF_1_1WPASolver.html#a21709a0f33b6238afe735cc9fe49ff70">More...</a><br /></td></tr>
-<tr class="separator:a21709a0f33b6238afe735cc9fe49ff70 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="classSVF_1_1WPASolver.html#a1352953966be14b2a1d6244f35e74a33">SCC</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">scc</a></td></tr>
+<tr class="memdesc:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCC.  <a href="classSVF_1_1WPASolver.html#a1d3b2a21385c775f355e188e2abe345e">More...</a><br /></td></tr>
+<tr class="separator:a1d3b2a21385c775f355e188e2abe345e inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classSVF_1_1WPASolver.html#a624e9156b2d3a4f284548cbaaf650334">WorkList</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPASolver.html#a1775717a8c8d5d125b7561bc1ae6abf5">worklist</a></td></tr>
 <tr class="memdesc:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Worklist for resolution.  <a href="classSVF_1_1WPASolver.html#a1775717a8c8d5d125b7561bc1ae6abf5">More...</a><br /></td></tr>
 <tr class="separator:a1775717a8c8d5d125b7561bc1ae6abf5 inherit pro_attribs_classSVF_1_1WPASolver"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -399,7 +399,7 @@ template&lt;class GraphType &gt; </div>
 
 <p class="definition">Definition at line <a class="el" href="WPAFSSolver_8h_source.html#l00236">236</a> of file <a class="el" href="WPAFSSolver_8h_source.html">WPAFSSolver.h</a>.</p>
 <div class="fragment"><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    {</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a3e26f894660fb22f7d2f342bb4338ff8">candidates</a>.<a class="code" href="classSVF_1_1SparseBitVector.html#a61bd86909a141f9de873d92c0f904832">set</a>(node);</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    }</div><div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_a3e26f894660fb22f7d2f342bb4338ff8"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#a3e26f894660fb22f7d2f342bb4338ff8">SVF::WPAMinimumSolver::candidates</a></div><div class="ttdeci">NodeBS candidates</div><div class="ttdoc">nodes which need to be analyzed in current iteration. </div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00249">WPAFSSolver.h:249</a></div></div>
-<div class="ttc" id="classSVF_1_1SparseBitVector_html_a61bd86909a141f9de873d92c0f904832"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a61bd86909a141f9de873d92c0f904832">SVF::SparseBitVector::set</a></div><div class="ttdeci">void set(unsigned Idx)</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00747">SparseBitVector.h:747</a></div></div>
+<div class="ttc" id="classSVF_1_1SparseBitVector_html_a61bd86909a141f9de873d92c0f904832"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a61bd86909a141f9de873d92c0f904832">SVF::SparseBitVector::set</a></div><div class="ttdeci">void set(unsigned Idx)</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00739">SparseBitVector.h:739</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -432,7 +432,7 @@ template&lt;class GraphType &gt; </div>
 <p>Reimplemented from <a class="el" href="classSVF_1_1WPASCCSolver.html#a92c96800a81e69f0148c2d43342837a5">SVF::WPASCCSolver&lt; GraphType &gt;</a>.</p>
 
 <p class="definition">Definition at line <a class="el" href="WPAFSSolver_8h_source.html#l00227">227</a> of file <a class="el" href="WPAFSSolver_8h_source.html">WPAFSSolver.h</a>.</p>
-<div class="fragment"><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    {</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="keywordflow">if</span> (this-&gt;<a class="code" href="classSVF_1_1WPASCCSolver.html#ae1ed4875e706677acf22a776f7285185">isInCurrentSCC</a>(node))</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">pushIntoWorklist</a>(node);</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">addNewCandidate</a>(node);</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    }</div><div class="ttc" id="classSVF_1_1WPASolver_html_a4af1c3e72f5af96c4facff672108da58"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">SVF::WPASolver::pushIntoWorklist</a></div><div class="ttdeci">virtual void pushIntoWorklist(NodeID id)</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00160">WPASolver.h:160</a></div></div>
+<div class="fragment"><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    {</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="keywordflow">if</span> (this-&gt;<a class="code" href="classSVF_1_1WPASCCSolver.html#ae1ed4875e706677acf22a776f7285185">isInCurrentSCC</a>(node))</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">pushIntoWorklist</a>(node);</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">addNewCandidate</a>(node);</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    }</div><div class="ttc" id="classSVF_1_1WPASolver_html_a4af1c3e72f5af96c4facff672108da58"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">SVF::WPASolver::pushIntoWorklist</a></div><div class="ttdeci">virtual void pushIntoWorklist(NodeID id)</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00156">WPASolver.h:156</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_a9f7d45208d70631ba8fa76220f13c6e4"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">SVF::WPAMinimumSolver::addNewCandidate</a></div><div class="ttdeci">void addNewCandidate(NodeID node)</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00236">WPAFSSolver.h:236</a></div></div>
 <div class="ttc" id="classSVF_1_1WPASCCSolver_html_ae1ed4875e706677acf22a776f7285185"><div class="ttname"><a href="classSVF_1_1WPASCCSolver.html#ae1ed4875e706677acf22a776f7285185">SVF::WPASCCSolver::isInCurrentSCC</a></div><div class="ttdeci">bool isInCurrentSCC(NodeID node)</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00162">WPAFSSolver.h:162</a></div></div>
 </div><!-- fragment -->
@@ -495,7 +495,7 @@ template&lt;class GraphType &gt; </div>
 </div><div class="memdoc">
 
 <p class="definition">Definition at line <a class="el" href="WPAFSSolver_8h_source.html#l00244">244</a> of file <a class="el" href="WPAFSSolver_8h_source.html">WPAFSSolver.h</a>.</p>
-<div class="fragment"><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;        <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a3e26f894660fb22f7d2f342bb4338ff8">candidates</a>.<a class="code" href="classSVF_1_1SparseBitVector.html#a8b481ef53a27a351affecab90310b1ef">intersectWithComplement</a>(<a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>);</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;    }</div><div class="ttc" id="classSVF_1_1SparseBitVector_html_a8b481ef53a27a351affecab90310b1ef"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a8b481ef53a27a351affecab90310b1ef">SVF::SparseBitVector::intersectWithComplement</a></div><div class="ttdeci">bool intersectWithComplement(const SparseBitVector &amp;RHS)</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00905">SparseBitVector.h:905</a></div></div>
+<div class="fragment"><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;        <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a3e26f894660fb22f7d2f342bb4338ff8">candidates</a>.<a class="code" href="classSVF_1_1SparseBitVector.html#a8b481ef53a27a351affecab90310b1ef">intersectWithComplement</a>(<a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>);</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;    }</div><div class="ttc" id="classSVF_1_1SparseBitVector_html_a8b481ef53a27a351affecab90310b1ef"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a8b481ef53a27a351affecab90310b1ef">SVF::SparseBitVector::intersectWithComplement</a></div><div class="ttdeci">bool intersectWithComplement(const SparseBitVector &amp;RHS)</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00897">SparseBitVector.h:897</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_a3e26f894660fb22f7d2f342bb4338ff8"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#a3e26f894660fb22f7d2f342bb4338ff8">SVF::WPAMinimumSolver::candidates</a></div><div class="ttdeci">NodeBS candidates</div><div class="ttdoc">nodes which need to be analyzed in current iteration. </div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00249">WPAFSSolver.h:249</a></div></div>
 <div class="ttc" id="namespaceSVF_html_ae6c7046834fe00382052ece7d06eb0ac"><div class="ttname"><a href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">SVF::nodes</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; GraphType &gt;::nodes_iterator &gt; nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00111">GraphTraits.h:111</a></div></div>
 </div><!-- fragment -->
@@ -532,19 +532,19 @@ template&lt;class GraphType &gt; </div>
 <p>Reimplemented from <a class="el" href="classSVF_1_1WPASCCSolver.html#ac37c1063fbdff394c9a313c8d131d893">SVF::WPASCCSolver&lt; GraphType &gt;</a>.</p>
 
 <p class="definition">Definition at line <a class="el" href="WPAFSSolver_8h_source.html#l00192">192</a> of file <a class="el" href="WPAFSSolver_8h_source.html">WPAFSSolver.h</a>.</p>
-<div class="fragment"><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    {</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="keywordtype">bool</span> solveAll = <span class="keyword">true</span>;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;        <span class="keywordflow">if</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;        {</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            solveAll = <span class="keyword">false</span>;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">while</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">addNewCandidate</a>(this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">popFromWorklist</a>());</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;</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        <a class="code" href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">NodeStack</a>&amp; <a class="code" href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">nodeStack</a> = this-&gt;<a class="code" href="classSVF_1_1WPAFSSolver.html#a2d4cfae34bd4a55f1fe03881c87f8708">SCCDetect</a>();</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="keywordflow">while</span> (!nodeStack.empty())</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        {</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> rep = nodeStack.top();</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            nodeStack.pop();</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;            this-&gt;<a class="code" href="classSVF_1_1WPASCCSolver.html#a782121c831536e231f5b287629defef7">setCurrentSCC</a>(rep);</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;            <a class="code" href="namespaceSVF.html#aa7b6a13e52671de8524b130738aeb564">NodeBS</a> sccNodes = this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a>()-&gt;<a class="code" href="classSVF_1_1SCCDetection.html#a6ab5eff6a576e6d8703c1ea29b7f425d">subNodes</a>(rep);</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            <span class="keywordflow">if</span> (solveAll == <span class="keyword">false</span>)</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                sccNodes &amp;= <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a2dc1f9588dd3ac376f8bb17a144c6fb2">getCandidates</a>();    </div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">NodeBS::iterator</a> it = sccNodes.begin(), eit = sccNodes.end(); it != eit; ++it)</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">pushIntoWorklist</a>(*it);</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            <span class="keywordflow">while</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;                this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#abd7fd785e70f66d394088101d78598ca">processNode</a>(this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">popFromWorklist</a>());</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;            <a class="code" href="classSVF_1_1WPAMinimumSolver.html#aa6d8de95ddf703fdac33ef1216ce4aff">removeCandidates</a>(sccNodes);     </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;    }</div><div class="ttc" id="classSVF_1_1WPASolver_html_a4af1c3e72f5af96c4facff672108da58"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">SVF::WPASolver::pushIntoWorklist</a></div><div class="ttdeci">virtual void pushIntoWorklist(NodeID id)</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00160">WPASolver.h:160</a></div></div>
+<div class="fragment"><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    {</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="keywordtype">bool</span> solveAll = <span class="keyword">true</span>;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;        <span class="keywordflow">if</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;        {</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            solveAll = <span class="keyword">false</span>;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">while</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">addNewCandidate</a>(this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">popFromWorklist</a>());</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;</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        <a class="code" href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">NodeStack</a>&amp; <a class="code" href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">nodeStack</a> = this-&gt;<a class="code" href="classSVF_1_1WPAFSSolver.html#a2d4cfae34bd4a55f1fe03881c87f8708">SCCDetect</a>();</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="keywordflow">while</span> (!nodeStack.empty())</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        {</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> rep = nodeStack.top();</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            nodeStack.pop();</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;            this-&gt;<a class="code" href="classSVF_1_1WPASCCSolver.html#a782121c831536e231f5b287629defef7">setCurrentSCC</a>(rep);</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;            <a class="code" href="namespaceSVF.html#aa7b6a13e52671de8524b130738aeb564">NodeBS</a> sccNodes = this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">getSCCDetector</a>()-&gt;<a class="code" href="classSVF_1_1SCCDetection.html#a6ab5eff6a576e6d8703c1ea29b7f425d">subNodes</a>(rep);</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            <span class="keywordflow">if</span> (solveAll == <span class="keyword">false</span>)</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                sccNodes &amp;= <a class="code" href="classSVF_1_1WPAMinimumSolver.html#a2dc1f9588dd3ac376f8bb17a144c6fb2">getCandidates</a>();    </div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">NodeBS::iterator</a> it = sccNodes.begin(), eit = sccNodes.end(); it != eit; ++it)</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">pushIntoWorklist</a>(*it);</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            <span class="keywordflow">while</span> (!this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">isWorklistEmpty</a>())</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;                this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#abd7fd785e70f66d394088101d78598ca">processNode</a>(this-&gt;<a class="code" href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">popFromWorklist</a>());</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;            <a class="code" href="classSVF_1_1WPAMinimumSolver.html#aa6d8de95ddf703fdac33ef1216ce4aff">removeCandidates</a>(sccNodes);     </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;    }</div><div class="ttc" id="classSVF_1_1WPASolver_html_a4af1c3e72f5af96c4facff672108da58"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a4af1c3e72f5af96c4facff672108da58">SVF::WPASolver::pushIntoWorklist</a></div><div class="ttdeci">virtual void pushIntoWorklist(NodeID id)</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00156">WPASolver.h:156</a></div></div>
 <div class="ttc" id="classSVF_1_1SCCDetection_html_a6ab5eff6a576e6d8703c1ea29b7f425d"><div class="ttname"><a href="classSVF_1_1SCCDetection.html#a6ab5eff6a576e6d8703c1ea29b7f425d">SVF::SCCDetection::subNodes</a></div><div class="ttdeci">const NodeBS &amp; subNodes(NodeID n) const</div><div class="ttdoc">get all subnodes in one scc, if size is empty insert itself into the set </div><div class="ttdef"><b>Definition:</b> <a href="SCC_8h_source.html#l00173">SCC.h:173</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a350ae9bf8606bdfe23c8679681b969dc"><div class="ttname"><a href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">SVF::NodeID</a></div><div class="ttdeci">unsigned NodeID</div><div class="ttdef"><b>Definition:</b> <a href="include_2MTA_2MTAResultValidator_8h_source.html#l00020">MTAResultValidator.h:20</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a1811127aebdb9c926e39d155e20b3dc0"><div class="ttname"><a href="namespaceSVF.html#a1811127aebdb9c926e39d155e20b3dc0">SVF::NodeStack</a></div><div class="ttdeci">std::stack&lt; NodeID &gt; NodeStack</div><div class="ttdef"><b>Definition:</b> <a href="SVFType_8h_source.html#l00115">SVFType.h:115</a></div></div>
-<div class="ttc" id="classSVF_1_1WPASolver_html_a992b105a0ec126050a123e24db3bd45b"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">SVF::WPASolver::isWorklistEmpty</a></div><div class="ttdeci">bool isWorklistEmpty()</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00164">WPASolver.h:164</a></div></div>
+<div class="ttc" id="classSVF_1_1WPASolver_html_a992b105a0ec126050a123e24db3bd45b"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a992b105a0ec126050a123e24db3bd45b">SVF::WPASolver::isWorklistEmpty</a></div><div class="ttdeci">bool isWorklistEmpty()</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00160">WPASolver.h:160</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_aa6d8de95ddf703fdac33ef1216ce4aff"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#aa6d8de95ddf703fdac33ef1216ce4aff">SVF::WPAMinimumSolver::removeCandidates</a></div><div class="ttdeci">void removeCandidates(const NodeBS &amp;nodes)</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00244">WPAFSSolver.h:244</a></div></div>
-<div class="ttc" id="classSVF_1_1SparseBitVector_html_a0421e3336137b232edc442ece00a8a9c"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">SVF::SparseBitVector::iterator</a></div><div class="ttdeci">SparseBitVectorIterator iterator</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00675">SparseBitVector.h:675</a></div></div>
+<div class="ttc" id="classSVF_1_1SparseBitVector_html_a0421e3336137b232edc442ece00a8a9c"><div class="ttname"><a href="classSVF_1_1SparseBitVector.html#a0421e3336137b232edc442ece00a8a9c">SVF::SparseBitVector::iterator</a></div><div class="ttdeci">SparseBitVectorIterator iterator</div><div class="ttdef"><b>Definition:</b> <a href="SparseBitVector_8h_source.html#l00667">SparseBitVector.h:667</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_a9f7d45208d70631ba8fa76220f13c6e4"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#a9f7d45208d70631ba8fa76220f13c6e4">SVF::WPAMinimumSolver::addNewCandidate</a></div><div class="ttdeci">void addNewCandidate(NodeID node)</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00236">WPAFSSolver.h:236</a></div></div>
-<div class="ttc" id="classSVF_1_1WPASolver_html_abd7fd785e70f66d394088101d78598ca"><div class="ttname"><a href="classSVF_1_1WPASolver.html#abd7fd785e70f66d394088101d78598ca">SVF::WPASolver::processNode</a></div><div class="ttdeci">virtual void processNode(NodeID)</div><div class="ttdoc">Following methods are to be implemented in child class, in order to achieve a fully worked PTA...</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00126">WPASolver.h:126</a></div></div>
+<div class="ttc" id="classSVF_1_1WPASolver_html_abd7fd785e70f66d394088101d78598ca"><div class="ttname"><a href="classSVF_1_1WPASolver.html#abd7fd785e70f66d394088101d78598ca">SVF::WPASolver::processNode</a></div><div class="ttdeci">virtual void processNode(NodeID)</div><div class="ttdoc">Following methods are to be implemented in child class, in order to achieve a fully worked PTA...</div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00122">WPASolver.h:122</a></div></div>
 <div class="ttc" id="classSVF_1_1WPASCCSolver_html_a782121c831536e231f5b287629defef7"><div class="ttname"><a href="classSVF_1_1WPASCCSolver.html#a782121c831536e231f5b287629defef7">SVF::WPASCCSolver::setCurrentSCC</a></div><div class="ttdeci">void setCurrentSCC(NodeID id)</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00166">WPAFSSolver.h:166</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAFSSolver_html_a2d4cfae34bd4a55f1fe03881c87f8708"><div class="ttname"><a href="classSVF_1_1WPAFSSolver.html#a2d4cfae34bd4a55f1fe03881c87f8708">SVF::WPAFSSolver::SCCDetect</a></div><div class="ttdeci">virtual NodeStack &amp; SCCDetect()</div><div class="ttdoc">SCC detection. </div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00067">WPAFSSolver.h:67</a></div></div>
-<div class="ttc" id="classSVF_1_1WPASolver_html_a37ca8a99b8f83fba796293e6e13b0953"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">SVF::WPASolver::getSCCDetector</a></div><div class="ttdeci">SCC * getSCCDetector() const</div><div class="ttdoc">Get SCC detector. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00071">WPASolver.h:71</a></div></div>
-<div class="ttc" id="classSVF_1_1WPASolver_html_a20a14ac31fe23d4fe67da15f5cc498df"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">SVF::WPASolver::popFromWorklist</a></div><div class="ttdeci">NodeID popFromWorklist()</div><div class="ttdoc">Worklist operations. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00155">WPASolver.h:155</a></div></div>
+<div class="ttc" id="classSVF_1_1WPASolver_html_a37ca8a99b8f83fba796293e6e13b0953"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a37ca8a99b8f83fba796293e6e13b0953">SVF::WPASolver::getSCCDetector</a></div><div class="ttdeci">SCC * getSCCDetector() const</div><div class="ttdoc">Get SCC detector. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00067">WPASolver.h:67</a></div></div>
+<div class="ttc" id="classSVF_1_1WPASolver_html_a20a14ac31fe23d4fe67da15f5cc498df"><div class="ttname"><a href="classSVF_1_1WPASolver.html#a20a14ac31fe23d4fe67da15f5cc498df">SVF::WPASolver::popFromWorklist</a></div><div class="ttdeci">NodeID popFromWorklist()</div><div class="ttdoc">Worklist operations. </div><div class="ttdef"><b>Definition:</b> <a href="WPASolver_8h_source.html#l00151">WPASolver.h:151</a></div></div>
 <div class="ttc" id="namespaceSVF_html_aa7b6a13e52671de8524b130738aeb564"><div class="ttname"><a href="namespaceSVF.html#aa7b6a13e52671de8524b130738aeb564">SVF::NodeBS</a></div><div class="ttdeci">SparseBitVector NodeBS</div><div class="ttdef"><b>Definition:</b> <a href="SVFType_8h_source.html#l00061">SVFType.h:61</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAMinimumSolver_html_a2dc1f9588dd3ac376f8bb17a144c6fb2"><div class="ttname"><a href="classSVF_1_1WPAMinimumSolver.html#a2dc1f9588dd3ac376f8bb17a144c6fb2">SVF::WPAMinimumSolver::getCandidates</a></div><div class="ttdeci">const NodeBS &amp; getCandidates() const</div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00240">WPAFSSolver.h:240</a></div></div>
 <div class="ttc" id="classSVF_1_1WPAFSSolver_html_a2cb80102611c663c4daddd68b4f4b75f"><div class="ttname"><a href="classSVF_1_1WPAFSSolver.html#a2cb80102611c663c4daddd68b4f4b75f">SVF::WPAFSSolver::nodeStack</a></div><div class="ttdeci">NodeStack nodeStack</div><div class="ttdoc">stack used for processing nodes. </div><div class="ttdef"><b>Definition:</b> <a href="WPAFSSolver_8h_source.html#l00064">WPAFSSolver.h:64</a></div></div>