aamutils 0.0.1__py3-none-any.whl

aamutils/__main__.py

@@ -0,0 +1,18 @@
+import logging
+
+from aamutils.cmd import setup_argparser
+
+if __name__ == "__main__":
+    logger = logging.getLogger("aamutils")
+    ch = logging.StreamHandler()
+    ch.setLevel(logging.INFO)
+    formatter = logging.Formatter(
+        "[%(asctime)s %(levelname)s] %(message)s", datefmt="%y-%m-%d %H:%M:%S"
+    )
+    ch.setFormatter(formatter)
+    logger.setLevel(logging.INFO)
+    logger.addHandler(ch)
+
+    parser = setup_argparser()
+    args = parser.parse_args()
+    args.func(args)

aamutils/algorithm/aaming.py

@@ -0,0 +1,124 @@
+import collections
+import networkx as nx
+
+
+def _add_its_nodes(ITS, G, H, eta, symbol_key):
+    eta_G, eta_G_inv, eta_H, eta_H_inv = eta[0], eta[1], eta[2], eta[3]
+    for n, d in G.nodes(data=True):
+        n_ITS = eta_G[n]
+        n_H = eta_H_inv[n_ITS]
+        if n_ITS is not None and n_H is not None:
+            ITS.add_node(n_ITS, symbol=d[symbol_key], idx_map=(n, n_H))
+    for n, d in H.nodes(data=True):
+        n_ITS = eta_H[n]
+        n_G = eta_G_inv[n_ITS]
+        if n_ITS is not None and n_G is not None and n_ITS not in ITS.nodes:
+            ITS.add_node(n_ITS, symbol=d[symbol_key], idx_map=(n_G, n))
+
+
+def _add_its_edges(ITS, G, H, eta, bond_key):
+    eta_G, eta_G_inv, eta_H, eta_H_inv = eta[0], eta[1], eta[2], eta[3]
+    for n1, n2, d in G.edges(data=True):
+        if n1 > n2:
+            continue
+        e_G = d[bond_key]
+        n_ITS1 = eta_G[n1]
+        n_ITS2 = eta_G[n2]
+        n_H1 = eta_H_inv[n_ITS1]
+        n_H2 = eta_H_inv[n_ITS2]
+        e_H = None
+        if H.has_edge(n_H1, n_H2):
+            e_H = H[n_H1][n_H2][bond_key]
+        if not ITS.has_edge(n_ITS1, n_ITS2) and n_ITS1 > 0 and n_ITS2 > 0:
+            ITS.add_edge(n_ITS1, n_ITS2, bond=(e_G, e_H))
+
+    for n1, n2, d in H.edges(data=True):
+        if n1 > n2:
+            continue
+        e_H = d[bond_key]
+        n_ITS1 = eta_H[n1]
+        n_ITS2 = eta_H[n2]
+        n_G1 = eta_G_inv[n_ITS1]
+        n_G2 = eta_G_inv[n_ITS2]
+        if n_G1 is None or n_G2 is None:
+            continue
+        if not G.has_edge(n_G1, n_G2) and n_ITS1 > 0 and n_ITS2 > 0:
+            ITS.add_edge(n_ITS1, n_ITS2, bond=(None, e_H))
+
+
+def get_its(
+    G: nx.Graph, H: nx.Graph, aam_key="aam", symbol_key="symbol", bond_key="bond"
+) -> nx.Graph:
+    """Get the ITS graph of reaction G \u2192 H.
+
+    :param G: Educt molecular graph.
+    :param H: Product molecular graph.
+    :param aam_key: (optional) The node label that encodes atom indices on the
+        molecular graph.
+    :param symbol_key: (optional) The node label that encodes atom symbols on
+        the molecular graph.
+    :param bond_key: (optional) The edge label that encodes bond order on the
+        molecular graph.
+
+    :returns: Returns the ITS graph.
+    """
+    eta_G = collections.defaultdict(lambda: None)
+    eta_G_inv = collections.defaultdict(lambda: None)
+    eta_H = collections.defaultdict(lambda: None)
+    eta_H_inv = collections.defaultdict(lambda: None)
+    eta = (eta_G, eta_G_inv, eta_H, eta_H_inv)
+
+    for n, d in G.nodes(data=True):
+        if aam_key in d.keys() and d[aam_key] >= 0:
+            eta_G[n] = d[aam_key]
+            eta_G_inv[d[aam_key]] = n
+    for n, d in H.nodes(data=True):
+        if aam_key in d.keys() and d[aam_key] >= 0:
+            eta_H[n] = d[aam_key]
+            eta_H_inv[d[aam_key]] = n
+
+    ITS = nx.Graph()
+    _add_its_nodes(ITS, G, H, eta, symbol_key)
+    _add_its_edges(ITS, G, H, eta, bond_key)
+
+    return ITS
+
+
+def get_rc(ITS: nx.Graph, symbol_key="symbol", bond_key="bond") -> nx.Graph:
+    """Get the reaction center (RC) graph from an ITS graph.
+
+    :param ITS: The ITS graph to get the RC from.
+    :param symbol_key: (optional) The node label that encodes atom symbols on
+        the molecular graph.
+    :param bond_key: (optional) The edge label that encodes bond order on the
+        molecular graph.
+
+    :returns: Returns the reaction center (RC) graph.
+    """
+    rc = nx.Graph()
+    for n1, n2, d in ITS.edges(data=True):
+        edge_label = d[bond_key]
+        if edge_label[0] != edge_label[1]:
+            rc.add_node(n1, **{symbol_key: ITS.nodes[n1][symbol_key]})
+            rc.add_node(n2, **{symbol_key: ITS.nodes[n2][symbol_key]})
+            rc.add_edge(n1, n2, **{bond_key: edge_label})
+    return rc
+
+
+def is_rc_valid(RC: nx.Graph, symbol_key="symbol") -> bool:
+    """Checks if a reaction center (RC) graph is valid. A valid RC does not
+    mean it is chemically correct. This function only checks the necessary
+    structural requirements for a correct RC. A chemically correct RC is always
+    valid but a valid RC is not necessarily chemically correct.
+
+    :param symbol_key: (optional) The node label that encodes atom symbols on
+        the molecular graph.
+
+    :returns: Returns ``True`` if the RC graph is valid, ``False`` otherwise.
+    """
+    for n, d in RC.degree():
+        if d < 2:
+            return False, "Atom {} {} has degree {}.".format(
+                n, RC.nodes[n][symbol_key], d
+            )
+    return True

