cnexp 0.1.0__py3-none-any.whl

cnexp/__init__.py

@@ -0,0 +1,2 @@
+"""cnexp: Computer Networks Lab Experiment CLI Tool"""
+__version__ = "0.1.0"

cnexp/cli.py

@@ -0,0 +1,79 @@
+import sys
+import argparse
+from cnexp.registry import EXPERIMENTS
+
+def normalize(s: str) -> str:
+    return str(s).lower().replace("-", "_").replace(" ", "_")
+
+def find_experiment(query: str):
+    q = normalize(query)
+    
+    # 1. Direct number or key lookup
+    for num, data in EXPERIMENTS.items():
+        if q == str(num) or q == normalize(data["key"]):
+            return num, data
+            
+    # 2. Alias match
+    for num, data in EXPERIMENTS.items():
+        aliases = [normalize(a) for a in data.get("aliases", [])]
+        if q in aliases:
+            return num, data
+            
+    # 3. Substring match
+    for num, data in EXPERIMENTS.items():
+        if q in normalize(data["key"]) or q in normalize(data["title"]):
+            return num, data
+            
+    return None, None
+
+def list_experiments():
+    print("=" * 68)
+    print("        Computer Networks Lab Experiments Reference (cnexp)")
+    print("=" * 68)
+    for num in sorted(EXPERIMENTS.keys()):
+        data = EXPERIMENTS[num]
+        print(f" {num:2d}. {data['title']}")
+        print(f"     Key: '{data['key']}'  (Aliases: {', '.join(data.get('aliases', []))})")
+    print("=" * 68)
+    print("\nUsage Examples:")
+    print("  cnexp 1                  # Print Exp 1 (Character Stuffing)")
+    print("  cnexp bit_stuffing       # Print Exp 2 (Bit Stuffing)")
+    print("  cnexp 3 -o crc.py        # Save Exp 3 directly to crc.py")
+    print("  cnexp --list             # Show this experiment index")
+
+def main():
+    parser = argparse.ArgumentParser(
+        prog="cnexp",
+        description="Quick CLI reference for Computer Networks lab experiment programs."
+    )
+    parser.add_argument("experiment", nargs="?", help="Experiment number (1-10) or keyword (e.g., crc, dijkstra)")
+    parser.add_argument("-l", "--list", action="store_true", help="List all available experiments")
+    parser.add_argument("-o", "--output", metavar="FILE", help="Save code directly to a file")
+
+    args = parser.parse_args()
+
+    if args.list or not args.experiment:
+        list_experiments()
+        sys.exit(0)
+
+    num, exp_data = find_experiment(args.experiment)
+    if not exp_data:
+        print(f"Error: Experiment '{args.experiment}' not found.\n", file=sys.stderr)
+        list_experiments()
+        sys.exit(1)
+
+    code = exp_data["code"].strip()
+
+    if args.output:
+        try:
+            with open(args.output, "w") as f:
+                f.write(code + "\n")
+            print(f"✓ Successfully saved Exp {num} ({exp_data['title']}) to {args.output}")
+        except Exception as e:
+            print(f"Error saving to file: {e}", file=sys.stderr)
+            sys.exit(1)
+    else:
+        print(code)
+
+if __name__ == "__main__":
+    main()

cnexp/registry.py

