diff --git a/annotated.html b/annotated.html
index 7034197..8e29758 100644
--- a/annotated.html
+++ b/annotated.html
@@ -129,7 +129,7 @@
 <tr id="row_0_22_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_once_function.html" target="_self">OnceFunction</a></td><td class="desc"></td></tr>
 <tr id="row_0_23_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_parallel_for_executor.html" target="_self">ParallelForExecutor</a></td><td class="desc"></td></tr>
 <tr id="row_0_24_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdispenso_1_1_par_for_options.html" target="_self">ParForOptions</a></td><td class="desc"></td></tr>
-<tr id="row_0_25_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_pool_allocator.html" target="_self">PoolAllocator</a></td><td class="desc"></td></tr>
+<tr id="row_0_25_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_pool_allocator_t.html" target="_self">PoolAllocatorT</a></td><td class="desc"></td></tr>
 <tr id="row_0_26_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdispenso_1_1_reserve_tag_s.html" target="_self">ReserveTagS</a></td><td class="desc"></td></tr>
 <tr id="row_0_27_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_resource.html" target="_self">Resource</a></td><td class="desc"></td></tr>
 <tr id="row_0_28_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_resource_pool.html" target="_self">ResourcePool</a></td><td class="desc"></td></tr>
diff --git a/annotated_dup.js b/annotated_dup.js
index 9af4ef3..8007389 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -26,7 +26,7 @@ var annotated_dup =
       [ "OnceFunction", "classdispenso_1_1_once_function.html", "classdispenso_1_1_once_function" ],
       [ "ParallelForExecutor", "classdispenso_1_1_parallel_for_executor.html", "classdispenso_1_1_parallel_for_executor" ],
       [ "ParForOptions", "structdispenso_1_1_par_for_options.html", "structdispenso_1_1_par_for_options" ],
-      [ "PoolAllocator", "classdispenso_1_1_pool_allocator.html", "classdispenso_1_1_pool_allocator" ],
+      [ "PoolAllocatorT", "classdispenso_1_1_pool_allocator_t.html", "classdispenso_1_1_pool_allocator_t" ],
       [ "ReserveTagS", "structdispenso_1_1_reserve_tag_s.html", null ],
       [ "Resource", "classdispenso_1_1_resource.html", "classdispenso_1_1_resource" ],
       [ "ResourcePool", "classdispenso_1_1_resource_pool.html", "classdispenso_1_1_resource_pool" ],
diff --git a/classdispenso_1_1_bi_prop_node.html b/classdispenso_1_1_bi_prop_node.html
index f9d3cb9..17a13d5 100644
--- a/classdispenso_1_1_bi_prop_node.html
+++ b/classdispenso_1_1_bi_prop_node.html
@@ -176,7 +176,7 @@
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Class to store task with dependencies. Support bidirectional propagation dependency between nodes. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00356">356</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00358">358</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a055b4ba3ac4a6f989c7b1529009c1d9f" name="a055b4ba3ac4a6f989c7b1529009c1d9f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a055b4ba3ac4a6f989c7b1529009c1d9f">&#9670;&#160;</a></span>BiPropNode()</h2>
@@ -202,7 +202,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a055b4ba3ac4a6f989c7b1529
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00361">361</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00363">363</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -240,7 +240,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#af7381198c926f4b8a3f09e8a
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00370">370</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00372">372</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -267,7 +267,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0432fc6facf69eaa06f43c2a
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00391">391</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00393">393</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
diff --git a/classdispenso_1_1_graph_t.html b/classdispenso_1_1_graph_t.html
index 06844d7..0765fd2 100644
--- a/classdispenso_1_1_graph_t.html
+++ b/classdispenso_1_1_graph_t.html
@@ -167,7 +167,7 @@
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class N&gt;<br />
 class dispenso::GraphT&lt; N &gt;</div>
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00493">493</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00510">510</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 </div><h2 class="groupheader">Member Typedef Documentation</h2>
 <a id="a1b2be4968c5f2fabc3ebd9c935f1f760" name="a1b2be4968c5f2fabc3ebd9c935f1f760"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1b2be4968c5f2fabc3ebd9c935f1f760">&#9670;&#160;</a></span>NodeType</h2>
@@ -183,7 +183,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1b2be4968c5f2fabc3ebd9c9
       </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00495">495</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00512">512</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -201,7 +201,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a489e5a6f76891fe5ec51ed71
       </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00496">496</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00513">513</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -232,7 +232,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7e18b24fe123bfac828e3b99
 </div><div class="memdoc">
 <p >Create empty graph. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00498">498</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00515">515</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -255,7 +255,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa66b84b339d030b305b58f67
 </div><div class="memdoc">
 <p >Move constructor </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00110">110</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00175">175</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
 
 </div>
 </div>
@@ -295,7 +295,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a13d24b1056de5324500d2070
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00520">520</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00537">537</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -314,7 +314,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#adf47c5ba380b61e20df7ec68
 </div><div class="memdoc">
 <p >Create an empty subgraph. This is not concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00126">126</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00191">191</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
 
 </div>
 </div>
@@ -344,7 +344,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a23d36763edcc0162257ee176
 </div><div class="memdoc">
 <p >Destroy all nodes and subgraphs. This is not concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00623">623</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00640">640</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -383,7 +383,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a3f648335d15c97603bc6a81d
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00613">613</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00630">630</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -422,7 +422,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a22f4214e82e711d82770830f
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00600">600</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00617">617</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -461,7 +461,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a77eb80216600caca5a6c6c03
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00588">588</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00605">605</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -500,7 +500,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a4aac6a8e1038bc3fd1ae8ec8
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00577">577</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00594">594</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -537,7 +537,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a9297df295822e9f46dc7f93a
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00542">542</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00559">559</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -574,7 +574,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ad85a02fa2e34f7beb7a3bfaf
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00534">534</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00551">551</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -604,7 +604,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae92cbfe6f02b870cf5e46687
 </div><div class="memdoc">
 <p >Return number of nodes in subgraph 0. Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00526">526</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00543">543</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -634,7 +634,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a5c307fa77893c5d9c2ea0e55
 </div><div class="memdoc">
 <p >Return number of subgraphs in the graph including subgraph 0. Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00552">552</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00569">569</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -657,7 +657,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa2ee3104f142782e0c5aa5a6
 </div><div class="memdoc">
 <p >Move assignment operator </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00117">117</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00182">182</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
 
 </div>
 </div>
@@ -694,7 +694,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a3af58d956a3073c39780dc2d
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00568">568</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00585">585</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -731,7 +731,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a049150fe3d50ebb3c121e7b4
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00560">560</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00577">577</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -760,7 +760,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0432fc6facf69eaa06f43c2a
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00639">639</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00658">658</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
diff --git a/classdispenso_1_1_node.html b/classdispenso_1_1_node.html
index e37845e..b47d386 100644
--- a/classdispenso_1_1_node.html
+++ b/classdispenso_1_1_node.html
@@ -173,7 +173,7 @@
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Class to store task with dependencies </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00219">219</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00221">221</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="af2591c722b64e2ba75f86eb752c512b3" name="af2591c722b64e2ba75f86eb752c512b3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af2591c722b64e2ba75f86eb752c512b3">&#9670;&#160;</a></span>Node() <span class="overload">[1/2]</span></h2>
@@ -199,7 +199,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#af2591c722b64e2ba75f86eb7
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00224">224</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00226">226</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -226,7 +226,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a5756909a679a4d7d69ec2453
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00233">233</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00235">235</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -256,7 +256,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6bd182ac99540c7b2c5d9232
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00318">318</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00320">320</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -294,7 +294,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#abfb52f4bd018eee8791499a9
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00244">244</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00246">246</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -322,7 +322,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a22161da856adcfc0afc5d873
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00328">328</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00330">330</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -359,7 +359,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a29dcdde915094ed0163f7d7b
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00272">272</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00274">274</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -396,7 +396,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2fd8f2a09e75b8cbaa76e43f
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00261">261</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00263">263</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -424,7 +424,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0176c8a462083b6fb4ce31ac
 </div><div class="memdoc">
 <p >Return true if node is completed. New node always incomplete. If node was invoked it become completed. this state can be changed by calling <code><a class="el" href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">setIncomplete()</a></code> Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00289">289</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00291">291</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -452,7 +452,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae961b329557136eeb3f2787e
 </div><div class="memdoc">
 <p >Return the number of nodes this node depends on. Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00280">280</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00282">282</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -480,7 +480,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#af73f196ba6ccba6081ac5ef4
 </div><div class="memdoc">
 <p >Invoke the type-erased functor. Change competed state of the node to "Incomplete". Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00251">251</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00253">253</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -508,7 +508,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a9ba6d698905f5f2e4e019d0f
 </div><div class="memdoc">
 <p >Mark node completed. Concurrency safe. This methods should never be called concurrent to when the graph execution is happening </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00312">312</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00314">314</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -537,7 +537,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a3a9c840c8df858d1b9e0e1c8
 <p >Mark node incomplete. (that allows reevaluate this node again). Concurrency safe. This methods should never be called concurrent to when the graph execution is happening</p>
 <dl class="section return"><dt>Returns</dt><dd>true if state was changed. </dd></dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00299">299</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00301">301</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -594,7 +594,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0432fc6facf69eaa06f43c2a
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00347">347</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00349">349</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -619,7 +619,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a39f7109e412058ea99505924
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00333">333</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00335">335</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -643,7 +643,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab26310466b8e316b8aa49d3f
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00334">334</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00336">336</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -667,7 +667,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab5fc8dc9d2848ba8936856c0
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00335">335</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00337">337</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
diff --git a/classdispenso_1_1_pool_allocator.js b/classdispenso_1_1_pool_allocator.js
deleted file mode 100644
index 2508e50..0000000
--- a/classdispenso_1_1_pool_allocator.js
+++ /dev/null
@@ -1,7 +0,0 @@
-var classdispenso_1_1_pool_allocator =
-[
-    [ "PoolAllocator", "classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20", null ],
-    [ "~PoolAllocator", "classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a", null ],
-    [ "alloc", "classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4", null ],
-    [ "dealloc", "classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582", null ]
-];
\ No newline at end of file
diff --git a/classdispenso_1_1_pool_allocator-members.html b/classdispenso_1_1_pool_allocator_t-members.html
similarity index 70%
rename from classdispenso_1_1_pool_allocator-members.html
rename to classdispenso_1_1_pool_allocator_t-members.html
index 17c1930..16e35a6 100644
--- a/classdispenso_1_1_pool_allocator-members.html
+++ b/classdispenso_1_1_pool_allocator_t-members.html
@@ -70,7 +70,7 @@
 </div>
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(document).ready(function(){initNavTree('classdispenso_1_1_pool_allocator.html',''); initResizable(); });
+$(document).ready(function(){initNavTree('classdispenso_1_1_pool_allocator_t.html',''); initResizable(); });
 /* @license-end */
 </script>
 <div id="doc-content">
@@ -96,16 +96,18 @@
 </div>
 
 <div class="header">
-  <div class="headertitle"><div class="title">dispenso::PoolAllocator Member List</div></div>
+  <div class="headertitle"><div class="title">dispenso::PoolAllocatorT&lt; kThreadSafe &gt; Member List</div></div>
 </div><!--header-->
 <div class="contents">
 
-<p>This is the complete list of members for <a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a>, including all inherited members.</p>
+<p>This is the complete list of members for <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a>, including all inherited members.</p>
 <table class="directory">
-  <tr class="even"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">alloc</a>()</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></td><td class="entry"></td></tr>
-  <tr class="odd"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dealloc</a>(char *ptr)</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">PoolAllocator</a>(size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></td><td class="entry"></td></tr>
-  <tr class="odd"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">~PoolAllocator</a>()</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">alloc</a>()</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"></td></tr>
+  <tr class="odd"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">clear</a>()</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dealloc</a>(char *ptr)</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"></td></tr>
+  <tr class="odd"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">PoolAllocatorT</a>(size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">totalChunkCapacity</a>() const</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
+  <tr class="odd"><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">~PoolAllocatorT</a>()</td><td class="entry"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/classdispenso_1_1_pool_allocator.html b/classdispenso_1_1_pool_allocator_t.html
similarity index 57%
rename from classdispenso_1_1_pool_allocator.html
rename to classdispenso_1_1_pool_allocator_t.html
index e7f0b7a..f95011d 100644
--- a/classdispenso_1_1_pool_allocator.html
+++ b/classdispenso_1_1_pool_allocator_t.html
@@ -5,7 +5,7 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.9.5"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>dispenso: dispenso::PoolAllocator Class Reference</title>
+<title>dispenso: dispenso::PoolAllocatorT&lt; kThreadSafe &gt; Class Template Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -70,7 +70,7 @@
 </div>
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(document).ready(function(){initNavTree('classdispenso_1_1_pool_allocator.html',''); initResizable(); });
+$(document).ready(function(){initNavTree('classdispenso_1_1_pool_allocator_t.html',''); initResizable(); });
 /* @license-end */
 </script>
 <div id="doc-content">
@@ -98,8 +98,8 @@
 <div class="header">
   <div class="summary">
 <a href="#pub-methods">Public Member Functions</a> &#124;
-<a href="classdispenso_1_1_pool_allocator-members.html">List of all members</a>  </div>
-  <div class="headertitle"><div class="title">dispenso::PoolAllocator Class Reference</div></div>
+<a href="classdispenso_1_1_pool_allocator_t-members.html">List of all members</a>  </div>
+  <div class="headertitle"><div class="title">dispenso::PoolAllocatorT&lt; kThreadSafe &gt; Class Template Reference</div></div>
 </div><!--header-->
 <div class="contents">
 
