setta 0.0.1.dev0__py3-none-any.whl → 0.0.2.dev0__py3-none-any.whl

setta/utils/utils.py

@@ -0,0 +1,271 @@
+import json
+import os
+import re
+from json import JSONDecodeError
+from pathlib import Path
+
+
+def get_absolute_path(src_path, file_path):
+    return (Path(src_path).parent / file_path).resolve()
+
+
+def is_dev_mode():
+    return os.environ.get("SETTA_DEV_MODE")
+
+
+# https://gist.github.com/bgusach/a967e0587d6e01e889fd1d776c5f3729
+def multireplace(string, replacements):
+    """
+    Given a string and a replacement map, it returns the replaced string.
+
+    :param str string: string to execute replacements on
+    :param dict replacements: replacement dictionary {value to find: value to replace}
+    :rtype: str
+
+    """
+    if not replacements:
+        # Edge case that'd produce a funny regex and cause a KeyError
+        return string
+
+    # Place longer ones first to keep shorter substrings from matching where the longer ones should take place
+    # For instance given the replacements {'ab': 'AB', 'abc': 'ABC'} against the string 'hey abc', it should produce
+    # 'hey ABC' and not 'hey ABc'
+    rep_sorted = sorted(replacements, key=len, reverse=True)
+    rep_escaped = map(re.escape, rep_sorted)
+
+    # Create a big OR regex that matches any of the substrings to replace
+    pattern = re.compile("|".join(rep_escaped))
+
+    # For each match, look up the new string in the replacements, being the key the normalized old string
+    return pattern.sub(lambda match: replacements[match.group(0)], string)
+
+
+class QuoteInsensitiveDict(dict):
+    def __getitem__(self, key):
+        return super().__getitem__(self.normalize_key(key))
+
+    def __setitem__(self, key, value):
+        super().__setitem__(self.normalize_key(key), value)
+
+    def __contains__(self, key):
+        return super().__contains__(self.normalize_key(key))
+
+    def normalize_key(self, key):
+        # Remove outer quotes if present
+        key = key.strip("'\"")
+        # Replace all quote characters with a standard one
+        key = re.sub(r"['\"]", '"', key)
+        return key
+
+
+def nested_access(input_dict, access_string):
+    # Split by array/dict access while preserving quotes
+    keys = re.findall(r"\[([^\]]+)\]|([^[]+)", access_string)
+    # Flatten tuples and handle quotes
+    keys = [k[0] if k[0] else k[1] for k in keys]
+    # Remove quotes from string keys and convert numeric keys to integers
+    keys = [int(k) if k.isdigit() else k.strip("\"'") for k in keys]
+
+    # Start with the input dictionary
+    result = input_dict
+
+    # Traverse the nested structure
+    for idx, key in enumerate(keys):
+        if idx == len(keys) - 1:
+            break
+        result = result[key]
+
+    return result, key
+
+
+def recursive_dict_merge(dict1, dict2, strict_top_level_keys=False):
+    """
+    Recursively merge two dictionaries. For conflicting keys:
+    - If both values are dictionaries: merge recursively
+    - If both values are lists: concatenate them
+    - Otherwise: value from dict2 takes precedence
+
+    Args:
+        dict1 (dict): First dictionary
+        dict2 (dict): Second dictionary
+        strict_top_level_keys (bool): If True, only keep top-level keys from dict1
+
+    Returns:
+        dict: Merged dictionary
+
+    Examples:
+        >>> d1 = {'a': 1, 'b': {'c': 2, 'd': [1, 2]}}
+        >>> d2 = {'b': {'c': 4, 'd': [3, 4]}, 'f': 6}
+        >>> recursive_dict_merge(d1, d2)
+        {'a': 1, 'b': {'c': 4, 'd': [1, 2, 3, 4]}, 'f': 6}
+        >>> recursive_dict_merge(d1, d2, strict_top_level_keys=True)
+        {'a': 1, 'b': {'c': 4, 'd': [1, 2, 3, 4]}}
+    """
+    if strict_top_level_keys:
+        # Only process keys that exist in dict1
+        dict2 = {k: v for k, v in dict2.items() if k in dict1}
+
+    merged = dict1.copy()
+
+    for key, value in dict2.items():
+        if key in merged:
+            if isinstance(merged[key], dict) and isinstance(value, dict):
+                # If both values are dictionaries, merge them recursively
+                merged[key] = recursive_dict_merge(merged[key], value)
+            elif isinstance(merged[key], list) and isinstance(value, list):
+                # If both values are lists, concatenate them
+                merged[key] = merged[key] + value
+            else:
+                # Otherwise, value from dict2 takes precedence
+                merged[key] = value
+        else:
+            merged[key] = value
+
+    return merged
+
+
+def try_json(x):
+    try:
+        return json.loads(x)
+    except (JSONDecodeError, TypeError):
+        return x
+
+
+def replace_null_keys_with_none(data):
+    """
+    Recursively replaces "null" keys with None in a dictionary.
+
+    Args:
+        data: Input dictionary
+
+    Returns:
+        Modified dictionary with "null" keys replaced by None
+    """
+    if isinstance(data, dict):
+        new_dict = {}
+        for key, value in data.items():
+            # Replace "null" key with None
+            new_key = None if key == "null" else key
+
+            # Recursively process value if it's a dictionary
+            if isinstance(value, dict):
+                value = replace_null_keys_with_none(value)
+            elif isinstance(value, list):
+                # Process dictionaries within lists
+                value = [
+                    replace_null_keys_with_none(item)
+                    if isinstance(item, dict)
+                    else item
+                    for item in value
+                ]
+
+            new_dict[new_key] = value
+        return new_dict
+    return data
+
+
+def filter_dict(x, keep_keys=None, default_vals=None):
+    if not isinstance(x, dict):
+        return x
+
+    return {
+        k: filter_dict(v, None, default_vals.get(k) if default_vals else None)
+        for k, v in x.items()
+        if (keep_keys is None or k in keep_keys)
+        and (
+            (default_vals is None) or (k not in default_vals) or (v != default_vals[k])
+        )
+    }
+
+
+def replace_at_positions(input_string, replacements, return_positions=False):
+    """
+    Replace substrings at specific positions in the input string.
+
+    Args:
+        input_string (str): The original string to modify
+        replacements (list): List of tuples (position, old_value, new_value)
+        return_positions (bool): Whether to return new positions of replacements
+
+    Returns:
+        Union[str, Tuple[str, List[Tuple[int, str]]]]:
+            If return_positions is False: Modified string with all replacements applied
+            If return_positions is True: Tuple of (modified string, list of (old_position, position, new_value))
+
+    Raises:
+        ValueError: If any replacement would result in an invalid operation
+    """
+    # Sort replacements by position in descending order to avoid position shifts
+    replacements = sorted(replacements, reverse=True, key=lambda x: x[0])
+
+    # Convert string to list for easier manipulation
+    result = list(input_string)
+
+    # Track new positions if requested
+    new_positions = []
+
+    for pos, old, new in replacements:
+        # Verify the position is valid
+        if pos < 0 or pos >= len(input_string):
+            raise ValueError(f"Position {pos} is out of bounds")
+
+        # Verify the old value matches at the specified position
+        if not input_string.startswith(old, pos):
+            raise ValueError(
+                f"Expected '{old}' at position {pos}, but found '{input_string[pos:pos+len(old)]}'"
+            )
+
+        # Calculate the shift this replacement will cause
+        current_shift = len(new) - len(old)
+
+        # Replace the characters
+        result[pos : pos + len(old)] = list(new)
+
+        # If tracking new positions, add the current replacement's new position
+        if return_positions:
+            new_positions.append((pos, pos, new))
+            # Update all previous entries' positions to account for this shift
+            for i in range(len(new_positions) - 1):
+                old_pos_i, pos_i, val_i = new_positions[i]
+                new_positions[i] = (old_pos_i, pos_i + current_shift, val_i)
+
+    # Join the result list back into a string
+    final_string = "".join(result)
+
+    # Return based on whether return_positions is requested
+    if return_positions:
+        return final_string, new_positions
+    return final_string
+
+
+def save_json_to_file(path, data):
+    with open(path, "w") as f:
+        json.dump(data, f, indent=2)
+
+
+def prune_dict(id_to_children: dict, keep_ids: list) -> dict:
+    """
+    Prunes a dictionary to keep only specified IDs and their descendants.
+
+    Args:
+        id_to_children: Dictionary mapping IDs to lists of child IDs
+        keep_ids: List of IDs to keep along with their descendants
+
+    Returns:
+        New dictionary containing only the specified IDs and their descendants
+    """
+    # First find all descendants of the keep_ids
+    to_keep = set()
+
+    def collect_descendants(current_id):
+        if current_id not in to_keep:  # Avoid cycles
+            to_keep.add(current_id)
+            for child_id in id_to_children.get(current_id, []):
+                collect_descendants(child_id)
+
+    # Collect all descendants
+    for id in keep_ids:
+        collect_descendants(id)
+
+    # Create new dict with only the ids we want to keep
+    return {id: children for id, children in id_to_children.items() if id in to_keep}