aamutils/algorithm/ilp.py

@@ -0,0 +1,150 @@
+import numpy as np
+import pulp as lp
+import networkx as nx
+
+from aamutils.utils import get_beta_map
+
+
+def _bijection_constraint(problem, X):
+    m = int(np.sqrt(len(X.keys())))
+
+    for j in range(m):
+        problem += (
+            lp.lpSum([X[i, j] for i in range(m)]) == 1,
+            "bijection_col_{}".format(j),
+        )
+    for i in range(m):
+        problem += (
+            lp.lpSum([X[i, j] for j in range(m)]) == 1,
+            "bijection_row_{}".format(i),
+        )
+
+
+def _beta_constraint(problem, X, beta_map):
+    for bi, bj, _ in beta_map:
+        problem += (X[bi, bj] == 1, "beta_constraint1_{}-{}".format(bi, bj))
+
+
+def _edge_diff_constraint(problem, X, D, A_G, A_H):
+    m = int(np.sqrt(len(D.keys())))
+    for i in range(m):
+        for j in range(m):
+            problem += D[i, j] == lp.lpSum(
+                [X[i, k] * A_H[k, j] for k in range(m)]
+            ) - lp.lpSum([A_G[i, k] * X[k, j] for k in range(m)])
+
+
+def _atom_type_constraint(problem, X, G, H, symbol_key="symbol"):
+    m = int(np.sqrt(len(X.keys())))
+    assert m == len(G.nodes)
+    assert m == len(H.nodes)
+    for i in range(m):
+        for j in range(m):
+            g_sym = G.nodes(data=True)[i][symbol_key]
+            h_sym = H.nodes(data=True)[j][symbol_key]
+            assert isinstance(g_sym, str)
+            assert isinstance(h_sym, str)
+            if g_sym != h_sym:
+                problem += (X[i, j] == 0, "atom_type_constraint_{}-{}".format(i, j))
+
+
+def _indicator_constraint(problem, D, G, S, k):
+    m = int(np.sqrt(len(D.keys())))
+    assert m == int(np.sqrt(len(G.keys())))
+    assert m == int(np.sqrt(len(S.keys())))
+
+    for i in range(m):
+        for j in range(m):
+            problem += (
+                D[i, j] <= k * G[i, j],
+                "g_indicator_constraint_lower_{}-{}".format(i, j),
+            )
+            problem += (
+                -D[i, j] <= k * S[i, j],
+                "s_indicator_constraint_lower_{}-{}".format(i, j),
+            )
+
+
+def expand_partial_aam_balanced(
+    G: nx.Graph,
+    H: nx.Graph,
+    beta_map: None | list[tuple[int, int, int]] = None,
+    bond_key="bond",
+) -> tuple[np.ndarray, str, float]:
+    """Function to extend the partial atom-atom map beta of the balanced
+    reaction G \u2192 H to a full atom-atom map based on the Minimal Chemical
+    Distance (minimize the number of changing bonds).
+
+    :param G: Educt molecular graph.
+    :param H: Product molecular graph.
+    :param beta_map: (optional) A list of predefined atom-atom mappings. If not
+        specified the existing mapping in G and H will be used.
+    :param bond_key: (optional) The edge label in G and H which encodes the
+        bond order.
+
+    :returns: A 3-tuple. The first element is the mapping matrix X. The second
+        element is the status string of the ILP solver (e.g. 'Optimal') and the
+        third is the ILP solution value.
+    """
+
+    A_G = nx.adjacency_matrix(G, weight=bond_key).todense()
+    A_H = nx.adjacency_matrix(H, weight=bond_key).todense()
+    k = np.max([np.max(A_G), np.max(A_H)])
+    m = len(G.nodes)
+
+    if m != len(H.nodes):
+        raise ValueError(
+            (
+                "Reaction is not balanced. " + "{} reactant atoms and {} product atoms."
+            ).format(len(G.nodes), len(H.nodes))
+        )
+
+    if beta_map is None:
+        beta_map = get_beta_map(G, H)
+
+    # Mapping matrix X
+    lp_X = lp.LpVariable.dicts(
+        "X",
+        [(i, j) for i in range(m) for j in range(m)],
+        cat=lp.LpBinary,
+    )
+
+    # Difference matrix D
+    lp_D = lp.LpVariable.dicts("D", [(i, j) for i in range(m) for j in range(m)])
+
+    # Indicator matrix G and S
+    lp_G = lp.LpVariable.dicts(
+        "G",
+        [(i, j) for i in range(m) for j in range(m)],
+        cat=lp.LpBinary,
+    )
+    lp_S = lp.LpVariable.dicts(
+        "S",
+        [(i, j) for i in range(m) for j in range(m)],
+        cat=lp.LpBinary,
+    )
+
+    # Non-zero counter function for D
+    lp_f = lp.LpVariable("f", 0, None, lp.LpInteger)
+
+    problem = lp.LpProblem("AAM", lp.LpMinimize)
+
+    problem += (lp_f, "objective")
+    problem += (
+        lp_f == lp.lpSum([lp_G[i, j] + lp_S[i, j] for i in range(m) for j in range(m)]),
+        "objective",
+    )
+
+    _bijection_constraint(problem, lp_X)
+    _beta_constraint(problem, lp_X, beta_map)
+    _atom_type_constraint(problem, lp_X, G, H)
+    _edge_diff_constraint(problem, lp_X, lp_D, A_G, A_H)
+    _indicator_constraint(problem, lp_D, lp_G, lp_S, k)
+
+    status = problem.solve(lp.PULP_CBC_CMD(logPath=r"solver.log"))
+
+    np_X = np.zeros([m, m], dtype=np.int32)
+    for (i, j), v in lp_X.items():
+        np_X[i, j] = int(v.value())
+
+    return np_X, lp.LpStatus[status], lp_f.value()