@@ -107,28 +107,35 @@
 <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:a7a393687ca662206fea08d6d261cdd20"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">PoolAllocator</a> (size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</td></tr>
-<tr class="separator:a7a393687ca662206fea08d6d261cdd20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a38a9be5293b77653b1560cb8e74b5bd4"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">alloc</a> ()</td></tr>
-<tr class="separator:a38a9be5293b77653b1560cb8e74b5bd4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae7121e9dcebfeb09a6a045d04455a582"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dealloc</a> (char *ptr)</td></tr>
-<tr class="separator:ae7121e9dcebfeb09a6a045d04455a582"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5c40ea70c1e81435ee7c9152fb9ce62a"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">~PoolAllocator</a> ()</td></tr>
-<tr class="separator:a5c40ea70c1e81435ee7c9152fb9ce62a"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a82adb70b33422125a6f3de59a0b63d11"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">PoolAllocatorT</a> (size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</td></tr>
+<tr class="separator:a82adb70b33422125a6f3de59a0b63d11"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a04ec8c4a58977f8ca6011431e1860036"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">alloc</a> ()</td></tr>
+<tr class="separator:a04ec8c4a58977f8ca6011431e1860036"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:add24c6cf8e3ea586940a18acf7959a4d"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dealloc</a> (char *ptr)</td></tr>
+<tr class="separator:add24c6cf8e3ea586940a18acf7959a4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a67dc4676c39f7226c23ac48ea1a58ad1"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">clear</a> ()</td></tr>
+<tr class="separator:a67dc4676c39f7226c23ac48ea1a58ad1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a811782e39e4b441b960bc35757af59c1"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">totalChunkCapacity</a> () const</td></tr>
+<tr class="separator:a811782e39e4b441b960bc35757af59c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a6f1cf4cfc584a9eef84a3e5e4e92ad60"><td class="memItemLeft" align="right" valign="top">DISPENSO_DLL_ACCESS&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">~PoolAllocatorT</a> ()</td></tr>
+<tr class="separator:a6f1cf4cfc584a9eef84a3e5e4e92ad60"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p >A pool allocator to help reduce calls to the underlying allocation and deallocation functions. </p>
+<div class="textblock"><div class="compoundTemplParams">template&lt;bool kThreadSafe&gt;<br />
+class dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</div><p >A pool allocator to help reduce calls to the underlying allocation and deallocation functions. </p>
 
-<p class="definition">Definition at line <a class="el" href="pool__allocator_8h_source.html#l00028">28</a> of file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8h_source.html#l00029">29</a> of file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
-<a id="a7a393687ca662206fea08d6d261cdd20" name="a7a393687ca662206fea08d6d261cdd20"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a7a393687ca662206fea08d6d261cdd20">&#9670;&#160;</a></span>PoolAllocator()</h2>
+<a id="a82adb70b33422125a6f3de59a0b63d11" name="a82adb70b33422125a6f3de59a0b63d11"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a82adb70b33422125a6f3de59a0b63d11">&#9670;&#160;</a></span>PoolAllocatorT()</h2>
 
 <div class="memitem">
 <div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname">dispenso::PoolAllocator::PoolAllocator </td>
+          <td class="memname"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::PoolAllocatorT </td>
           <td>(</td>
           <td class="paramtype">size_t&#160;</td>
           <td class="paramname"><em>chunkSize</em>, </td>
@@ -158,7 +165,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7a393687ca662206fea08d6d
         </tr>
       </table>
 </div><div class="memdoc">
-<p >Construct a <a class="el" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a>.</p>
+<p >Construct a PoolAllocator.</p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">chunkSize</td><td>The chunk size for each pool allocation </td></tr>
@@ -169,60 +176,79 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7a393687ca662206fea08d6d
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00012">12</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00013">13</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
 
 </div>
 </div>
-<a id="a5c40ea70c1e81435ee7c9152fb9ce62a" name="a5c40ea70c1e81435ee7c9152fb9ce62a"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a5c40ea70c1e81435ee7c9152fb9ce62a">&#9670;&#160;</a></span>~PoolAllocator()</h2>
+<a id="a6f1cf4cfc584a9eef84a3e5e4e92ad60" name="a6f1cf4cfc584a9eef84a3e5e4e92ad60"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6f1cf4cfc584a9eef84a3e5e4e92ad60">&#9670;&#160;</a></span>~PoolAllocatorT()</h2>
 
 <div class="memitem">
 <div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname">dispenso::PoolAllocator::~PoolAllocator </td>
-          <td>(</td>
-          <td class="paramname"></td><td>)</td>
-          <td></td>
+          <td class="memname"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::~<a class="el" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT</a></td>
         </tr>
       </table>
 </div><div class="memdoc">
-<p >Destruct a <a class="el" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a> </p>
+<p >Destruct a PoolAllocator </p>
 
-<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00070">70</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00104">104</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
 
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
-<a id="a38a9be5293b77653b1560cb8e74b5bd4" name="a38a9be5293b77653b1560cb8e74b5bd4"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a38a9be5293b77653b1560cb8e74b5bd4">&#9670;&#160;</a></span>alloc()</h2>
+<a id="a04ec8c4a58977f8ca6011431e1860036" name="a04ec8c4a58977f8ca6011431e1860036"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a04ec8c4a58977f8ca6011431e1860036">&#9670;&#160;</a></span>alloc()</h2>
 
 <div class="memitem">
 <div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname">char * dispenso::PoolAllocator::alloc </td>
-          <td>(</td>
-          <td class="paramname"></td><td>)</td>
-          <td></td>
+          <td class="memname">char * <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::alloc</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p >Allocate a chunk from a slab</p>
 <dl class="section return"><dt>Returns</dt><dd>The pointer to a buffer of chunkSize bytes </dd></dl>
 
-<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00026">26</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00028">28</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a67dc4676c39f7226c23ac48ea1a58ad1" name="a67dc4676c39f7226c23ac48ea1a58ad1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a67dc4676c39f7226c23ac48ea1a58ad1">&#9670;&#160;</a></span>clear()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">void <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::clear</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p >Effectively dealloc all previously allocated chunks. Useful for arenas. This function is not thread safe, and no previously allocated chunks may be dealloc'd after clear. </p>
+
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00092">92</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
 
 </div>
 </div>
-<a id="ae7121e9dcebfeb09a6a045d04455a582" name="ae7121e9dcebfeb09a6a045d04455a582"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#ae7121e9dcebfeb09a6a045d04455a582">&#9670;&#160;</a></span>dealloc()</h2>
+<a id="add24c6cf8e3ea586940a18acf7959a4d" name="add24c6cf8e3ea586940a18acf7959a4d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#add24c6cf8e3ea586940a18acf7959a4d">&#9670;&#160;</a></span>dealloc()</h2>
 
 <div class="memitem">
 <div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname">void dispenso::PoolAllocator::dealloc </td>
+          <td class="memname">void <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::dealloc </td>
           <td>(</td>
           <td class="paramtype">char *&#160;</td>
           <td class="paramname"><em>ptr</em></td><td>)</td>
@@ -238,7 +264,37 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae7121e9dcebfeb09a6a045d0
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00052">52</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8cpp_source.html#l00068">68</a> of file <a class="el" href="pool__allocator_8cpp_source.html">pool_allocator.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a811782e39e4b441b960bc35757af59c1" name="a811782e39e4b441b960bc35757af59c1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a811782e39e4b441b960bc35757af59c1">&#9670;&#160;</a></span>totalChunkCapacity()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;bool kThreadSafe&gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a>&lt; kThreadSafe &gt;::totalChunkCapacity </td>
+          <td>(</td>
+          <td class="paramname"></td><td>)</td>
+          <td> const</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+<p >Get the total capicity allocated in chunks (how many <a class="el" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">alloc()</a> could be called without triggering allocFunc() if all chunks were available) </p>
+
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8h_source.html#l00070">70</a> of file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
 
 </div>
 </div>
@@ -251,7 +307,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae7121e9dcebfeb09a6a045d0
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><b>dispenso</b></li><li class="navelem"><a class="el" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a></li>
+    <li class="navelem"><b>dispenso</b></li><li class="navelem"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT</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.5 </li>
   </ul>
 </div>
diff --git a/classdispenso_1_1_pool_allocator_t.js b/classdispenso_1_1_pool_allocator_t.js
new file mode 100644
index 0000000..75cedeb
--- /dev/null
+++ b/classdispenso_1_1_pool_allocator_t.js
@@ -0,0 +1,9 @@
+var classdispenso_1_1_pool_allocator_t =
+[
+    [ "PoolAllocatorT", "classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11", null ],
+    [ "~PoolAllocatorT", "classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60", null ],
+    [ "alloc", "classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036", null ],
+    [ "clear", "classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1", null ],
+    [ "dealloc", "classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d", null ],
+    [ "totalChunkCapacity", "classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1", null ]
+];
\ No newline at end of file
diff --git a/classdispenso_1_1_subgraph_t-members.html b/classdispenso_1_1_subgraph_t-members.html
index b99e851..f90b344 100644
--- a/classdispenso_1_1_subgraph_t-members.html
+++ b/classdispenso_1_1_subgraph_t-members.html
@@ -115,6 +115,7 @@
   <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>SubgraphT</b>()=delete (defined in <a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a>)</td><td class="entry"><a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a></td><td class="entry"></td></tr>
   <tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>SubgraphT</b>(const SubgraphT&lt; N &gt; &amp;)=delete (defined in <a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a>)</td><td class="entry"><a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a></td><td class="entry"></td></tr>
   <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>SubgraphT</b>(SubgraphT&lt; N &gt; &amp;&amp;other) (defined in <a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a>)</td><td class="entry"><a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
+  <tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>~SubgraphT</b>() (defined in <a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a>)</td><td class="entry"><a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT&lt; N &gt;</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/classdispenso_1_1_subgraph_t.html b/classdispenso_1_1_subgraph_t.html
index 2113664..dc38095 100644
--- a/classdispenso_1_1_subgraph_t.html
+++ b/classdispenso_1_1_subgraph_t.html
@@ -147,7 +147,7 @@
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class N&gt;<br />
 class dispenso::SubgraphT&lt; N &gt;</div>
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00399">399</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00401">401</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 </div><h2 class="groupheader">Member Typedef Documentation</h2>
 <a id="af6ea48c7d0d4d693d52fbbbd1dcddb00" name="af6ea48c7d0d4d693d52fbbbd1dcddb00"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af6ea48c7d0d4d693d52fbbbd1dcddb00">&#9670;&#160;</a></span>NodeType</h2>
@@ -163,7 +163,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#af6ea48c7d0d4d693d52fbbbd
       </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00401">401</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00403">403</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -194,7 +194,25 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1aeef3832453e131f9d331ba
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00405">405</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00407">407</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+
+</div>
+</div>
+<a id="a43f98c099c992040dec0e7a572ab61b1" name="a43f98c099c992040dec0e7a572ab61b1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a43f98c099c992040dec0e7a572ab61b1">&#9670;&#160;</a></span>~SubgraphT()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class N &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT</a>&lt; N &gt;::~<a class="el" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00068">68</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
 
 </div>
 </div>
@@ -235,7 +253,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a3f314f17214ede38225e89be
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>reference to the created node. </dd></dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00413">413</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00419">419</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -254,7 +272,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2e39c55d6e04462971f93f34
 </div><div class="memdoc">
 <p >Removes all dependency between nodes of this subgraph and other nodes, destroy this subgraph nodes. This is not concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00052">52</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8cpp_source.html#l00054">54</a> of file <a class="el" href="graph_8cpp_source.html">graph.cpp</a>.</p>
 
 </div>
 </div>
@@ -293,7 +311,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a747b7abd35505b2d8b8c2a95
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00457">457</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00463">463</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -332,7 +350,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a76da1c94b498111c70f98f95
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00445">445</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00451">451</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -369,7 +387,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a8ace42166b89031a0059a711
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00436">436</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00442">442</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -406,7 +424,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2e46a695042ae3675573a20d
   </dd>
 </dl>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00428">428</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00434">434</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -436,7 +454,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a90491dc1be17b0f2e35a8683
 </div><div class="memdoc">
 <p >Return number of nodes in subgraph. Concurrency safe. </p>
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00420">420</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00426">426</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
@@ -465,7 +483,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a5680370b96dd21e6c5424cb1
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00489">489</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="graph_8h_source.html#l00506">506</a> of file <a class="el" href="graph_8h_source.html">graph.h</a>.</p>
 
 </div>
 </div>
diff --git a/classes.html b/classes.html
index 6d95e04..beff3f4 100644
--- a/classes.html
+++ b/classes.html
@@ -133,7 +133,7 @@
 <dd><a class="el" href="classdispenso_1_1_once_function.html">OnceFunction</a> (dispenso)</dd></dl>
 <dl class="classindex even">
 <dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
-<dd><a class="el" href="classdispenso_1_1_parallel_for_executor.html">ParallelForExecutor</a> (dispenso)</dd><dd><a class="el" href="structdispenso_1_1_par_for_options.html">ParForOptions</a> (dispenso)</dd><dd><a class="el" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a> (dispenso)</dd></dl>
+<dd><a class="el" href="classdispenso_1_1_parallel_for_executor.html">ParallelForExecutor</a> (dispenso)</dd><dd><a class="el" href="structdispenso_1_1_par_for_options.html">ParForOptions</a> (dispenso)</dd><dd><a class="el" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT</a> (dispenso)</dd></dl>
 <dl class="classindex odd">
 <dt class="alphachar"><a id="letter_R" name="letter_R">R</a></dt>
 <dd><a class="el" href="structdispenso_1_1_reserve_tag_s.html">ReserveTagS</a> (dispenso)</dd><dd><a class="el" href="classdispenso_1_1_resource.html">Resource</a> (dispenso)</dd><dd><a class="el" href="classdispenso_1_1_resource_pool.html">ResourcePool</a> (dispenso)</dd><dd><a class="el" href="classdispenso_1_1_r_w_lock.html">RWLock</a> (dispenso)</dd></dl>
diff --git a/functions.html b/functions.html
index c575852..0f5558e 100644
--- a/functions.html
+++ b/functions.html
@@ -102,7 +102,7 @@ <h3><a id="index_a" name="index_a"></a>- a -</h3><ul>
 <li>acquire()&#160;:&#160;<a class="el" href="classdispenso_1_1_resource_pool.html#aa3dfd898745a3d729f6ab66311ffd443">dispenso::ResourcePool&lt; T &gt;</a></li>
 <li>addNode()&#160;:&#160;<a class="el" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">dispenso::SubgraphT&lt; N &gt;</a></li>
 <li>addSubgraph()&#160;:&#160;<a class="el" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">dispenso::GraphT&lt; N &gt;</a></li>
-<li>alloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">dispenso::PoolAllocator</a></li>
+<li>alloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>arrive_and_wait()&#160;:&#160;<a class="el" href="classdispenso_1_1_latch.html#a20d9a291572a64adf4cb2c419f195292">dispenso::Latch</a></li>
 <li>assign()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a26c0082215b34bbeaab95524ac504b18">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>at()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#aeae05d2a976749f555fba34f37707aa4">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
diff --git a/functions_c.html b/functions_c.html
index 3bee8ef..d84ecf7 100644
--- a/functions_c.html
+++ b/functions_c.html
@@ -106,7 +106,7 @@ <h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
 <li>cbegin()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a8157ca262ec71edddb03db8ad05f2b52">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>cend()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a699a704e271c79bf9a3d537b4a090607">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>ChunkedRange()&#160;:&#160;<a class="el" href="structdispenso_1_1_chunked_range.html#a644b2269aed883922db39c928a009b16">dispenso::ChunkedRange&lt; IntegerT &gt;</a></li>
-<li>clear()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a>, <a class="el" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT&lt; N &gt;</a></li>
+<li>clear()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a>, <a class="el" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT&lt; N &gt;</a></li>
 <li>completed()&#160;:&#160;<a class="el" href="classdispenso_1_1_completion_event.html#aadf4486fc37923878b4d732f0a7f47f4">dispenso::CompletionEvent</a></li>
 <li>ConcurrentObjectArena()&#160;:&#160;<a class="el" href="structdispenso_1_1_concurrent_object_arena.html#ac2e855dc6e3e325e4b9dff88de2ad597">dispenso::ConcurrentObjectArena&lt; T, Index, alignment &gt;</a></li>
 <li>ConcurrentTaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#a5e48f4df33cd5cf87b3973ffb9153f16">dispenso::ConcurrentTaskSet</a></li>
diff --git a/functions_d.html b/functions_d.html
index b7f5611..e124be8 100644
--- a/functions_d.html
+++ b/functions_d.html
@@ -99,7 +99,7 @@
 <div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
 
 <h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
-<li>dealloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dispenso::PoolAllocator</a></li>
+<li>dealloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>default_capacity()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a8ce7e4f78d13c0660b9de99ac96a11df">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>defaultChunking&#160;:&#160;<a class="el" href="structdispenso_1_1_par_for_options.html#a2cfd7b948697c97874c727940529d1d8">dispenso::ParForOptions</a></li>
 <li>dependsOn()&#160;:&#160;<a class="el" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dispenso::Node</a></li>
diff --git a/functions_func.html b/functions_func.html
index 6d614da..ece7103 100644
--- a/functions_func.html
+++ b/functions_func.html
@@ -102,7 +102,7 @@ <h3><a id="index_a" name="index_a"></a>- a -</h3><ul>
 <li>acquire()&#160;:&#160;<a class="el" href="classdispenso_1_1_resource_pool.html#aa3dfd898745a3d729f6ab66311ffd443">dispenso::ResourcePool&lt; T &gt;</a></li>
 <li>addNode()&#160;:&#160;<a class="el" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">dispenso::SubgraphT&lt; N &gt;</a></li>
 <li>addSubgraph()&#160;:&#160;<a class="el" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">dispenso::GraphT&lt; N &gt;</a></li>
-<li>alloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">dispenso::PoolAllocator</a></li>
+<li>alloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>arrive_and_wait()&#160;:&#160;<a class="el" href="classdispenso_1_1_latch.html#a20d9a291572a64adf4cb2c419f195292">dispenso::Latch</a></li>
 <li>assign()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a26c0082215b34bbeaab95524ac504b18">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>at()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#aeae05d2a976749f555fba34f37707aa4">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
@@ -124,7 +124,7 @@ <h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
 <li>cbegin()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a8157ca262ec71edddb03db8ad05f2b52">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>cend()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a699a704e271c79bf9a3d537b4a090607">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>ChunkedRange()&#160;:&#160;<a class="el" href="structdispenso_1_1_chunked_range.html#a644b2269aed883922db39c928a009b16">dispenso::ChunkedRange&lt; IntegerT &gt;</a></li>
-<li>clear()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a>, <a class="el" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT&lt; N &gt;</a></li>
+<li>clear()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a>, <a class="el" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT&lt; N &gt;</a>, <a class="el" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a>, <a class="el" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT&lt; N &gt;</a></li>
 <li>completed()&#160;:&#160;<a class="el" href="classdispenso_1_1_completion_event.html#aadf4486fc37923878b4d732f0a7f47f4">dispenso::CompletionEvent</a></li>
 <li>ConcurrentObjectArena()&#160;:&#160;<a class="el" href="structdispenso_1_1_concurrent_object_arena.html#ac2e855dc6e3e325e4b9dff88de2ad597">dispenso::ConcurrentObjectArena&lt; T, Index, alignment &gt;</a></li>
 <li>ConcurrentTaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#a5e48f4df33cd5cf87b3973ffb9153f16">dispenso::ConcurrentTaskSet</a></li>
@@ -134,7 +134,7 @@ <h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
 
 
 <h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
-<li>dealloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dispenso::PoolAllocator</a></li>
+<li>dealloc()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>default_capacity()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a8ce7e4f78d13c0660b9de99ac96a11df">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>dependsOn()&#160;:&#160;<a class="el" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dispenso::Node</a></li>
 <li>detach()&#160;:&#160;<a class="el" href="classdispenso_1_1_timed_task.html#a310952e54d6daf1add1cbbe4c690c8f9">dispenso::TimedTask</a></li>
@@ -204,7 +204,7 @@ <h3><a id="index_o" name="index_o"></a>- o -</h3><ul>
 
 
 <h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
-<li>PoolAllocator()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">dispenso::PoolAllocator</a></li>
+<li>PoolAllocatorT()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>pop_back()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a6df17279a0127ce60af3abb56121678b">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>push_back()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a0cc5821267defcaf8eaec2bb77ae19ff">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 </ul>
@@ -241,6 +241,7 @@ <h3><a id="index_t" name="index_t"></a>- t -</h3><ul>
 <li>then()&#160;:&#160;<a class="el" href="classdispenso_1_1_future.html#aac1d6623d69295fc0a2d72fac46aebaf">dispenso::Future&lt; Result &gt;</a></li>
 <li>ThreadPool()&#160;:&#160;<a class="el" href="classdispenso_1_1_thread_pool.html#a2442016e8a4924ca665d3993c1879b4d">dispenso::ThreadPool</a></li>
 <li>TimedTaskScheduler()&#160;:&#160;<a class="el" href="classdispenso_1_1_timed_task_scheduler.html#afda120b230ff030f8f9af68c6f7899bc">dispenso::TimedTaskScheduler</a></li>
+<li>totalChunkCapacity()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>try_wait()&#160;:&#160;<a class="el" href="classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f">dispenso::Latch</a></li>
 <li>tryEmplaceUpdate()&#160;:&#160;<a class="el" href="classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d">dispenso::AsyncRequest&lt; T &gt;</a></li>
 <li>tryWait()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad">dispenso::ConcurrentTaskSet</a>, <a class="el" href="classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5">dispenso::TaskSet</a></li>
@@ -270,7 +271,7 @@ <h3><a id="index__7E" name="index__7E"></a>- ~ -</h3><ul>
 <li>~ConcurrentTaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#aaf3fa4c1b3da5fe5c542aa161dcf9478">dispenso::ConcurrentTaskSet</a></li>
 <li>~ConcurrentVector()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#af180093482b0fdd9c89c1157cab07d5d">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>~Future()&#160;:&#160;<a class="el" href="classdispenso_1_1_future.html#a14d27f2276dedd9e4e6d17b6fcfdb74f">dispenso::Future&lt; Result &gt;</a></li>
-<li>~PoolAllocator()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">dispenso::PoolAllocator</a></li>
+<li>~PoolAllocatorT()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>~ResourcePool()&#160;:&#160;<a class="el" href="classdispenso_1_1_resource_pool.html#a72c23146a6e1d6fdb38ec623f11106dd">dispenso::ResourcePool&lt; T &gt;</a></li>
 <li>~TaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_task_set.html#a2fbdd27aa8ffcb216e51f45aad709f12">dispenso::TaskSet</a></li>
 <li>~ThreadPool()&#160;:&#160;<a class="el" href="classdispenso_1_1_thread_pool.html#acd886dd712424330935b64959e8188af">dispenso::ThreadPool</a></li>
diff --git a/functions_p.html b/functions_p.html
index 759266f..c6f92c0 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -99,7 +99,7 @@
 <div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
 
 <h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
-<li>PoolAllocator()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">dispenso::PoolAllocator</a></li>
+<li>PoolAllocatorT()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>pop_back()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a6df17279a0127ce60af3abb56121678b">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>push_back()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#a0cc5821267defcaf8eaec2bb77ae19ff">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 </ul>
diff --git a/functions_t.html b/functions_t.html
index 7afa5cc..b9c4382 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -103,6 +103,7 @@ <h3><a id="index_t" name="index_t"></a>- t -</h3><ul>
 <li>then()&#160;:&#160;<a class="el" href="classdispenso_1_1_future.html#aac1d6623d69295fc0a2d72fac46aebaf">dispenso::Future&lt; Result &gt;</a></li>
 <li>ThreadPool()&#160;:&#160;<a class="el" href="classdispenso_1_1_thread_pool.html#a2442016e8a4924ca665d3993c1879b4d">dispenso::ThreadPool</a></li>
 <li>TimedTaskScheduler()&#160;:&#160;<a class="el" href="classdispenso_1_1_timed_task_scheduler.html#afda120b230ff030f8f9af68c6f7899bc">dispenso::TimedTaskScheduler</a></li>
+<li>totalChunkCapacity()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>try_wait()&#160;:&#160;<a class="el" href="classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f">dispenso::Latch</a></li>
 <li>tryEmplaceUpdate()&#160;:&#160;<a class="el" href="classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d">dispenso::AsyncRequest&lt; T &gt;</a></li>
 <li>tryWait()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad">dispenso::ConcurrentTaskSet</a>, <a class="el" href="classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5">dispenso::TaskSet</a></li>
diff --git a/functions_~.html b/functions_~.html
index 3a2bd20..8f84990 100644
--- a/functions_~.html
+++ b/functions_~.html
@@ -102,7 +102,7 @@ <h3><a id="index__7E" name="index__7E"></a>- ~ -</h3><ul>
 <li>~ConcurrentTaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_task_set.html#aaf3fa4c1b3da5fe5c542aa161dcf9478">dispenso::ConcurrentTaskSet</a></li>
 <li>~ConcurrentVector()&#160;:&#160;<a class="el" href="classdispenso_1_1_concurrent_vector.html#af180093482b0fdd9c89c1157cab07d5d">dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;</a></li>
 <li>~Future()&#160;:&#160;<a class="el" href="classdispenso_1_1_future.html#a14d27f2276dedd9e4e6d17b6fcfdb74f">dispenso::Future&lt; Result &gt;</a></li>
-<li>~PoolAllocator()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">dispenso::PoolAllocator</a></li>
+<li>~PoolAllocatorT()&#160;:&#160;<a class="el" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></li>
 <li>~ResourcePool()&#160;:&#160;<a class="el" href="classdispenso_1_1_resource_pool.html#a72c23146a6e1d6fdb38ec623f11106dd">dispenso::ResourcePool&lt; T &gt;</a></li>
 <li>~TaskSet()&#160;:&#160;<a class="el" href="classdispenso_1_1_task_set.html#a2fbdd27aa8ffcb216e51f45aad709f12">dispenso::TaskSet</a></li>
 <li>~ThreadPool()&#160;:&#160;<a class="el" href="classdispenso_1_1_thread_pool.html#acd886dd712424330935b64959e8188af">dispenso::ThreadPool</a></li>
diff --git a/graph_8cpp_source.html b/graph_8cpp_source.html
index 31ee3c4..abda1e8 100644
--- a/graph_8cpp_source.html
+++ b/graph_8cpp_source.html
@@ -107,141 +107,204 @@
 <div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> */</span></div>
 <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;dispenso/graph.h&gt;</span></div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
-<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span>{</div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kToDelete = std::numeric_limits&lt;size_t&gt;::max();</div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">void</span> set_union(</div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s1,</div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keyword">const</span> std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s2) {</div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>  std::vector&lt;const dispenso::BiPropNode*&gt; tmp(s1);</div>
-<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>  s1.clear();</div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  std::set_union(tmp.cbegin(), tmp.cend(), s2.cbegin(), s2.cend(), std::back_inserter(s1));</div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>}</div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keywordtype">void</span> set_insert(std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s, <span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a>* node) {</div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  <span class="keyword">auto</span> it = std::upper_bound(s.begin(), s.end(), node);</div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  <span class="keywordflow">if</span> (it == s.begin() || *(it - 1) != node) {</div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    s.insert(it, node);</div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  }</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>} <span class="comment">// anonymous namespace</span></div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span>dispenso {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iterator&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;mutex&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kToDelete = std::numeric_limits&lt;size_t&gt;::max();</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keywordtype">void</span> set_union(</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s1,</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keyword">const</span> std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s2) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  std::vector&lt;const dispenso::BiPropNode*&gt; tmp(s1);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>  s1.clear();</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>  std::set_union(tmp.cbegin(), tmp.cend(), s2.cbegin(), s2.cend(), std::back_inserter(s1));</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>}</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">void</span> set_insert(std::vector&lt;const dispenso::BiPropNode*&gt;&amp; s, <span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a>* node) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  <span class="keyword">auto</span> it = std::upper_bound(s.begin(), s.end(), node);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  <span class="keywordflow">if</span> (it == s.begin() || *(it - 1) != node) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    s.insert(it, node);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>} <span class="comment">// anonymous namespace</span></div>
 <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">void</span> BiPropNode::biPropDependsOnOneNode(BiPropNode&amp; node) {</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>  Node::dependsOnOneNode(node);</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>  <span class="keywordflow">if</span> (node.biPropSet_ == <span class="keyword">nullptr</span> &amp;&amp; biPropSet_ == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    biPropSet_ = std::make_shared&lt;std::vector&lt;const BiPropNode*&gt;&gt;();</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    set_insert(*biPropSet_, <span class="keyword">this</span>);</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    set_insert(*biPropSet_, &amp;node);</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    node.biPropSet_ = biPropSet_;</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node.biPropSet_ != <span class="keyword">nullptr</span> &amp;&amp; biPropSet_ != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    set_union(*biPropSet_, *node.biPropSet_);</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    node.biPropSet_ = biPropSet_;</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (biPropSet_ == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    biPropSet_ = node.biPropSet_;</div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    set_insert(*biPropSet_, <span class="keyword">this</span>);</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    node.biPropSet_ = biPropSet_;</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    set_insert(*biPropSet_, &amp;node);</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  }</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">   52</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">SubgraphT&lt;N&gt;::clear</a>() {</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>  decrementDependentCounters();</div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numGraphPredecessors = markNodesWithPredicessors();</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  <span class="keywordflow">if</span> (numGraphPredecessors != 0) {</div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    removePredecessorDependencies(numGraphPredecessors);</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  }</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  nodes_.clear();</div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;::decrementDependentCounters</a>() {</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>  <span class="keywordflow">for</span> (N&amp; node : nodes_) {</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>* <span class="keyword">const</span> dependent : node.dependents_) {</div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>      dependent-&gt;numPredecessors_--;</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    removeNodeFromBiPropSet(node);</div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  }</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="keywordtype">size_t</span> SubgraphT&lt;N&gt;::markNodesWithPredicessors() {</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  <span class="keywordtype">size_t</span> numGraphPredecessors = 0;</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  <span class="keywordflow">for</span> (N&amp; node : nodes_) {</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">if</span> (node.numPredecessors_ != 0) {</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>      numGraphPredecessors += node.numPredecessors_;</div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>      node.numPredecessors_ = kToDelete;</div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  }</div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  <span class="keywordflow">return</span> numGraphPredecessors;</div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keywordtype">void</span> SubgraphT&lt;N&gt;::removePredecessorDependencies(<span class="keywordtype">size_t</span> numGraphPredecessors) {</div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>  <span class="keywordflow">for</span> (SubgraphT&lt;N&gt;&amp; subgraph : graph_-&gt;subgraphs_) {</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">if</span> (&amp;subgraph == <span class="keyword">this</span>) {</div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>      <span class="keywordflow">continue</span>;</div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    }</div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">for</span> (N&amp; node : subgraph.nodes_) {</div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>      std::vector&lt;Node*&gt;&amp; dependents = node.dependents_;</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>      <span class="keywordtype">size_t</span> num = dependents.size();</div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>      <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num;) {</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">if</span> (dependents[i]-&gt;numPredecessors_ == kToDelete) {</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>          dependents[i] = dependents[num - 1];</div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>          --num;</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>          <span class="keywordflow">if</span> (--numGraphPredecessors == 0) {</div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            dependents.resize(num);</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>          }</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>          i++;</div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>      }</div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>      dependents.resize(num);</div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    }</div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  }</div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#aa66b84b339d030b305b58f676094d121">  110</a></span><a class="code hl_function" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">GraphT&lt;N&gt;::GraphT</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;&amp; other) : subgraphs_(std::move(other.subgraphs_)) {</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    subgraph.graph_ = <span class="keyword">this</span>;</div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  }</div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#aa2ee3104f142782e0c5aa5a689f87ddd">  117</a></span><a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp; <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;::operator=</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp;&amp; other) {</div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  subgraphs_ = std::move(other.subgraphs_);</div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    subgraph.graph_ = <span class="keyword">this</span>;</div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>  }</div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">  126</a></span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">GraphT&lt;N&gt;::addSubgraph</a>() {</div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>  subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph = subgraphs_.back();</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  <span class="keywordflow">return</span> subgraph;</div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}</div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;Node&gt;</a>;</div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;BiPropNode&gt;</a>;</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;Node&gt;</a>;</div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;BiPropNode&gt;</a>;</div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>} <span class="comment">// namespace dispenso</span></div>
-<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00356">graph.h:356</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html"><div class="ttname"><a href="classdispenso_1_1_graph_t.html">dispenso::GraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00493">graph.h:493</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a7e18b24fe123bfac828e3b996c774cd7"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">dispenso::GraphT::GraphT</a></div><div class="ttdeci">GraphT()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00498">graph.h:502</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_adf47c5ba380b61e20df7ec680a1cca43"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">dispenso::GraphT::addSubgraph</a></div><div class="ttdeci">SubgraphT&lt; N &gt; &amp; addSubgraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00126">graph.cpp:126</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html"><div class="ttname"><a href="classdispenso_1_1_node.html">dispenso::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00219">graph.h:219</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00399">graph.h:399</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a2e39c55d6e04462971f93f349c5be3fe"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00052">graph.cpp:52</a></div></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span>dispenso {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keywordtype">void</span> BiPropNode::biPropDependsOnOneNode(BiPropNode&amp; node) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>  Node::dependsOnOneNode(node);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  <span class="keywordflow">if</span> (node.biPropSet_ == <span class="keyword">nullptr</span> &amp;&amp; biPropSet_ == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    biPropSet_ = std::make_shared&lt;std::vector&lt;const BiPropNode*&gt;&gt;();</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    set_insert(*biPropSet_, <span class="keyword">this</span>);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    set_insert(*biPropSet_, &amp;node);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    node.biPropSet_ = biPropSet_;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node.biPropSet_ != <span class="keyword">nullptr</span> &amp;&amp; biPropSet_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    set_union(*biPropSet_, *node.biPropSet_);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    node.biPropSet_ = biPropSet_;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (biPropSet_ == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    biPropSet_ = node.biPropSet_;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    set_insert(*biPropSet_, <span class="keyword">this</span>);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    node.biPropSet_ = biPropSet_;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    set_insert(*biPropSet_, &amp;node);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">   54</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">SubgraphT&lt;N&gt;::clear</a>() {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  decrementDependentCounters();</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numGraphPredecessors = markNodesWithPredicessors();</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  <span class="keywordflow">if</span> (numGraphPredecessors != 0) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    removePredecessorDependencies(numGraphPredecessors);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>  }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>  <span class="keywordflow">for</span> (NodeType* n : nodes_) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    n-&gt;~NodeType();</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>  }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>  allocator_-&gt;clear();</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>  nodes_.clear();</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;::~SubgraphT</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="keywordflow">for</span> (NodeType* n : nodes_) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    n-&gt;~NodeType();</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="keywordtype">void</span> SubgraphT&lt;N&gt;::decrementDependentCounters() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="keywordflow">for</span> (N* node : nodes_) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (Node* <span class="keyword">const</span> dependent : node-&gt;dependents_) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>      dependent-&gt;numPredecessors_--;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    removeNodeFromBiPropSet(node);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>  }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keywordtype">size_t</span> SubgraphT&lt;N&gt;::markNodesWithPredicessors() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  <span class="keywordtype">size_t</span> numGraphPredecessors = 0;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keywordflow">for</span> (N* node : nodes_) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">if</span> (node-&gt;numPredecessors_ != 0) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>      numGraphPredecessors += node-&gt;numPredecessors_;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>      node-&gt;numPredecessors_ = kToDelete;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  <span class="keywordflow">return</span> numGraphPredecessors;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="keywordtype">void</span> SubgraphT&lt;N&gt;::removePredecessorDependencies(<span class="keywordtype">size_t</span> numGraphPredecessors) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  <span class="keywordflow">for</span> (SubgraphT&lt;N&gt;&amp; subgraph : graph_-&gt;subgraphs_) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">if</span> (&amp;subgraph == <span class="keyword">this</span>) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>      <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">for</span> (N* node : subgraph.nodes_) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>      std::vector&lt;Node*&gt;&amp; dependents = node-&gt;dependents_;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>      <span class="keywordtype">size_t</span> num = dependents.size();</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>      <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num;) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">if</span> (dependents[i]-&gt;numPredecessors_ == kToDelete) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>          dependents[i] = dependents[num - 1];</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>          --num;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>          <span class="keywordflow">if</span> (--numGraphPredecessors == 0) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            dependents.resize(num);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>          }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>          i++;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>      }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>      dependents.resize(num);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kMaxCache = 8;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment">// Don&#39;t cache too-large allocators.  This way we will have at most 8*(2**16) = 512K outstanding</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment">// nodes worth of memory per node type.</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment">// TODO(bbudge): Make these caching values macro configurable for lightweight platforms.</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kMaxChunkCapacity = 1 &lt;&lt; 16;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>std::vector&lt;std::unique_ptr&lt;NoLockPoolAllocator&gt;&gt; g_sgcache[2];</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>std::mutex g_sgcacheMtx;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kCacheIndex = <span class="keywordtype">size_t</span>{std::is_same&lt;T, BiPropNode&gt;::value};</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>} <span class="comment">// namespace</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="keyword">typename</span> SubgraphT&lt;N&gt;::PoolPtr SubgraphT&lt;N&gt;::getAllocator() {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  std::unique_ptr&lt;NoLockPoolAllocator&gt; ptr;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <span class="keyword">auto</span>&amp; cache = g_sgcache[kCacheIndex&lt;N&gt;];</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>  {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::lock_guard&lt;std::mutex&gt; lk(g_sgcacheMtx);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">if</span> (cache.empty()) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>      ptr = std::make_unique&lt;NoLockPoolAllocator&gt;(</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>          <span class="keyword">sizeof</span>(NodeType), 128 * <span class="keyword">sizeof</span>(NodeType), ::malloc, ::free);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>      ptr = std::move(cache.back());</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>      ptr-&gt;clear();</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>      cache.pop_back();</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>  }</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>  <span class="keywordflow">return</span> PoolPtr(ptr.release(), releaseAllocator);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>}</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="keywordtype">void</span> SubgraphT&lt;N&gt;::releaseAllocator(NoLockPoolAllocator* ptr) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>  <span class="keywordflow">if</span> (!ptr) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>  }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>  <span class="keywordflow">if</span> (ptr-&gt;totalChunkCapacity() &lt; kMaxChunkCapacity) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keyword">auto</span>&amp; cache = g_sgcache[kCacheIndex&lt;N&gt;];</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>      std::lock_guard&lt;std::mutex&gt; lk(g_sgcacheMtx);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>      <span class="keywordflow">if</span> (cache.size() &lt; kMaxCache) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        cache.emplace_back(ptr);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>      }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>  }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>  <span class="keyword">delete</span> ptr;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#aa66b84b339d030b305b58f676094d121">  175</a></span><a class="code hl_function" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">GraphT&lt;N&gt;::GraphT</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;&amp; other) : subgraphs_(std::move(other.subgraphs_)) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>  <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    subgraph.graph_ = <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>  }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#aa2ee3104f142782e0c5aa5a689f87ddd">  182</a></span><a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp; <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;::operator=</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp;&amp; other) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>  subgraphs_ = std::move(other.subgraphs_);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>  <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    subgraph.graph_ = <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>  }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">  191</a></span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">GraphT&lt;N&gt;::addSubgraph</a>() {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>  subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>  <span class="keywordflow">return</span> subgraphs_.back();</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>}</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;Node&gt;</a>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;BiPropNode&gt;</a>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;Node&gt;</a>;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="keyword">template</span> <span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;BiPropNode&gt;</a>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>} <span class="comment">// namespace dispenso</span></div>
+<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00358">graph.h:358</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html"><div class="ttname"><a href="classdispenso_1_1_graph_t.html">dispenso::GraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00510">graph.h:510</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a7e18b24fe123bfac828e3b996c774cd7"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">dispenso::GraphT::GraphT</a></div><div class="ttdeci">GraphT()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00515">graph.h:519</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_adf47c5ba380b61e20df7ec680a1cca43"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">dispenso::GraphT::addSubgraph</a></div><div class="ttdeci">SubgraphT&lt; N &gt; &amp; addSubgraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00191">graph.cpp:191</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00401">graph.h:401</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a2e39c55d6e04462971f93f349c5be3fe"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00054">graph.cpp:54</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/graph_8h_source.html b/graph_8h_source.html
index 7f67718..f2c0e25 100644
--- a/graph_8h_source.html
+++ b/graph_8h_source.html
@@ -108,523 +108,541 @@
 <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#pragma once</span></div>
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;dispenso/platform.h&gt;</span></div>
-<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;<a class="code" href="small__buffer__allocator_8h.html">dispenso/small_buffer_allocator.h</a>&gt;</span></div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;atomic&gt;</span></div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;deque&gt;</span></div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
-<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">/*</span></div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">Terminology</span></div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">--------------------------------------------------------------------------------</span></div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">The Node depends on the predecessor. The dependent depends on the node.</span></div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">┌─────────────┐     ┌──────┐     ┌───────────┐</span></div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">│ predecessor │ ──▶ │ node │ ──▶ │ dependent │</span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">└─────────────┘     └──────┘     └───────────┘</span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"></span> </div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment">Graph construction</span></div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">--------------------------------------------------------------------------------</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment">The Graph class can be used to created tasks with dependencies and execute it once.</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">Graphs must not contain cycles.</span></div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">Example:</span></div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">//</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">//   ┌────────────┐     ┌───────────────┐     ┌───────────────────┐</span></div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">//   │ 0: r[0]+=1 │ ──▶ │ 1: r[1]=r[0]*2│ ──▶ │ 4: r[4]=r[1]+r[3] │</span></div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">//   └────────────┘     └───────────────┘     └───────────────────┘</span></div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">//                                              ▲</span></div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">//   ┌────────────┐     ┌───────────────┐       │</span></div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">//   │ 2: r[2]+=8 │ ──▶ │ 3: r[3]=r[2]/2│ ──────┘</span></div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">//   └────────────┘     └───────────────┘</span></div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"></span> </div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">std::array&lt;float, 5&gt; r;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;atomic&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;deque&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;dispenso/platform.h&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;<a class="code" href="pool__allocator_8h.html">dispenso/pool_allocator.h</a>&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;<a class="code" href="small__buffer__allocator_8h.html">dispenso/small_buffer_allocator.h</a>&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">Terminology</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">--------------------------------------------------------------------------------</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">The Node depends on the predecessor. The dependent depends on the node.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">┌─────────────┐     ┌──────┐     ┌───────────┐</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">│ predecessor │ ──▶ │ node │ ──▶ │ dependent │</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">└─────────────┘     └──────┘     └───────────┘</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"></span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment">Graph construction</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">--------------------------------------------------------------------------------</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">The Graph class can be used to created tasks with dependencies and execute it once.</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">Graphs must not contain cycles.</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">Example:</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">//</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">//   ┌────────────┐     ┌───────────────┐     ┌───────────────────┐</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">//   │ 0: r[0]+=1 │ ──▶ │ 1: r[1]=r[0]*2│ ──▶ │ 4: r[4]=r[1]+r[3] │</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">//   └────────────┘     └───────────────┘     └───────────────────┘</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">//                                              ▲</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">//   ┌────────────┐     ┌───────────────┐       │</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment">//   │ 2: r[2]+=8 │ ──▶ │ 3: r[3]=r[2]/2│ ──────┘</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">//   └────────────┘     └───────────────┘</span></div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"></span> </div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">dispenso::Graph graph;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">std::array&lt;float, 5&gt; r;</span></div>
 <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"></span> </div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">dispenso::Node&amp; N0 = graph.addNode([&amp;]() { r[0] += 1; });</span></div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">dispenso::Node&amp; N2 = graph.addNode([&amp;]() { r[2] += 8; });</span></div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">dispenso::Node&amp; N1 = graph.addNode([&amp;]() { r[1] += r[0] * 2; });</span></div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">dispenso::Node&amp; N3 = graph.addNode([&amp;]() { r[3] += r[2] / 2; });</span></div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">dispenso::Node&amp; N4 = graph.addNode([&amp;]() { r[4] += r[1] + r[3]; });</span></div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"></span> </div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">N4.dependsOn(N1, N3);</span></div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">N1.dependsOn(N0);</span></div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">N3.dependsOn(N2);</span></div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"></span> </div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">dispenso::TaskSet taskSet(dispenso::globalThreadPool());</span></div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">dispenso::ParallelForExecutor parallelForExecutor;</span></div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">parallelForExecutor(taskSet, graph);</span></div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment"></span> </div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">Partial revaluation</span></div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">--------------------------------------------------------------------------------</span></div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">If graph is big or we need to recompute graph partially we can execute it again.</span></div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">After execution of the graph all nodes change their state from &quot;incomplete&quot; to</span></div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">&quot;completed&quot;. If order to evaluate whole graph again we can use function `setAllNodesIncomplete`</span></div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">Example:</span></div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">r = {0, 0, 0, 0, 0};</span></div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">setAllNodesIncomplete(graph);</span></div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">parallelForExecutor(taskSet, graph);</span></div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment"></span> </div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment">The graph can be recomputed partially if we have new input data for one or several nodes in the</span></div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment">graph. It order to do it we need to call `setIncomplete()` method for every node which we need to</span></div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment">recompute and after use functor `ForwardPropagator` to mark as &quot;incomplete&quot; all dependents.</span></div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment"></span> </div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">Example:</span></div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">N1.setIncomplete();</span></div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment">r[1] = r[4] = 0;</span></div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment">ForwardPropagator forwardPropagator;</span></div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment">forwardPropagator(graph);</span></div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment">evaluateGraph(graph);</span></div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment">In this exaple only node 1 and 4 will be invoked.</span></div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"></span> </div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment"> Subgraphs</span></div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment">--------------------------------------------------------------------------------</span></div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment">It is possible to organize nodes into subgraphs and destroy and recreate if we have static and</span></div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">dynamic parts of the computation graph</span></div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">Example:</span></div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">//</span></div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">// ∙----subgraph1---∙ ∙---subgraph2-------∙</span></div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">// ¦ ┌────────────┐ ¦ ¦ ┌───────────────┐ ¦   ┌───────────────────┐</span></div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">// ¦ │ 0: r[0]+=1 │ ──▶ │ 1: r[1]=r[0]*2│ ──▶ │ 4: r[4]=r[1]+r[3] │</span></div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">// ¦ └────────────┘ ¦ ¦ └───────────────┘ ¦   └───────────────────┘</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">// ¦                ¦ ¦                   ¦     ▲</span></div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment">// ¦ ┌────────────┐ ¦ ¦ ┌───────────────┐ ¦     │</span></div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment">// ¦ │ 2: r[2]+=8 │ ──▶ │ 3: r[3]=r[2]/2│ ──────┘</span></div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment">// ¦ └────────────┘ ¦ ¦ └───────────────┘ ¦</span></div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment">// ∙----------------∙ ∙-------------------∙</span></div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="comment">std::array&lt;float, 5&gt; r;</span></div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment">dispenso::Graph graph;</span></div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment"></span> </div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">dispenso::Subgraph&amp; subgraph1 = graph.addSubgraph();</span></div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment">dispenso::Subgraph&amp; subgraph2 = graph.addSubgraph();</span></div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment"></span> </div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">dispenso::Node&amp; N0 = subgraph1.addNode([&amp;]() { r[0] += 1; });</span></div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">dispenso::Node&amp; N2 = subgraph1.addNode([&amp;]() { r[2] += 8; });</span></div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">dispenso::Node&amp; N1 = subgraph2.addNode([&amp;]() { r[1] += r[0] * 2; });</span></div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">dispenso::Node&amp; N3 = subgraph2.addNode([&amp;]() { r[3] += r[2] / 2; });</span></div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment">dispenso::Node&amp; N4 = graph.addNode([&amp;]() { r[4] += r[1] + r[3]; });</span></div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment"></span> </div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="comment">N4.dependsOn(N1, N3);</span></div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment">N1.dependsOn(N0);</span></div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="comment">N3.dependsOn(N2);</span></div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment"></span> </div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">// evaluate graph first time</span></div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">r = {0, 0, 0, 0, 0};</span></div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment">dispenso::ConcurrentTaskSet concurrentTaskSet(dispenso::globalThreadPool());</span></div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment">dispenso::ConcurrentTaskSetExecutor concurrentTaskSetExecutor;</span></div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, graph);</span></div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment"></span> </div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment">// disconnect and destroy nodes of subgraph2</span></div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment">// it invalidates node references/pointers of this subgraph</span></div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment">subgraph2.clear();</span></div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment"></span> </div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment">// create another nodes</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">dispenso::Node&amp; newN1 = subgraph2.addNode([&amp;]() { r[1] += r[0] * 20; });</span></div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">dispenso::Node&amp; newN3 = subgraph2.addNode([&amp;]() { r[3] += r[2] / 20; });</span></div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">newN1.dependsOn(N0);</span></div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">newN3.dependsOn(N2);</span></div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">N4.dependsOn(newN1, newN3);</span></div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment"></span> </div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">// and revaluae the graph</span></div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment">setAllNodesIncomplete(movedGraph);</span></div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, graph);</span></div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment"></span> </div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">Bidirectional propagation dependency</span></div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">--------------------------------------------------------------------------------</span></div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">In certain scenarios, nodes may alter the same memory. In such instances, it becomes necessary to</span></div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">compute the predecessors of the node, even if they possess a &quot;completed&quot; state following state</span></div>
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="comment">propagation. To facilitate this process automatically, we introduce the notion of a bidirectional</span></div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="comment">propagation dependency (`BiProp`).</span></div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="comment"></span> </div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="comment">Example:</span></div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="comment">//                     ┌─────────────────┐</span></div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">//                     │ 3: m3+=b*b      │</span></div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment">//                     └─────────────────┘</span></div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">//                       ▲</span></div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="comment">// ┌−-----------−−−−−−−−−│−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−┐</span></div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="comment">// ╎ ┌───────────┐     ┌─────────────────┐     ┌────────────┐ ╎</span></div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="comment">// ╎ │  0: b+=5  │ ──▷ │     1: b*=5     │ ──▷ │ 2: b/=m4   │ ╎</span></div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment">// ╎ └───────────┘     └─────────────────┘     └────────────┘ ╎</span></div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment">// └−−−-−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−▲−−−−−−−−−−−−┘</span></div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment">//  Legend:                                      │</span></div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment">//  ──▶ Normal dependency                      ┌────────────┐</span></div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment">//  ──▷ Bidirectional propagation dependency   │ 4: m4+=2   │</span></div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="comment">//  m4  variable modified only in node 4       └────────────┘</span></div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment"></span> </div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment">float  b,  m3, m4</span></div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment">dispenso::BiPropGraph g;</span></div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment">std::array&lt;dispenso::BiPropNode*, 8&gt; N;</span></div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="comment"></span> </div>
-<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="comment">dispenso::BiPropNode&amp; N0 = g.addNode([&amp;]() { b += 5; });</span></div>
-<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="comment">dispenso::BiPropNode&amp; N1 = g.addNode([&amp;]() { b *= 5; });</span></div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment">dispenso::BiPropNode&amp; N2 = g.addNode([&amp;]() { b /= m4; });</span></div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment">dispenso::BiPropNode&amp; N3 = g.addNode([&amp;]() { m3 += b*b; });</span></div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment">dispenso::BiPropNode&amp; N4 = g.addNode([&amp;]() { m4 += 2; });</span></div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment"></span> </div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span><span class="comment">N3.dependsOn(N1);</span></div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="comment">N2.dependsOn(N4);</span></div>
-<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="comment">N2.biPropDependsOn(N1);</span></div>
-<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="comment">N1.biPropDependsOn(N0);</span></div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="comment"></span> </div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment">// first execution</span></div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">b = m3 = m4 = 0.f;</span></div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">dispenso::ConcurrentTaskSet concurrentTaskSet(dispenso::globalThreadPool());</span></div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment">dispenso::ConcurrentTaskSetExecutor concurrentTaskSetExecutor;</span></div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, g);</span></div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment"></span> </div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">N[4].setIncomplete();</span></div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment">// if node 4 is incomplete after propagation node 2 become incomplete. Taking in account that node 2</span></div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment">// bidirectionally depends on nodes 0 and 1 they will be marked as incomplete as well</span></div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment">b =  m4 = 0.f;</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment">ForwardPropagator forwardPropagator;</span></div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">forwardPropagator(g);</span></div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, g);</span></div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span><span class="comment">~~~</span></div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span><span class="comment"></span> </div>
-<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span><span class="comment">Please read tests from `graph_test.cpp` for more examples.</span></div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="comment">*/</span></div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="keyword">namespace </span>detail {</div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="keyword">class </span>ExecutorBase;</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> F&gt;</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="keywordtype">void</span> callFunctor(<span class="keywordtype">void</span>* ptr) {</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>  (*<span class="keyword">static_cast&lt;</span>F*<span class="keyword">&gt;</span>(ptr))();</div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>}</div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> F&gt;</div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="keywordtype">void</span> destroyFunctor(<span class="keywordtype">void</span>* ptr) {</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>  <span class="keyword">static_cast&lt;</span>F*<span class="keyword">&gt;</span>(ptr)-&gt;~F();</div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>  <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kFuncSize = <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(dispenso::detail::nextPow2(<span class="keyword">sizeof</span>(F)));</div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>  dispenso::deallocSmallBuffer&lt;kFuncSize&gt;(ptr);</div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}</div>
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>} <span class="comment">// namespace detail</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">dispenso::Graph graph;</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"></span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">dispenso::Node&amp; N0 = graph.addNode([&amp;]() { r[0] += 1; });</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">dispenso::Node&amp; N2 = graph.addNode([&amp;]() { r[2] += 8; });</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">dispenso::Node&amp; N1 = graph.addNode([&amp;]() { r[1] += r[0] * 2; });</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">dispenso::Node&amp; N3 = graph.addNode([&amp;]() { r[3] += r[2] / 2; });</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">dispenso::Node&amp; N4 = graph.addNode([&amp;]() { r[4] += r[1] + r[3]; });</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment"></span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">N4.dependsOn(N1, N3);</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">N1.dependsOn(N0);</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">N3.dependsOn(N2);</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment"></span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">dispenso::TaskSet taskSet(dispenso::globalThreadPool());</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">dispenso::ParallelForExecutor parallelForExecutor;</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">parallelForExecutor(taskSet, graph);</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment"></span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">Partial revaluation</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">--------------------------------------------------------------------------------</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">If graph is big or we need to recompute graph partially we can execute it again.</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">After execution of the graph all nodes change their state from &quot;incomplete&quot; to</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">&quot;completed&quot;. If order to evaluate whole graph again we can use function `setAllNodesIncomplete`</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">Example:</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">r = {0, 0, 0, 0, 0};</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">setAllNodesIncomplete(graph);</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">parallelForExecutor(taskSet, graph);</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment"></span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment">The graph can be recomputed partially if we have new input data for one or several nodes in the</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">graph. It order to do it we need to call `setIncomplete()` method for every node which we need to</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">recompute and after use functor `ForwardPropagator` to mark as &quot;incomplete&quot; all dependents.</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment"></span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">Example:</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment">N1.setIncomplete();</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment">r[1] = r[4] = 0;</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment">ForwardPropagator forwardPropagator;</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment">forwardPropagator(graph);</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment">evaluateGraph(graph);</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">In this exaple only node 1 and 4 will be invoked.</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment"></span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment"> Subgraphs</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">--------------------------------------------------------------------------------</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">It is possible to organize nodes into subgraphs and destroy and recreate if we have static and</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">dynamic parts of the computation graph</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">Example:</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">//</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">// ∙----subgraph1---∙ ∙---subgraph2-------∙</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">// ¦ ┌────────────┐ ¦ ¦ ┌───────────────┐ ¦   ┌───────────────────┐</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">// ¦ │ 0: r[0]+=1 │ ──▶ │ 1: r[1]=r[0]*2│ ──▶ │ 4: r[4]=r[1]+r[3] │</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment">// ¦ └────────────┘ ¦ ¦ └───────────────┘ ¦   └───────────────────┘</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment">// ¦                ¦ ¦                   ¦     ▲</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment">// ¦ ┌────────────┐ ¦ ¦ ┌───────────────┐ ¦     │</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment">// ¦ │ 2: r[2]+=8 │ ──▶ │ 3: r[3]=r[2]/2│ ──────┘</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="comment">// ¦ └────────────┘ ¦ ¦ └───────────────┘ ¦</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment">// ∙----------------∙ ∙-------------------∙</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">std::array&lt;float, 5&gt; r;</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">dispenso::Graph graph;</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment"></span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">dispenso::Subgraph&amp; subgraph1 = graph.addSubgraph();</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">dispenso::Subgraph&amp; subgraph2 = graph.addSubgraph();</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment"></span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">dispenso::Node&amp; N0 = subgraph1.addNode([&amp;]() { r[0] += 1; });</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">dispenso::Node&amp; N2 = subgraph1.addNode([&amp;]() { r[2] += 8; });</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment">dispenso::Node&amp; N1 = subgraph2.addNode([&amp;]() { r[1] += r[0] * 2; });</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">dispenso::Node&amp; N3 = subgraph2.addNode([&amp;]() { r[3] += r[2] / 2; });</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="comment">dispenso::Node&amp; N4 = graph.addNode([&amp;]() { r[4] += r[1] + r[3]; });</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment"></span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="comment">N4.dependsOn(N1, N3);</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment">N1.dependsOn(N0);</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">N3.dependsOn(N2);</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment"></span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment">// evaluate graph first time</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment">r = {0, 0, 0, 0, 0};</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment">dispenso::ConcurrentTaskSet concurrentTaskSet(dispenso::globalThreadPool());</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment">dispenso::ConcurrentTaskSetExecutor concurrentTaskSetExecutor;</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, graph);</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment"></span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment">// disconnect and destroy nodes of subgraph2</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment">// it invalidates node references/pointers of this subgraph</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment">subgraph2.clear();</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment"></span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">// create another nodes</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">dispenso::Node&amp; newN1 = subgraph2.addNode([&amp;]() { r[1] += r[0] * 20; });</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">dispenso::Node&amp; newN3 = subgraph2.addNode([&amp;]() { r[3] += r[2] / 20; });</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">newN1.dependsOn(N0);</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment">newN3.dependsOn(N2);</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">N4.dependsOn(newN1, newN3);</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment"></span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment">// and revaluae the graph</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment">setAllNodesIncomplete(movedGraph);</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, graph);</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment"></span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">Bidirectional propagation dependency</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">--------------------------------------------------------------------------------</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="comment">In certain scenarios, nodes may alter the same memory. In such instances, it becomes necessary to</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="comment">compute the predecessors of the node, even if they possess a &quot;completed&quot; state following state</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="comment">propagation. To facilitate this process automatically, we introduce the notion of a bidirectional</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="comment">propagation dependency (`BiProp`).</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="comment"></span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="comment">Example:</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment">//                     ┌─────────────────┐</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">//                     │ 3: m3+=b*b      │</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="comment">//                     └─────────────────┘</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="comment">//                       ▲</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="comment">// ┌−-----------−−−−−−−−−│−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−┐</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment">// ╎ ┌───────────┐     ┌─────────────────┐     ┌────────────┐ ╎</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment">// ╎ │  0: b+=5  │ ──▷ │     1: b*=5     │ ──▷ │ 2: b/=m4   │ ╎</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment">// ╎ └───────────┘     └─────────────────┘     └────────────┘ ╎</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment">// └−−−-−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−▲−−−−−−−−−−−−┘</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment">//  Legend:                                      │</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="comment">//  ──▶ Normal dependency                      ┌────────────┐</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment">//  ──▷ Bidirectional propagation dependency   │ 4: m4+=2   │</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment">//  m4  variable modified only in node 4       └────────────┘</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment"></span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment">float  b,  m3, m4</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="comment">dispenso::BiPropGraph g;</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="comment">std::array&lt;dispenso::BiPropNode*, 8&gt; N;</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="comment"></span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment">dispenso::BiPropNode&amp; N0 = g.addNode([&amp;]() { b += 5; });</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment">dispenso::BiPropNode&amp; N1 = g.addNode([&amp;]() { b *= 5; });</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment">dispenso::BiPropNode&amp; N2 = g.addNode([&amp;]() { b /= m4; });</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment">dispenso::BiPropNode&amp; N3 = g.addNode([&amp;]() { m3 += b*b; });</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span><span class="comment">dispenso::BiPropNode&amp; N4 = g.addNode([&amp;]() { m4 += 2; });</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="comment"></span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="comment">N3.dependsOn(N1);</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="comment">N2.dependsOn(N4);</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="comment">N2.biPropDependsOn(N1);</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment">N1.biPropDependsOn(N0);</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment"></span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">// first execution</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment">b = m3 = m4 = 0.f;</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">dispenso::ConcurrentTaskSet concurrentTaskSet(dispenso::globalThreadPool());</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment">dispenso::ConcurrentTaskSetExecutor concurrentTaskSetExecutor;</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, g);</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment"></span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment">N[4].setIncomplete();</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment">// if node 4 is incomplete after propagation node 2 become incomplete. Taking in account that node 2</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment">// bidirectionally depends on nodes 0 and 1 they will be marked as incomplete as well</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">b =  m4 = 0.f;</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span><span class="comment">ForwardPropagator forwardPropagator;</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span><span class="comment">forwardPropagator(g);</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span><span class="comment">concurrentTaskSetExecutor(concurrentTaskSet, g);</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span><span class="comment">~~~</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="comment"></span> </div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment">Please read tests from `graph_test.cpp` for more examples.</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">*/</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="keyword">namespace </span>detail {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="keyword">class </span>ExecutorBase;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> F&gt;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="keywordtype">void</span> callFunctor(<span class="keywordtype">void</span>* ptr) {</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>  (*<span class="keyword">static_cast&lt;</span>F*<span class="keyword">&gt;</span>(ptr))();</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>}</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> F&gt;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="keywordtype">void</span> destroyFunctor(<span class="keywordtype">void</span>* ptr) {</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>  <span class="keyword">static_cast&lt;</span>F*<span class="keyword">&gt;</span>(ptr)-&gt;~F();</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>  <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kFuncSize = <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(dispenso::detail::nextPow2(<span class="keyword">sizeof</span>(F)));</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>  dispenso::deallocSmallBuffer&lt;kFuncSize&gt;(ptr);</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>}</div>
 <div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="keyword">namespace </span>dispenso {</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html">  219</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_node.html">Node</a> {</div>
-<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>() = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(<a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;&amp; other) noexcept</div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>      : numIncompletePredecessors_(other.numIncompletePredecessors_.load()),</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        numPredecessors_(other.numPredecessors_),</div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        invoke_(other.invoke_),</div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        destroy_(other.destroy_),</div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        funcBuffer_(other.funcBuffer_),</div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        dependents_(std::move(other.dependents_)) {</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    other.funcBuffer_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>  }</div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">~Node</a>() {</div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordflow">if</span> (funcBuffer_) {</div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>      destroy_(funcBuffer_);</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    }</div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>  };</div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span>... Ns&gt;</div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">  244</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dependsOn</a>(Ns&amp;... nodes) {</div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    ((void)std::initializer_list&lt;int&gt;{(dependsOnOneNode(nodes), 0)...});</div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>  }</div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">  251</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">run</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    invoke_(funcBuffer_);</div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    numIncompletePredecessors_.store(kCompleted, std::memory_order_release);</div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>  }</div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">  261</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">forEachDependent</a>(F func)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>* dependent : dependents_) {</div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>      func(*dependent);</div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    }</div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  }</div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">  272</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">forEachDependent</a>(F func) {</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>* dependent : dependents_) {</div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>      func(*dependent);</div>
-<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    }</div>
-<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>  }</div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">  280</a></span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">numPredecessors</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordflow">return</span> numPredecessors_;</div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>  }</div>
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">  289</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">isCompleted</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">return</span> numIncompletePredecessors_.load(std::memory_order_relaxed) == kCompleted;</div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  }</div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">  299</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">setIncomplete</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="keywordflow">if</span> (numIncompletePredecessors_.load(std::memory_order_relaxed) == kCompleted) {</div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>      numIncompletePredecessors_.store(0, std::memory_order_relaxed);</div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>      <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    }</div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>  }</div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">  312</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">setCompleted</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    numIncompletePredecessors_.store(kCompleted, std::memory_order_relaxed);</div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  }</div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span> <span class="keyword">protected</span>:</div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>  template &lt;class F, class X = std::enable_if_t&lt;!std::is_base_of&lt;Node, F&gt;::value, <span class="keywordtype">void</span>&gt;&gt;</div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(F&amp;&amp; f) : numIncompletePredecessors_(0) {</div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    <span class="keyword">using </span>FNoRef = <span class="keyword">typename</span> std::remove_reference&lt;F&gt;::type;</div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kFuncSize = <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(detail::nextPow2(<span class="keyword">sizeof</span>(FNoRef)));</div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    funcBuffer_ = allocSmallBuffer&lt;kFuncSize&gt;();</div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keyword">new</span> (funcBuffer_) FNoRef(std::forward&lt;F&gt;(f));</div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    invoke_ = ::detail::callFunctor&lt;FNoRef&gt;;</div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    destroy_ = ::detail::destroyFunctor&lt;FNoRef&gt;;</div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>  }</div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span> </div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>  <span class="keywordtype">void</span> dependsOnOneNode(Node&amp; node) {</div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    node.dependents_.emplace_back(<span class="keyword">this</span>);</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    numPredecessors_++;</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>  }</div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kCompleted = std::numeric_limits&lt;size_t&gt;::max();</div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>  <span class="keyword">mutable</span> std::atomic&lt;size_t&gt; numIncompletePredecessors_;</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keywordtype">size_t</span> numPredecessors_ = 0;</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span> </div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="keyword">using </span>InvokerType = void (*)(<span class="keywordtype">void</span>* ptr);</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  InvokerType invoke_;</div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>  InvokerType destroy_;</div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  <span class="keywordtype">char</span>* funcBuffer_;</div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span> </div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  std::vector&lt;Node*&gt; dependents_; <span class="comment">// nodes depend on this</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>} <span class="comment">// namespace detail</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="keyword">namespace </span>dispenso {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html">  221</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>() = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(<a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>&amp;&amp; other) noexcept</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>      : numIncompletePredecessors_(other.numIncompletePredecessors_.load()),</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        numPredecessors_(other.numPredecessors_),</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        invoke_(other.invoke_),</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        destroy_(other.destroy_),</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        funcBuffer_(other.funcBuffer_),</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        dependents_(std::move(other.dependents_)) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    other.funcBuffer_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>  }</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">~Node</a>() {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="keywordflow">if</span> (funcBuffer_) {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>      destroy_(funcBuffer_);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    }</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>  };</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span>... Ns&gt;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">  246</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dependsOn</a>(Ns&amp;... nodes) {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    ((void)std::initializer_list&lt;int&gt;{(dependsOnOneNode(nodes), 0)...});</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>  }</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">  253</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">run</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    invoke_(funcBuffer_);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    numIncompletePredecessors_.store(kCompleted, std::memory_order_release);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>  }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">  263</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">forEachDependent</a>(F func)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>* dependent : dependents_) {</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>      func(*dependent);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    }</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>  }</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">  274</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">forEachDependent</a>(F func) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>* dependent : dependents_) {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>      func(*dependent);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    }</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>  }</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">  282</a></span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">numPredecessors</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="keywordflow">return</span> numPredecessors_;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>  }</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">  291</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">isCompleted</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="keywordflow">return</span> numIncompletePredecessors_.load(std::memory_order_relaxed) == kCompleted;</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>  }</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">  301</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">setIncomplete</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="keywordflow">if</span> (numIncompletePredecessors_.load(std::memory_order_relaxed) == kCompleted) {</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>      numIncompletePredecessors_.store(0, std::memory_order_relaxed);</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>      <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    }</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>  }</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"><a class="line" href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">  314</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">setCompleted</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    numIncompletePredecessors_.store(kCompleted, std::memory_order_relaxed);</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  }</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> <span class="keyword">protected</span>:</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>  template &lt;class F, class X = std::enable_if_t&lt;!std::is_base_of&lt;Node, F&gt;::value, <span class="keywordtype">void</span>&gt;&gt;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>  <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(F&amp;&amp; f) : numIncompletePredecessors_(0) {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="keyword">using </span>FNoRef = <span class="keyword">typename</span> std::remove_reference&lt;F&gt;::type;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span> </div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kFuncSize = <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(detail::nextPow2(<span class="keyword">sizeof</span>(FNoRef)));</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    funcBuffer_ = allocSmallBuffer&lt;kFuncSize&gt;();</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <span class="keyword">new</span> (funcBuffer_) FNoRef(std::forward&lt;F&gt;(f));</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    invoke_ = ::detail::callFunctor&lt;FNoRef&gt;;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    destroy_ = ::detail::destroyFunctor&lt;FNoRef&gt;;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>  }</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span> </div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>  <span class="keywordtype">void</span> dependsOnOneNode(Node&amp; node) {</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    node.dependents_.emplace_back(<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    numPredecessors_++;</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>  }</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kCompleted = std::numeric_limits&lt;size_t&gt;::max();</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>  <span class="keyword">mutable</span> std::atomic&lt;size_t&gt; numIncompletePredecessors_;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="keywordtype">size_t</span> numPredecessors_ = 0;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  <span class="keyword">using </span>InvokerType = void (*)(<span class="keywordtype">void</span>* ptr);</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span> </div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  InvokerType invoke_;</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  InvokerType destroy_;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  <span class="keywordtype">char</span>* funcBuffer_;</div>
 <div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
