effspm 0.1.12__cp313-cp313-macosx_10_13_universal2.whl → 0.2.2__cp313-cp313-macosx_10_13_universal2.whl

effspm/largepp/src/freq_miner.cpp

@@ -0,0 +1,170 @@
+#include <iostream>
+#include <time.h>
+#include "freq_miner.hpp"
+#include "utility.hpp"
+
+namespace largepp   // ← BEGIN namespacing
+{
+void Out_patt(vector<int>& seq, unsigned int freq);
+void Extend_patt(Pattern& _patt);
+
+unsigned long long int num_patt = 0;
+
+Pattern _patt;
+
+void Freq_miner() {
+
+	vector<int> islist;
+
+	for (int i = 0; i < L; ++i) {
+		if (DFS[i].freq >= theta) 
+			islist.push_back(i);
+	}
+
+	for (int i = 0; i < DFS.size(); ++i) {
+		DFS[i].ilist = islist;
+		DFS[i].slist = islist;
+	}
+	
+	while (!DFS.empty() && give_time(clock() - start_time) < time_limit) {
+		if (DFS.back().freq >= theta)
+			Extend_patt(DFS.back());
+		else 
+			DFS.pop_back();
+	}
+
+}
+
+void Extend_patt(Pattern& _pattern) {
+
+	swap(_patt, _pattern);
+	DFS.pop_back();
+
+	vector<bool> slist(L, 0);
+	vector<bool> ilist(L, 0);
+	
+	for (vector<int>::iterator it = _patt.slist.begin(); it != _patt.slist.end(); ++it)
+		slist[*it] = 1;
+	for (vector<int>::iterator it = _patt.ilist.begin(); it != _patt.ilist.end(); ++it)
+		ilist[*it] = 1;
+
+	vector<Pattern> pot_patt(L * 2);
+
+	int last_neg = _patt.seq.size() - 1;
+	while (_patt.seq[last_neg] > 0)
+		--last_neg;
+
+	for (int i = 0; i < _patt.str_pnt.size(); ++i) {
+
+		vector<bool> found(L * 2, 0);		
+
+		unsigned long long int seq = _patt.seq_ID[i];				
+		unsigned int j = _patt.str_pnt[i] + 1;
+		while (j < items[seq].size() && items[seq][j] > 0) {
+			int cur_itm = items[seq][j];
+			if (ilist[cur_itm - 1]) {
+				pot_patt[cur_itm - 1].seq_ID.push_back(seq);
+				pot_patt[cur_itm - 1].str_pnt.push_back(j);
+				++pot_patt[cur_itm - 1].freq;
+				found[cur_itm - 1] = 1;
+			}
+			++j;
+		}
+		
+		int num_itmfnd = 0;
+		for (int k = j; k < items[seq].size(); ++k) {
+			int cur_itm = abs(items[seq][k]);
+			if (items[seq][k] < 0) 
+				num_itmfnd = 0;
+			if (slist[cur_itm - 1] && !found[L + cur_itm - 1]) {
+				pot_patt[L + cur_itm - 1].seq_ID.push_back(seq);
+				pot_patt[L + cur_itm - 1].str_pnt.push_back(k);
+				++pot_patt[L + cur_itm - 1].freq;
+				found[L + cur_itm - 1] = 1;
+			}
+			if (num_itmfnd == _patt.seq.size() - last_neg) {
+				if (ilist[cur_itm - 1] && !found[cur_itm - 1]) {
+					pot_patt[cur_itm - 1].seq_ID.push_back(seq);
+					pot_patt[cur_itm - 1].str_pnt.push_back(k);
+					++pot_patt[cur_itm - 1].freq;
+					found[cur_itm - 1] = 1;
+				}
+			}
+			else if (cur_itm == abs(_patt.seq[last_neg + num_itmfnd])) 
+				++num_itmfnd;
+		}
+	}
+
+
+	vector<int> slistp;
+	vector<int> ilistp;
+
+	for (vector<int>::iterator it = _patt.ilist.begin(); it != _patt.ilist.end(); ++it) {
+		if (pot_patt[*it].freq >= theta) 
+			ilistp.push_back(*it);
+	}
+
+	for (vector<int>::iterator it = _patt.slist.begin(); it != _patt.slist.end(); ++it) {
+		if (pot_patt[(*it) + L].freq >= theta) 
+			slistp.push_back(*it);
+	}
+
+	for (vector<int>::iterator it = ilistp.begin(); it != ilistp.end(); ++it) {
+		DFS.emplace_back();
+		swap(DFS.back(), pot_patt[*it]);
+		DFS.back().seq = _patt.seq;
+		DFS.back().seq.push_back((*it) + 1);
+		DFS.back().slist = slistp;
+		DFS.back().ilist = ilistp;
+		if (b_disp || b_write) 
+			Out_patt(DFS.back().seq, DFS.back().freq);
+		++num_patt;
+	}
+
+
+	for (vector<int>::iterator it = slistp.begin(); it != slistp.end(); ++it) {
+		DFS.emplace_back();
+		swap(DFS.back(), pot_patt[(*it) + L]);
+		DFS.back().seq = _patt.seq;
+		DFS.back().seq.push_back(-(*it) - 1);
+		DFS.back().slist = slistp;
+		DFS.back().ilist = slistp;
+		if (b_disp || b_write) 
+			Out_patt(DFS.back().seq, DFS.back().freq);
+		++num_patt;
+	}
+
+}
+
+
+void Out_patt(vector<int>& seq, unsigned int freq) {
+
+	largepp::collected.push_back(seq);  
+
+	ofstream file_o;
+	if (b_write) 
+		file_o.open(out_file, std::ios::app);
+
+	for (int ii = 0; ii < seq.size(); ii++) {
+		if (b_disp)
+			cout << seq[ii] << " ";
+		if (b_write) 
+			file_o << seq[ii] << " ";
+	}
+	if (b_disp)
+		cout << endl;
+	if (b_write) 
+		file_o << endl;
+	
+	if (b_disp)
+		cout << "************** Freq: " << freq << endl;
+	if (b_write) {
+		file_o << "************** Freq: " << freq << endl;
+		file_o.close();
+	}
+}
+}
+
+
+
+