aamutils/cmd/__init__.py

@@ -0,0 +1,15 @@
+import argparse
+
+from aamutils.cmd.expanding import configure_parser as configure_expanding_parser
+
+
+def setup_argparser() -> argparse.ArgumentParser:
+    parser = argparse.ArgumentParser(
+        prog="AAM Utils",
+        description="A collection of atom-atom-mapping utility functions.",
+    )
+    subparsers = parser.add_subparsers(dest="command")
+
+    configure_expanding_parser(subparsers)
+
+    return parser

aamutils/cmd/expanding.py

@@ -0,0 +1,84 @@
+import os
+import json
+import logging
+import rdkit.Chem.rdmolfiles as rdmolfiles
+import rdkit.Chem.rdmolops as rdmolops
+
+from utils import mol_to_graph, set_aam, graph_to_mol, is_valid_rxn_smiles
+from algorithm.ilp import expand_partial_aam_balanced
+from algorithm.aaming import get_its, get_rc, is_rc_valid
+
+logger = logging.getLogger("aamutils")
+
+
+def run(args):
+    outputfile = args.o
+    inputfile = args.inputfile
+    if outputfile is None:
+        in_path, in_ext = os.path.splitext(inputfile)
+        outputfile = "{}_extended.json".format(in_path)
+    rxn_smiles = []
+    with open(inputfile, "r") as f:
+        rxn_smiles = [line.strip() for line in f if is_valid_rxn_smiles(line)]
+
+    results = []
+    success_cnt = 0
+    for smiles in rxn_smiles:
+        result = {"input": smiles}
+        try:
+            r_smiles, p_smiles = smiles.split(">>")
+            r_mol = rdmolfiles.MolFromSmiles(r_smiles)
+            p_mol = rdmolfiles.MolFromSmiles(p_smiles)
+            r_mol = rdmolops.AddHs(r_mol, 1)
+            p_mol = rdmolops.AddHs(p_mol, 1)
+            G = mol_to_graph(r_mol)
+            H = mol_to_graph(p_mol)
+
+            M, status, e_diff = expand_partial_aam_balanced(G, H)
+
+            set_aam(G, H, M)
+
+            r_mol = graph_to_mol(G)
+            p_mol = graph_to_mol(H)
+
+            its = get_its(G, H)
+            rc = get_rc(its)
+            rc_invalid = not is_rc_valid(rc)
+            result_smiles = "{}>>{}".format(
+                rdmolfiles.MolToSmiles(r_mol), rdmolfiles.MolToSmiles(p_mol)
+            )
+            result["expanded_aam"] = result_smiles
+            result["ilp_status"] = status
+            result["optimization_result"] = e_diff
+            result["invalid_reaction_center"] = rc_invalid
+            result["reaction_edges"] = len(rc.nodes)
+            success_cnt += 1
+        except Exception as e:
+            result["error"] = str(e)
+        finally:
+            results.append(result)
+
+    with open(outputfile, "w") as f:
+        json.dump(results, f, indent=4)
+    logger.info(
+        "Expanded {} atom-atom-maps (failed: {})".format(
+            success_cnt, len(rxn_smiles) - success_cnt
+        )
+    )
+    logger.info("The result is written to file '{}'.".format(outputfile))
+
+
+def configure_parser(subparsers):
+    parser = subparsers.add_parser(
+        "expand", help="Utility to expand a partial atom-atom-maps."
+    )
+    parser.add_argument(
+        "inputfile",
+        help=(
+            "A file containing reaction smiles with "
+            + "partial atom-atom-maps. Reactions should be separated by newlines."
+        ),
+    )
+    parser.add_argument("-o", default=None, help="Path to output file.")
+
+    parser.set_defaults(func=run)