@@ -0,0 +1,74 @@
+# Auto-generated registry of CN lab experiments
+
+EXPERIMENTS = {
+    1: {
+        'key': 'char_stuffing',
+        'title': 'Character / Byte Stuffing and De-stuffing',
+        'aliases': ['1', 'char', 'character', 'byte_stuffing', 'char_stuffing'],
+        'filename': 'exp1_char_stuffing.py',
+        'code': '# 1. Character (Byte) Stuffing and De-stuffing\nDLE, STX, ETX = "DLE", "STX", "ETX"\n\ndef stuff(data):\n    res = [DLE, STX]\n    for ch in data:\n        if ch == DLE:\n            res.extend([DLE, DLE])  # Stuff an extra DLE\n        else:\n            res.append(ch)\n    res.extend([DLE, ETX])\n    return res\n\ndef destuff(frame):\n    res = []\n    i = 2  # Skip starting DLE STX\n    while i < len(frame) - 2:  # Stop before ending DLE ETX\n        res.append(frame[i])\n        if frame[i] == DLE and frame[i + 1] == DLE:\n            i += 1  # Skip stuffed DLE\n        i += 1\n    return res\n\nif __name__ == "__main__":\n    raw = input("Enter tokens (space-separated, e.g. A B DLE C): ").strip().split()\n    data = raw if raw else ["A", "B", "DLE", "C"]\n    stuffed = stuff(data)\n    print("\\n[Transmitter] Stuffed Frame :", " ".join(stuffed))\n    print("[Receiver]    De-stuffed Data :", " ".join(destuff(stuffed)))',
+    },
+    2: {
+        'key': 'bit_stuffing',
+        'title': 'Bit Stuffing and De-stuffing',
+        'aliases': ['2', 'bit', 'bitstuffing', 'bit_stuffing'],
+        'filename': 'exp2_bit_stuffing.py',
+        'code': '# 2. Bit Stuffing and De-stuffing\ndef stuff(data):\n    res, count = "", 0\n    for b in data:\n        res += b\n        count = count + 1 if b == \'1\' else 0\n        if count == 5:\n            res += \'0\'  # Stuff \'0\' after five consecutive 1s\n            count = 0\n    return "01111110" + res + "01111110"\n\ndef destuff(frame):\n    data = frame[8:-8]  # Strip 8-bit start and end flags\n    res, count, i = "", 0, 0\n    while i < len(data):\n        res += data[i]\n        count = count + 1 if data[i] == \'1\' else 0\n        if count == 5 and i + 1 < len(data):\n            i += 1  # Skip stuffed \'0\'\n            count = 0\n        i += 1\n    return res\n\nif __name__ == "__main__":\n    raw = input("Enter binary bit string (e.g. 01111110111110): ").strip()\n    data = raw if raw else "01111110111110"\n    stuffed = stuff(data)\n    print("\\n[Transmitter] Stuffed Frame :", stuffed)\n    print("[Receiver]    De-stuffed Data :", destuff(stuffed))',
+    },
+    3: {
+        'key': 'crc',
+        'title': 'CRC-12 and CRC-16 Polynomials on Character Dataset',
+        'aliases': ['3', 'crc12', 'crc16', 'crc_check'],
+        'filename': 'exp3_crc12_crc16.py',
+        'code': '# 3. CRC-12 and CRC-16 on Character Dataset\n\ndef mod2div(dividend, divisor):\n    cur = list(dividend)\n    k = len(divisor)\n    for i in range(len(dividend) - k + 1):\n        if cur[i] == \'1\':\n            for j in range(k):\n                cur[i + j] = \'0\' if cur[i + j] == divisor[j] else \'1\'\n    return \'\'.join(cur[-(k - 1):])\n\ndef run_crc(text, poly_name):\n    polys = {\n        "CRC-12": "1100000001111",     # x^12 + x^11 + x^3 + x^2 + x + 1 (13 bits)\n        "CRC-16": "11000000000000101"   # x^16 + x^15 + x^2 + 1 (17 bits)\n    }\n    divisor = polys[poly_name]\n    # Convert character dataset into binary ASCII stream\n    bits = \'\'.join(f"{ord(c):08b}" for c in text)\n    appended = bits + \'0\' * (len(divisor) - 1)\n    rem = mod2div(appended, divisor)\n    codeword = bits + rem\n    check = mod2div(codeword, divisor)\n    return bits, rem, codeword, check\n\nif __name__ == "__main__":\n    text = input("Enter character dataset (e.g. NET): ").strip() or "NET"\n    for poly in ["CRC-12", "CRC-16"]:\n        bits, rem, cw, chk = run_crc(text, poly)\n        print(f"\\n--- {poly} ---")\n        print(f"Data Bits    : {bits} (\'{text}\')")\n        print(f"Remainder/CRC: {rem}")\n        print(f"Codeword     : {cw}")\n        print("Verification :", "Valid / No Error" if int(chk) == 0 else "Error Detected")',
+    },
+    4: {
+        'key': 'sliding_window',
+        'title': 'Stop and Wait Sliding Window Protocol',
+        'aliases': ['4', 'sliding', 'stop_and_wait', 'sliding_window'],
+        'filename': 'exp4_sliding_window.py',
+        'code': '# 4. Stop and Wait Sliding Window Protocol\nimport random\n\ndef stop_and_wait(total_frames=5):\n    i = 0\n    while i < total_frames:\n        print(f"\\n[Sender]   Sending Frame {i}")\n        if random.random() < 0.2:\n            print(f"[Network]  ** Frame {i} LOST! Timeout **")\n            print(f"[Sender]   Retransmitting Frame {i}...")\n            continue\n        print(f"[Receiver] Frame {i} received. Sending ACK {i}")\n        if random.random() < 0.1:\n            print(f"[Network]  ** ACK {i} LOST! Timeout **")\n            print(f"[Sender]   Retransmitting Frame {i}...")\n            continue\n        print(f"[Sender]   ACK {i} received. Window sliding forward.")\n        i += 1\n    print("\\n[Complete] All frames transmitted successfully!")\n\nif __name__ == "__main__":\n    n = int(input("Enter number of frames to send (default 5): ") or 5)\n    stop_and_wait(n)',
+    },
+    5: {
+        'key': 'gobackn',
+        'title': 'Go-Back-N Protocol Simulation',
+        'aliases': ['5', 'gbn', 'go_back_n', 'gobackn'],
+        'filename': 'exp5_go_back_n.py',
+        'code': '# 5. Go-Back-N Sliding Window Protocol Simulation\nimport random\n\ndef go_back_n(total_frames=7, window_size=3):\n    base, next_seq = 0, 0\n    print(f"Simulating Go-Back-N (Total Frames = {total_frames}, Window Size = {window_size})\\n")\n    \n    while base < total_frames:\n        # Transmit all available frames in current window\n        while next_seq < base + window_size and next_seq < total_frames:\n            print(f"[Sender]   Sent Frame {next_seq}")\n            next_seq += 1\n\n        # Simulate receiver acknowledgment for the base frame\n        if random.random() < 0.25:\n            print(f"[Network]  ** Frame {base} Lost/Corrupted! Timeout **")\n            print(f"[Sender]   Go-Back-N: Retransmitting from Frame {base}...\\n")\n            next_seq = base  # Roll back sender pointer to base\n        else:\n            print(f"[Receiver] Received Frame {base} -> Sent ACK {base}")\n            base += 1\n\n    print("\\n[Complete] All frames transmitted and acknowledged successfully!")\n\nif __name__ == "__main__":\n    w = int(input("Enter window size N (default 3): ") or 3)\n    f = int(input("Enter total frames (default 7): ") or 7)\n    go_back_n(f, w)',
+    },
+    6: {
+        'key': 'dijkstra',
+        'title': "Dijkstra's Algorithm for Shortest Path through Network Routers",
+        'aliases': ['6', 'dijkstras', 'shortest_path', 'spf'],
+        'filename': 'exp6_dijkstra.py',
+        'code': '# 6. Dijkstra\'s Algorithm for Shortest Path through Network Routers\n\ndef dijkstra(graph, src):\n    n = len(graph)\n    dist = [float(\'inf\')] * n\n    dist[src] = 0\n    visited = [False] * n\n\n    for _ in range(n):\n        # Pick minimum distance unvisited router\n        u = min((d, i) for i, d in enumerate(dist) if not visited[i])[1]\n        visited[u] = True\n        for v in range(n):\n            if graph[u][v] > 0 and not visited[v]:\n                dist[v] = min(dist[v], dist[u] + graph[u][v])\n\n    print(f"\\nShortest Path Cost from Source Router {src}:")\n    print(f"{\'Destination Router\':<20}{\'Cost\'}")\n    print("-" * 30)\n    for i in range(n):\n        print(f"Router {i:<13} {dist[i]}")\n\nif __name__ == "__main__":\n    # Subnet adjacency cost matrix (0 = no direct link)\n    cost_matrix = [\n        [0, 4, 2, 0, 0],\n        [4, 0, 1, 5, 0],\n        [2, 1, 0, 8, 10],\n        [0, 5, 8, 0, 2],\n        [0, 0, 10, 2, 0]\n    ]\n    src = int(input("Enter source router (0 to 4, default 0): ") or 0)\n    dijkstra(cost_matrix, src)',
+    },
+    7: {
+        'key': 'distance_vector',
+        'title': 'Distance Vector Routing Algorithm (Delay Metric)',
+        'aliases': ['7', 'dvr', 'bellman_ford', 'distance_vector'],
+        'filename': 'exp7_distance_vector.py',
+        'code': '# 7. Distance Vector Routing Algorithm (Delay Metric)\n\ndef dvr(delay_matrix):\n    n = len(delay_matrix)\n    # dist[i][j] = delay from i to j, nexthop[i][j] = next router\n    dist = [row[:] for row in delay_matrix]\n    nexthop = [[j if delay_matrix[i][j] != float(\'inf\') else -1 for j in range(n)] for i in range(n)]\n\n    # Bellman-Ford relaxation step\n    for _ in range(n):\n        for i in range(n):\n            for j in range(n):\n                for k in range(n):\n                    if dist[i][k] + dist[k][j] < dist[i][j]:\n                        dist[i][j] = dist[i][k] + dist[k][j]\n                        nexthop[i][j] = nexthop[i][k]\n\n    # Display routing table for each node\n    for i in range(n):\n        print(f"\\nRouting Table for Node {i}:")\n        print(f"{\'Destination\':<15}{\'Delay\':<10}{\'Next Hop\'}")\n        print("-" * 35)\n        for j in range(n):\n            print(f"Node {j:<10} {dist[i][j]:<10} Node {nexthop[i][j]}")\n\nif __name__ == "__main__":\n    INF = float(\'inf\')\n    # Subnet delay matrix (weights indicate delay in ms)\n    subnet_delay = [\n        [0, 2, INF, 1],\n        [2, 0, 3, 7],\n        [INF, 3, 0, 1],\n        [1, 7, 1, 0]\n    ]\n    dvr(subnet_delay)',
+    },
+    8: {
+        'key': 'broadcast_tree',
+        'title': 'Broadcast Tree for a Subnet of Hosts (Minimum Spanning Tree)',
+        'aliases': ['8', 'broadcast', 'broadcast_tree', 'spanning_tree', 'mst'],
+        'filename': 'exp8_broadcast_tree.py',
+        'code': '# 8. Broadcast Tree for a Subnet of Hosts (Minimum Spanning Tree)\n\ndef broadcast_tree(graph, root=0):\n    n = len(graph)\n    in_tree = [False] * n\n    in_tree[root] = True\n    tree_edges = []\n    total_delay = 0\n\n    while len(tree_edges) < n - 1:\n        min_edge = (float(\'inf\'), -1, -1)\n        for u in range(n):\n            if in_tree[u]:\n                for v in range(n):\n                    if not in_tree[v] and 0 < graph[u][v] < min_edge[0]:\n                        min_edge = (graph[u][v], u, v)\n        \n        weight, u, v = min_edge\n        if v == -1:\n            break\n        in_tree[v] = True\n        tree_edges.append((u, v, weight))\n        total_delay += weight\n\n    print(f"\\nBroadcast Tree from Root Host {root}:")\n    print(f"{\'Link (Host <-> Host)\':<25}{\'Delay / Weight\'}")\n    print("-" * 40)\n    for u, v, w in tree_edges:\n        print(f"Host {u} <---> Host {v}     {w} ms")\n    print("-" * 40)\n    print(f"Total Broadcast Tree Cost: {total_delay} ms")\n\nif __name__ == "__main__":\n    # Subnet graph of 5 hosts\n    subnet = [\n        [0, 2, 4, 0, 0],\n        [2, 0, 1, 7, 0],\n        [4, 1, 0, 3, 5],\n        [0, 7, 3, 0, 1],\n        [0, 0, 5, 1, 0]\n    ]\n    root = int(input("Enter root host (0 to 4, default 0): ") or 0)\n    broadcast_tree(subnet, root)',
+    },
+    9: {
+        'key': 'leaky_bucket',
+        'title': 'Congestion Control using Leaky Bucket Algorithm',
+        'aliases': ['9', 'leaky', 'leaky_bucket', 'congestion'],
+        'filename': 'exp9_leaky_bucket.py',
+        'code': '# 9. Congestion Control using Leaky Bucket Algorithm\n\ndef leaky_bucket(capacity, leak_rate, packets):\n    stored = 0\n    print(f"Bucket Capacity: {capacity} packets | Leak Rate: {leak_rate} pkts/sec\\n")\n    print(f"{\'Sec\':<5}{\'Incoming\':<10}{\'Stored\':<10}{\'Sent\':<10}{\'Left\':<10}{\'Dropped\'}")\n    print("-" * 52)\n\n    for sec, incoming in enumerate(packets, start=1):\n        dropped = 0\n        if incoming + stored > capacity:\n            dropped = (incoming + stored) - capacity\n            stored = capacity\n        else:\n            stored += incoming\n\n        sent = min(stored, leak_rate)\n        stored -= sent\n        print(f"{sec:<5}{incoming:<10}{stored+sent:<10}{sent:<10}{stored:<10}{dropped}")\n\n    # Flush remaining packets in buffer\n    sec = len(packets) + 1\n    while stored > 0:\n        sent = min(stored, leak_rate)\n        stored -= sent\n        print(f"{sec:<5}{0:<10}{stored+sent:<10}{sent:<10}{stored:<10}{0}")\n        sec += 1\n\nif __name__ == "__main__":\n    cap = int(input("Enter bucket capacity (default 10): ") or 10)\n    rate = int(input("Enter leak rate (default 3): ") or 3)\n    pkts = [4, 7, 8, 2, 5, 1]\n    leaky_bucket(cap, rate, pkts)',
+    },
+    10: {
+        'key': 'ns3_drop',
+        'title': 'Simulation of Packet Drops in NS-3 Style DropTail Queue',
+        'aliases': ['10', 'ns3', 'ns3_drop', 'packet_drop', 'ns3_packet_drop'],
+        'filename': 'exp10_ns3_packet_drop.py',
+        'code': '# 10. Simulation of Packet Drops in NS-3 Style DropTail Queue\nimport random\n\ndef simulate_ns3_queue(total_packets=25, queue_limit=5, drop_prob=0.15):\n    print("=" * 55)\n    print("  NS-3 Point-to-Point Queue Simulation (DropTail)")\n    print(f"  Max Queue Capacity : {queue_limit} packets")\n    print(f"  Total Inflow Packets: {total_packets}")\n    print("=" * 55 + "\\n")\n\n    queue = []\n    dropped_queue_full = 0\n    dropped_channel_err = 0\n    transmitted = 0\n\n    for pkt_id in range(1, total_packets + 1):\n        # 1. Enqueue event (Router ingress)\n        if len(queue) >= queue_limit:\n            print(f"[Time {pkt_id:02d}s] Pkt {pkt_id:2d} arrived -> QUEUE FULL! -> [DROPPED]")\n            dropped_queue_full += 1\n        else:\n            queue.append(pkt_id)\n            print(f"[Time {pkt_id:02d}s] Pkt {pkt_id:2d} arrived -> Enqueued (Queue: {len(queue)}/{queue_limit})")\n\n        # 2. Dequeue / Service event (Router egress)\n        if pkt_id % 2 == 0 and queue:\n            serviced_pkt = queue.pop(0)\n            if random.random() < drop_prob:\n                print(f"          Pkt {serviced_pkt:2d} dequeued -> Channel Noise -> [DROPPED]")\n                dropped_channel_err += 1\n            else:\n                print(f"          Pkt {serviced_pkt:2d} dequeued -> Successfully Delivered")\n                transmitted += 1\n\n    # Drain remaining packets\n    while queue:\n        serviced_pkt = queue.pop(0)\n        transmitted += 1\n\n    total_dropped = dropped_queue_full + dropped_channel_err\n    loss_rate = (total_dropped / total_packets) * 100\n\n    print("\\n" + "=" * 55)\n    print("                SIMULATION RESULTS")\n    print("=" * 55)\n    print(f"Total Packets Generated     : {total_packets}")\n    print(f"Packets Dropped (Buffer Full): {dropped_queue_full}")\n    print(f"Packets Dropped (Channel Err): {dropped_channel_err}")\n    print(f"Total Packets Dropped       : {total_dropped}")\n    print(f"Packets Successfully Sent   : {transmitted}")\n    print(f"Packet Loss Percentage      : {loss_rate:.2f}%")\n    print("=" * 55)\n\nif __name__ == "__main__":\n    n = int(input("Enter number of packets to simulate (default 25): ") or 25)\n    q = int(input("Enter router queue size (default 5): ") or 5)\n    simulate_ns3_queue(n, q)',
+    },
+}

