effspm 0.1.5__cp310-cp310-win_amd64.whl → 0.2.6__cp310-cp310-win_amd64.whl

effspm/largehm/src/freq_miner.cpp

@@ -0,0 +1,445 @@
+
+#include <cstdint>
+#include <vector>
+
+#include <iostream>
+#include <time.h>
+      // for std::vector
+#include <cmath>         // for std::ceil
+
+#include "freq_miner.hpp"
+#include "build_mdd.hpp"
+#include "utility.hpp"
+std::vector<std::uint64_t> ancest_base;
+namespace largehm {
+
+void Out_patt(std::vector<int>& seq, unsigned int freq);
+void Extend_patt(Pattern& _patt);
+void Mine_vec(unsigned long long int seq_ID,
+              int pos,
+              int num_found,
+             
+              std::vector<int>& items,
+              unsigned long long int inod,
+              int sgn);
+
+unsigned long long int num_patt = 0;
+
+std::vector<bool> ilist;
+std::vector<bool> slist;
+
+std::vector<Pattern> pot_patt;
+std::vector<VPattern> pot_vpatt;
+std::vector<unsigned long long int> last_strpnt;
+
+std::vector<int> DFS_numfound;
+
+Pattern _patt;
+VPattern _vpatt;
+
+int itmset_size;
+int last_neg;
+
+bool ilist_nempty;
+
+
+void Freq_miner() {
+    
+
+    // ─── Make sure DFS and VDFS are at least size L ─────────────────────────────
+    if (DFS.size() < static_cast<size_t>(L)) {
+        size_t old = DFS.size();
+        DFS.resize(static_cast<size_t>(L));
+        for (size_t i = old; i < DFS.size(); ++i) {
+            DFS[i] = Pattern(-static_cast<int>(i) - 1);
+        }
+    }
+    if (VDFS.size() < static_cast<size_t>(L)) {
+        size_t old = VDFS.size();
+        VDFS.resize(static_cast<size_t>(L));
+        for (size_t i = old; i < VDFS.size(); ++i) {
+            VDFS[i] = VPattern(static_cast<int>(i));
+        }
+    }
+    // ─────────────────────────────────────────────────────────────────────────────
+
+   
+    if (!Tree.empty()) {
+        // std::cout << ", Tree[0].chld=" << Tree[0].chld
+        //           << ", Tree[0].sibl=" << Tree[0].sibl
+        //           << ", Tree[0].freq=" << Tree[0].freq;
+    }
+    // std::cout << ", DFS.size()=" << DFS.size()
+    //           << ", theta="    << theta
+    //           << ", M="        << M
+    //           << ", E="        << E
+    //           << std::endl;
+
+    std::vector<int> tmp_list;
+    for (int i = 0; i < static_cast<int>(L); ++i) {
+        if (DFS[i].freq >= theta) {
+            tmp_list.push_back(-i - 1);
+            if (itmset_exists) {
+                tmp_list.push_back(i + 1);
+            }
+        }
+    }
+
+    for (int i = 0; i < static_cast<int>(DFS.size()); ++i) {
+        DFS[i].list = tmp_list;
+    }
+
+    while (!DFS.empty() && give_time(std::clock() - start_time) < time_limit) {
+        if (DFS.back().freq >= theta) {
+            Extend_patt(DFS.back());
+        }
+        else {
+            DFS.pop_back();
+            if (!VDFS.empty() && VDFS.back().ass_patt == static_cast<int>(DFS.size())) {
+                VDFS.pop_back();
+            }
+        }
+    }
+}
+
+
+void Extend_patt(Pattern& _pattern) {
+    swap(_patt, _pattern);
+    DFS.pop_back();
+
+    slist = std::vector<bool>(L, false);
+    ilist_nempty = false;
+
+    if (itmset_exists) {
+        ilist = std::vector<bool>(L, false);
+        for (auto it = _patt.list.begin(); it != _patt.list.end(); ++it) {
+            if (*it < 0)
+                slist[-(*it) - 1] = true;
+            else {
+                ilist[(*it) - 1] = true;
+                ilist_nempty = true;
+            }
+        }
+    }
+    else {
+        for (auto it = _patt.list.begin(); it != _patt.list.end(); ++it)
+            slist[-(*it) - 1] = true;
+    }
+
+    last_neg = _patt.seq.size() - 1;
+    while (_patt.seq[last_neg] > 0)
+        --last_neg;
+    itmset_size = _patt.seq.size() - last_neg;
+
+    pot_patt = std::vector<Pattern>(L + L * (ilist_nempty ? 1 : 0));
+    if (!CTree.empty())
+        pot_vpatt = std::vector<VPattern>(L + L * (ilist_nempty ? 1 : 0));
+
+    last_strpnt = std::vector<unsigned long long int>(L, 0ULL);
+
+    if (!VDFS.empty() && VDFS.back().ass_patt == static_cast<int>(DFS.size())) {
+        swap(_vpatt, VDFS.back());
+        VDFS.pop_back();
+        for (unsigned long long int pnt = 0; pnt < _vpatt.str_pnt.size(); ++pnt) {
+            if (_vpatt.str_pnt[pnt] < 0) {
+                Mine_vec(_vpatt.seq_ID[pnt],
+                         -_vpatt.str_pnt[pnt],
+                         -1,
+                         ancest_base,
+                         CTree[_vpatt.seq_ID[pnt]].seq,
+                         0,
+                         -1);
+            }
+            else {
+                Mine_vec(_vpatt.seq_ID[pnt],
+                         _vpatt.str_pnt[pnt],
+                         -1,
+                         ancest_base,
+                         VTree[_vpatt.seq_ID[pnt]].seq,
+                         0,
+                         1);
+            }
+        }
+    }
+
+    std::vector<unsigned long long int> DFS_itm;
+    std::vector<unsigned long long int> DFS_seq;
+    if (ilist_nempty)
+        DFS_numfound.clear();
+
+    for (unsigned long long int pnt = 0; pnt < _patt.str_pnt.size(); ++pnt) {
+        DFS_itm.push_back(_patt.str_pnt[pnt]);
+        while (!DFS_itm.empty()) {
+            unsigned long long int cur_sibl = DFS_itm.back();
+            DFS_itm.pop_back();
+            if (Tree[cur_sibl].itmset < 0) {
+                unsigned int carc = Tree[cur_sibl].chld;
+                Mine_vec(carc,
+                         0,
+                         -1,
+                         CTree[carc].ancest,
+                         CTree[carc].seq,
+                         _patt.str_pnt[pnt],
+                         -1);
+                cur_sibl = CTree[carc].ancest.back();
+                while (cur_sibl != 0) {
+                    Mine_vec(cur_sibl - 1,
+                             0,
+                             -1,
+                             CTree[carc].ancest,
+                             VTree[cur_sibl - 1].seq,
+                             _patt.str_pnt[pnt],
+                             1);
+                    cur_sibl = VTree[cur_sibl - 1].sibl;
+                }
+                continue;
+            }
+            cur_sibl = Tree[cur_sibl].chld;
+            while (cur_sibl != 0) {
+                int cur_itm = Tree[cur_sibl].item;
+                if (cur_itm < 0) {
+                    cur_itm = -cur_itm;
+                    if (slist[cur_itm - 1]) {
+                        pot_patt[cur_itm - 1].freq += Tree[cur_sibl].freq;
+                        if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                            pot_patt[cur_itm - 1].str_pnt.push_back(cur_sibl);
+                    }
+                    if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0) {
+                        DFS_seq.push_back(cur_sibl);
+                        if (ilist_nempty) {
+                            if (cur_itm == -_patt.seq[last_neg])
+                                DFS_numfound.push_back(1);
+                            else
+                                DFS_numfound.push_back(0);
+                        }
+                    }
+                }
+                else {
+                    if (ilist[cur_itm - 1]) {
+                        pot_patt[cur_itm + L - 1].freq += Tree[cur_sibl].freq;
+                        if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                            pot_patt[cur_itm + L - 1].str_pnt.push_back(cur_sibl);
+                    }
+                    if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                        DFS_itm.push_back(cur_sibl);
+                }
+                cur_sibl = Tree[cur_sibl].sibl;
+            }
+        }
+        if (ilist_nempty) {
+            for (int i = 0; i < (int)L; ++i) {
+                if (ilist[i])
+                    last_strpnt[i] = pot_patt[i + L].str_pnt.size();
+            }
+        }
+        while(!DFS_seq.empty()) {
+            unsigned long long int cur_sibl = DFS_seq.back();
+            DFS_seq.pop_back();
+            int num_found = 0;
+            if (ilist_nempty) {
+                num_found = DFS_numfound.back();
+                DFS_numfound.pop_back();
+            }
+            if (Tree[cur_sibl].itmset < 0) {
+                unsigned int carc = Tree[cur_sibl].chld;
+                Mine_vec(carc,
+                         0,
+                         num_found,
+                         CTree[carc].ancest,
+                         CTree[carc].seq,
+                         _patt.str_pnt[pnt],
+                         -1);
+                cur_sibl = CTree[carc].ancest.back();
+                while (cur_sibl != 0) {
+                    Mine_vec(cur_sibl - 1,
+                             0,
+                             num_found,
+                             CTree[carc].ancest,
+                             VTree[cur_sibl - 1].seq,
+                             _patt.str_pnt[pnt],
+                             1);
+                    cur_sibl = VTree[cur_sibl - 1].sibl;
+                }
+                continue;
+            }
+            cur_sibl = Tree[cur_sibl].chld;
+            while (cur_sibl != 0) {
+                int cur_itm = Tree[cur_sibl].item;
+                if (cur_itm > 0) {
+                    if (num_found == itmset_size &&
+                        ilist[cur_itm - 1] &&
+                        (std::abs(Tree[Tree[cur_sibl].anct].itmset) < std::abs(Tree[_patt.str_pnt[pnt]].itmset) 
+                         || !check_parent(Tree[cur_sibl].anct,
+                                         _patt.str_pnt[pnt],
+                                         last_strpnt[cur_itm - 1],
+                                         pot_patt[cur_itm + L - 1].str_pnt)))
+                    {
+                        pot_patt[cur_itm + L - 1].freq += Tree[cur_sibl].freq;
+                        if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                            pot_patt[cur_itm + L - 1].str_pnt.push_back(cur_sibl);
+                    }
+                    if (slist[cur_itm - 1] &&
+                        std::abs(Tree[Tree[cur_sibl].anct].itmset) <= std::abs(Tree[_patt.str_pnt[pnt]].itmset))
+                    {
+                        pot_patt[cur_itm - 1].freq += Tree[cur_sibl].freq;
+                        if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                            pot_patt[cur_itm - 1].str_pnt.push_back(cur_sibl);
+                    }
+                    if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0) {
+                        DFS_seq.push_back(cur_sibl);
+                        if (ilist_nempty) {
+                            if (num_found < itmset_size 
+                                && cur_itm == std::abs(_patt.seq[last_neg + num_found])) 
+                                DFS_numfound.push_back(num_found + 1);
+                            else
+                                DFS_numfound.push_back(num_found);
+                        }
+                    }
+                }
+                else {
+                    cur_itm = -cur_itm;
+                    if (slist[cur_itm - 1] &&
+                        std::abs(Tree[Tree[cur_sibl].anct].itmset) <= std::abs(Tree[_patt.str_pnt[pnt]].itmset))
+                    {
+                        pot_patt[cur_itm - 1].freq += Tree[cur_sibl].freq;
+                        if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0)
+                            pot_patt[cur_itm - 1].str_pnt.push_back(cur_sibl);
+                    }
+                    if (Tree[cur_sibl].chld != 0 || Tree[cur_sibl].itmset < 0) {
+                        DFS_seq.push_back(cur_sibl);
+                        if (ilist_nempty) {
+                            if (cur_itm == -_patt.seq[last_neg])
+                                DFS_numfound.push_back(1);
+                            else
+                                DFS_numfound.push_back(0);
+                        }
+                    }
+                }
+                cur_sibl = Tree[cur_sibl].sibl;
+            }
+        }
+    }
+
+    std::vector<int> ilistp;
+    std::vector<int> slistp;
+    for (auto it = _patt.list.begin(); it != _patt.list.end(); ++it) {
+        if (*it > 0 && pot_patt[(*it) + L - 1].freq >= theta) 
+            ilistp.push_back(*it);
+        else if (*it < 0 && pot_patt[-(*it) - 1].freq >= theta) {
+            if (itmset_exists) 
+                slistp.push_back(-(*it));
+            ilistp.push_back(*it);
+            slistp.push_back(*it);
+        }
+    } 
+
+    for (auto it = ilistp.begin(); it != ilistp.end(); ++it) {
+        int p;
+        if (*it < 0) 
+            p = -(*it) - 1;
+        else
+            p = (*it) - 1 + L;
+        pot_patt[p].str_pnt.shrink_to_fit();
+        DFS.push_back(pot_patt[p]);
+        DFS.back().seq = _patt.seq;
+        DFS.back().seq.push_back(*it);
+        if (*it < 0)
+            DFS.back().list = slistp;
+        else
+            DFS.back().list = ilistp;
+        if (!CTree.empty() && !pot_vpatt[p].str_pnt.empty()) {
+            pot_vpatt[p].ass_patt = static_cast<int>(DFS.size()) - 1;
+            VDFS.push_back(pot_vpatt[p]);
+        }
+        if (b_disp || b_write) 
+            Out_patt(DFS.back().seq, DFS.back().freq);
+        ++num_patt;
+    }
+}
+
+
+void Mine_vec(std::uint64_t seq_ID,
+              int pos,
+              int num_found,
+              std::vector<std::uint64_t>& ancest,
+              std::vector<int>& items,
+              std::uint64_t pnt,
+              int sgn)
+{
+    std::vector<bool> found(L + L * (ilist_nempty ? 1 : 0), false);
+
+    if (num_found == -1) {
+        while (pos < static_cast<int>(items.size()) && items[pos] > 0) {
+            int cur_itm = items[pos];
+            if (ilist[cur_itm - 1] && !found[cur_itm + L - 1]) {
+                if (pos + 1 < static_cast<int>(items.size())) {
+                    pot_vpatt[cur_itm + L - 1].seq_ID.push_back(seq_ID);
+                    pot_vpatt[cur_itm + L - 1].str_pnt.push_back(sgn * (pos + 1));
+                }
+                ++pot_patt[cur_itm + L - 1].freq;
+                found[cur_itm + L - 1] = true;            
+            }
+            ++pos;
+        }
+    }
+
+    for (unsigned int k = pos; k < items.size(); ++k) {
+        int cur_itm = std::abs(items[k]);
+        if (items[k] < 0) 
+            num_found = 0;
+        if (slist[cur_itm - 1] && !found[cur_itm - 1]) {
+            if (ancest.empty() || std::abs(Tree[ancest[cur_itm - 1]].itmset) <= std::abs(Tree[pnt].itmset)) {
+                if (k + 1 < static_cast<int>(items.size())) {
+                    pot_vpatt[cur_itm - 1].seq_ID.push_back(seq_ID);
+                    pot_vpatt[cur_itm - 1].str_pnt.push_back(sgn * (k + 1));
+                }
+                ++pot_patt[cur_itm - 1].freq;
+            }
+            found[cur_itm - 1] = true;
+        }
+        if (num_found == itmset_size) {
+            if (ilist[cur_itm - 1] && !found[cur_itm + L - 1]) {
+                if (ancest.empty() || 
+                    std::abs(Tree[ancest[cur_itm - 1]].itmset) < std::abs(Tree[pnt].itmset) 
+                    || !check_parent(ancest[cur_itm - 1], pnt, last_strpnt[cur_itm - 1], pot_patt[cur_itm + L - 1].str_pnt))
+                {
+                    if (k + 1 < static_cast<int>(items.size())) {
+                        pot_vpatt[cur_itm + L - 1].seq_ID.push_back(seq_ID);
+                        pot_vpatt[cur_itm + L - 1].str_pnt.push_back(sgn * (k + 1));
+                    }
+                    ++pot_patt[cur_itm + L - 1].freq;
+                }
+                found[cur_itm + L - 1] = true;
+            }
+        }
+        else if (cur_itm == std::abs(_patt.seq[last_neg + num_found])) {
+            ++num_found;
+        }
+    }
+}
+
+
+void Out_patt(std::vector<int>& seq, unsigned int freq) {
+    largehm::collected.push_back(seq);
+    std::ofstream file_o;
+    if (b_write) 
+        file_o.open(out_file, std::ios::app);
+
+    for (int ii = 0; ii < static_cast<int>(seq.size()); ii++) {
+        if (b_disp)
+            std::cout << seq[ii] << " ";
+        if (b_write) 
+            file_o << seq[ii] << " ";
+    }
+    if (b_disp)
+        std::cout << std::endl;
+    if (b_write) {
+        file_o << std::endl;
+        file_o << "************** Freq: " << freq << std::endl;
+        file_o.close();
+    }
+    if (b_disp)
+        std::cout << "************** Freq: " << freq << std::endl;
+}
+
+} // namespace largehm