-<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>  <span class="keyword">friend</span> <span class="keyword">class </span>SubgraphT;</div>
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>  <span class="keyword">friend</span> class ::detail::ExecutorBase;</div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span> G&gt;</div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span> setAllNodesIncomplete(<span class="keyword">const</span> G&amp; graph);</div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>};</div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"><a class="line" href="classdispenso_1_1_bi_prop_node.html">  356</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a> : <span class="keyword">public</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a> {</div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>() = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(<a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;&amp; other) noexcept</div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>      : <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(std::move(other)), biPropSet_(std::move(other.biPropSet_)) {}</div>
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span>... Ns&gt;</div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">  370</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">biPropDependsOn</a>(Ns&amp;... nodes) {</div>
-<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    ((void)std::initializer_list&lt;int&gt;{(biPropDependsOnOneNode(nodes), 0)...});</div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>  }</div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span> </div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  template &lt;class T, class X = std::enable_if_t&lt;!std::is_base_of&lt;BiPropNode, T&gt;::value, <span class="keywordtype">void</span>&gt;&gt;</div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(T&amp;&amp; f) : <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(std::forward&lt;T&gt;(f)) {}</div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> removeFromBiPropSet() {</div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    <span class="keywordflow">if</span> (biPropSet_ != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>      <span class="keyword">auto</span> it = std::find(biPropSet_-&gt;begin(), biPropSet_-&gt;end(), <span class="keyword">this</span>);</div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>      <span class="keywordflow">if</span> (it != biPropSet_-&gt;end()) {</div>
-<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        biPropSet_-&gt;erase(it);</div>
-<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>      }</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    }</div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  }</div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span> </div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> biPropDependsOnOneNode(BiPropNode&amp; node);</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>  std::vector&lt;Node*&gt; dependents_; <span class="comment">// nodes depend on this</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>  <span class="keyword">friend</span> <span class="keyword">class </span>SubgraphT;</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>  <span class="keyword">friend</span> class ::detail::ExecutorBase;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span> G&gt;</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span> setAllNodesIncomplete(<span class="keyword">const</span> G&amp; graph);</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>};</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"><a class="line" href="classdispenso_1_1_bi_prop_node.html">  358</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a> : <span class="keyword">public</span> <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>() = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(<a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>&amp;&amp; other) noexcept</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>      : <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(std::move(other)), biPropSet_(std::move(other.biPropSet_)) {}</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span>... Ns&gt;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"><a class="line" href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">  372</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">biPropDependsOn</a>(Ns&amp;... nodes) {</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    ((void)std::initializer_list&lt;int&gt;{(biPropDependsOnOneNode(nodes), 0)...});</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  }</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span> </div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  template &lt;class T, class X = std::enable_if_t&lt;!std::is_base_of&lt;BiPropNode, T&gt;::value, <span class="keywordtype">void</span>&gt;&gt;</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>  <a class="code hl_class" href="classdispenso_1_1_bi_prop_node.html">BiPropNode</a>(T&amp;&amp; f) : <a class="code hl_class" href="classdispenso_1_1_node.html">Node</a>(std::forward&lt;T&gt;(f)) {}</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> removeFromBiPropSet() {</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    <span class="keywordflow">if</span> (biPropSet_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>      <span class="keyword">auto</span> it = std::find(biPropSet_-&gt;begin(), biPropSet_-&gt;end(), <span class="keyword">this</span>);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>      <span class="keywordflow">if</span> (it != biPropSet_-&gt;end()) {</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        biPropSet_-&gt;erase(it);</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>      }</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    }</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  }</div>
 <div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span> </div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  std::shared_ptr&lt;std::vector&lt;const BiPropNode*&gt;&gt; biPropSet_;</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> biPropDependsOnOneNode(BiPropNode&amp; node);</div>
 <div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span> </div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>  <span class="keyword">friend</span> <span class="keyword">class </span>SubgraphT;</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>  <span class="keyword">friend</span> class ::detail::ExecutorBase;</div>
