effspm 0.1.7__cp310-cp310-macosx_10_9_universal2.whl

effspm/__init__.py

@@ -0,0 +1,3 @@
+from ._core import PrefixProjection
+
+__all__ = ['PrefixProjection']

effspm/_core.cpp

@@ -0,0 +1,106 @@
+#include <ctime>       // std::clock
+#include <cmath>       // std::ceil, std::abs
+#include <algorithm>   // std::max
+#include <iostream>    // optional echo
+#include <pybind11/pybind11.h>
+#include <pybind11/stl.h>
+
+#include "load_inst.hpp"
+#include "freq_miner.hpp"
+#include "utility.hpp"
+
+namespace py = pybind11;
+
+PYBIND11_MODULE(_core, m) {
+    m.doc() = "Efficient Sequential Pattern Mining via Prefix-Projection";
+
+    m.def("PrefixProjection",
+        [](py::object data,
+           double minsup,
+           unsigned int time_limit_arg,
+           bool preproc_arg,
+           bool use_dic_arg,
+           bool verbose_arg,
+           const std::string &out_file_arg)
+        {
+            // 1) configure C++ globals
+            time_limit = time_limit_arg;
+            pre_pro    = preproc_arg;
+            use_dic    = use_dic_arg;
+            use_list   = false;
+            b_disp     = verbose_arg;
+            b_write    = !out_file_arg.empty();
+            out_file   = out_file_arg;
+
+            // 2) clear collector & start timer
+            ClearCollected();
+            start_time = std::clock();
+
+            // 3) load either file or in‐memory sequences
+            if (py::isinstance<py::str>(data)) {
+                auto path = data.cast<std::string>();
+                if (!Load_instance(path, minsup))
+                    throw std::runtime_error("Failed to load database from " + path);
+            }
+            else {
+                // convert Python List[List[int]] → C++ items
+                auto seqs = data.cast<std::vector<std::vector<int>>>();
+                items     = std::move(seqs);
+                N         = items.size();
+
+                // a) compute max item ID → L
+                int max_id = 0;
+                for (auto &seq : items)
+                    for (int x : seq)
+                        max_id = std::max(max_id, std::abs(x));
+                L = static_cast<unsigned int>(max_id);
+
+                // b) support threshold θ
+                if (minsup < 1.0)
+                    theta = static_cast<unsigned long long>(std::ceil(minsup * N));
+                else
+                    theta = static_cast<unsigned long long>(minsup);
+
+                // c) initialize DFS stack
+                DFS.clear();
+                DFS.reserve(L);
+                for (unsigned int i = 0; i < L; ++i)
+                    DFS.emplace_back(-static_cast<int>(i) - 1);
+
+                // d) gather dataset stats: max length M, total entries E
+                M = 0;
+                E = 0;
+                for (auto &seq : items) {
+                    M = std::max<unsigned int>(M, static_cast<unsigned int>(seq.size()));
+                    E += seq.size();
+                }
+
+                if (b_disp) {
+                    std::cout << "\nIn-memory dataset: "
+                              << N << " sequences, max len " << M
+                              << ", " << E << " entries, " << L << " items\n";
+                }
+            }
+
+            // 4) run the C++ miner
+            Freq_miner();
+
+            // 5) collect patterns & timing
+            auto patterns   = GetCollected();
+            double wall_time = give_time(std::clock() - start_time);
+
+            // 6) return Python dict
+            py::dict out;
+            out["patterns"] = patterns;
+            out["time"]     = wall_time;
+            return out;
+        },
+        py::arg("data"),
+        py::arg("minsup")      = 0.01,
+        py::arg("time_limit")  = 10 * 3600,
+        py::arg("preproc")     = false,
+        py::arg("use_dic")     = false,
+        py::arg("verbose")     = false,
+        py::arg("out_file")    = ""
+    );
+}

effspm/freq_miner.cpp