effspm/largehm/src/freq_miner.hpp

@@ -0,0 +1,77 @@
+#ifndef LARGEHM_FREQ_MINER_HPP
+#define LARGEHM_FREQ_MINER_HPP
+#include <cstdint>
+#include <vector>
+#include <string>
+#include <fstream>
+#include <ctime>      // for clock_t
+extern std::vector<std::uint64_t> ancest_base;
+namespace largehm {
+
+//
+// ─── Pattern & VPattern ──────────────────────────────────────────────────────
+//
+
+class Pattern {
+public:
+    std::vector<int>            seq;
+    unsigned int                freq;
+    std::vector<int>            list;
+    std::vector<unsigned long long int> str_pnt;
+
+    Pattern(int start_code = 0) : freq(0) {
+        if (start_code != 0)
+            seq.push_back(start_code);
+    }
+};
+
+class VPattern {
+public:
+    std::vector<unsigned long long int> str_pnt;
+    std::vector<unsigned long long int> seq_ID;
+    int                                 ass_patt;
+
+    VPattern(int assoc = -1) : ass_patt(assoc) {}
+};
+
+//
+// ─── Globals used by Freq_miner ──────────────────────────────────────────────
+//
+extern std::vector<Pattern>    DFS;
+extern std::vector<VPattern>   VDFS;
+
+extern unsigned long long int num_patt;
+
+extern std::vector<bool>       ilist;
+extern std::vector<bool>       slist;
+
+extern std::vector<Pattern>    pot_patt;
+extern std::vector<VPattern>   pot_vpatt;
+extern std::vector<unsigned long long int> last_strpnt;
+
+extern std::vector<int>       DFS_numfound;
+
+extern Pattern                 _patt;
+extern VPattern                _vpatt;
+
+extern int                     itmset_size;
+extern int                     last_neg;
+extern bool                    ilist_nempty;
+
+//
+// ─── Function Prototypes ─────────────────────────────────────────────────────
+//
+void Freq_miner();
+void Extend_patt(Pattern& _patt);
+void Mine_vec(std::uint64_t seq_ID,
+              int pos,
+              int num_found,
+              std::vector<std::uint64_t>& ancest,
+              std::vector<int>& items,
+              std::uint64_t pnt,
+              int sgn);
+void Out_patt(std::vector<int>& seq, unsigned int freq);
+
+} // namespace largehm
+
+#endif // LARGEHM_FREQ_MINER_HPP