-<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>};</div>
-<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span><span class="keyword">class </span>GraphT;</div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span> </div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html">  399</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a> {</div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>  <span class="keyword">using </span>NodeType = N;</div>
-<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>() = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;&amp; other) : graph_(other.graph_), nodes_(std::move(other.nodes_)) {}</div>
-<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">  413</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">addNode</a>(T&amp;&amp; f) {</div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    nodes_.push_back(NodeType(std::forward&lt;T&gt;(f)));</div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    <span class="keywordflow">return</span> nodes_.back();</div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>  }</div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">  420</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">numNodes</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    <span class="keywordflow">return</span> nodes_.size();</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>  std::shared_ptr&lt;std::vector&lt;const BiPropNode*&gt;&gt; biPropSet_;</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span> </div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>  <span class="keyword">friend</span> <span class="keyword">class </span>SubgraphT;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  <span class="keyword">friend</span> class ::detail::ExecutorBase;</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>};</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span> </div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="keyword">class </span>GraphT;</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span> </div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html">  401</a></span><span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a> {</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  <span class="keyword">using </span>NodeType = N;</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>() = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp;&amp; other)</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>      : graph_(other.graph_),</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        nodes_(std::move(other.nodes_)),</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        allocator_(std::move(other.allocator_)) {}</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">~SubgraphT</a>();</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">  419</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">addNode</a>(T&amp;&amp; f) {</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    nodes_.push_back(<span class="keyword">new</span> (allocator_-&gt;alloc()) NodeType(std::forward&lt;T&gt;(f)));</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    <span class="keywordflow">return</span> *nodes_.back();</div>
 <div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>  }</div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">  428</a></span>  <span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    <span class="keywordflow">return</span> nodes_[index];</div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>  }</div>