effspm/largepp/src/freq_miner.hpp

@@ -0,0 +1,43 @@
+#pragma once
+
+#include "load_inst.hpp"
+namespace largepp   // ← BEGIN namespacing
+{
+void Freq_miner();
+
+class Pattern {
+public:
+
+	vector<int> seq;
+	vector<unsigned int> str_pnt;
+	vector<unsigned long long int> seq_ID;
+
+	vector<int> slist;
+	vector<int> ilist;
+
+	unsigned long long int freq;
+
+	Pattern(vector<int>& _seq, int item) {
+		seq.reserve(_seq.size());
+		for (int i = 0; i < _seq.size(); ++i)
+			seq.push_back(_seq[i]);
+		seq.push_back(item);
+		freq = 0;
+	}
+
+
+	Pattern(int item) {
+		seq.push_back(item);
+		freq = 0;
+	}
+
+	Pattern() {
+		freq = 0;
+	}
+
+};
+
+extern vector<Pattern> DFS;				//DFS queue of potential patterns to extend
+
+extern unsigned long long int num_patt;
+}

effspm/largepp/src/load_inst.cpp

@@ -0,0 +1,219 @@
+#include <iostream>
+#include <sstream>
+#include <algorithm>
+#include <cmath>
+#include "load_inst.hpp"
+#include "freq_miner.hpp"
+#include "utility.hpp"
+
+namespace largepp {   // ─── BEGIN namespace ─────────────────────
+using namespace std;
+
+/* ------------------------------------------------------------------
+ *  Global definitions (match the externs in load_inst.hpp)
+ * ---------------------------------------------------------------- */
+unsigned int        M = 0, L = 0;
+unsigned long long  N = 0, E = 0;
+double              theta = 0.01;
+vector<vector<int>> items;
+vector<Pattern>     DFS;
+vector<int>         item_dic;
+
+/*  Forward decls for helper routines in this file  */
+static bool  Load_items(string& inst);
+static void  Load_items_pre(string& inst);
+static bool  Preprocess(string& inst, double thresh);
+
+/* ==================================================================
+ *  MAIN ENTRY — load from disk
+ * ================================================================= */
+bool Load_instance(string& items_file, double thresh)
+{
+    clock_t kk = clock();
+
+    if (pre_pro) {
+        if (!Preprocess(items_file, thresh)) return false;
+
+        cout << "\nPreprocess done in " << give_time(clock() - kk) << " seconds\n\n";
+
+        DFS.reserve(L);
+        for (unsigned int i = 0; i < L; ++i)
+            DFS.emplace_back(-int(i) - 1);
+
+        kk = clock();
+        Load_items_pre(items_file);
+        N = items.size();
+    }
+    else if (!Load_items(items_file))
+        return false;
+    else
+        theta = (thresh < 1.0) ? ceil(thresh * N) : thresh;
+
+    cout << "\nMDD Database built in " << give_time(clock() - kk) << " seconds\n\n";
+    cout << "Found " << N << " sequence, with max line len " << M
+         << ", and " << L << " items, and " << E << " enteries\n";
+
+    return true;
+}
+
+/* ==================================================================
+ *  ALT ENTRY — load directly from a Python list of lists
+ * ================================================================= */
+void Load_py(const pybind11::object& data, double thresh)
+{
+    items = data.cast<vector<vector<int>>>();
+    N     = items.size();
+
+    int max_id = 0;
+    M = 0;  E = 0;
+    for (auto& seq : items) {
+        M = max<unsigned int>(M, seq.size());
+        E += seq.size();
+        for (int x : seq)
+            max_id = max(max_id, abs(x));
+    }
+    L = max_id;
+    theta = (thresh < 1.0) ? ceil(thresh * N) : thresh;
+
+    DFS.clear();
+    DFS.reserve(L);
+    for (unsigned int i = 0; i < L; ++i)
+        DFS.emplace_back(-int(i) - 1);
+}
+
+/* =================================================================
+ *  The professor’s original helpers — untouched
+ * ================================================================= */
+static bool Preprocess(string& inst, double thresh)
+{
+    ifstream file(inst);
+    vector<unsigned long long> freq(1000000), counted(1000000, 0);
+
+    if (file.good()) {
+        string line; int ditem;
+        while (getline(file, line) && give_time(clock() - start_time) < time_limit) {
+            ++N;
+            istringstream word(line);
+            string itm;
+            while (word >> itm) {
+                ditem = stoi(itm);
+                L = max<unsigned int>(L, abs(ditem));
+
+                if (freq.size() < L) {
+                    freq.resize(L, 0);
+                    counted.resize(L, 0);
+                }
+                if (counted[abs(ditem) - 1] != N) {
+                    ++freq[abs(ditem) - 1];
+                    counted[abs(ditem) - 1] = N;
+                }
+            }
+        }
+    } else {
+        cout << "!!!!!! No such file exists: " << inst << " !!!!!!\n";
+        return false;
+    }
+
+    theta = (thresh < 1.0) ? ceil(thresh * N) : thresh;
+
+    int real_L = 0;
+    item_dic.assign(L, -1);
+    for (unsigned int i = 0; i < L; ++i)
+        if (freq[i] >= theta) item_dic[i] = ++real_L;
+
+    cout << "Original number of items: " << L
+         << "  Reduced to: " << real_L << '\n';
+
+    L = real_L;
+    N = 0;
+    return true;
+}
+
+static void Load_items_pre(string& inst)
+{
+    ifstream file(inst);
+
+    if (!file.good()) return;
+    string line; int size_m, ditem; bool empty_seq = false;
+
+    while (getline(file, line) && give_time(clock() - start_time) < time_limit) {
+        vector<bool> counted(L, 0);
+        istringstream word(line);
+
+        if (!empty_seq) items.emplace_back();
+        string itm; size_m = 0; bool sgn = false; empty_seq = true;
+
+        while (word >> itm) {
+            ditem = stoi(itm);
+
+            if (item_dic[abs(ditem) - 1] == -1) {
+                if (!sgn) sgn = ditem < 0;
+                continue;
+            } else {
+                ditem = (ditem > 0)
+                      ?  item_dic[ditem - 1]
+                      : -item_dic[-ditem - 1];
+            }
+            empty_seq = false;
+
+            if (sgn) { if (ditem > 0) ditem = -ditem; sgn = false; }
+
+            items.back().push_back(ditem);
+
+            if (!counted[abs(ditem) - 1] && !just_build) {
+                DFS[abs(ditem) - 1].seq_ID.push_back(items.size() - 1);
+                DFS[abs(ditem) - 1].str_pnt.push_back(items.back().size() - 1);
+                ++DFS[abs(ditem) - 1].freq;
+                counted[abs(ditem) - 1] = true;
+            }
+            ++size_m;
+        }
+        if (empty_seq) continue;
+
+        ++N;  E += size_m;  M = max<unsigned int>(M, size_m);
+    }
+}
+
+static bool Load_items(string& inst)
+{
+    ifstream file(inst);
+    if (!file.good()) {
+        cout << "!!!!!! No such file exists: " << inst << " !!!!!!\n";
+        return false;
+    }
+
+    string line; int size_m, ditem;
+    while (getline(file, line) && give_time(clock() - start_time) < time_limit) {
+        ++N;
+        vector<bool> counted(L, 0);
+        istringstream word(line);
+
+        items.emplace_back();
+        string itm; size_m = 0;
+
+        while (word >> itm) {
+            ditem = stoi(itm);
+            if (L < abs(ditem)) {
+                L = abs(ditem);
+                while (DFS.size() < L) {
+                    DFS.emplace_back(-int(DFS.size()) - 1);
+                    counted.push_back(0);
+                }
+            }
+            items.back().push_back(ditem);
+
+            if (!counted[abs(ditem) - 1] && !just_build) {
+                DFS[abs(ditem) - 1].seq_ID.push_back(items.size() - 1);
+                DFS[abs(ditem) - 1].str_pnt.push_back(items.back().size() - 1);
+                ++DFS[abs(ditem) - 1].freq;
+                counted[abs(ditem) - 1] = true;
+            }
+            ++size_m;
+        }
+        E += size_m;
+        M = max<unsigned int>(M, size_m);
+    }
+    return true;
+}
+
+} // namespace largepp  // ─── END namespace ──────────────────────