@@ -0,0 +1,143 @@
+#include <iostream>
+#include <time.h>
+#include <fstream>
+#include <cmath>
+#include "freq_miner.hpp"
+#include "utility.hpp"
+
+
+
+// Forward declarations from the original code:
+void Extend_patt(Pattern& _patt);
+
+// Globals from original:
+unsigned long long int num_patt = 0;
+Pattern _patt;
+
+// Main miner function from original:
+void Freq_miner() {
+    vector<int> islist;
+    if (use_list) {
+        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();
+    }
+}
+
+// The recursive extension from original:
+void Extend_patt(Pattern& _pattern) {
+    swap(_patt, _pattern);
+    DFS.pop_back();
+
+    vector<bool> slist;
+    vector<bool> ilist;
+
+    if (use_list) {
+        slist = vector<bool>(L, 0);
+        ilist = vector<bool>(L, 0);
+        for (int idx : _patt.slist) slist[idx] = 1;
+        for (int idx : _patt.ilist) ilist[idx] = 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 int seq = _patt.seq_ID[i];
+        unsigned int j = _patt.str_pnt[i] + 1;
+        // positive extensions
+        while (j < items[seq].size() && items[seq][j] > 0) {
+            int cur_itm = items[seq][j];
+            if (!use_list || 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;
+        }
+        // negative and cross-itemset extensions...
+        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 ((!use_list || 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 ((!use_list || 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;
+            }
+        }
+    }
+
+    // Now generate new DFS states
+    if (use_list) {
+        // itemset extensions
+        vector<int> slistp, ilistp;
+        for (int idx : _patt.ilist)
+            if (pot_patt[idx].freq >= theta) ilistp.push_back(idx);
+        for (int idx : _patt.slist)
+            if (pot_patt[idx + L].freq >= theta) slistp.push_back(idx);
+
+        for (int idx : ilistp) {
+            DFS.emplace_back();
+            swap(DFS.back(), pot_patt[idx]);
+            DFS.back().seq = _patt.seq;
+            DFS.back().seq.push_back(idx + 1);
+            DFS.back().slist = slistp;
+            DFS.back().ilist = ilistp;
+            Out_patt(DFS.back().seq, DFS.back().freq);
+            ++num_patt;
+        }
+        for (int idx : slistp) {
+            DFS.emplace_back();
+            swap(DFS.back(), pot_patt[idx + L]);
+            DFS.back().seq = _patt.seq;
+            DFS.back().seq.push_back(-idx - 1);
+            DFS.back().slist = slistp;
+            DFS.back().ilist = slistp;
+            Out_patt(DFS.back().seq, DFS.back().freq);
+            ++num_patt;
+        }
+    } else {
+        // no list optimization
+        for (int i = 0; i < 2 * L; ++i) {
+            if (pot_patt[i].freq >= theta) {
+                DFS.emplace_back();
+                swap(DFS.back(), pot_patt[i]);
+                DFS.back().seq = _patt.seq;
+                if (i >= L)
+                    DFS.back().seq.push_back(-(i - L + 1));
+                else
+                    DFS.back().seq.push_back(i + 1);
+                Out_patt(DFS.back().seq, DFS.back().freq);
+                ++num_patt;
+            }
+        }
+    }
+}

effspm/freq_miner.hpp

@@ -0,0 +1,45 @@
+#pragma once
+#include <vector>
+#include "load_inst.hpp"
+#include <cstdlib> 
+#include <cmath> 
+using namespace std;
+void Freq_miner();
+void Out_patt(std::vector<int>& seq, unsigned int freq);
+
+
+class Pattern {
+public:
+
+	vector<int> seq;
+	vector<unsigned int> str_pnt;
+	vector<unsigned int> seq_ID;
+
+	vector<int> slist;
+	vector<int> ilist;
+
+	unsigned 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/load_inst.cpp

@@ -0,0 +1,252 @@
+#include<iostream>
+#include <sstream>
+#include <algorithm>
+#include "load_inst.hpp"
+#include "freq_miner.hpp"
+#include "utility.hpp"
+#include <math.h>
+
+using namespace std;
+
+unsigned int M = 0, L = 0;
+unsigned long long int N = 0, E = 0, theta;
+
+vector<vector<int>> items;
+vector<Pattern> DFS;
+vector<int> item_dic;
+
+bool Load_items(string& inst);
+void Load_items_pre(string& inst);
+bool Preprocess(string& inst, double thresh);
+
+bool Load_instance(string &items_file, double thresh) {
+
+	clock_t kk = clock();
+	if (pre_pro) {
+		if(!Preprocess(items_file, thresh))
+			return 0;
+
+		cout << "\nPreprocess done in " << give_time(clock() - kk) << " seconds\n\n";
+
+		DFS.reserve(L);
+		for (int i = 0; i < L; ++i)
+			DFS.emplace_back(-i - 1);
+	
+
+		kk = clock();
+		
+		Load_items_pre(items_file);
+	
+		N = items.size();
+
+	}
+	else if (!Load_items(items_file))
+		return 0;
+	else {
+		if (thresh < 1)
+			theta = ceil(thresh * N);
+		else
+			theta = 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 1;
+}
+
+bool Preprocess(string &inst, double thresh) {
+
+	ifstream file(inst);
+
+	vector<unsigned int> freq(1000000);
+	vector<unsigned int> 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);
+				if (L < abs(ditem))
+					L = abs(ditem);
+			
+				if (freq.size() < L) {
+					freq.reserve(L);
+					counted.reserve(L);
+					while (freq.size() < L) {
+						freq.push_back(0);
+						counted.push_back(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 0;
+	}
+
+	if (thresh < 1)
+		theta = ceil(thresh * N);
+	else
+		theta = thresh;
+
+	int real_L = 0;
+	item_dic = vector<int>(L, -1);
+	for (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 << endl;
+
+	L = real_L;
+	N = 0;
+
+
+	return 1;
+}
+
+
+void Load_items_pre(string &inst) {
+
+	ifstream file(inst);
+
+	if (file.good()) {
+		string line;
+		int size_m;
+		int ditem;
+		bool empty_seq = 0;
+		while (getline(file, line) && give_time(clock() - start_time) < time_limit) {
+			vector<bool> counted(L, 0);
+			istringstream word(line);
+			if (!empty_seq) {
+				vector<int> temp;
+				items.push_back(temp);
+			}
+			string itm;
+			size_m = 0;
+			bool sgn = 0; 
+			empty_seq = 1;
+			while (word >> itm) {
+				
+				ditem = stoi(itm);
+
+				if (item_dic[abs(ditem) - 1] == -1) {
+					if (!sgn)
+						sgn = ditem < 0;
+					continue;
+				}
+				else {
+					if (ditem > 0)
+						ditem = item_dic[ditem - 1];
+					else
+						ditem = -item_dic[-ditem - 1];
+				}
+
+				empty_seq = 0;
+
+				if (sgn) {
+					if (ditem > 0)
+						ditem = -ditem;
+					sgn = 0;
+				}
+			
+				items.back().push_back(ditem);
+
+				if (!counted[abs(ditem) - 1]) {
+					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] = 1;
+				}
+
+				++size_m;
+			}
+
+			if (empty_seq)
+				continue;
+
+			++N;
+
+			E += size_m;
+
+			if (size_m > M)
+				M = size_m;
+			
+		}
+	}
+}
+
+bool Load_items(string &inst) {
+
+	ifstream file(inst);
+
+	if (file.good()) {
+		string line;
+		int size_m;
+		int 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(-DFS.size() - 1);
+						counted.push_back(0);
+					}
+				}
+			
+				items.back().push_back(ditem);
+
+				if (!counted[abs(ditem) - 1]) {
+					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] = 1;
+				}
+
+				++size_m;
+			}
+
+			E += size_m;
+
+			if (size_m > M)
+				M = size_m;
+	
+		}
+			}
+	else {
+		cout << "!!!!!! No such file exists: " << inst << " !!!!!!\n";
+		return 0;
+	}
+
+	return 1;
+
+}
+
+
+
+
+
+
+
+
+

effspm/load_inst.hpp

@@ -0,0 +1,30 @@
+// effspm/load_inst.hpp
+#pragma once
+
+#include <vector>
+#include <string>
+#include <fstream>
+#include <map>
+#include <ctime>    // for clock_t
+
+using namespace std;
+
+// ------------------------------------------------------------
+// forward declare Pattern (defined in freq_miner.hpp)
+struct Pattern;
+
+// Main entrypoint: load your file on disk into 'items', build DFS, theta, etc.
+bool Load_instance(string &items_file, double thresh);
+
+// storage & globals shared between the C++-CLI & Python bindings
+extern vector<vector<int>> items;
+extern vector<Pattern>     DFS;         // now Pattern is known
+extern vector<int>         item_dic;
+
+extern string              out_file;
+extern bool                b_disp, b_write, use_dic, use_list, pre_pro;
+
+extern unsigned int        M, L, time_limit;
+extern unsigned long long  N, E, theta; // E = total number of entries
+
+extern clock_t             start_time;

effspm/utility.cpp

@@ -0,0 +1,55 @@
+#include "utility.hpp"
+#include <iostream>
+#include <fstream>
+
+// timing
+std::clock_t start_time;
+
+// flags
+bool b_disp = false, b_write = false, use_dic = false, use_list = false, pre_pro = false;
+unsigned int time_limit = 10 * 3600;
+std::string out_file;
+
+// storage for Python
+static std::vector<std::vector<int>> collected_patterns;
+
+double give_time(std::clock_t end_time) {
+    return static_cast<double>(end_time) / CLOCKS_PER_SEC;
+}
+
+void ClearCollected() {
+    collected_patterns.clear();
+}
+
+const std::vector<std::vector<int>>& GetCollected() {
+    return collected_patterns;
+}
+
+// collect for Python
+void CollectPattern(const std::vector<int>& seq) {
+    collected_patterns.push_back(seq);
+}
+
+// non-const overload forwards to const version
+void Out_patt(std::vector<int>& seq, unsigned int freq) {
+    Out_patt(static_cast<const std::vector<int>&>(seq), freq);
+}
+
+// actual implementation
+void Out_patt(const std::vector<int>& seq, unsigned int freq) {
+    // 1) collect for Python
+    CollectPattern(seq);
+
+    // 2) optional console output
+    if (b_disp) {
+        for (int x : seq) std::cout << x << ' ';
+        std::cout << "\n************** Freq: " << freq << "\n";
+    }
+
+    // 3) optional file output
+    if (b_write) {
+        std::ofstream ofs(out_file, std::ios::app);
+        for (int x : seq) ofs << x << ' ';
+        ofs << "\n************** Freq: " << freq << "\n";
+    }
+}

effspm/utility.hpp

@@ -0,0 +1,29 @@
+#ifndef UTILITY_HPP
+#define UTILITY_HPP
+
+#include <vector>
+#include <string>
+#include <ctime>
+
+// timing
+extern std::clock_t start_time;
+double give_time(std::clock_t end_time);
+
+// flags (shared with main.cpp)
+extern bool b_disp, b_write, use_dic, use_list, pre_pro;
+extern unsigned int time_limit;
+extern std::string out_file;
+
+// Python-binding collection
+void ClearCollected();
+const std::vector<std::vector<int>>& GetCollected();
+
+// pattern collection & output
+void CollectPattern(const std::vector<int>& seq);
+
+// two overloads of Out_patt so calls with non‑const or const vectors both link
+void Out_patt(std::vector<int>& seq, unsigned int freq);
+void Out_patt(const std::vector<int>& seq, unsigned int freq);
+
+#endif // UTILITY_HPP
+

effspm-0.1.7.dist-info/METADATA

@@ -0,0 +1,38 @@
+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

@@ -0,0 +1,14 @@
+effspm-0.1.7.dist-info/RECORD,,
+effspm-0.1.7.dist-info/WHEEL,sha256=DElYocmdrgopNrUdY8SR5gETc6Nry_bwiewfIrlA1RY,141
+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/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
+effspm/_core.cpython-310-darwin.so,sha256=hIvhsct6RUdw8tSXQKxwaO_dJFfOC8FF2fzLBKKJF64,478128

effspm-0.1.7.dist-info/WHEEL

@@ -0,0 +1,6 @@
+Wheel-Version: 1.0
+Generator: setuptools (79.0.1)
+Root-Is-Purelib: false
+Tag: cp310-cp310-macosx_10_9_universal2
+Generator: delocate 0.13.0
+

effspm-0.1.7.dist-info/licenses/LICENSE

@@ -0,0 +1,201 @@
+                                 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.

effspm-0.1.7.dist-info/top_level.txt

@@ -0,0 +1 @@
+effspm