effspm 0.1.7__cp312-cp312-macosx_11_0_arm64.whl → 0.2.6__cp312-cp312-macosx_11_0_arm64.whl

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/utility.cpp

@@ -0,0 +1,34 @@
+#include "utility.hpp"
+#include <string>
+
+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,21 @@
+#pragma once
+#include <vector>
+#include <ctime>
+#include <string>
+
+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/load_inst.hpp

@@ -11,7 +11,8 @@ using namespace std;
 
 // ------------------------------------------------------------
 // forward declare Pattern (defined in freq_miner.hpp)
-struct Pattern;
+class Pattern;
+
 
 // Main entrypoint: load your file on disk into 'items', build DFS, theta, etc.
 bool Load_instance(string &items_file, double thresh);

effspm-0.2.6.dist-info/METADATA

@@ -0,0 +1,237 @@
+Metadata-Version: 2.4
+Name: effspm
+Version: 0.2.6
+Summary: Prefix‑Projection and other sequential pattern mining algorithms
+Author: Yeswanth Vootla
+Author-email: yeshu999 <vootlayeswanth20@gmail.com>
+License:                                  Apache License
+                                   Version 2.0, January 2004
+                                http://www.apache.org/licenses/
+        
+           TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+        
+           1. Definitions.
+        
+              "License" shall mean the terms and conditions for use, reproduction,
+              and distribution as defined by Sections 1 through 9 of this document.
+        
+              "Licensor" shall mean the copyright owner or entity authorized by
+              the copyright owner that is granting the License.
+        
+              "Legal Entity" shall mean the union of the acting entity and all
+              other entities that control, are controlled by, or are under common
+              control with that entity. For the purposes of this definition,
+              "control" means (i) the power, direct or indirect, to cause the
+              direction or management of such entity, whether by contract or
+              otherwise, or (ii) ownership of fifty percent (50%) or more of the
+              outstanding shares, or (iii) beneficial ownership of such entity.
+        
+              "You" (or "Your") shall mean an individual or Legal Entity
+              exercising permissions granted by this License.
+        
+              "Source" form shall mean the preferred form for making modifications,
+              including but not limited to software source code, documentation
+              source, and configuration files.
+        
+              "Object" form shall mean any form resulting from mechanical
+              transformation or translation of a Source form, including but
+              not limited to compiled object code, generated documentation,
+              and conversions to other media types.
+        
+              "Work" shall mean the work of authorship, whether in Source or
+              Object form, made available under the License, as indicated by a
+              copyright notice that is included in or attached to the work
+              (an example is provided in the Appendix below).
+        
+              "Derivative Works" shall mean any work, whether in Source or Object
+              form, that is based on (or derived from) the Work and for which the
+              editorial revisions, annotations, elaborations, or other modifications
+              represent, as a whole, an original work of authorship. For the purposes
+              of this License, Derivative Works shall not include works that remain
+              separable from, or merely link (or bind by name) to the interfaces of,
+              the Work and Derivative Works thereof.
+        
+              "Contribution" shall mean any work of authorship, including
+              the original version of the Work and any modifications or additions
+              to that Work or Derivative Works thereof, that is intentionally
+              submitted to Licensor for inclusion in the Work by the copyright owner
+              or by an individual or Legal Entity authorized to submit on behalf of
+              the copyright owner. For the purposes of this definition, "submitted"
+              means any form of electronic, verbal, or written communication sent
+              to the Licensor or its representatives, including but not limited to
+              communication on electronic mailing lists, source code control systems,
+              and issue tracking systems that are managed by, or on behalf of, the
+              Licensor for the purpose of discussing and improving the Work, but
+              excluding communication that is conspicuously marked or otherwise
+              designated in writing by the copyright owner as "Not a Contribution."
+        
+              "Contributor" shall mean Licensor and any individual or Legal Entity
+              on behalf of whom a Contribution has been received by Licensor and
+              subsequently incorporated within the Work.
+        
+           2. Grant of Copyright License. Subject to the terms and conditions of
+              this License, each Contributor hereby grants to You a perpetual,
+              worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+              copyright license to reproduce, prepare Derivative Works of,
+              publicly display, publicly perform, sublicense, and distribute the
+              Work and such Derivative Works in Source or Object form.
+        
+           3. Grant of Patent License. Subject to the terms and conditions of
+              this License, each Contributor hereby grants to You a perpetual,
+              worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+              (except as stated in this section) patent license to make, have made,
+              use, offer to sell, sell, import, and otherwise transfer the Work,
+              where such license applies only to those patent claims licensable
+              by such Contributor that are necessarily infringed by their
+              Contribution(s) alone or by combination of their Contribution(s)
+              with the Work to which such Contribution(s) was submitted. If You
+              institute patent litigation against any entity (including a
+              cross-claim or counterclaim in a lawsuit) alleging that the Work
+              or a Contribution incorporated within the Work constitutes direct
+              or contributory patent infringement, then any patent licenses
+              granted to You under this License for that Work shall terminate
+              as of the date such litigation is filed.
+        
+           4. Redistribution. You may reproduce and distribute copies of the
+              Work or Derivative Works thereof in any medium, with or without
+              modifications, and in Source or Object form, provided that You
+              meet the following conditions:
+        
+              (a) You must give any other recipients of the Work or
+                  Derivative Works a copy of this License; and
+        
+              (b) You must cause any modified files to carry prominent notices
+                  stating that You changed the files; and
+        
+              (c) You must retain, in the Source form of any Derivative Works
+                  that You distribute, all copyright, patent, trademark, and
+                  attribution notices from the Source form of the Work,
+                  excluding those notices that do not pertain to any part of
+                  the Derivative Works; and
+        
+              (d) If the Work includes a "NOTICE" text file as part of its
+                  distribution, then any Derivative Works that You distribute must
+                  include a readable copy of the attribution notices contained
+                  within such NOTICE file, excluding those notices that do not
+                  pertain to any part of the Derivative Works, in at least one
+                  of the following places: within a NOTICE text file distributed
+                  as part of the Derivative Works; within the Source form or
+                  documentation, if provided along with the Derivative Works; or,
+                  within a display generated by the Derivative Works, if and
+                  wherever such third-party notices normally appear. The contents
+                  of the NOTICE file are for informational purposes only and
+                  do not modify the License. You may add Your own attribution
+                  notices within Derivative Works that You distribute, alongside
+                  or as an addendum to the NOTICE text from the Work, provided
+                  that such additional attribution notices cannot be construed
+                  as modifying the License.
+        
+              You may add Your own copyright statement to Your modifications and
+              may provide additional or different license terms and conditions
+              for use, reproduction, or distribution of Your modifications, or
+              for any such Derivative Works as a whole, provided Your use,
+              reproduction, and distribution of the Work otherwise complies with
+              the conditions stated in this License.
+        
+           5. Submission of Contributions. Unless You explicitly state otherwise,
+              any Contribution intentionally submitted for inclusion in the Work
+              by You to the Licensor shall be under the terms and conditions of
+              this License, without any additional terms or conditions.
+              Notwithstanding the above, nothing herein shall supersede or modify
+              the terms of any separate license agreement you may have executed
+              with Licensor regarding such Contributions.
+        
+           6. Trademarks. This License does not grant permission to use the trade
+              names, trademarks, service marks, or product names of the Licensor,
+              except as required for reasonable and customary use in describing the
+              origin of the Work and reproducing the content of the NOTICE file.
+        
+           7. Disclaimer of Warranty. Unless required by applicable law or
+              agreed to in writing, Licensor provides the Work (and each
+              Contributor provides its Contributions) on an "AS IS" BASIS,
+              WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+              implied, including, without limitation, any warranties or conditions
+              of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+              PARTICULAR PURPOSE. You are solely responsible for determining the
+              appropriateness of using or redistributing the Work and assume any
+              risks associated with Your exercise of permissions under this License.
+        
+           8. Limitation of Liability. In no event and under no legal theory,
+              whether in tort (including negligence), contract, or otherwise,
+              unless required by applicable law (such as deliberate and grossly
+              negligent acts) or agreed to in writing, shall any Contributor be
+              liable to You for damages, including any direct, indirect, special,
+              incidental, or consequential damages of any character arising as a
+              result of this License or out of the use or inability to use the
+              Work (including but not limited to damages for loss of goodwill,
+              work stoppage, computer failure or malfunction, or any and all
+              other commercial damages or losses), even if such Contributor
+              has been advised of the possibility of such damages.
+        
+           9. Accepting Warranty or Additional Liability. While redistributing
+              the Work or Derivative Works thereof, You may choose to offer,
+              and charge a fee for, acceptance of support, warranty, indemnity,
+              or other liability obligations and/or rights consistent with this
+              License. However, in accepting such obligations, You may act only
+              on Your own behalf and on Your sole responsibility, not on behalf
+              of any other Contributor, and only if You agree to indemnify,
+              defend, and hold each Contributor harmless for any liability
+              incurred by, or claims asserted against, such Contributor by reason
+              of your accepting any such warranty or additional liability.
+        
+           END OF TERMS AND CONDITIONS
+        
+           APPENDIX: How to apply the Apache License to your work.
+        
+              To apply the Apache License to your work, attach the following
+              boilerplate notice, with the fields enclosed by brackets "[]"
+              replaced with your own identifying information. (Don't include
+              the brackets!)  The text should be enclosed in the appropriate
+              comment syntax for the file format. We also recommend that a
+              file or class name and description of purpose be included on the
+              same "printed page" as the copyright notice for easier
+              identification within third-party archives.
+        
+           Copyright [yyyy] [name of copyright owner]
+        
+           Licensed under the Apache License, Version 2.0 (the "License");
+           you may not use this file except in compliance with the License.
+           You may obtain a copy of the License at
+        
+               http://www.apache.org/licenses/LICENSE-2.0
+        
+           Unless required by applicable law or agreed to in writing, software
+           distributed under the License is distributed on an "AS IS" BASIS,
+           WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+           See the License for the specific language governing permissions and
+           limitations under the License.
+        
+Project-URL: Homepage, https://github.com/yeshu999/effspm
+Project-URL: Source, https://github.com/yeshu999/effspm
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: C++
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: pybind11>=2.6
+Dynamic: author
+Dynamic: license-file
+
+# effspm
+
+**Efficient Sequential Pattern Mining via Prefix‑Projection**
+
+This library provides a Python interface to mine sequential patterns using the prefix‑projection algorithm, implemented in C++ for performance and exposed via pybind11.
+
+## Installation
+
+```bash
+pip install effspm

effspm-0.2.6.dist-info/RECORD

@@ -0,0 +1,53 @@
+effspm/utility.hpp,sha256=Y_MQVk9AmJWjguKyuyk0LraTi_6VzZFg0StsmVOCkNc,744
+effspm/_core.cpp,sha256=S6UsUcl0HQLMQUTy2tMJxcrbLGJo8tjkLskyHqESYyI,3675
+effspm/load_inst.hpp,sha256=CyLvoIMLWxcyP4RmEKvPUJ5FkZo1-FSy_eZrqjZaAd8,906
+effspm/__init__.py,sha256=_BkZ8cFlB_l1haxTzxJMgFHhO6LEmF3pIY-nmPTPMj8,246
+effspm/freq_miner.cpp,sha256=9K-nO_c-vVzbFlmh511vmvypA2fu1TXpiJhyx03owDU,4642
+effspm/_effspm.cpp,sha256=B6Kp5bGhrOqONnlZQpTgk8JZt41heb8g3ONzaft1QZY,24047
+effspm/load_inst.cpp,sha256=804fvkfdtYqFMP9Jla6dM2romWWPJmSeCwLm0wEZE5M,4517
+effspm/freq_miner.hpp,sha256=UH7eGk-rFerN2cJMaVMsri_iTKpjBG3rXi5aBH8ci9Q,793
+effspm/_effspm.cpython-312-darwin.so,sha256=0ggksvM8TjZdNKAc0y1UeQJFoKf5UJypSIrurU_JIpI,574304
+effspm/utility.cpp,sha256=luWwBNy7OVWRmam9gz2RjhtrRmx6c37oOobFJaDWqcA,1403
+effspm/htminer/src/build_mdd.cpp,sha256=3uh8NQyDgEI6UkDQ4pW7XDVdAHD_nS6Wc2mMExdI2wg,8871
+effspm/htminer/src/utility.hpp,sha256=737-iMuDE5Sm5GGSYnAtgO6cC5O6bFvqHEftV5dGrKM,3573
+effspm/htminer/src/load_inst.hpp,sha256=Cs_zpT4lM5j4sqoY1f6R0LKjkrTFMg9myGPYcDat0bE,455
+effspm/htminer/src/freq_miner.cpp,sha256=5WbdTmQ4O-_U8UR-cbx1iqqEYDEXoBIi8lC2LHeoVIQ,10590
+effspm/htminer/src/load_inst.cpp,sha256=enxuhSWzYwse92NKWVTXScdpmn3U74mRxX9lLFKnyEE,10925
+effspm/htminer/src/freq_miner.hpp,sha256=8cVfeJknsgZo63Fp2iG7ndOop3BA-74y_vsjNQnJ9dY,765
+effspm/htminer/src/build_mdd.hpp,sha256=GDFkmrjPyOfgkHOTwIjVH_dWrSXWB7OA_GAZ2GXzMpo,1328
+effspm/htminer/src/utility.cpp,sha256=WZU9XAmZX86ihWuU6F_SSMSmCwl8h0t9SswAfi5ndcc,2375
+effspm/largepp/src/utility.hpp,sha256=i06elLVb7qWGwkalC1t03bfuQ7c06Eu3QFt3I92FnG8,736
+effspm/largepp/src/load_inst.hpp,sha256=PT6vX8ty29WCHNizwIhVcpB1CSc93pzh5qLmX4acBrY,986
+effspm/largepp/src/freq_miner.cpp,sha256=yC55sBfuMOagmDwHkaJpEkOvSkoEMQXP96Xux8TDGCQ,3960
+effspm/largepp/src/load_inst.cpp,sha256=910i6wUOPxZtAj_BOy9ieUffxUv6TNLTYFALeJZBWUM,6799
+effspm/largepp/src/freq_miner.hpp,sha256=GmKUub-pED6kM39wxO0hssWkXDzaSNl2vLO4oGYDbzo,678
+effspm/largepp/src/utility.cpp,sha256=Hbn49pUWCf1ixWyhiMBxXCW2a7uttkSNwc5gPgA1vqA,954
+effspm/largehm/src/build_mdd.cpp,sha256=d3Ro-YtIz6bfkOg8oFhkOjB32kMBobb21o8kBd7WPPU,5916
+effspm/largehm/src/utility.hpp,sha256=cjPJ6KYC37CFAMVNNygNMH1HiLTUHjMukImSIuY-S60,692
+effspm/largehm/src/load_inst.hpp,sha256=sBvJhT6ibvR1R09YGiSgQYxNRc4jE89tcXvcVVR4-_4,1628
+effspm/largehm/src/freq_miner.cpp,sha256=ZHfDRgJjUqhq8KrYAPBYhILQ0xFFKEfJlk2pTzEQPGs,16288
+effspm/largehm/src/load_inst.cpp,sha256=vPCz5SqxgSzye54Pt6wqpwNu0-EOdOWap8XbU7edxAI,10263
+effspm/largehm/src/freq_miner.hpp,sha256=fnuS6SIbbQYbP5llUez2WSnBzd6XujdG-IiCwRpU1QM,2351
+effspm/largehm/src/build_mdd.hpp,sha256=zV0hhPq9HYFLsOJaaRAnrX4vbN49YsStwIca9kxpvLU,2787
+effspm/largehm/src/utility.cpp,sha256=K0THrMKa_7cwAEJXbPXOdOwKBrC0gNt8oj1KOHECdJA,960
+effspm/largebm/src/build_mdd.cpp,sha256=QAPj_cjGCo-u3wk5Pch1zmWlJmw772O5bqYEvWSn2TQ,4948
+effspm/largebm/src/utility.hpp,sha256=S18kyrS5ulJj4to8RndypR35ImPQuGoAVMh6_KnMhaA,350
+effspm/largebm/src/load_inst.hpp,sha256=inptC_vdkRPUnGHh4LcDPyGlD9Px2PSU64Xe26BWts8,1880
+effspm/largebm/src/freq_miner.cpp,sha256=kxE0UbYH_QfbEAqu7HEq7ptotKH7RWOt6tl6M29LjFA,13596
+effspm/largebm/src/load_inst.cpp,sha256=HmumfXv5o_Jdd1E4XQ7BtQSN7aOJiFFNg5-moRoj0lw,7339
+effspm/largebm/src/freq_miner.hpp,sha256=Rjuhzbr7W9raV_5jPxtQl4lbCPDxvNO6fldBBoQeKQU,892
+effspm/largebm/src/build_mdd.hpp,sha256=R0M0p1gJqA1LdjPzlgpn410cX5-Ak8ebuvgL5kTZS2E,636
+effspm/largebm/src/utility.cpp,sha256=5yIPUtgMXVqZwPnwKyTJMMdDRvZe3sBDmZpeXAoLWO4,1167
+effspm/btminer/src/build_mdd.cpp,sha256=LWfH_23cTExfOeK3evO46C8Di2_hmu7uCbmutOxj4Fw,1727
+effspm/btminer/src/utility.hpp,sha256=ew4pclVwtKZp4bn7HrnaaWHSPZ-yMcsXYDiTmSs_MYM,937
+effspm/btminer/src/load_inst.hpp,sha256=pojP8ClGglVhx6GuwEqCvwURPMtBpnHBeCVTGSsCiyA,462
+effspm/btminer/src/freq_miner.cpp,sha256=PN8Ksetb5S_akEVjY71mwBP9YEVxlnphTz0zYCDAlaU,6557
+effspm/btminer/src/load_inst.cpp,sha256=FudIgA4N7GNlEm34jHMDoQLfyY5NLZENC2CI-cVJoV4,5359
+effspm/btminer/src/freq_miner.hpp,sha256=x-c7BpMdNqYiDFM49I7VDJXeb1tIruTOeD-3MXJ2g0A,626
+effspm/btminer/src/build_mdd.hpp,sha256=CvowY9TxxnMh3_bIy0HZ9eZmnCm45z5A6Xz5hxHcwfg,567
+effspm/btminer/src/utility.cpp,sha256=P-CwwWx5QG7U3DsqzZrFNbYxKqaoapR37P_J69qYVz8,2112
+effspm-0.2.6.dist-info/RECORD,,
+effspm-0.2.6.dist-info/WHEEL,sha256=CltXN3lQvXbHxKDtiDwW0RNzF8s2WyBuPbOAX_ZeQlA,109
+effspm-0.2.6.dist-info/top_level.txt,sha256=2O-AuI0nw0pDmJMo2jzM1wvV2rj48AmkjskkAnsuuQk,7
+effspm-0.2.6.dist-info/METADATA,sha256=ZeFn07nadFyyN89edYibk-LzKR93sOGj5d9kjt4MwBc,14227
+effspm-0.2.6.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357

{effspm-0.1.7.dist-info → effspm-0.2.6.dist-info}/WHEEL

@@ -1,6 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (79.0.1)
+Generator: setuptools (80.9.0)
 Root-Is-Purelib: false
 Tag: cp312-cp312-macosx_11_0_arm64
-Generator: delocate 0.13.0
 

effspm-0.1.7.dist-info/METADATA

@@ -1,38 +0,0 @@
-Metadata-Version: 2.4
-Name: effspm
-Version: 0.1.7
-Summary: Prefix‑Projection sequential pattern mining
-Home-page: https://github.com/yeshu999/effspm
-Author: yeshu999
-Author-email: yeshu999 <vootlayeswanth20@gmail.com>
-Project-URL: Homepage, https://github.com/yeshu999/effspm
-Project-URL: Source, https://github.com/yeshu999/effspm
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.7
-Classifier: Programming Language :: Python :: 3.8
-Classifier: Programming Language :: Python :: 3.9
-Classifier: Programming Language :: Python :: 3.10
-Classifier: Programming Language :: Python :: 3.11
-Classifier: Programming Language :: Python :: 3.12
-Classifier: Programming Language :: C++
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Requires-Python: >=3.7
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Requires-Dist: pybind11>=2.6
-Dynamic: author
-Dynamic: home-page
-Dynamic: license-file
-Dynamic: requires-python
-
-# effspm
-
-**Efficient Sequential Pattern Mining via Prefix‑Projection**
-
-This library provides a Python interface to mine sequential patterns using the prefix‑projection algorithm, implemented in C++ for performance and exposed via pybind11.
-
-## Installation
-
-```bash
-pip install effspm