effspm/largepp/src/load_inst.hpp

@@ -0,0 +1,28 @@
+#pragma once
+
+#include <vector>
+#include <string>
+#include <fstream>
+#include <map>
+#include <pybind11/pybind11.h>
+
+namespace largepp {
+using namespace std;
+
+// ───── public entry points ───────────────────────────────────────
+bool Load_instance(string& items_file, double thresh);
+void Load_py(const pybind11::object& py_data, double thresh);
+
+// ───── shared state (defined once in load_inst.cpp) ──────────────
+extern vector<vector<int>> items;      // encoded database
+extern string              out_file;
+
+extern bool b_disp, b_write, use_dic, just_build, ovr_count, pre_pro;
+
+extern unsigned int        M, L, time_limit;
+extern unsigned long long  N;          // # sequences
+extern double              theta;      // support threshold
+extern unsigned long long  E;          // total entries
+extern clock_t             start_time;
+
+} // namespace largepp

effspm/largepp/src/main.cpp

@@ -0,0 +1,108 @@
+#include <iostream>
+#include <time.h>
+#include <string.h>
+#include <string>
+#include "load_inst.hpp"
+#include "freq_miner.hpp"
+#include "utility.hpp"
+
+namespace largepp   // ← BEGIN namespacing
+{
+using namespace std;
+
+string out_file;
+
+bool  b_disp = 0, b_write = 0, use_dic = 0, just_build = 0, ovr_count = 0, pre_pro = 0;
+
+unsigned int time_limit = 10 * 3600;
+
+clock_t start_time;
+
+int main(int argc, char* argv[]) {
+
+        double thresh = 0;
+        string VV, folder;
+        for (int i = 1; i < argc; ++i){
+		if (argv[i][0] !='-')
+			continue;
+		else if (strcmp(argv[i], "-thr") == 0)
+			thresh = stof(argv[i + 1]);
+                else if (strcmp(argv[i], "-file") == 0)
+                        VV = argv[i + 1];
+		else if (strcmp(argv[i], "-folder") == 0)
+                        folder = argv[i + 1];
+		else if (strcmp(argv[i], "-time") == 0)
+			time_limit = stoi(argv[i + 1]);
+		else if (strcmp(argv[i], "-jbuild") == 0)
+			just_build = 1;
+		else if (strcmp(argv[i], "-npre") == 0)
+			pre_pro = 0;
+		else if (strcmp(argv[i], "-ovrc") == 0)
+			ovr_count = 1;
+		else if (strcmp(argv[i], "-dic") == 0)
+			use_dic = 1;
+		else if (strcmp(argv[i], "-out") == 0){
+			if (i + 1 == argc || argv[i + 1][0] == '-')
+				b_disp = 1;
+			else if (argv[i + 1][0] == '+') {
+				b_disp = 1; 
+				b_write = 1;
+				out_file = argv[i + 1];
+				out_file = out_file.substr(1,out_file.size()-1);
+			}
+			else {
+				b_write = 1;
+				out_file = argv[i + 1];
+			}
+		}
+		else
+			cout << "Command " << argv[i] << " not recognized and skipped.\n";
+        }
+
+	if (thresh == 0){	
+		cout << "No Threshold given, using threshold deafult of 1%\n";
+		thresh = 0.01;
+	}
+	if (folder.back() != '/'){
+		folder += '/';
+	}
+
+
+   	cout << "\n********************** " << VV << "**********************\n";
+
+	string item_file = folder + VV + ".txt";
+	//out_file = folder + VV + "_result.txt";
+	cout << "loading instances...\n";
+
+	start_time = clock();
+
+	if(!Load_instance(item_file, thresh)){
+		cout << "Files invalid, exiting.\n";
+		return 0;
+	}
+
+	cout << "Instances loaded\n";
+
+	if (!just_build && give_time(clock() - start_time) < time_limit) {
+		cout << "\nRunning mining algorithm...\n";
+		Freq_miner();
+		if (give_time(clock() - start_time) >= time_limit)
+			cout << "TIME LIMIT REACHED\n";
+		cout << "Mining Complete\n\nFound a total of " << num_patt << " patterns\n";
+	}
+
+	cout << "Total CPU time is: ";
+	cout << give_time(clock() - start_time) << "\n";
+
+	if (b_write){
+		ofstream file;
+		file.open(out_file, std::ios::app);
+		file << "\nMining completed in " << give_time(clock() - start_time) << " seconds\n";
+		//file << "Found a total of " << num_max_patt << " maximal patterns\n";
+		file.close();
+	}
+
+
+	return 0;
+}
+}