setta/utils/websocket_manager.py

@@ -0,0 +1,91 @@
+import json
+
+from fastapi import WebSocket
+from websockets.exceptions import ConnectionClosedError
+
+from setta.tasks.fns.utils import TaskMessage
+from setta.utils.constants import C
+from setta.utils.generate_memorable_string import generate_memorable_string
+
+
+# https://fastapi.tiangolo.com/advanced/websockets/#handling-disconnections-and-multiple-clients
+class WebsocketManager:
+    def __init__(self):
+        self.sockets = {}
+        self.server_cli_id = "main"
+        self.message_id_to_sender_id = {}
+
+    async def connect(self, websocket: WebSocket):
+        await websocket.accept()
+        id = websocket.headers.get("websocketId")
+        while (not id) or id in self.sockets:
+            id = generate_memorable_string()
+        self.sockets[id] = {
+            "websocket": websocket,
+            "isCLI": websocket.headers.get("isCLI", False),
+            "location": None,
+        }
+        await self.broadcast_connections()
+        return id
+
+    async def disconnect(self, id):
+        try:
+            del self.sockets[id]
+            await self.broadcast_connections()
+        except ConnectionClosedError:
+            pass
+
+    async def send_message(self, message, fromWebsocketId, tasks):
+        if "toWebsocketId" in message:
+            if "id" in message:
+                self.message_id_to_sender_id[message["id"]] = fromWebsocketId
+            wid = message["toWebsocketId"]
+            if wid == self.server_cli_id:
+                # process task and send any results back to requester
+                result = await tasks(
+                    message["messageType"], TaskMessage.parse_obj(message)
+                )
+                if "content" in result:
+                    websocket = self.sockets[fromWebsocketId]["websocket"]
+                    await websocket.send_text(
+                        json.dumps(
+                            {
+                                "id": message["id"],
+                                "content": result["content"],
+                                "messageType": result["messageType"],
+                            }
+                        )
+                    )
+            else:
+                # just send data to target websocket
+                websocket = self.sockets[wid]["websocket"]
+                await websocket.send_text(json.dumps(message))
+
+        if "location" in message:
+            self.sockets[fromWebsocketId]["location"] = message["location"]
+
+    async def send_message_to_requester(self, id, content):
+        # just send data to target websocket
+        websocket = self.sockets[self.message_id_to_sender_id[id]]["websocket"]
+        await websocket.send_text(json.dumps({"id": id, "content": content}))
+
+    async def send_message_to_location(self, content, messageType, location):
+        for w in self.sockets.values():
+            if w["location"] == location:
+                websocket = w["websocket"]
+                await websocket.send_text(
+                    json.dumps({"content": content, "messageType": messageType})
+                )
+
+    async def broadcast(self, message):
+        for s in self.sockets.values():
+            await s["websocket"].send_text(json.dumps(message))
+
+    async def broadcast_connections(self):
+        connections = []
+        for id, s in self.sockets.items():
+            connections.append({"websocketId": id, "isCLI": s["isCLI"]})
+        connections.append({"websocketId": self.server_cli_id, "isCLI": True})
+        await self.broadcast(
+            {"messageType": C.WS_ALL_CONNECTIONS, "connections": connections}
+        )