-<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">  436</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">node</a>(<span class="keywordtype">size_t</span> index) {</div>
-<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    <span class="keywordflow">return</span> nodes_[index];</div>
-<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>  }</div>
-<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">  445</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">forEachNode</a>(F func)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a> : nodes_) {</div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>      func(<a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>);</div>
-<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    }</div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  }</div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">  457</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">forEachNode</a>(F func) {</div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    <span class="keywordflow">for</span> (N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a> : nodes_) {</div>
-<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>      func(<a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>);</div>
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    }</div>
-<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>  }</div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">clear</a>();</div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span> </div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span> <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>  <span class="keyword">explicit</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>* graph) : graph_(graph), nodes_() {}</div>
-<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> removeNodeFromBiPropSet(Node&amp; <span class="comment">/* node */</span>) {}</div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>  <span class="keywordtype">void</span> removeNodeFromBiPropSet(BiPropNode&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>) {</div>
-<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>.removeFromBiPropSet();</div>
-<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>  }</div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>  <span class="keywordtype">void</span> decrementDependentCounters();</div>
-<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>  <span class="keywordtype">size_t</span> markNodesWithPredicessors();</div>
-<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>  <span class="keywordtype">void</span> removePredecessorDependencies(<span class="keywordtype">size_t</span> numGraphPredecessors);</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">  426</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">numNodes</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    <span class="keywordflow">return</span> nodes_.size();</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>  }</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">  434</a></span>  <span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">node</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="keywordflow">return</span> *nodes_[index];</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>  }</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">  442</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">node</a>(<span class="keywordtype">size_t</span> index) {</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>    <span class="keywordflow">return</span> *nodes_[index];</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>  }</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">  451</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">forEachNode</a>(F func)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> N* node : nodes_) {</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>      func(*node);</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    }</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  }</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"><a class="line" href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">  463</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">forEachNode</a>(F func) {</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    <span class="keywordflow">for</span> (N* node : nodes_) {</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>      func(*node);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>    }</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>  }</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>  <span class="keywordtype">void</span> clear();</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span> </div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>  <span class="keyword">using </span>DeallocFunc = void (*)(<a class="code hl_class" href="classdispenso_1_1_pool_allocator_t.html">NoLockPoolAllocator</a>*);</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>  <span class="keyword">using </span>PoolPtr = std::unique_ptr&lt;NoLockPoolAllocator, DeallocFunc&gt;;</div>
 <div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span> </div>
-<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>  GraphT&lt;N&gt;* graph_;</div>
-<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span><span class="preprocessor">#if defined(_WIN32)</span></div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span><span class="preprocessor">#pragma warning(push)</span></div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span><span class="preprocessor">#pragma warning(disable : 4251)</span></div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  std::deque&lt;N&gt; nodes_;</div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span><span class="preprocessor">#if defined(_WIN32)</span></div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span><span class="preprocessor">#pragma warning(pop)</span></div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span> </div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>  <span class="keyword">friend</span> <span class="keyword">class </span>GraphT;</div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>};</div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span> </div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html">  493</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a> {</div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>  <span class="keyword">using </span>NodeType = N;</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  <span class="keyword">using </span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a> = <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>;</div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>  <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">GraphT</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">  498</a></span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>() {</div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  }</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">GraphT</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;&amp; other);</div>
-<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp; operator=(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp;&amp; other);</div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
-<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">  520</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">addNode</a>(T&amp;&amp; f) {</div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>    <span class="keywordflow">return</span> subgraphs_[0].addNode(std::forward&lt;T&gt;(f));</div>
-<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>  }</div>
-<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">  526</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">numNodes</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>    <span class="keywordflow">return</span> subgraphs_[0].numNodes();</div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  }</div>
-<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">  534</a></span>  <span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>    <span class="keywordflow">return</span> subgraphs_[0].node(index);</div>
-<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  }</div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">  542</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">node</a>(<span class="keywordtype">size_t</span> index) {</div>
-<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>    <span class="keywordflow">return</span> subgraphs_[0].node(index);</div>
-<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>  }</div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">addSubgraph</a>();</div>
-<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">  552</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">numSubgraphs</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    <span class="keywordflow">return</span> subgraphs_.size();</div>
-<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>  }</div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">  560</a></span>  <span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">subgraphs</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    <span class="keywordflow">return</span> subgraphs_[index];</div>
-<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>  }</div>
-<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">  568</a></span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">subgraphs</a>(<span class="keywordtype">size_t</span> index) {</div>
-<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>    <span class="keywordflow">return</span> subgraphs_[index];</div>
-<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>  }</div>
-<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">  577</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">forEachSubgraph</a>(F&amp;&amp; func)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>      func(subgraph);</div>
-<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>    }</div>
-<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>  }</div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">  588</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">forEachSubgraph</a>(F&amp;&amp; func) {</div>
-<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>      func(subgraph);</div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>    }</div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>  }</div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">  600</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">forEachNode</a>(F&amp;&amp; func)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a> : subgraph.nodes_) {</div>
-<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>        func(<a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a>);</div>
-<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>      }</div>
-<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>    }</div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>  }</div>
-<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
-<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">  613</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">forEachNode</a>(F&amp;&amp; func) {</div>
-<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>      <span class="keywordflow">for</span> (N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a> : subgraph.nodes_) {</div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>        func(<a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a>);</div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>      }</div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    }</div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>  }</div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">  623</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">clear</a>() {</div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>    subgraphs_.clear();</div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>    subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>  }</div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span> </div>
-<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span> <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span><span class="preprocessor">#if defined(_WIN32)</span></div>
-<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span><span class="preprocessor">#pragma warning(push)</span></div>
-<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span><span class="preprocessor">#pragma warning(disable : 4251)</span></div>
-<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>  std::deque&lt;SubgraphT&lt;N&gt;&gt; subgraphs_;</div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="preprocessor">#if defined(_WIN32)</span></div>
-<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span><span class="preprocessor">#pragma warning(pop)</span></div>
-<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span> </div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>;</div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>};</div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span> </div>
-<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span><span class="keyword">using </span>Graph = GraphT&lt;Node&gt;;</div>
-<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span><span class="keyword">using </span>BiPropGraph = GraphT&lt;BiPropNode&gt;;</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kNodeSizeP2 = detail::nextPow2(<span class="keyword">sizeof</span>(NodeType));</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span> </div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>  <span class="keyword">explicit</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>* graph) : graph_(graph), nodes_(), allocator_(getAllocator()) {}</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span> </div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> removeNodeFromBiPropSet(Node* <span class="comment">/* node */</span>) {}</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  <span class="keywordtype">void</span> removeNodeFromBiPropSet(BiPropNode* node) {</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>    node-&gt;removeFromBiPropSet();</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>  }</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>  <span class="keywordtype">void</span> decrementDependentCounters();</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>  <span class="keywordtype">size_t</span> markNodesWithPredicessors();</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>  <span class="keywordtype">void</span> removePredecessorDependencies(<span class="keywordtype">size_t</span> numGraphPredecessors);</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span> </div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>  <span class="keyword">static</span> PoolPtr getAllocator();</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> releaseAllocator(NoLockPoolAllocator* ptr);</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>  GraphT&lt;N&gt;* graph_;</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="preprocessor">#if defined(_WIN32)</span></div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span><span class="preprocessor">#pragma warning(push)</span></div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span><span class="preprocessor">#pragma warning(disable : 4251)</span></div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>  std::vector&lt;N*&gt; nodes_;</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span> </div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>  PoolPtr allocator_;</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span><span class="preprocessor">#if defined(_WIN32)</span></div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span><span class="preprocessor">#pragma warning(pop)</span></div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span> </div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>  <span class="keyword">friend</span> <span class="keyword">class </span>GraphT;</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>};</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span> </div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> N&gt;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html">  510</a></span><span class="keyword">class </span>DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a> {</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  <span class="keyword">using </span>NodeType = N;</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>  <span class="keyword">using </span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a> = <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>;</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">  515</a></span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>() {</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  }</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp;&amp; other);</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  <a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT&lt;N&gt;</a>&amp; operator=(<a class="code hl_class" href="classdispenso_1_1_graph_t.html">GraphT</a>&amp;&amp; other);</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">  537</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">addNode</a>(T&amp;&amp; f) {</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>    <span class="keywordflow">return</span> subgraphs_[0].addNode(std::forward&lt;T&gt;(f));</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  }</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">  543</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">numNodes</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>    <span class="keywordflow">return</span> subgraphs_[0].numNodes();</div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>  }</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">  551</a></span>  <span class="keyword">const</span> N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">node</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    <span class="keywordflow">return</span> subgraphs_[0].node(index);</div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>  }</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">  559</a></span>  N&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">node</a>(<span class="keywordtype">size_t</span> index) {</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>    <span class="keywordflow">return</span> subgraphs_[0].node(index);</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>  }</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; addSubgraph();</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">  569</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">numSubgraphs</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>    <span class="keywordflow">return</span> subgraphs_.size();</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>  }</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">  577</a></span>  <span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">subgraphs</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <span class="keywordflow">return</span> subgraphs_[index];</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>  }</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">  585</a></span>  <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">subgraphs</a>(<span class="keywordtype">size_t</span> index) {</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    <span class="keywordflow">return</span> subgraphs_[index];</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  }</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">  594</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">forEachSubgraph</a>(F&amp;&amp; func)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>      func(subgraph);</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>    }</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>  }</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">  605</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">forEachSubgraph</a>(F&amp;&amp; func) {</div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>      func(subgraph);</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>    }</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>  }</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">  617</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">forEachNode</a>(F&amp;&amp; func)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> N* node : subgraph.nodes_) {</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>        func(*node);</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>      }</div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    }</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>  }</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">  630</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">forEachNode</a>(F&amp;&amp; func) {</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>    <span class="keywordflow">for</span> (<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT&lt;N&gt;</a>&amp; subgraph : subgraphs_) {</div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>      <span class="keywordflow">for</span> (N* node : subgraph.nodes_) {</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>        func(*node);</div>
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>      }</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>    }</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>  }</div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"><a class="line" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">  640</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">clear</a>() {</div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>    subgraphs_.clear();</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>    subgraphs_.push_back(<a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphType</a>(<span class="keyword">this</span>));</div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>  }</div>
 <div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span> </div>