effspm/largepp/src/utility.cpp

@@ -0,0 +1,33 @@
+#include "utility.hpp"
+
+namespace largepp {
+
+// ─── instantiate the globals declared in the header ─────────────
+bool  b_disp   = false;
+bool  b_write  = false;
+bool  use_dic  = false;
+bool  just_build = false;
+bool  ovr_count  = false;
+bool  pre_pro  = false;
+bool  use_list = true;          // large-prefix flag the binder toggles
+unsigned int time_limit = 36000;
+std::string out_file;  
+std::vector<std::vector<int>> collected;  // mined pattern output
+
+
+std::clock_t start_time = 0;
+
+// ─── helper implementations ─────────────────────────────────────
+void ClearCollected()                       { collected.clear(); }
+
+const std::vector<std::vector<int>>& GetCollected()
+{
+    return collected;
+}
+
+double give_time(std::clock_t ticks)
+{
+    return static_cast<double>(ticks) / CLOCKS_PER_SEC;
+}
+
+} // namespace largepp

effspm/largepp/src/utility.hpp

@@ -0,0 +1,20 @@
+#pragma once
+#include <vector>
+#include <ctime>
+
+namespace largepp {
+
+// Flag & option globals (only declare here – actual values in utility.cpp)
+extern bool b_disp, b_write, use_dic, just_build, ovr_count, pre_pro;
+extern bool use_list;                  // ← NEW (large-prefix needs this)
+extern unsigned int time_limit;
+
+// Pattern buffer that _effspm.cpp_ returns to Python
+extern std::vector<std::vector<int>> collected;
+
+// Helper functions every source file uses
+void ClearCollected();                                   // wipe buffer
+const std::vector<std::vector<int>>& GetCollected();     // read buffer
+double give_time(std::clock_t ticks);                    // secs from clocks
+
+} // namespace largepp