effspm-0.1.7.dist-info/RECORD

@@ -1,14 +0,0 @@
-effspm-0.1.7.dist-info/RECORD,,
-effspm-0.1.7.dist-info/WHEEL,sha256=ACrMF2aP05akv4Id-mc7DZIHqvH9LlWg74roxnFqUPM,136
-effspm-0.1.7.dist-info/top_level.txt,sha256=2O-AuI0nw0pDmJMo2jzM1wvV2rj48AmkjskkAnsuuQk,7
-effspm-0.1.7.dist-info/METADATA,sha256=9Wff5v6cWekQ4c3O11anwulN2lI4pLW9V_DEh2zQmng,1311
-effspm-0.1.7.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
-effspm/utility.hpp,sha256=Y_MQVk9AmJWjguKyuyk0LraTi_6VzZFg0StsmVOCkNc,744
-effspm/_core.cpp,sha256=S6UsUcl0HQLMQUTy2tMJxcrbLGJo8tjkLskyHqESYyI,3675
-effspm/load_inst.hpp,sha256=cR-iZG95mUN62ZLCnPNQsKUINtkwhUzMTLlH81wmyt0,906
-effspm/__init__.py,sha256=3fTJ432t0_vjUMnkw4d8I3Jgots4YKVHWnDSHKs_qb4,68
-effspm/_core.cpython-312-darwin.so,sha256=w9NSmfQIb1qkwm0VlgF5s5lXDKoWLeSBHK45XIWd-Vk,250552
-effspm/freq_miner.cpp,sha256=9K-nO_c-vVzbFlmh511vmvypA2fu1TXpiJhyx03owDU,4642
-effspm/load_inst.cpp,sha256=804fvkfdtYqFMP9Jla6dM2romWWPJmSeCwLm0wEZE5M,4517
-effspm/freq_miner.hpp,sha256=jA-ZCT12Z0YNjLoAiY9sniFTP6g-ITTDuWtlOdHXkMQ,744
-effspm/utility.cpp,sha256=luWwBNy7OVWRmam9gz2RjhtrRmx6c37oOobFJaDWqcA,1403