cnexp-0.1.0.dist-info/METADATA

@@ -0,0 +1,57 @@
+Metadata-Version: 2.4
+Name: cnexp
+Version: 0.1.0
+Summary: Quick CLI reference for Computer Networks lab experiment programs
+Author-email: CN Student <student@example.com>
+License: MIT
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# cnexp - Computer Networks Lab Programs CLI
+
+A lightweight CLI tool to instantly display and export clean, memorization-friendly Python programs for Computer Networks (CN) lab experiments.
+
+## Installation
+
+### From PyPI (once published):
+```bash
+pip install cnexp
+```
+
+### Local / Editable mode:
+```bash
+cd cnexp_package
+pip install -e .
+```
+
+## Quick Usage
+
+```bash
+# List all 10 experiments
+cnexp --list
+
+# View an experiment (by number or name)
+cnexp 1
+cnexp 2
+cnexp bit_stuffing
+cnexp crc
+cnexp dijkstra
+
+# Save directly to a python file to run immediately in your lab
+cnexp 3 -o crc.py
+python crc.py
+```
+
+## Included Experiments
+1. Character Stuffing & De-stuffing (DLE STX / DLE ETX)
+2. Bit Stuffing & De-stuffing (01111110 Flag)
+3. CRC-12 and CRC-16 Polynomials on Character Dataset
+4. Stop and Wait Sliding Window Protocol
+5. Go-Back-N Protocol Simulation
+6. Dijkstra's Shortest Path Routing Algorithm
+7. Distance Vector Routing (Delay Metric)
+8. Broadcast Tree for Subnet of Hosts (Minimum Spanning Tree)
+9. Leaky Bucket Congestion Control Algorithm
+10. NS-3 Style Queue Packet Drop Simulation