setta-0.0.2.dev0.dist-info/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 2025 Kevin Musgrave and Jeff Musgrave
+
+   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.

setta-0.0.2.dev0.dist-info/METADATA

@@ -0,0 +1,24 @@
+Metadata-Version: 2.2
+Name: setta
+Version: 0.0.2.dev0
+Home-page: https://setta.dev
+Project-URL: GitHub, https://github.com/settadev/setta
+License-File: LICENSE
+Requires-Dist: click==8.1.3
+Requires-Dist: requests==2.28.1
+Requires-Dist: PyYAML==6.0
+Requires-Dist: websockets==11.0.3
+Requires-Dist: fastapi==0.115.4
+Requires-Dist: uvicorn==0.32.0
+Requires-Dist: docstring_parser==0.15
+Requires-Dist: pywinpty==2.0.12; platform_system == "Windows"
+Requires-Dist: ptyprocess==0.7.0; platform_system != "Windows"
+Requires-Dist: psutil==5.9.7
+Requires-Dist: basedpyright==1.25.0
+Requires-Dist: docstring-to-markdown==0.15
+Requires-Dist: black==23.7.0
+Requires-Dist: watchdog==6.0.0
+Provides-Extra: dev
+Requires-Dist: build==1.0.3; extra == "dev"
+Requires-Dist: isort==5.12.0; extra == "dev"
+Requires-Dist: flake8==6.1.0; extra == "dev"