aamutils/utils.py

@@ -0,0 +1,125 @@
+import collections
+import numpy as np
+import networkx as nx
+import rdkit.Chem as Chem
+import rdkit.Chem.rdmolfiles as rdmolfiles
+
+
+def mol_to_graph(mol: Chem.rdchem.Mol) -> nx.Graph:
+    bond_order_map = {
+        "SINGLE": 1,
+        "DOUBLE": 2,
+        "TRIPLE": 3,
+        "QUADRUPLE": 4,
+        "AROMATIC": 1.5,
+    }
+    g = nx.Graph()
+    for atom in mol.GetAtoms():
+        aam = atom.GetAtomMapNum()
+        g.add_node(atom.GetIdx(), symbol=atom.GetSymbol(), aam=aam)
+    for bond in mol.GetBonds():
+        bond_type = str(bond.GetBondType()).split(".")[-1]
+        bond_order = 1
+        if bond_type in bond_order_map.keys():
+            bond_order = bond_order_map[bond_type]
+        g.add_edge(bond.GetBeginAtomIdx(), bond.GetEndAtomIdx(), bond=bond_order)
+    return g
+
+
+def graph_to_mol(
+    G: nx.Graph, symbol_key="symbol", aam_key="aam", bond_type_key="bond"
+) -> Chem.rdchem.Mol:
+    bond_order_map = {
+        1: Chem.rdchem.BondType.SINGLE,
+        2: Chem.rdchem.BondType.DOUBLE,
+        3: Chem.rdchem.BondType.TRIPLE,
+        4: Chem.rdchem.BondType.QUADRUPLE,
+        1.5: Chem.rdchem.BondType.AROMATIC,
+    }
+    rw_mol = Chem.rdchem.RWMol()
+    for n, d in G.nodes(data=True):
+        idx = rw_mol.AddAtom(Chem.rdchem.Atom(d[symbol_key]))
+        if aam_key in d.keys() and d[aam_key] >= 0:
+            rw_mol.GetAtomWithIdx(idx).SetAtomMapNum(d[aam_key])
+        assert n == idx
+    for n1, n2, d in G.edges(data=True):
+        rw_mol.AddBond(n1, n2, bond_order_map[d[bond_type_key]])
+    return rw_mol.GetMol()
+
+
+def get_beta_map(G, H, aam_key="aam"):
+    node2aam_G = collections.defaultdict(
+        lambda: -1, {n: d[aam_key] for (n, d) in G.nodes(data=True) if d[aam_key] > 0}
+    )
+    aam2node_H = collections.defaultdict(
+        lambda: -1, {d[aam_key]: n for (n, d) in H.nodes(data=True) if d[aam_key] > 0}
+    )
+    beta_map = []
+    for n_G, aam_G in node2aam_G.items():
+        if aam_G in aam2node_H and aam2node_H[aam_G] > -1:
+            beta_map.append((n_G, aam2node_H[aam_G], aam_G))
+    return beta_map
+
+
+def set_aam(G, H, M, beta_map=None, aam_key="aam"):
+    if beta_map is None:
+        beta_map = get_beta_map(G, H)
+    used_atom_numbers = [aam for _, _, aam in beta_map]
+
+    aam_G = collections.defaultdict(lambda: -1)
+    for bi, _, aam in beta_map:
+        aam_G[bi] = aam
+
+    next_aam_nr = 1
+    for n, d in G.nodes(data=True):
+        if aam_G[n] > -1:
+            aam_nr = aam_G[n]
+        else:
+            while next_aam_nr in used_atom_numbers:
+                next_aam_nr += 1
+            aam_nr = next_aam_nr
+            used_atom_numbers.append(aam_nr)
+        d[aam_key] = int(aam_nr)
+        aam_G[n] = aam_nr
+
+    aam_G = np.array([v for _, v in sorted(aam_G.items(), key=lambda x: x[0])])
+    for (_, d), aam in zip(H.nodes(data=True), np.dot(aam_G.T, M)):
+        d[aam_key] = int(aam)
+
+
+def is_valid_rxn_smiles(smiles):
+    smiles_token = smiles.split(">>")
+    if len(smiles_token) != 2:
+        return False
+    mol1 = rdmolfiles.MolFromSmiles(smiles_token[0])
+    if mol1 is None:
+        return False
+    mol2 = rdmolfiles.MolFromSmiles(smiles_token[0])
+    if mol2 is None:
+        return False
+    return True
+
+
+def print_graph(graph):
+    print(
+        "Graph Nodes: {}".format(
+            " ".join(
+                [
+                    "[{}]{}:{}".format(
+                        n[0], n[1].get("symbol", None), n[1].get("aam", None)
+                    )
+                    for n in graph.nodes(data=True)
+                ]
+            )
+        )
+    )
+    print(
+        "Graph Edges: {}".format(
+            " ".join(
+                [
+                    "[{}]-[{}]:{}".format(n[0], n[1], n[2]["bond"])
+                    for n in graph.edges(data=True)
+                ]
+            )
+        )
+    )