-<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span><span class="keyword">using </span>Subgraph = SubgraphT&lt;Node&gt;;</div>
-<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span><span class="keyword">using </span>BiPropSubgraph = SubgraphT&lt;BiPropNode&gt;;</div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>} <span class="comment">// namespace dispenso</span></div>
-<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00356">graph.h:356</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html_af7381198c926f4b8a3f09e8add2fde30"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">dispenso::BiPropNode::biPropDependsOn</a></div><div class="ttdeci">void biPropDependsOn(Ns &amp;... nodes)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00370">graph.h:370</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html"><div class="ttname"><a href="classdispenso_1_1_graph_t.html">dispenso::GraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00493">graph.h:493</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a049150fe3d50ebb3c121e7b45cc94717"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">dispenso::GraphT::subgraphs</a></div><div class="ttdeci">const SubgraphT&lt; N &gt; &amp; subgraphs(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00560">graph.h:560</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a13d24b1056de5324500d20702661fa7e"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">dispenso::GraphT::addNode</a></div><div class="ttdeci">N &amp; addNode(T &amp;&amp;f)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00520">graph.h:520</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a22f4214e82e711d82770830fde0a4d43"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">dispenso::GraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F &amp;&amp;func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00600">graph.h:600</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a23d36763edcc0162257ee176355ee1da"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00623">graph.h:623</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a3af58d956a3073c39780dc2d0d2e4860"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">dispenso::GraphT::subgraphs</a></div><div class="ttdeci">SubgraphT&lt; N &gt; &amp; subgraphs(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00568">graph.h:568</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a3f648335d15c97603bc6a81d16f26cf7"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">dispenso::GraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F &amp;&amp;func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00613">graph.h:613</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a4aac6a8e1038bc3fd1ae8ec8a2c3a70d"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">dispenso::GraphT::forEachSubgraph</a></div><div class="ttdeci">void forEachSubgraph(F &amp;&amp;func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00577">graph.h:577</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a5c307fa77893c5d9c2ea0e5527825821"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">dispenso::GraphT::numSubgraphs</a></div><div class="ttdeci">size_t numSubgraphs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00552">graph.h:552</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a77eb80216600caca5a6c6c03e93205a3"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">dispenso::GraphT::forEachSubgraph</a></div><div class="ttdeci">void forEachSubgraph(F &amp;&amp;func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00588">graph.h:588</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a7e18b24fe123bfac828e3b996c774cd7"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a7e18b24fe123bfac828e3b996c774cd7">dispenso::GraphT::GraphT</a></div><div class="ttdeci">GraphT()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00498">graph.h:502</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a9297df295822e9f46dc7f93a11356ba2"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">dispenso::GraphT::node</a></div><div class="ttdeci">N &amp; node(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00542">graph.h:542</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_ad85a02fa2e34f7beb7a3bfafd94123b1"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">dispenso::GraphT::node</a></div><div class="ttdeci">const N &amp; node(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00534">graph.h:534</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_adf47c5ba380b61e20df7ec680a1cca43"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43">dispenso::GraphT::addSubgraph</a></div><div class="ttdeci">SubgraphT&lt; N &gt; &amp; addSubgraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00126">graph.cpp:126</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_graph_t_html_ae92cbfe6f02b870cf5e466872f069c56"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">dispenso::GraphT::numNodes</a></div><div class="ttdeci">size_t numNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00526">graph.h:526</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html"><div class="ttname"><a href="classdispenso_1_1_node.html">dispenso::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00219">graph.h:219</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_a0176c8a462083b6fb4ce31ac3a06b692"><div class="ttname"><a href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">dispenso::Node::isCompleted</a></div><div class="ttdeci">bool isCompleted() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00289">graph.h:289</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_a29dcdde915094ed0163f7d7b1df6ac07"><div class="ttname"><a href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">dispenso::Node::forEachDependent</a></div><div class="ttdeci">void forEachDependent(F func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00272">graph.h:272</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_a2fd8f2a09e75b8cbaa76e43f1634fab2"><div class="ttname"><a href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">dispenso::Node::forEachDependent</a></div><div class="ttdeci">void forEachDependent(F func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00261">graph.h:261</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_a3a9c840c8df858d1b9e0e1c8aacf3ce4"><div class="ttname"><a href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">dispenso::Node::setIncomplete</a></div><div class="ttdeci">bool setIncomplete() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00299">graph.h:299</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_a9ba6d698905f5f2e4e019d0fbd5eac01"><div class="ttname"><a href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">dispenso::Node::setCompleted</a></div><div class="ttdeci">void setCompleted() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00312">graph.h:312</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_abfb52f4bd018eee8791499a9bd160c8a"><div class="ttname"><a href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dispenso::Node::dependsOn</a></div><div class="ttdeci">void dependsOn(Ns &amp;... nodes)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00244">graph.h:244</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_ae961b329557136eeb3f2787ee66c062e"><div class="ttname"><a href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">dispenso::Node::numPredecessors</a></div><div class="ttdeci">size_t numPredecessors() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00280">graph.h:280</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html_af73f196ba6ccba6081ac5ef46b61c256"><div class="ttname"><a href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">dispenso::Node::run</a></div><div class="ttdeci">void run() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00251">graph.h:251</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00399">graph.h:399</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a2e39c55d6e04462971f93f349c5be3fe"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe">dispenso::SubgraphT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8cpp_source.html#l00052">graph.cpp:52</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a2e46a695042ae3675573a20d743b50ca"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">dispenso::SubgraphT::node</a></div><div class="ttdeci">const N &amp; node(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00428">graph.h:428</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a3f314f17214ede38225e89be5cdd79ab"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">dispenso::SubgraphT::addNode</a></div><div class="ttdeci">N &amp; addNode(T &amp;&amp;f)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00413">graph.h:413</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a747b7abd35505b2d8b8c2a95142b002e"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">dispenso::SubgraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00457">graph.h:457</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a76da1c94b498111c70f98f957c093e57"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">dispenso::SubgraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00445">graph.h:445</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a8ace42166b89031a0059a7114467333b"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">dispenso::SubgraphT::node</a></div><div class="ttdeci">N &amp; node(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00436">graph.h:436</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a90491dc1be17b0f2e35a8683f44c4215"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">dispenso::SubgraphT::numNodes</a></div><div class="ttdeci">size_t numNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00420">graph.h:420</a></div></div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> kSubgraphSizeP2 = detail::nextPow2(<span class="keyword">sizeof</span>(SubgraphType));</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span> </div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span><span class="preprocessor">#if defined(_WIN32)</span></div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span><span class="preprocessor">#pragma warning(push)</span></div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span><span class="preprocessor">#pragma warning(disable : 4251)</span></div>
+<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>  std::deque&lt;SubgraphT&lt;N&gt;&gt; subgraphs_;</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span><span class="preprocessor">#if defined(_WIN32)</span></div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span><span class="preprocessor">#pragma warning(pop)</span></div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span> </div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>  <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_subgraph_t.html">SubgraphT</a>;</div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>};</div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span> </div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span><span class="keyword">using </span>Graph = GraphT&lt;Node&gt;;</div>
+<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span><span class="keyword">using </span>BiPropGraph = GraphT&lt;BiPropNode&gt;;</div>
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span> </div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span><span class="keyword">using </span>Subgraph = SubgraphT&lt;Node&gt;;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span><span class="keyword">using </span>BiPropSubgraph = SubgraphT&lt;BiPropNode&gt;;</div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>} <span class="comment">// namespace dispenso</span></div>
+<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00358">graph.h:358</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html_af7381198c926f4b8a3f09e8add2fde30"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html#af7381198c926f4b8a3f09e8add2fde30">dispenso::BiPropNode::biPropDependsOn</a></div><div class="ttdeci">void biPropDependsOn(Ns &amp;... nodes)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00372">graph.h:372</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html"><div class="ttname"><a href="classdispenso_1_1_graph_t.html">dispenso::GraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00510">graph.h:510</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a049150fe3d50ebb3c121e7b45cc94717"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a049150fe3d50ebb3c121e7b45cc94717">dispenso::GraphT::subgraphs</a></div><div class="ttdeci">const SubgraphT&lt; N &gt; &amp; subgraphs(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00577">graph.h:577</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a13d24b1056de5324500d20702661fa7e"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e">dispenso::GraphT::addNode</a></div><div class="ttdeci">N &amp; addNode(T &amp;&amp;f)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00537">graph.h:537</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a22f4214e82e711d82770830fde0a4d43"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a22f4214e82e711d82770830fde0a4d43">dispenso::GraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F &amp;&amp;func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00617">graph.h:617</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a23d36763edcc0162257ee176355ee1da"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da">dispenso::GraphT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00640">graph.h:640</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a3af58d956a3073c39780dc2d0d2e4860"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a3af58d956a3073c39780dc2d0d2e4860">dispenso::GraphT::subgraphs</a></div><div class="ttdeci">SubgraphT&lt; N &gt; &amp; subgraphs(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00585">graph.h:585</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a3f648335d15c97603bc6a81d16f26cf7"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a3f648335d15c97603bc6a81d16f26cf7">dispenso::GraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F &amp;&amp;func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00630">graph.h:630</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a4aac6a8e1038bc3fd1ae8ec8a2c3a70d"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a4aac6a8e1038bc3fd1ae8ec8a2c3a70d">dispenso::GraphT::forEachSubgraph</a></div><div class="ttdeci">void forEachSubgraph(F &amp;&amp;func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00594">graph.h:594</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a5c307fa77893c5d9c2ea0e5527825821"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a5c307fa77893c5d9c2ea0e5527825821">dispenso::GraphT::numSubgraphs</a></div><div class="ttdeci">size_t numSubgraphs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00569">graph.h:569</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a77eb80216600caca5a6c6c03e93205a3"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a77eb80216600caca5a6c6c03e93205a3">dispenso::GraphT::forEachSubgraph</a></div><div class="ttdeci">void forEachSubgraph(F &amp;&amp;func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00605">graph.h:605</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_a9297df295822e9f46dc7f93a11356ba2"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#a9297df295822e9f46dc7f93a11356ba2">dispenso::GraphT::node</a></div><div class="ttdeci">N &amp; node(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00559">graph.h:559</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_ad85a02fa2e34f7beb7a3bfafd94123b1"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#ad85a02fa2e34f7beb7a3bfafd94123b1">dispenso::GraphT::node</a></div><div class="ttdeci">const N &amp; node(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00551">graph.h:551</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_graph_t_html_ae92cbfe6f02b870cf5e466872f069c56"><div class="ttname"><a href="classdispenso_1_1_graph_t.html#ae92cbfe6f02b870cf5e466872f069c56">dispenso::GraphT::numNodes</a></div><div class="ttdeci">size_t numNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00543">graph.h:543</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html"><div class="ttname"><a href="classdispenso_1_1_node.html">dispenso::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00221">graph.h:221</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_a0176c8a462083b6fb4ce31ac3a06b692"><div class="ttname"><a href="classdispenso_1_1_node.html#a0176c8a462083b6fb4ce31ac3a06b692">dispenso::Node::isCompleted</a></div><div class="ttdeci">bool isCompleted() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00291">graph.h:291</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_a29dcdde915094ed0163f7d7b1df6ac07"><div class="ttname"><a href="classdispenso_1_1_node.html#a29dcdde915094ed0163f7d7b1df6ac07">dispenso::Node::forEachDependent</a></div><div class="ttdeci">void forEachDependent(F func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00274">graph.h:274</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_a2fd8f2a09e75b8cbaa76e43f1634fab2"><div class="ttname"><a href="classdispenso_1_1_node.html#a2fd8f2a09e75b8cbaa76e43f1634fab2">dispenso::Node::forEachDependent</a></div><div class="ttdeci">void forEachDependent(F func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00263">graph.h:263</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_a3a9c840c8df858d1b9e0e1c8aacf3ce4"><div class="ttname"><a href="classdispenso_1_1_node.html#a3a9c840c8df858d1b9e0e1c8aacf3ce4">dispenso::Node::setIncomplete</a></div><div class="ttdeci">bool setIncomplete() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00301">graph.h:301</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_a9ba6d698905f5f2e4e019d0fbd5eac01"><div class="ttname"><a href="classdispenso_1_1_node.html#a9ba6d698905f5f2e4e019d0fbd5eac01">dispenso::Node::setCompleted</a></div><div class="ttdeci">void setCompleted() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00314">graph.h:314</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_abfb52f4bd018eee8791499a9bd160c8a"><div class="ttname"><a href="classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a">dispenso::Node::dependsOn</a></div><div class="ttdeci">void dependsOn(Ns &amp;... nodes)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00246">graph.h:246</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_ae961b329557136eeb3f2787ee66c062e"><div class="ttname"><a href="classdispenso_1_1_node.html#ae961b329557136eeb3f2787ee66c062e">dispenso::Node::numPredecessors</a></div><div class="ttdeci">size_t numPredecessors() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00282">graph.h:282</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html_af73f196ba6ccba6081ac5ef46b61c256"><div class="ttname"><a href="classdispenso_1_1_node.html#af73f196ba6ccba6081ac5ef46b61c256">dispenso::Node::run</a></div><div class="ttdeci">void run() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00253">graph.h:253</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a></div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8h_source.html#l00029">pool_allocator.h:29</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html">dispenso::SubgraphT</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00401">graph.h:401</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a2e46a695042ae3675573a20d743b50ca"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a2e46a695042ae3675573a20d743b50ca">dispenso::SubgraphT::node</a></div><div class="ttdeci">const N &amp; node(size_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00434">graph.h:434</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a3f314f17214ede38225e89be5cdd79ab"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab">dispenso::SubgraphT::addNode</a></div><div class="ttdeci">N &amp; addNode(T &amp;&amp;f)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00419">graph.h:419</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a747b7abd35505b2d8b8c2a95142b002e"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a747b7abd35505b2d8b8c2a95142b002e">dispenso::SubgraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F func)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00463">graph.h:463</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a76da1c94b498111c70f98f957c093e57"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a76da1c94b498111c70f98f957c093e57">dispenso::SubgraphT::forEachNode</a></div><div class="ttdeci">void forEachNode(F func) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00451">graph.h:451</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a8ace42166b89031a0059a7114467333b"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a8ace42166b89031a0059a7114467333b">dispenso::SubgraphT::node</a></div><div class="ttdeci">N &amp; node(size_t index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00442">graph.h:442</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_subgraph_t_html_a90491dc1be17b0f2e35a8683f44c4215"><div class="ttname"><a href="classdispenso_1_1_subgraph_t.html#a90491dc1be17b0f2e35a8683f44c4215">dispenso::SubgraphT::numNodes</a></div><div class="ttdeci">size_t numNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00426">graph.h:426</a></div></div>
+<div class="ttc" id="apool__allocator_8h_html"><div class="ttname"><a href="pool__allocator_8h.html">pool_allocator.h</a></div></div>
 <div class="ttc" id="asmall__buffer__allocator_8h_html"><div class="ttname"><a href="small__buffer__allocator_8h.html">small_buffer_allocator.h</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/graph__executor_8cpp_source.html b/graph__executor_8cpp_source.html
index fe42505..aaac41e 100644
--- a/graph__executor_8cpp_source.html
+++ b/graph__executor_8cpp_source.html
@@ -284,11 +284,11 @@
 <div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="keyword">template</span> DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> ForwardPropagator::operator()&lt;BiPropGraph&gt;(<span class="keyword">const</span> BiPropGraph&amp;);</div>
 <div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
 <div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>} <span class="comment">// namespace dispenso</span></div>
-<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00356">graph.h:356</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_bi_prop_node_html"><div class="ttname"><a href="classdispenso_1_1_bi_prop_node.html">dispenso::BiPropNode</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00358">graph.h:358</a></div></div>
 <div class="ttc" id="aclassdispenso_1_1_concurrent_task_set_html"><div class="ttname"><a href="classdispenso_1_1_concurrent_task_set.html">dispenso::ConcurrentTaskSet</a></div><div class="ttdef"><b>Definition:</b> <a href="task__set_8h_source.html#l00173">task_set.h:173</a></div></div>
 <div class="ttc" id="aclassdispenso_1_1_concurrent_task_set_html_a141919e5ebb3e61135d4827f3906f108"><div class="ttname"><a href="classdispenso_1_1_concurrent_task_set.html#a141919e5ebb3e61135d4827f3906f108">dispenso::ConcurrentTaskSet::schedule</a></div><div class="ttdeci">void schedule(F &amp;&amp;f, bool skipRecheck=false)</div><div class="ttdef"><b>Definition:</b> <a href="task__set_8h_source.html#l00213">task_set.h:213</a></div></div>
 <div class="ttc" id="aclassdispenso_1_1_concurrent_task_set_html_a72ff3af1484a7104e364d564b6ef63ae"><div class="ttname"><a href="classdispenso_1_1_concurrent_task_set.html#a72ff3af1484a7104e364d564b6ef63ae">dispenso::ConcurrentTaskSet::wait</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS bool wait()</div><div class="ttdef"><b>Definition:</b> <a href="task__set_8cpp_source.html#l00055">task_set.cpp:55</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_node_html"><div class="ttname"><a href="classdispenso_1_1_node.html">dispenso::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00219">graph.h:219</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_node_html"><div class="ttname"><a href="classdispenso_1_1_node.html">dispenso::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00221">graph.h:221</a></div></div>
 <div class="ttc" id="aclassdispenso_1_1_parallel_for_executor_html_ae59c8e5924faa0fe0ad03004b22f52db"><div class="ttname"><a href="classdispenso_1_1_parallel_for_executor.html#ae59c8e5924faa0fe0ad03004b22f52db">dispenso::ParallelForExecutor::operator()</a></div><div class="ttdeci">void operator()(TaskSetT &amp;taskSet, const G &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="graph__executor_8cpp_source.html#l00041">graph_executor.cpp:41</a></div></div>
 <div class="ttc" id="aclassdispenso_1_1_single_thread_executor_html_ae0d07bf17b2c2c45d2fab3c13a6869c1"><div class="ttname"><a href="classdispenso_1_1_single_thread_executor.html#ae0d07bf17b2c2c45d2fab3c13a6869c1">dispenso::SingleThreadExecutor::operator()</a></div><div class="ttdeci">void operator()(const G &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="graph__executor_8cpp_source.html#l00013">graph_executor.cpp:13</a></div></div>
 <div class="ttc" id="aparallel__for_8h_html_a8201f4fc565c557f5cbaf6b4403991b1"><div class="ttname"><a href="parallel__for_8h.html#a8201f4fc565c557f5cbaf6b4403991b1">dispenso::parallel_for</a></div><div class="ttdeci">void parallel_for(TaskSetT &amp;taskSet, StateContainer &amp;states, const StateGen &amp;defaultState, const ChunkedRange&lt; IntegerT &gt; &amp;range, F &amp;&amp;f, ParForOptions options={})</div><div class="ttdef"><b>Definition:</b> <a href="parallel__for_8h_source.html#l00344">parallel_for.h:344</a></div></div>
diff --git a/hierarchy.html b/hierarchy.html
index a04a9cb..bc7a4c6 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -132,7 +132,7 @@
 <tr id="row_20_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_bi_prop_node.html" target="_self">dispenso::BiPropNode</a></td><td class="desc"></td></tr>
 <tr id="row_21_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_once_function.html" target="_self">dispenso::OnceFunction</a></td><td class="desc"></td></tr>
 <tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdispenso_1_1_par_for_options.html" target="_self">dispenso::ParForOptions</a></td><td class="desc"></td></tr>
-<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_pool_allocator.html" target="_self">dispenso::PoolAllocator</a></td><td class="desc"></td></tr>
+<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_pool_allocator_t.html" target="_self">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdispenso_1_1_reserve_tag_s.html" target="_self">dispenso::ReserveTagS</a></td><td class="desc"></td></tr>
 <tr id="row_25_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_resource.html" target="_self">dispenso::Resource&lt; T &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdispenso_1_1_resource_pool.html" target="_self">dispenso::ResourcePool&lt; T &gt;</a></td><td class="desc"></td></tr>
diff --git a/hierarchy.js b/hierarchy.js
index a585295..756c3d8 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -36,7 +36,7 @@ var hierarchy =
     ] ],
     [ "dispenso::OnceFunction", "classdispenso_1_1_once_function.html", null ],
     [ "dispenso::ParForOptions", "structdispenso_1_1_par_for_options.html", null ],
-    [ "dispenso::PoolAllocator", "classdispenso_1_1_pool_allocator.html", null ],
+    [ "dispenso::PoolAllocatorT< kThreadSafe >", "classdispenso_1_1_pool_allocator_t.html", null ],
     [ "dispenso::ReserveTagS", "structdispenso_1_1_reserve_tag_s.html", null ],
     [ "dispenso::Resource< T >", "classdispenso_1_1_resource.html", null ],
     [ "dispenso::ResourcePool< T >", "classdispenso_1_1_resource_pool.html", null ],
diff --git a/navtreedata.js b/navtreedata.js
index 41e09d6..cc04d98 100644
--- a/navtreedata.js
+++ b/navtreedata.js
@@ -45,7 +45,7 @@ var NAVTREE =
 var NAVTREEINDEX =
 [
 "annotated.html",
-"functions_rela.html"
+"functions_p.html"
 ];
 
 var SYNCONMSG = 'click to disable panel synchronisation';
diff --git a/navtreeindex0.js b/navtreeindex0.js
index 140244f..2ac3c85 100644
--- a/navtreeindex0.js
+++ b/navtreeindex0.js
@@ -160,11 +160,13 @@ var NAVTREEINDEX0 =
 "classdispenso_1_1_once_function.html#a7bec1f15cb5ca710f21145b37783e052":[0,0,0,22,0],
 "classdispenso_1_1_parallel_for_executor.html":[0,0,0,23],
 "classdispenso_1_1_parallel_for_executor.html#ae59c8e5924faa0fe0ad03004b22f52db":[0,0,0,23,0],
-"classdispenso_1_1_pool_allocator.html":[0,0,0,25],
-"classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4":[0,0,0,25,2],
-"classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a":[0,0,0,25,1],
-"classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20":[0,0,0,25,0],
-"classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582":[0,0,0,25,3],
+"classdispenso_1_1_pool_allocator_t.html":[0,0,0,25],
+"classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036":[0,0,0,25,2],
+"classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1":[0,0,0,25,3],
+"classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60":[0,0,0,25,1],
+"classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1":[0,0,0,25,5],
+"classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11":[0,0,0,25,0],
+"classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d":[0,0,0,25,4],
 "classdispenso_1_1_r_w_lock.html":[0,0,0,29],
 "classdispenso_1_1_resource.html":[0,0,0,27],
 "classdispenso_1_1_resource.html#a61190270b880598f6f816905299fb858":[0,0,0,27,0],
@@ -247,7 +249,5 @@ var NAVTREEINDEX0 =
 "functions_l.html":[0,3,0,9],
 "functions_m.html":[0,3,0,10],
 "functions_n.html":[0,3,0,11],
-"functions_o.html":[0,3,0,12],
-"functions_p.html":[0,3,0,13],
-"functions_r.html":[0,3,0,14]
+"functions_o.html":[0,3,0,12]
 };
diff --git a/navtreeindex1.js b/navtreeindex1.js
index ad0ee13..837da77 100644
--- a/navtreeindex1.js
+++ b/navtreeindex1.js
@@ -1,5 +1,7 @@
 var NAVTREEINDEX1 =
 {
+"functions_p.html":[0,3,0,13],
+"functions_r.html":[0,3,0,14],
 "functions_rela.html":[0,3,3],
 "functions_s.html":[0,3,0,15],
 "functions_t.html":[0,3,0,16],
diff --git a/pool__allocator_8cpp_source.html b/pool__allocator_8cpp_source.html
index f5717bb..72e64cb 100644
--- a/pool__allocator_8cpp_source.html
+++ b/pool__allocator_8cpp_source.html
@@ -110,75 +110,117 @@
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span>dispenso {</div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">   12</a></span><a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">PoolAllocator::PoolAllocator</a>(</div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">size_t</span> chunkSize,</div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">size_t</span> allocSize,</div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    std::function&lt;<span class="keywordtype">void</span>*(<span class="keywordtype">size_t</span>)&gt; allocFunc,</div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">void</span>*)&gt; deallocFunc)</div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    : chunkSize_(chunkSize),</div>
-<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>      allocSize_(allocSize),</div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>      chunksPerAlloc_(allocSize / chunkSize),</div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>      allocFunc_(std::move(allocFunc)),</div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>      deallocFunc_(std::move(deallocFunc)) {</div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>  <span class="comment">// Start off with at least enough space to store at least one set of chunks.</span></div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  chunks_.reserve(chunksPerAlloc_);</div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>}</div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">   26</a></span><span class="keywordtype">char</span>* <a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">PoolAllocator::alloc</a>() {</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    uint32_t allocId = backingAllocLock_.fetch_or(1, std::memory_order_acquire);</div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (allocId == 0) {</div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>      <span class="keywordflow">if</span> (chunks_.empty()) {</div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordtype">char</span>* buffer = <span class="keyword">reinterpret_cast&lt;</span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(allocFunc_(allocSize_));</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        backingAllocs_.push_back(buffer);</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="comment">// Push n-1 values into the chunks_ buffer, and then return the nth.</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; chunksPerAlloc_ - 1; ++i) {</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>          chunks_.push_back(buffer);</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>          buffer += chunkSize_;</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        }</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        backingAllocLock_.store(0, std::memory_order_release);</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> buffer;</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>      }</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>      <span class="keywordtype">char</span>* back = chunks_.back();</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>      chunks_.pop_back();</div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>      backingAllocLock_.store(0, std::memory_order_release);</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>      <span class="keywordflow">return</span> back;</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>      std::this_thread::yield();</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  }</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">   52</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">PoolAllocator::dealloc</a>(<span class="keywordtype">char</span>* ptr) {</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>  <span class="comment">// For now do not release any memory back to the deallocFunc until destruction.</span></div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>  <span class="comment">// TODO(bbudge): Consider cases where we haven&#39;t gotten below some threshold of ready chunks</span></div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  <span class="comment">// in a while.  In that case, we could begin tracking allocations, and try to assemble entire</span></div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  <span class="comment">// starting allocations, possibly deferring a small amount to each alloc call.  This would be</span></div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  <span class="comment">// slower, but would ensure we don&#39;t get into a situation where we need a bunch of memory up</span></div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  <span class="comment">// front, and then never again.</span></div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint32_t allocId = backingAllocLock_.fetch_or(1, std::memory_order_acquire);</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span> (allocId == 0) {</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>      chunks_.push_back(ptr);</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>      backingAllocLock_.store(0, std::memory_order_release);</div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>      <span class="keywordflow">break</span>;</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  }</div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">   70</a></span><a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">PoolAllocator::~PoolAllocator</a>() {</div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  <span class="keywordflow">for</span> (<span class="keywordtype">char</span>* backing : backingAllocs_) {</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    deallocFunc_(backing);</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  }</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">   13</a></span><a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">PoolAllocatorT&lt;kThreadSafe&gt;::PoolAllocatorT</a>(</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">size_t</span> chunkSize,</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">size_t</span> allocSize,</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    std::function&lt;<span class="keywordtype">void</span>*(<span class="keywordtype">size_t</span>)&gt; allocFunc,</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">void</span>*)&gt; deallocFunc)</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    : chunkSize_(chunkSize),</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>      allocSize_(allocSize),</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>      chunksPerAlloc_(allocSize / chunkSize),</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>      allocFunc_(std::move(allocFunc)),</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>      deallocFunc_(std::move(deallocFunc)) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  <span class="comment">// Start off with at least enough space to store at least one set of chunks.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  chunks_.reserve(chunksPerAlloc_);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">   28</a></span><span class="keywordtype">char</span>* <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">PoolAllocatorT&lt;kThreadSafe&gt;::alloc</a>() {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    uint32_t allocId = 0;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">if</span> (kThreadSafe) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>      allocId = backingAllocLock_.fetch_or(1, std::memory_order_acquire);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (allocId == 0) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>      <span class="keywordflow">if</span> (chunks_.empty()) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordtype">char</span>* buffer;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> (backingAllocs2_.empty()) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>          buffer = <span class="keyword">reinterpret_cast&lt;</span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(allocFunc_(allocSize_));</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>          buffer = backingAllocs2_.back();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>          backingAllocs2_.pop_back();</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        backingAllocs_.push_back(buffer);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// Push n-1 values into the chunks_ buffer, and then return the nth.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; chunksPerAlloc_ - 1; ++i) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>          chunks_.push_back(buffer);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>          buffer += chunkSize_;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (kThreadSafe) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>          backingAllocLock_.store(0, std::memory_order_release);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">return</span> buffer;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>      }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>      <span class="keywordtype">char</span>* back = chunks_.back();</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>      chunks_.pop_back();</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>      <span class="keywordflow">if</span> (kThreadSafe) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        backingAllocLock_.store(0, std::memory_order_release);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>      }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>      <span class="keywordflow">return</span> back;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>      std::this_thread::yield();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>  }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">   68</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">PoolAllocatorT&lt;kThreadSafe&gt;::dealloc</a>(<span class="keywordtype">char</span>* ptr) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="comment">// For now do not release any memory back to the deallocFunc until destruction.</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  <span class="comment">// TODO(bbudge): Consider cases where we haven&#39;t gotten below some threshold of ready chunks</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  <span class="comment">// in a while.  In that case, we could begin tracking allocations, and try to assemble entire</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  <span class="comment">// starting allocations, possibly deferring a small amount to each alloc call.  This would be</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  <span class="comment">// slower, but would ensure we don&#39;t get into a situation where we need a bunch of memory up</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  <span class="comment">// front, and then never again.</span></div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>} <span class="comment">// namespace dispenso</span></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_a38a9be5293b77653b1560cb8e74b5bd4"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">dispenso::PoolAllocator::alloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS char * alloc()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00026">pool_allocator.cpp:26</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_a5c40ea70c1e81435ee7c9152fb9ce62a"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">dispenso::PoolAllocator::~PoolAllocator</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS ~PoolAllocator()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00070">pool_allocator.cpp:70</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_a7a393687ca662206fea08d6d261cdd20"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20">dispenso::PoolAllocator::PoolAllocator</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS PoolAllocator(size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00012">pool_allocator.cpp:12</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_ae7121e9dcebfeb09a6a045d04455a582"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dispenso::PoolAllocator::dealloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void dealloc(char *ptr)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00052">pool_allocator.cpp:52</a></div></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    uint32_t allocId = 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">if</span> (kThreadSafe) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>      allocId = backingAllocLock_.fetch_or(1, std::memory_order_acquire);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">if</span> (allocId == 0) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>      chunks_.push_back(ptr);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>      <span class="keywordflow">if</span> (kThreadSafe) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        backingAllocLock_.store(0, std::memory_order_release);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>      }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>      <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">   92</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">PoolAllocatorT&lt;kThreadSafe&gt;::clear</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  chunks_.clear();</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  <span class="keywordflow">if</span> (backingAllocs2_.size() &lt; backingAllocs_.size()) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::swap(backingAllocs2_, backingAllocs_);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>  }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  <span class="keywordflow">for</span> (<span class="keywordtype">char</span>* ba : backingAllocs_) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    backingAllocs2_.push_back(ba);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  backingAllocs_.clear();</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">  104</a></span><a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">PoolAllocatorT&lt;kThreadSafe&gt;::~PoolAllocatorT</a>() {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  <span class="keywordflow">for</span> (<span class="keywordtype">char</span>* backing : backingAllocs_) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    deallocFunc_(backing);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  <span class="keywordflow">for</span> (<span class="keywordtype">char</span>* backing : backingAllocs2_) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    deallocFunc_(backing);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="keyword">template</span> <span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT&lt;false&gt;</a>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="keyword">template</span> <span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT&lt;true&gt;</a>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>} <span class="comment">// namespace dispenso</span></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a></div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8h_source.html#l00029">pool_allocator.h:29</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a04ec8c4a58977f8ca6011431e1860036"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">dispenso::PoolAllocatorT::alloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS char * alloc()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00028">pool_allocator.cpp:28</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a67dc4676c39f7226c23ac48ea1a58ad1"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">dispenso::PoolAllocatorT::clear</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void clear()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00092">pool_allocator.cpp:92</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a6f1cf4cfc584a9eef84a3e5e4e92ad60"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">dispenso::PoolAllocatorT::~PoolAllocatorT</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS ~PoolAllocatorT()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00104">pool_allocator.cpp:104</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a82adb70b33422125a6f3de59a0b63d11"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11">dispenso::PoolAllocatorT::PoolAllocatorT</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS PoolAllocatorT(size_t chunkSize, size_t allocSize, std::function&lt; void *(size_t)&gt; allocFunc, std::function&lt; void(void *)&gt; deallocFunc)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00013">pool_allocator.cpp:13</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_add24c6cf8e3ea586940a18acf7959a4d"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dispenso::PoolAllocatorT::dealloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void dealloc(char *ptr)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00068">pool_allocator.cpp:68</a></div></div>
 <div class="ttc" id="apool__allocator_8h_html"><div class="ttname"><a href="pool__allocator_8h.html">pool_allocator.h</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/pool__allocator_8h.html b/pool__allocator_8h.html
index 4fbf0d9..4c5c600 100644
--- a/pool__allocator_8h.html
+++ b/pool__allocator_8h.html
@@ -97,7 +97,8 @@
 
 <div class="header">
   <div class="summary">
-<a href="#nested-classes">Classes</a>  </div>
+<a href="#nested-classes">Classes</a> &#124;
+<a href="#typedef-members">Typedefs</a>  </div>
   <div class="headertitle"><div class="title">pool_allocator.h File Reference</div></div>
 </div><!--header-->
 <div class="contents">
@@ -110,14 +111,54 @@
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT&lt; kThreadSafe &gt;</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table><table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
+Typedefs</h2></td></tr>
+<tr class="memitem:aa1d6334a157d4713ac82c2270084b7a6"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pool__allocator_8h.html#aa1d6334a157d4713ac82c2270084b7a6">dispenso::PoolAllocator</a> = PoolAllocatorT&lt; true &gt;</td></tr>
+<tr class="separator:aa1d6334a157d4713ac82c2270084b7a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a78ad28cc5915f68b846d72c5a01bf011"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pool__allocator_8h.html#a78ad28cc5915f68b846d72c5a01bf011">dispenso::NoLockPoolAllocator</a> = PoolAllocatorT&lt; false &gt;</td></tr>
+<tr class="separator:a78ad28cc5915f68b846d72c5a01bf011"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >A pool allocator to help reduce calls to the underlying allocation and deallocation functions that can be provided custom backing allocation and deallocation functions, e.g. cudaMalloc, cudaFree. </p>
 
 <p class="definition">Definition in file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
-</div></div><!-- contents -->
+</div><h2 class="groupheader">Typedef Documentation</h2>
+<a id="a78ad28cc5915f68b846d72c5a01bf011" name="a78ad28cc5915f68b846d72c5a01bf011"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a78ad28cc5915f68b846d72c5a01bf011">&#9670;&#160;</a></span>NoLockPoolAllocator</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::NoLockPoolAllocator</a> = typedef PoolAllocatorT&lt;false&gt;</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8h_source.html#l00095">95</a> of file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
+
+</div>
+</div>
+<a id="aa1d6334a157d4713ac82c2270084b7a6" name="aa1d6334a157d4713ac82c2270084b7a6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa1d6334a157d4713ac82c2270084b7a6">&#9670;&#160;</a></span>PoolAllocator</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocator</a> = typedef PoolAllocatorT&lt;true&gt;</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="pool__allocator_8h_source.html#l00094">94</a> of file <a class="el" href="pool__allocator_8h_source.html">pool_allocator.h</a>.</p>
+
+</div>
+</div>
+</div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
diff --git a/pool__allocator_8h.js b/pool__allocator_8h.js
index 9efffe6..d183c50 100644
--- a/pool__allocator_8h.js
+++ b/pool__allocator_8h.js
@@ -1,4 +1,4 @@
 var pool__allocator_8h =
 [
-    [ "dispenso::PoolAllocator", "classdispenso_1_1_pool_allocator.html", "classdispenso_1_1_pool_allocator" ]
+    [ "dispenso::PoolAllocatorT< kThreadSafe >", "classdispenso_1_1_pool_allocator_t.html", "classdispenso_1_1_pool_allocator_t" ]
 ];
\ No newline at end of file
diff --git a/pool__allocator_8h_source.html b/pool__allocator_8h_source.html
index ff64c72..9500d95 100644
--- a/pool__allocator_8h_source.html
+++ b/pool__allocator_8h_source.html
@@ -116,40 +116,52 @@
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
 <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span>dispenso {</div>
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator.html">   28</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a> {</div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_pool_allocator.html">PoolAllocator</a>(</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>      <span class="keywordtype">size_t</span> chunkSize,</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>      <span class="keywordtype">size_t</span> allocSize,</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>      std::function&lt;<span class="keywordtype">void</span>*(<span class="keywordtype">size_t</span>)&gt; allocFunc,</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>      std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">void</span>*)&gt; deallocFunc);</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">char</span>* <a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">alloc</a>();</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dealloc</a>(<span class="keywordtype">char</span>* ptr);</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>  DISPENSO_DLL_ACCESS <a class="code hl_function" href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">~PoolAllocator</a>();</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> chunkSize_;</div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> allocSize_;</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> chunksPerAlloc_;</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  std::function&lt;<span class="keywordtype">void</span>*(size_t)&gt; allocFunc_;</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  std::function&lt;void(<span class="keywordtype">void</span>*)&gt; deallocFunc_;</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  <span class="comment">// Use of a spin lock was found to be faster than std::mutex in benchmarks.</span></div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  <span class="keyword">alignas</span>(kCacheLineSize) std::atomic&lt;uint32_t&gt; backingAllocLock_{0};</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  std::vector&lt;char*&gt; backingAllocs_;</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  std::vector&lt;char*&gt; chunks_;</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>};</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;<span class="keywordtype">bool</span> kThreadSafe&gt;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html">   29</a></span><span class="keyword">class </span><a class="code hl_class" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  DISPENSO_DLL_ACCESS <a class="code hl_class" href="classdispenso_1_1_pool_allocator_t.html">PoolAllocatorT</a>(</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>      <span class="keywordtype">size_t</span> chunkSize,</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>      <span class="keywordtype">size_t</span> allocSize,</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>      std::function&lt;<span class="keywordtype">void</span>*(<span class="keywordtype">size_t</span>)&gt; allocFunc,</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>      std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">void</span>*)&gt; deallocFunc);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">char</span>* <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">alloc</a>();</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dealloc</a>(<span class="keywordtype">char</span>* ptr);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>  DISPENSO_DLL_ACCESS <span class="keywordtype">void</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">clear</a>();</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">   70</a></span>  <span class="keywordtype">size_t</span> <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">totalChunkCapacity</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> (backingAllocs2_.size() + backingAllocs_.size()) * chunksPerAlloc_;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  DISPENSO_DLL_ACCESS <a class="code hl_function" href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">~PoolAllocatorT</a>();</div>
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>} <span class="comment">// namespace dispenso</span></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html">dispenso::PoolAllocator</a></div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8h_source.html#l00028">pool_allocator.h:28</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_a38a9be5293b77653b1560cb8e74b5bd4"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4">dispenso::PoolAllocator::alloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS char * alloc()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00026">pool_allocator.cpp:26</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_a5c40ea70c1e81435ee7c9152fb9ce62a"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a">dispenso::PoolAllocator::~PoolAllocator</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS ~PoolAllocator()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00070">pool_allocator.cpp:70</a></div></div>
-<div class="ttc" id="aclassdispenso_1_1_pool_allocator_html_ae7121e9dcebfeb09a6a045d04455a582"><div class="ttname"><a href="classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582">dispenso::PoolAllocator::dealloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void dealloc(char *ptr)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00052">pool_allocator.cpp:52</a></div></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> chunkSize_;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> allocSize_;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> chunksPerAlloc_;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  std::function&lt;<span class="keywordtype">void</span>*(size_t)&gt; allocFunc_;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>  std::function&lt;void(<span class="keywordtype">void</span>*)&gt; deallocFunc_;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  <span class="comment">// Use of a spin lock was found to be faster than std::mutex in benchmarks.</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keyword">alignas</span>(kCacheLineSize) std::atomic&lt;uint32_t&gt; backingAllocLock_{0};</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  std::vector&lt;char*&gt; backingAllocs_;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  std::vector&lt;char*&gt; backingAllocs2_;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  std::vector&lt;char*&gt; chunks_;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="keyword">using </span>PoolAllocator = PoolAllocatorT&lt;true&gt;;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="keyword">using </span>NoLockPoolAllocator = PoolAllocatorT&lt;false&gt;;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>} <span class="comment">// namespace dispenso</span></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html">dispenso::PoolAllocatorT</a></div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8h_source.html#l00029">pool_allocator.h:29</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a04ec8c4a58977f8ca6011431e1860036"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036">dispenso::PoolAllocatorT::alloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS char * alloc()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00028">pool_allocator.cpp:28</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a67dc4676c39f7226c23ac48ea1a58ad1"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1">dispenso::PoolAllocatorT::clear</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void clear()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00092">pool_allocator.cpp:92</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a6f1cf4cfc584a9eef84a3e5e4e92ad60"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60">dispenso::PoolAllocatorT::~PoolAllocatorT</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS ~PoolAllocatorT()</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00104">pool_allocator.cpp:104</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_a811782e39e4b441b960bc35757af59c1"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1">dispenso::PoolAllocatorT::totalChunkCapacity</a></div><div class="ttdeci">size_t totalChunkCapacity() const</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8h_source.html#l00070">pool_allocator.h:70</a></div></div>
+<div class="ttc" id="aclassdispenso_1_1_pool_allocator_t_html_add24c6cf8e3ea586940a18acf7959a4d"><div class="ttname"><a href="classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d">dispenso::PoolAllocatorT::dealloc</a></div><div class="ttdeci">DISPENSO_DLL_ACCESS void dealloc(char *ptr)</div><div class="ttdef"><b>Definition:</b> <a href="pool__allocator_8cpp_source.html#l00068">pool_allocator.cpp:68</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/search/all_0.js b/search/all_0.js
index 630a0a8..5815750 100644
--- a/search/all_0.js
+++ b/search/all_0.js
@@ -3,7 +3,7 @@ var searchData=
   ['acquire_0',['acquire',['../classdispenso_1_1_resource_pool.html#aa3dfd898745a3d729f6ab66311ffd443',1,'dispenso::ResourcePool']]],
   ['addnode_1',['addNode',['../classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab',1,'dispenso::SubgraphT::addNode()'],['../classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e',1,'dispenso::GraphT::addNode(T &amp;&amp;f)']]],
   ['addsubgraph_2',['addSubgraph',['../classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43',1,'dispenso::GraphT']]],
-  ['alloc_3',['alloc',['../classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4',1,'dispenso::PoolAllocator']]],
+  ['alloc_3',['alloc',['../classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036',1,'dispenso::PoolAllocatorT']]],
   ['allocsmallbuffer_4',['allocSmallBuffer',['../small__buffer__allocator_8h.html#ab83550597ed4347b3d89d15bb16cd49a',1,'dispenso']]],
   ['approxbytesallocatedsmallbuffer_5',['approxBytesAllocatedSmallBuffer',['../small__buffer__allocator_8h.html#ad883cfcdabda87d64afdab3d04f11a47',1,'dispenso']]],
   ['arrive_5fand_5fwait_6',['arrive_and_wait',['../classdispenso_1_1_latch.html#a20d9a291572a64adf4cb2c419f195292',1,'dispenso::Latch']]],
diff --git a/search/all_10.js b/search/all_10.js
index 5f0f2c9..adf8476 100644
--- a/search/all_10.js
+++ b/search/all_10.js
@@ -8,8 +8,9 @@ var searchData=
   ['threadpriority_5',['ThreadPriority',['../priority_8h.html#ad04637f316fbde5fba47d984c3700bb7',1,'dispenso']]],
   ['timedtask_6',['TimedTask',['../classdispenso_1_1_timed_task.html',1,'dispenso']]],
   ['timedtaskscheduler_7',['TimedTaskScheduler',['../classdispenso_1_1_timed_task_scheduler.html',1,'dispenso::TimedTaskScheduler'],['../classdispenso_1_1_timed_task_scheduler.html#afda120b230ff030f8f9af68c6f7899bc',1,'dispenso::TimedTaskScheduler::TimedTaskScheduler()']]],
-  ['try_5fwait_8',['try_wait',['../classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f',1,'dispenso::Latch']]],
-  ['tryemplaceupdate_9',['tryEmplaceUpdate',['../classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d',1,'dispenso::AsyncRequest']]],
-  ['trywait_10',['tryWait',['../classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5',1,'dispenso::TaskSet::tryWait()'],['../classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad',1,'dispenso::ConcurrentTaskSet::tryWait()']]],
-  ['tsan_5fannotations_2eh_11',['tsan_annotations.h',['../tsan__annotations_8h.html',1,'']]]
+  ['totalchunkcapacity_8',['totalChunkCapacity',['../classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1',1,'dispenso::PoolAllocatorT']]],
+  ['try_5fwait_9',['try_wait',['../classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f',1,'dispenso::Latch']]],
+  ['tryemplaceupdate_10',['tryEmplaceUpdate',['../classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d',1,'dispenso::AsyncRequest']]],
+  ['trywait_11',['tryWait',['../classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5',1,'dispenso::TaskSet::tryWait()'],['../classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad',1,'dispenso::ConcurrentTaskSet::tryWait()']]],
+  ['tsan_5fannotations_2eh_12',['tsan_annotations.h',['../tsan__annotations_8h.html',1,'']]]
 ];
diff --git a/search/all_14.js b/search/all_14.js
index 61303fd..4d90671 100644
--- a/search/all_14.js
+++ b/search/all_14.js
@@ -3,7 +3,7 @@ var searchData=
   ['_7econcurrenttaskset_0',['~ConcurrentTaskSet',['../classdispenso_1_1_concurrent_task_set.html#aaf3fa4c1b3da5fe5c542aa161dcf9478',1,'dispenso::ConcurrentTaskSet']]],
   ['_7econcurrentvector_1',['~ConcurrentVector',['../classdispenso_1_1_concurrent_vector.html#af180093482b0fdd9c89c1157cab07d5d',1,'dispenso::ConcurrentVector']]],
   ['_7efuture_2',['~Future',['../classdispenso_1_1_future.html#a14d27f2276dedd9e4e6d17b6fcfdb74f',1,'dispenso::Future']]],
-  ['_7epoolallocator_3',['~PoolAllocator',['../classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a',1,'dispenso::PoolAllocator']]],
+  ['_7epoolallocatort_3',['~PoolAllocatorT',['../classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60',1,'dispenso::PoolAllocatorT']]],
   ['_7eresourcepool_4',['~ResourcePool',['../classdispenso_1_1_resource_pool.html#a72c23146a6e1d6fdb38ec623f11106dd',1,'dispenso::ResourcePool']]],
   ['_7etaskset_5',['~TaskSet',['../classdispenso_1_1_task_set.html#a2fbdd27aa8ffcb216e51f45aad709f12',1,'dispenso::TaskSet']]],
   ['_7ethreadpool_6',['~ThreadPool',['../classdispenso_1_1_thread_pool.html#acd886dd712424330935b64959e8188af',1,'dispenso::ThreadPool']]],
diff --git a/search/all_2.js b/search/all_2.js
index d9ebf0c..d4263b7 100644
--- a/search/all_2.js
+++ b/search/all_2.js
@@ -8,13 +8,13 @@ var searchData=
   ['cbegin_5',['cbegin',['../classdispenso_1_1_concurrent_vector.html#a8157ca262ec71edddb03db8ad05f2b52',1,'dispenso::ConcurrentVector']]],
   ['cend_6',['cend',['../classdispenso_1_1_concurrent_vector.html#a699a704e271c79bf9a3d537b4a090607',1,'dispenso::ConcurrentVector']]],
   ['chunkedrange_7',['ChunkedRange',['../structdispenso_1_1_chunked_range.html#a488b20ac57d038c6088ba6289c05dd47',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, Auto)'],['../structdispenso_1_1_chunked_range.html#a8a59cc087d0646ce617c04259db26149',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, Static)'],['../structdispenso_1_1_chunked_range.html#a644b2269aed883922db39c928a009b16',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, IntegerT c)'],['../structdispenso_1_1_chunked_range.html',1,'dispenso::ChunkedRange&lt; IntegerT &gt;']]],
-  ['clear_8',['clear',['../classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da',1,'dispenso::GraphT::clear()'],['../classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1',1,'dispenso::ConcurrentVector::clear()'],['../classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe',1,'dispenso::SubgraphT::clear()']]],
+  ['clear_8',['clear',['../classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1',1,'dispenso::PoolAllocatorT::clear()'],['../classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1',1,'dispenso::ConcurrentVector::clear()'],['../classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe',1,'dispenso::SubgraphT::clear()'],['../classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da',1,'dispenso::GraphT::clear()']]],
   ['completed_9',['completed',['../classdispenso_1_1_completion_event.html#aadf4486fc37923878b4d732f0a7f47f4',1,'dispenso::CompletionEvent']]],
   ['completion_5fevent_2eh_10',['completion_event.h',['../completion__event_8h.html',1,'']]],
   ['completionevent_11',['CompletionEvent',['../classdispenso_1_1_completion_event.html',1,'dispenso']]],
   ['concurrent_5fobject_5farena_2eh_12',['concurrent_object_arena.h',['../concurrent__object__arena_8h.html',1,'']]],
   ['concurrent_5fvector_2eh_13',['concurrent_vector.h',['../concurrent__vector_8h.html',1,'']]],
-  ['concurrentobjectarena_14',['ConcurrentObjectArena',['../structdispenso_1_1_concurrent_object_arena.html#a97beaf8f43ab51528598d980d520bb24',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;other)'],['../structdispenso_1_1_concurrent_object_arena.html#a727fe346168e1672195109502e9c60dc',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;&amp;other) noexcept'],['../structdispenso_1_1_concurrent_object_arena.html#ac2e855dc6e3e325e4b9dff88de2ad597',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const Index minBuffSize)'],['../structdispenso_1_1_concurrent_object_arena.html',1,'dispenso::ConcurrentObjectArena&lt; T, Index, alignment &gt;']]],
+  ['concurrentobjectarena_14',['ConcurrentObjectArena',['../structdispenso_1_1_concurrent_object_arena.html#ac2e855dc6e3e325e4b9dff88de2ad597',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const Index minBuffSize)'],['../structdispenso_1_1_concurrent_object_arena.html#a727fe346168e1672195109502e9c60dc',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;&amp;other) noexcept'],['../structdispenso_1_1_concurrent_object_arena.html#a97beaf8f43ab51528598d980d520bb24',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;other)'],['../structdispenso_1_1_concurrent_object_arena.html',1,'dispenso::ConcurrentObjectArena&lt; T, Index, alignment &gt;']]],
   ['concurrenttaskset_15',['ConcurrentTaskSet',['../classdispenso_1_1_concurrent_task_set.html#a5e48f4df33cd5cf87b3973ffb9153f16',1,'dispenso::ConcurrentTaskSet::ConcurrentTaskSet()'],['../classdispenso_1_1_concurrent_task_set.html',1,'dispenso::ConcurrentTaskSet']]],
   ['concurrenttasksetexecutor_16',['ConcurrentTaskSetExecutor',['../classdispenso_1_1_concurrent_task_set_executor.html',1,'dispenso']]],
   ['concurrentvector_17',['ConcurrentVector',['../classdispenso_1_1_concurrent_vector.html#a520f78b3837308ae0bf5042bc02db374',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize)'],['../classdispenso_1_1_concurrent_vector.html#af0f4f336438d230d23cc088c2e650b3a',1,'dispenso::ConcurrentVector::ConcurrentVector(ConcurrentVector &amp;&amp;other)'],['../classdispenso_1_1_concurrent_vector.html#a54dc4ebacd3d78bb0f3d6aa59d60efcf',1,'dispenso::ConcurrentVector::ConcurrentVector(const ConcurrentVector &amp;other)'],['../classdispenso_1_1_concurrent_vector.html#a9c2fcc7dc242363af82ec208c23be729',1,'dispenso::ConcurrentVector::ConcurrentVector(std::initializer_list&lt; T &gt; l)'],['../classdispenso_1_1_concurrent_vector.html#a969ceec28f12a4454fa08578ad8679d1',1,'dispenso::ConcurrentVector::ConcurrentVector(size_type startSize, InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#ad7d74051f6a7341625a2749da507da7b',1,'dispenso::ConcurrentVector::ConcurrentVector(InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#a205540e4da8eba5f90a311154df24d47',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize, const T &amp;defaultValue)'],['../classdispenso_1_1_concurrent_vector.html#ae4d0bc2c37e42d74abbd221ba7d6ca3b',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startCapacity, ReserveTagS)'],['../classdispenso_1_1_concurrent_vector.html#a479d98beb884647f48dcd11226b9db80',1,'dispenso::ConcurrentVector::ConcurrentVector()'],['../classdispenso_1_1_concurrent_vector.html',1,'dispenso::ConcurrentVector&lt; T, Traits, SizeTraits &gt;']]],
diff --git a/search/all_3.js b/search/all_3.js
index 7600158..4ecf81a 100644
--- a/search/all_3.js
+++ b/search/all_3.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['dealloc_0',['dealloc',['../classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582',1,'dispenso::PoolAllocator']]],
+  ['dealloc_0',['dealloc',['../classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d',1,'dispenso::PoolAllocatorT']]],
   ['deallocsmallbuffer_1',['deallocSmallBuffer',['../small__buffer__allocator_8h.html#a1ba6120f1467502c75d6e8bd3d8131ec',1,'dispenso']]],
   ['default_5fcapacity_2',['default_capacity',['../classdispenso_1_1_concurrent_vector.html#a8ce7e4f78d13c0660b9de99ac96a11df',1,'dispenso::ConcurrentVector']]],
   ['defaultchunking_3',['defaultChunking',['../structdispenso_1_1_par_for_options.html#a2cfd7b948697c97874c727940529d1d8',1,'dispenso::ParForOptions']]],
diff --git a/search/all_d.js b/search/all_d.js
index 471f526..35a381d 100644
--- a/search/all_d.js
+++ b/search/all_d.js
@@ -8,7 +8,7 @@ var searchData=
   ['pipeline_5',['pipeline',['../pipeline_8h.html#a5438114dce2544c8cdab8100309478ab',1,'dispenso::pipeline(ThreadPool &amp;pool, Stages &amp;&amp;... sIn)'],['../pipeline_8h.html#a9a0289cbbb678c03532bdf458da1401b',1,'dispenso::pipeline(Stages &amp;&amp;... sIn)']]],
   ['pipeline_2eh_6',['pipeline.h',['../pipeline_8h.html',1,'']]],
   ['pool_5fallocator_2eh_7',['pool_allocator.h',['../pool__allocator_8h.html',1,'']]],
-  ['poolallocator_8',['PoolAllocator',['../classdispenso_1_1_pool_allocator.html',1,'dispenso::PoolAllocator'],['../classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20',1,'dispenso::PoolAllocator::PoolAllocator()']]],
+  ['poolallocatort_8',['PoolAllocatorT',['../classdispenso_1_1_pool_allocator_t.html',1,'dispenso::PoolAllocatorT&lt; kThreadSafe &gt;'],['../classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11',1,'dispenso::PoolAllocatorT::PoolAllocatorT()']]],
   ['pop_5fback_9',['pop_back',['../classdispenso_1_1_concurrent_vector.html#a6df17279a0127ce60af3abb56121678b',1,'dispenso::ConcurrentVector']]],
   ['priority_2eh_10',['priority.h',['../priority_8h.html',1,'']]],
   ['push_5fback_11',['push_back',['../classdispenso_1_1_concurrent_vector.html#a1306ac315f6e7062a6b1ee39e2978b22',1,'dispenso::ConcurrentVector::push_back(T &amp;&amp;val)'],['../classdispenso_1_1_concurrent_vector.html#a0cc5821267defcaf8eaec2bb77ae19ff',1,'dispenso::ConcurrentVector::push_back(const T &amp;val)']]]
diff --git a/search/classes_a.js b/search/classes_a.js
index 2e9d522..a11c937 100644
--- a/search/classes_a.js
+++ b/search/classes_a.js
@@ -2,5 +2,5 @@ var searchData=
 [
   ['parallelforexecutor_0',['ParallelForExecutor',['../classdispenso_1_1_parallel_for_executor.html',1,'dispenso']]],
   ['parforoptions_1',['ParForOptions',['../structdispenso_1_1_par_for_options.html',1,'dispenso']]],
-  ['poolallocator_2',['PoolAllocator',['../classdispenso_1_1_pool_allocator.html',1,'dispenso']]]
+  ['poolallocatort_2',['PoolAllocatorT',['../classdispenso_1_1_pool_allocator_t.html',1,'dispenso']]]
 ];
diff --git a/search/functions_0.js b/search/functions_0.js
index 463623d..96d2295 100644
--- a/search/functions_0.js
+++ b/search/functions_0.js
@@ -3,7 +3,7 @@ var searchData=
   ['acquire_0',['acquire',['../classdispenso_1_1_resource_pool.html#aa3dfd898745a3d729f6ab66311ffd443',1,'dispenso::ResourcePool']]],
   ['addnode_1',['addNode',['../classdispenso_1_1_subgraph_t.html#a3f314f17214ede38225e89be5cdd79ab',1,'dispenso::SubgraphT::addNode()'],['../classdispenso_1_1_graph_t.html#a13d24b1056de5324500d20702661fa7e',1,'dispenso::GraphT::addNode(T &amp;&amp;f)']]],
   ['addsubgraph_2',['addSubgraph',['../classdispenso_1_1_graph_t.html#adf47c5ba380b61e20df7ec680a1cca43',1,'dispenso::GraphT']]],
-  ['alloc_3',['alloc',['../classdispenso_1_1_pool_allocator.html#a38a9be5293b77653b1560cb8e74b5bd4',1,'dispenso::PoolAllocator']]],
+  ['alloc_3',['alloc',['../classdispenso_1_1_pool_allocator_t.html#a04ec8c4a58977f8ca6011431e1860036',1,'dispenso::PoolAllocatorT']]],
   ['allocsmallbuffer_4',['allocSmallBuffer',['../small__buffer__allocator_8h.html#ab83550597ed4347b3d89d15bb16cd49a',1,'dispenso']]],
   ['approxbytesallocatedsmallbuffer_5',['approxBytesAllocatedSmallBuffer',['../small__buffer__allocator_8h.html#ad883cfcdabda87d64afdab3d04f11a47',1,'dispenso']]],
   ['arrive_5fand_5fwait_6',['arrive_and_wait',['../classdispenso_1_1_latch.html#a20d9a291572a64adf4cb2c419f195292',1,'dispenso::Latch']]],
diff --git a/search/functions_13.js b/search/functions_13.js
index 61303fd..4d90671 100644
--- a/search/functions_13.js
+++ b/search/functions_13.js
@@ -3,7 +3,7 @@ var searchData=
   ['_7econcurrenttaskset_0',['~ConcurrentTaskSet',['../classdispenso_1_1_concurrent_task_set.html#aaf3fa4c1b3da5fe5c542aa161dcf9478',1,'dispenso::ConcurrentTaskSet']]],
   ['_7econcurrentvector_1',['~ConcurrentVector',['../classdispenso_1_1_concurrent_vector.html#af180093482b0fdd9c89c1157cab07d5d',1,'dispenso::ConcurrentVector']]],
   ['_7efuture_2',['~Future',['../classdispenso_1_1_future.html#a14d27f2276dedd9e4e6d17b6fcfdb74f',1,'dispenso::Future']]],
-  ['_7epoolallocator_3',['~PoolAllocator',['../classdispenso_1_1_pool_allocator.html#a5c40ea70c1e81435ee7c9152fb9ce62a',1,'dispenso::PoolAllocator']]],
+  ['_7epoolallocatort_3',['~PoolAllocatorT',['../classdispenso_1_1_pool_allocator_t.html#a6f1cf4cfc584a9eef84a3e5e4e92ad60',1,'dispenso::PoolAllocatorT']]],
   ['_7eresourcepool_4',['~ResourcePool',['../classdispenso_1_1_resource_pool.html#a72c23146a6e1d6fdb38ec623f11106dd',1,'dispenso::ResourcePool']]],
   ['_7etaskset_5',['~TaskSet',['../classdispenso_1_1_task_set.html#a2fbdd27aa8ffcb216e51f45aad709f12',1,'dispenso::TaskSet']]],
   ['_7ethreadpool_6',['~ThreadPool',['../classdispenso_1_1_thread_pool.html#acd886dd712424330935b64959e8188af',1,'dispenso::ThreadPool']]],
diff --git a/search/functions_2.js b/search/functions_2.js
index 1f0940b..de20b04 100644
--- a/search/functions_2.js
+++ b/search/functions_2.js
@@ -7,10 +7,10 @@ var searchData=
   ['cbegin_4',['cbegin',['../classdispenso_1_1_concurrent_vector.html#a8157ca262ec71edddb03db8ad05f2b52',1,'dispenso::ConcurrentVector']]],
   ['cend_5',['cend',['../classdispenso_1_1_concurrent_vector.html#a699a704e271c79bf9a3d537b4a090607',1,'dispenso::ConcurrentVector']]],
   ['chunkedrange_6',['ChunkedRange',['../structdispenso_1_1_chunked_range.html#a644b2269aed883922db39c928a009b16',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, IntegerT c)'],['../structdispenso_1_1_chunked_range.html#a8a59cc087d0646ce617c04259db26149',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, Static)'],['../structdispenso_1_1_chunked_range.html#a488b20ac57d038c6088ba6289c05dd47',1,'dispenso::ChunkedRange::ChunkedRange(IntegerT s, IntegerT e, Auto)']]],
-  ['clear_7',['clear',['../classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1',1,'dispenso::ConcurrentVector::clear()'],['../classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe',1,'dispenso::SubgraphT::clear()'],['../classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da',1,'dispenso::GraphT::clear()']]],
+  ['clear_7',['clear',['../classdispenso_1_1_pool_allocator_t.html#a67dc4676c39f7226c23ac48ea1a58ad1',1,'dispenso::PoolAllocatorT::clear()'],['../classdispenso_1_1_graph_t.html#a23d36763edcc0162257ee176355ee1da',1,'dispenso::GraphT::clear()'],['../classdispenso_1_1_concurrent_vector.html#ae3f8595a52183e3a145cf8f4213250b1',1,'dispenso::ConcurrentVector::clear()'],['../classdispenso_1_1_subgraph_t.html#a2e39c55d6e04462971f93f349c5be3fe',1,'dispenso::SubgraphT::clear()']]],
   ['completed_8',['completed',['../classdispenso_1_1_completion_event.html#aadf4486fc37923878b4d732f0a7f47f4',1,'dispenso::CompletionEvent']]],
   ['concurrentobjectarena_9',['ConcurrentObjectArena',['../structdispenso_1_1_concurrent_object_arena.html#ac2e855dc6e3e325e4b9dff88de2ad597',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const Index minBuffSize)'],['../structdispenso_1_1_concurrent_object_arena.html#a97beaf8f43ab51528598d980d520bb24',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(const ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;other)'],['../structdispenso_1_1_concurrent_object_arena.html#a727fe346168e1672195109502e9c60dc',1,'dispenso::ConcurrentObjectArena::ConcurrentObjectArena(ConcurrentObjectArena&lt; T, Index, alignment &gt; &amp;&amp;other) noexcept']]],
   ['concurrenttaskset_10',['ConcurrentTaskSet',['../classdispenso_1_1_concurrent_task_set.html#a5e48f4df33cd5cf87b3973ffb9153f16',1,'dispenso::ConcurrentTaskSet']]],
-  ['concurrentvector_11',['ConcurrentVector',['../classdispenso_1_1_concurrent_vector.html#a479d98beb884647f48dcd11226b9db80',1,'dispenso::ConcurrentVector::ConcurrentVector()'],['../classdispenso_1_1_concurrent_vector.html#ae4d0bc2c37e42d74abbd221ba7d6ca3b',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startCapacity, ReserveTagS)'],['../classdispenso_1_1_concurrent_vector.html#a520f78b3837308ae0bf5042bc02db374',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize)'],['../classdispenso_1_1_concurrent_vector.html#a205540e4da8eba5f90a311154df24d47',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize, const T &amp;defaultValue)'],['../classdispenso_1_1_concurrent_vector.html#ad7d74051f6a7341625a2749da507da7b',1,'dispenso::ConcurrentVector::ConcurrentVector(InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#a969ceec28f12a4454fa08578ad8679d1',1,'dispenso::ConcurrentVector::ConcurrentVector(size_type startSize, InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#a9c2fcc7dc242363af82ec208c23be729',1,'dispenso::ConcurrentVector::ConcurrentVector(std::initializer_list&lt; T &gt; l)'],['../classdispenso_1_1_concurrent_vector.html#a54dc4ebacd3d78bb0f3d6aa59d60efcf',1,'dispenso::ConcurrentVector::ConcurrentVector(const ConcurrentVector &amp;other)'],['../classdispenso_1_1_concurrent_vector.html#af0f4f336438d230d23cc088c2e650b3a',1,'dispenso::ConcurrentVector::ConcurrentVector(ConcurrentVector &amp;&amp;other)']]],
+  ['concurrentvector_11',['ConcurrentVector',['../classdispenso_1_1_concurrent_vector.html#ae4d0bc2c37e42d74abbd221ba7d6ca3b',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startCapacity, ReserveTagS)'],['../classdispenso_1_1_concurrent_vector.html#af0f4f336438d230d23cc088c2e650b3a',1,'dispenso::ConcurrentVector::ConcurrentVector(ConcurrentVector &amp;&amp;other)'],['../classdispenso_1_1_concurrent_vector.html#a54dc4ebacd3d78bb0f3d6aa59d60efcf',1,'dispenso::ConcurrentVector::ConcurrentVector(const ConcurrentVector &amp;other)'],['../classdispenso_1_1_concurrent_vector.html#a9c2fcc7dc242363af82ec208c23be729',1,'dispenso::ConcurrentVector::ConcurrentVector(std::initializer_list&lt; T &gt; l)'],['../classdispenso_1_1_concurrent_vector.html#a969ceec28f12a4454fa08578ad8679d1',1,'dispenso::ConcurrentVector::ConcurrentVector(size_type startSize, InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#ad7d74051f6a7341625a2749da507da7b',1,'dispenso::ConcurrentVector::ConcurrentVector(InIterator start, InIterator end)'],['../classdispenso_1_1_concurrent_vector.html#a205540e4da8eba5f90a311154df24d47',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize, const T &amp;defaultValue)'],['../classdispenso_1_1_concurrent_vector.html#a520f78b3837308ae0bf5042bc02db374',1,'dispenso::ConcurrentVector::ConcurrentVector(size_t startSize)'],['../classdispenso_1_1_concurrent_vector.html#a479d98beb884647f48dcd11226b9db80',1,'dispenso::ConcurrentVector::ConcurrentVector()']]],
   ['count_5fdown_12',['count_down',['../classdispenso_1_1_latch.html#a32b1cd1f97ba95656204c9ba90de41fb',1,'dispenso::Latch']]]
 ];
diff --git a/search/functions_3.js b/search/functions_3.js
index 5460982..1ecf833 100644
--- a/search/functions_3.js
+++ b/search/functions_3.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['dealloc_0',['dealloc',['../classdispenso_1_1_pool_allocator.html#ae7121e9dcebfeb09a6a045d04455a582',1,'dispenso::PoolAllocator']]],
+  ['dealloc_0',['dealloc',['../classdispenso_1_1_pool_allocator_t.html#add24c6cf8e3ea586940a18acf7959a4d',1,'dispenso::PoolAllocatorT']]],
   ['deallocsmallbuffer_1',['deallocSmallBuffer',['../small__buffer__allocator_8h.html#a1ba6120f1467502c75d6e8bd3d8131ec',1,'dispenso']]],
   ['default_5fcapacity_2',['default_capacity',['../classdispenso_1_1_concurrent_vector.html#a8ce7e4f78d13c0660b9de99ac96a11df',1,'dispenso::ConcurrentVector']]],
   ['dependson_3',['dependsOn',['../classdispenso_1_1_node.html#abfb52f4bd018eee8791499a9bd160c8a',1,'dispenso::Node']]],
diff --git a/search/functions_c.js b/search/functions_c.js
index dff578a..85f3b0c 100644
--- a/search/functions_c.js
+++ b/search/functions_c.js
@@ -2,7 +2,7 @@ var searchData=
 [
   ['parallel_5ffor_0',['parallel_for',['../parallel__for_8h.html#a8201f4fc565c557f5cbaf6b4403991b1',1,'dispenso::parallel_for(TaskSetT &amp;taskSet, StateContainer &amp;states, const StateGen &amp;defaultState, const ChunkedRange&lt; IntegerT &gt; &amp;range, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#acc7052102a8bc76b02f21b6c82264c18',1,'dispenso::parallel_for(TaskSetT &amp;taskSet, const ChunkedRange&lt; IntegerT &gt; &amp;range, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#a7d469e66515688d74cc2ebcf9ff0cc54',1,'dispenso::parallel_for(const ChunkedRange&lt; IntegerT &gt; &amp;range, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#acd1434f629d379d54363d93c6970440a',1,'dispenso::parallel_for(StateContainer &amp;states, const StateGen &amp;defaultState, const ChunkedRange&lt; IntegerT &gt; &amp;range, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#a4c7907a22bed40a3cdb0890936e6e402',1,'dispenso::parallel_for(TaskSetT &amp;taskSet, IntegerA start, IntegerB end, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#a4b3adc98a791e37ef19708242b30d047',1,'dispenso::parallel_for(IntegerA start, IntegerB end, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#ac28cb63caa4dc43f836ea3c4d03e9255',1,'dispenso::parallel_for(TaskSetT &amp;taskSet, StateContainer &amp;states, const StateGen &amp;defaultState, IntegerA start, IntegerB end, F &amp;&amp;f, ParForOptions options={})'],['../parallel__for_8h.html#ac0f644b9ba92c8c5c0d86101bf5007fc',1,'dispenso::parallel_for(StateContainer &amp;states, const StateGen &amp;defaultState, IntegerA start, IntegerB end, F &amp;&amp;f, ParForOptions options={})']]],
   ['pipeline_1',['pipeline',['../pipeline_8h.html#a5438114dce2544c8cdab8100309478ab',1,'dispenso::pipeline(ThreadPool &amp;pool, Stages &amp;&amp;... sIn)'],['../pipeline_8h.html#a9a0289cbbb678c03532bdf458da1401b',1,'dispenso::pipeline(Stages &amp;&amp;... sIn)']]],
-  ['poolallocator_2',['PoolAllocator',['../classdispenso_1_1_pool_allocator.html#a7a393687ca662206fea08d6d261cdd20',1,'dispenso::PoolAllocator']]],
+  ['poolallocatort_2',['PoolAllocatorT',['../classdispenso_1_1_pool_allocator_t.html#a82adb70b33422125a6f3de59a0b63d11',1,'dispenso::PoolAllocatorT']]],
   ['pop_5fback_3',['pop_back',['../classdispenso_1_1_concurrent_vector.html#a6df17279a0127ce60af3abb56121678b',1,'dispenso::ConcurrentVector']]],
   ['push_5fback_4',['push_back',['../classdispenso_1_1_concurrent_vector.html#a0cc5821267defcaf8eaec2bb77ae19ff',1,'dispenso::ConcurrentVector::push_back(const T &amp;val)'],['../classdispenso_1_1_concurrent_vector.html#a1306ac315f6e7062a6b1ee39e2978b22',1,'dispenso::ConcurrentVector::push_back(T &amp;&amp;val)']]]
 ];
diff --git a/search/functions_f.js b/search/functions_f.js
index ec10dac..6ff6375 100644
--- a/search/functions_f.js
+++ b/search/functions_f.js
@@ -4,7 +4,8 @@ var searchData=
   ['then_1',['then',['../classdispenso_1_1_future.html#aac1d6623d69295fc0a2d72fac46aebaf',1,'dispenso::Future']]],
   ['threadpool_2',['ThreadPool',['../classdispenso_1_1_thread_pool.html#a2442016e8a4924ca665d3993c1879b4d',1,'dispenso::ThreadPool']]],
   ['timedtaskscheduler_3',['TimedTaskScheduler',['../classdispenso_1_1_timed_task_scheduler.html#afda120b230ff030f8f9af68c6f7899bc',1,'dispenso::TimedTaskScheduler']]],
-  ['try_5fwait_4',['try_wait',['../classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f',1,'dispenso::Latch']]],
-  ['tryemplaceupdate_5',['tryEmplaceUpdate',['../classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d',1,'dispenso::AsyncRequest']]],
-  ['trywait_6',['tryWait',['../classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5',1,'dispenso::TaskSet::tryWait()'],['../classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad',1,'dispenso::ConcurrentTaskSet::tryWait()']]]
+  ['totalchunkcapacity_4',['totalChunkCapacity',['../classdispenso_1_1_pool_allocator_t.html#a811782e39e4b441b960bc35757af59c1',1,'dispenso::PoolAllocatorT']]],
+  ['try_5fwait_5',['try_wait',['../classdispenso_1_1_latch.html#abe26b747c7ddb5620585faad089b2d3f',1,'dispenso::Latch']]],
+  ['tryemplaceupdate_6',['tryEmplaceUpdate',['../classdispenso_1_1_async_request.html#a4fc2ef79cd8d2efd6cbab96b0ca8ef1d',1,'dispenso::AsyncRequest']]],
+  ['trywait_7',['tryWait',['../classdispenso_1_1_task_set.html#a17cf46f5790f1a818ac404167a796bd5',1,'dispenso::TaskSet::tryWait()'],['../classdispenso_1_1_concurrent_task_set.html#a5338ddfb4e5d98f769386b7b35b3f7ad',1,'dispenso::ConcurrentTaskSet::tryWait()']]]
 ];