{effspm-0.1.12.dist-info → effspm-0.2.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: effspm
-Version: 0.1.12
+Version: 0.2.2
 Summary: Prefix‑Projection and other sequential pattern mining algorithms
 Author: Yeswanth Vootla
 Author-email: yeshu999 <vootlayeswanth20@gmail.com>

effspm-0.2.2.dist-info/RECORD

@@ -0,0 +1,59 @@
+effspm/__init__.py,sha256=lFt6ng5CigUoRWeT8crTZ0PMEaR1ejOIOJuyhNs-gtI,233
+effspm/_core.cpp,sha256=S6UsUcl0HQLMQUTy2tMJxcrbLGJo8tjkLskyHqESYyI,3675
+effspm/_effspm.cpp,sha256=9imtXWbdeHkfWMwTZaE6Dcs1nD_b2BaAwXSbIuuKd8o,22196
+effspm/_effspm.cpython-313-darwin.so,sha256=9X6s30nTGWOE2hJ7XtXm8H9XBp6OujqbWlvOXJKjd_Q,1067872
+effspm/freq_miner.cpp,sha256=9K-nO_c-vVzbFlmh511vmvypA2fu1TXpiJhyx03owDU,4642
+effspm/freq_miner.hpp,sha256=jA-ZCT12Z0YNjLoAiY9sniFTP6g-ITTDuWtlOdHXkMQ,744
+effspm/load_inst.cpp,sha256=804fvkfdtYqFMP9Jla6dM2romWWPJmSeCwLm0wEZE5M,4517
+effspm/load_inst.hpp,sha256=cR-iZG95mUN62ZLCnPNQsKUINtkwhUzMTLlH81wmyt0,906
+effspm/main.cpp,sha256=aMyPwuTn5dPIlLAZ_XfWL8Z6cXfQS7EaJ0tEQPqpA8I,2558
+effspm/utility.cpp,sha256=luWwBNy7OVWRmam9gz2RjhtrRmx6c37oOobFJaDWqcA,1403
+effspm/utility.hpp,sha256=Y_MQVk9AmJWjguKyuyk0LraTi_6VzZFg0StsmVOCkNc,744
+effspm/btminer/src/build_mdd.cpp,sha256=LWfH_23cTExfOeK3evO46C8Di2_hmu7uCbmutOxj4Fw,1727
+effspm/btminer/src/build_mdd.hpp,sha256=CvowY9TxxnMh3_bIy0HZ9eZmnCm45z5A6Xz5hxHcwfg,567
+effspm/btminer/src/freq_miner.cpp,sha256=PN8Ksetb5S_akEVjY71mwBP9YEVxlnphTz0zYCDAlaU,6557
+effspm/btminer/src/freq_miner.hpp,sha256=x-c7BpMdNqYiDFM49I7VDJXeb1tIruTOeD-3MXJ2g0A,626
+effspm/btminer/src/load_inst.cpp,sha256=FudIgA4N7GNlEm34jHMDoQLfyY5NLZENC2CI-cVJoV4,5359
+effspm/btminer/src/load_inst.hpp,sha256=pojP8ClGglVhx6GuwEqCvwURPMtBpnHBeCVTGSsCiyA,462
+effspm/btminer/src/main.cpp,sha256=h1_BcTVDWBCjlGkkb_K2v8IKVkxJacVErV7yhWNMR94,3010
+effspm/btminer/src/utility.cpp,sha256=P-CwwWx5QG7U3DsqzZrFNbYxKqaoapR37P_J69qYVz8,2112
+effspm/btminer/src/utility.hpp,sha256=ew4pclVwtKZp4bn7HrnaaWHSPZ-yMcsXYDiTmSs_MYM,937
+effspm/htminer/src/build_mdd.cpp,sha256=3uh8NQyDgEI6UkDQ4pW7XDVdAHD_nS6Wc2mMExdI2wg,8871
+effspm/htminer/src/build_mdd.hpp,sha256=GDFkmrjPyOfgkHOTwIjVH_dWrSXWB7OA_GAZ2GXzMpo,1328
+effspm/htminer/src/freq_miner.cpp,sha256=5WbdTmQ4O-_U8UR-cbx1iqqEYDEXoBIi8lC2LHeoVIQ,10590
+effspm/htminer/src/freq_miner.hpp,sha256=8cVfeJknsgZo63Fp2iG7ndOop3BA-74y_vsjNQnJ9dY,765
+effspm/htminer/src/load_inst.cpp,sha256=Qcmd3LygQ6DDdCjiDzMRE-aeRdyPL2bynp6G_2P68As,10922
+effspm/htminer/src/load_inst.hpp,sha256=Cs_zpT4lM5j4sqoY1f6R0LKjkrTFMg9myGPYcDat0bE,455
+effspm/htminer/src/main.cpp,sha256=_kKdO9UuS8Hvs4gUD66vZ_ehjz1_VC7FI25LfyKBku4,2187
+effspm/htminer/src/utility.cpp,sha256=WZU9XAmZX86ihWuU6F_SSMSmCwl8h0t9SswAfi5ndcc,2375
+effspm/htminer/src/utility.hpp,sha256=737-iMuDE5Sm5GGSYnAtgO6cC5O6bFvqHEftV5dGrKM,3573
+effspm/largebm/src/build_mdd.cpp,sha256=QAPj_cjGCo-u3wk5Pch1zmWlJmw772O5bqYEvWSn2TQ,4948
+effspm/largebm/src/build_mdd.hpp,sha256=R0M0p1gJqA1LdjPzlgpn410cX5-Ak8ebuvgL5kTZS2E,636
+effspm/largebm/src/freq_miner.cpp,sha256=cGZvM6mqfskTR7QkHKqOoi8nmghy4o0qotY0ZExpmS4,13048
+effspm/largebm/src/freq_miner.hpp,sha256=Rjuhzbr7W9raV_5jPxtQl4lbCPDxvNO6fldBBoQeKQU,892
+effspm/largebm/src/load_inst.cpp,sha256=XpewU8CIqIN2kh4XScriVs5ok1Jh0Sn-t-A5OIKYRf0,6929
+effspm/largebm/src/load_inst.hpp,sha256=inptC_vdkRPUnGHh4LcDPyGlD9Px2PSU64Xe26BWts8,1880
+effspm/largebm/src/main.cpp,sha256=fcGqsLCmnCPOyrMglSMjG8yC0QoGXdmfH6G2Jm5jycU,2083
+effspm/largebm/src/utility.cpp,sha256=5yIPUtgMXVqZwPnwKyTJMMdDRvZe3sBDmZpeXAoLWO4,1167
+effspm/largebm/src/utility.hpp,sha256=S18kyrS5ulJj4to8RndypR35ImPQuGoAVMh6_KnMhaA,350
+effspm/largehm/src/build_mdd.cpp,sha256=JMA4Z_mUUAJS4DwLKybRafcl31eIFLWPLL85u5TLaMU,5922
+effspm/largehm/src/build_mdd.hpp,sha256=zV0hhPq9HYFLsOJaaRAnrX4vbN49YsStwIca9kxpvLU,2787
+effspm/largehm/src/freq_miner.cpp,sha256=aqYyAClNNLlBPXZSH4dRC6iWgs-aRG-Q2gQmNRdUnA8,16356
+effspm/largehm/src/freq_miner.hpp,sha256=B9LXKxRQbrSDsd9LbyUM9kR1WUxbBIp4-u388P5FIvY,2371
+effspm/largehm/src/load_inst.cpp,sha256=vPCz5SqxgSzye54Pt6wqpwNu0-EOdOWap8XbU7edxAI,10263
+effspm/largehm/src/load_inst.hpp,sha256=sBvJhT6ibvR1R09YGiSgQYxNRc4jE89tcXvcVVR4-_4,1628
+effspm/largehm/src/main.cpp,sha256=mPBKhs_cYCxzSJ6CxSVipZbsOtoqosVLkRquHR8Pl7k,2236
+effspm/largehm/src/utility.cpp,sha256=K0THrMKa_7cwAEJXbPXOdOwKBrC0gNt8oj1KOHECdJA,960
+effspm/largehm/src/utility.hpp,sha256=cjPJ6KYC37CFAMVNNygNMH1HiLTUHjMukImSIuY-S60,692
+effspm/largepp/src/freq_miner.cpp,sha256=yC55sBfuMOagmDwHkaJpEkOvSkoEMQXP96Xux8TDGCQ,3960
+effspm/largepp/src/freq_miner.hpp,sha256=GmKUub-pED6kM39wxO0hssWkXDzaSNl2vLO4oGYDbzo,678
+effspm/largepp/src/load_inst.cpp,sha256=910i6wUOPxZtAj_BOy9ieUffxUv6TNLTYFALeJZBWUM,6799
+effspm/largepp/src/load_inst.hpp,sha256=PT6vX8ty29WCHNizwIhVcpB1CSc93pzh5qLmX4acBrY,986
+effspm/largepp/src/main.cpp,sha256=2y_xGXSHo2wyrHJh86VrD1GMDHaEDMBqvUmt5Rb03oI,2696
+effspm/largepp/src/utility.cpp,sha256=cUYchvpCpZ9vdsT9p-Z5if6hsrZzbspDJOxOHspx8to,936
+effspm/largepp/src/utility.hpp,sha256=aRoFRvhTzx4O4l7Yw5hXqksr4MXjr-8Bq-UqkIceeVw,718
+effspm-0.2.2.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
+effspm-0.2.2.dist-info/METADATA,sha256=ljAl44RrX2_Hbg4HGGkPF7A_D6rZNDjKeMT-x3xrQ1k,14227
+effspm-0.2.2.dist-info/WHEEL,sha256=memlX0NSEQnmSMa3rcNWPnk4cttudwgAZx3qq8qO4ME,115
+effspm-0.2.2.dist-info/top_level.txt,sha256=2O-AuI0nw0pDmJMo2jzM1wvV2rj48AmkjskkAnsuuQk,7
+effspm-0.2.2.dist-info/RECORD,,