aamutils-0.0.1.dist-info/METADATA

@@ -0,0 +1,86 @@
+Metadata-Version: 2.3
+Name: aamutils
+Version: 0.0.1
+Summary: Collection of atom-atom-mapping utility functions.
+Project-URL: homepage, https://github.com/klausweinbauer/AAMUtils
+Project-URL: source, https://github.com/klausweinbauer/AAMUtils
+Project-URL: issues, https://github.com/klausweinbauer/AAMUtils/issues
+Author-email: Klaus Weinbauer <klaus@bioinf.uni-leipzig.de>
+License-File: LICENSE
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Requires-Python: >=3.11
+Requires-Dist: fgutils<0.1.0,>=0.0.17
+Requires-Dist: networkx==3.3
+Requires-Dist: numpy<2.0.0,>=1.26.0
+Requires-Dist: pillow==10.3.0
+Requires-Dist: pulp==2.8.0
+Requires-Dist: rdkit==2024.3.1
+Requires-Dist: scipy==1.14.0
+Description-Content-Type: text/markdown
+
+# Atom-atom-mapping Utils
+
+A collection of atom-atom-mapping utility functions. 
+
+## Installation
+
+TODO
+
+## Usage
+
+The input is a list of partial atom-atom-maps (AAMs). Data is read line-by-line
+from a text file. Each line should contain one reaction SMILES.
+
+Here is a simple example extending the partial AAM to a complete AAM. First
+generate the input data:
+
+```bash
+echo "CCC[Cl:1].[N:2]>>CCC[N:2].[Cl:1]" > testinput.txt
+```
+
+Next, run AAMUtils to expand the partial AAM. 
+
+```bash 
+python3 ./aamutils/__main__.py expand testinput.txt
+```
+
+The output is written to 'testinput_extended.json'. 
+
+```bash 
+cat testinput_extended.json 
+```
+
+```json 
+[
+    {
+        "input": "CCC[Cl:1].[N:2]>>CCC[N:2].[Cl:1]",
+        "expanded_aam": "[Cl:1][CH2:5][CH2:4][CH3:3].[NH3:2]>>[ClH:1].[NH2:2][CH2:5][CH2:4][CH3:3]",
+        "ilp_status": "Optimal",
+        "optimization_result": 2.0,
+        "invalid_reaction_center": false,
+        "reaction_edges": 3
+    }
+]
+```
+
+## Functionality
+Here is an overview of implemented functionallity:
+
+- SMILES to graph and graph to SMILES parsing
+- Reaction center validity checks
+- ITS graph generation
+- Expand partial AAM to complete AAM on balanced reactions
+- AAMing based on minimal chemical distance (MCD) for balanced reactions
+
+## License
+
+This project is licensed under MIT License - see the [License](LICENSE) file
+for details.
+
+## Acknowledgments
+
+This project has received funding from the European Unions Horizon Europe
+Doctoral Network programme under the Marie-Skłodowska-Curie grant agreement No
+101072930 (TACsy -- Training Alliance for Computational)

