⚡ improved compute table reset

Author: burgholzer

include/DDpackage.h

@@ -156,12 +156,15 @@ namespace dd {
         // Three types since different possibilities for complex numbers  (caused by caching)
         // weights of operands and result are from complex table (e.g., transpose, conjugateTranspose)
         std::array<std::array<CTentry1, CTSLOTS>, modeCount> CTable1{};
+        std::array<std::size_t, modeCount> CT1count{};
 
         // weights of operands are from complex table, weight of result from cache/ZERO (e.g., mult)
         std::array<std::array<CTentry2, CTSLOTS>, modeCount> CTable2{};
+        std::array<std::size_t, modeCount> CT2count{};
 
         // weights of operands and result are from cache/ZERO (e.g., add)
         std::array<std::array<CTentry3, CTSLOTS>, modeCount> CTable3{};
+        std::array<std::size_t, modeCount> CT3count{};
 
         // Toffoli gate table
         std::array<TTentry, TTSLOTS> TTable{};

src/DDdebug.cpp

@@ -218,6 +218,7 @@ namespace dd {
                   << "\n  UniqueTable:"
                   << "\n    Collisions: " << UTcol
                   << "\n    Matches:    " << UTmatch
+                  << "\n    Looks:      " << UTlookups
                   << "\n"
                   << std::flush;
     }

src/DDpackage.cpp

@@ -673,6 +673,7 @@ namespace dd {
             table[i].r     = r.p;
             table[i].rw.r  = r.w.r->val;
             table[i].rw.i  = r.w.i->val;
+            CT2count.at(mode)++;
         } else if (which == ad) {
             std::array<CTentry3, CTSLOTS>& table = CTable3.at(mode);
             ComplexValue                   aw{a.w.r->val, a.w.i->val};
@@ -689,7 +690,7 @@ namespace dd {
             table[i].rw.r  = r.w.r->val;
             table[i].rw.i  = r.w.i->val;
             table[i].which = which;
-
+            CT3count.at(mode)++;
         } else if (which == conjTransp || which == transp) {
             std::array<CTentry1, CTSLOTS>& table = CTable1.at(mode);
             const unsigned long            i     = CThash(a, b, which);
@@ -698,6 +699,7 @@ namespace dd {
             table[i].b     = b;
             table[i].which = which;
             table[i].r     = r;
+            CT1count.at(mode)++;
         } else {
             throw std::runtime_error("Undefined kind in CTinsert: " + std::to_string(which));
         }
@@ -1655,22 +1657,27 @@ namespace dd {
     }
 
     void Package::clearComputeTables() {
-        for (auto& table: CTable1) {
-            for (auto& entry: table) {
-                entry.r.p   = nullptr;
-                entry.which = none;
+        for (auto i = 0U; i < modeCount; ++i) {
+            if (CT1count.at(i) > 0) {
+                for (auto& entry: CTable1.at(i)) {
+                    entry.r.p   = nullptr;
+                    entry.which = none;
+                }
+                CT1count.at(i) = 0;
             }
-        }
-        for (auto& table: CTable2) {
-            for (auto& entry: table) {
-                entry.r     = nullptr;
-                entry.which = none;
+            if (CT2count.at(i) > 0) {
+                for (auto& entry: CTable2.at(i)) {
+                    entry.r     = nullptr;
+                    entry.which = none;
+                }
+                CT2count.at(i) = 0;
             }
-        }
-        for (auto& table: CTable3) {
-            for (auto& entry: table) {
-                entry.r     = nullptr;
-                entry.which = none;
+            if (CT3count.at(i) > 0) {
+                for (auto& entry: CTable3.at(i)) {
+                    entry.r     = nullptr;
+                    entry.which = none;
+                }
+                CT3count.at(i) = 0;
             }
         }
     }