cnexp-0.1.0.dist-info/RECORD

@@ -0,0 +1,9 @@
+cnexp/__init__.py,sha256=q82kWJ-oEomVBj-LClhwOMw2RTFmHhORtM2Qirih2IQ,77
+cnexp/cli.py,sha256=QO6spZiMO5YyqQKqxVs1ZyKZYANKE9OgM46oh_3osOI,2732
+cnexp/registry.py,sha256=8BxyBy6S9L8S76bWwLpR64SrcNy8fvZwVCpyHH21XOc,15046
+cnexp-0.1.0.dist-info/licenses/LICENSE,sha256=Ee0ZTPmFeCp3S2bdr5QwB22ZV79bqMSukWme1Rzdzbo,594
+cnexp-0.1.0.dist-info/METADATA,sha256=WzNQZnTinDQOPDGFOmAqMOkNOnQmhhzx8yRtPR8XLnk,1454
+cnexp-0.1.0.dist-info/WHEEL,sha256=YVMoNqKzERt-wjUZwJ33xBGAwnFl-4cqbYkTtWa4itE,91
+cnexp-0.1.0.dist-info/entry_points.txt,sha256=dSrrYw8mxIan5jSOg703AaSioC6_Z54Fw9sy2VDXPns,41
+cnexp-0.1.0.dist-info/top_level.txt,sha256=s6A6VbwiJ-uR1flF8ge-V2BO6yiwmPYWju3oAR6_Ri4,6
+cnexp-0.1.0.dist-info/RECORD,,

cnexp-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.0.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

cnexp-0.1.0.dist-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+cnexp = cnexp.cli:main

cnexp-0.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,13 @@
+MIT License
+
+Copyright (c) 2026
+
+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.

cnexp-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+cnexp