aamutils-0.0.1.dist-info/RECORD

@@ -0,0 +1,12 @@
+aamutils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+aamutils/__main__.py,sha256=DasuV1GXyLtaaps146UZDGCUup3xkQMi1cx-FWX54w0,485
+aamutils/utils.py,sha256=d-9xXpHrEwY6-bnk_uOuoPp6h9BiBOlJH78gAuiaMbM,3794
+aamutils/algorithm/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+aamutils/algorithm/aaming.py,sha256=nz179yZ6gdhTCVRwZk4LuaGWzz9m8G58IDZuYEQ4YfI,4472
+aamutils/algorithm/ilp.py,sha256=__XejyI1l93d0h8YEDQ1P2xNBEnOArWtIqp57STwNCE,4707
+aamutils/cmd/__init__.py,sha256=v_hXGEsutZQjDS2rK7Q8SSF6qgObwNghoiQW-kT9zwg,415
+aamutils/cmd/expanding.py,sha256=h-Nzwo_xGb9q6YLKXT9Sxb_IUEJnUd59jS--IWe25DA,2717
+aamutils-0.0.1.dist-info/METADATA,sha256=rzUe5A_mkwpmttKFeWPyoP3sLNkg3Qfr96POJdINTDI,2430
+aamutils-0.0.1.dist-info/WHEEL,sha256=1yFddiXMmvYK7QYTqtRNtX66WJ0Mz8PYEiEUoOUUxRY,87
+aamutils-0.0.1.dist-info/licenses/LICENSE,sha256=_oKtgkrP1wX2OJZmh5jhsJu5aWm79813yq0wxYKh0I4,1062
+aamutils-0.0.1.dist-info/RECORD,,

aamutils-0.0.1.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: hatchling 1.25.0
+Root-Is-Purelib: true
+Tag: py3-none-any

aamutils-0.0.1.dist-info/licenses/LICENSE

@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) 2024 Klaus
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.