sutro 0.1.33__py3-none-any.whl → 0.1.40__py3-none-any.whl

sutro/templates/classification.py

@@ -0,0 +1,117 @@
+import json
+from typing import Union, List
+import polars as pl
+import pandas as pd
+from pydantic import BaseModel
+
+from ..common import ModelOptions
+from ..interfaces import BaseSutroClient
+
+
+class ClassificationTemplates(BaseSutroClient):
+    def classify(
+        self,
+        data: Union[List, pd.DataFrame, pl.DataFrame, str],
+        classes: Union[dict[str, str], list[str]],
+        model: ModelOptions = "gemma-3-12b-it",
+        job_priority: int = 0,
+        name: Union[str, List[str]] = None,
+        description: Union[str, List[str]] = None,
+        output_column: str = "inference_result",
+        column: Union[str, List[str]] = None,
+        truncate_rows: bool = True,
+        include_scratchpad: bool = False,
+    ):
+        """
+        A simple template style function to perform classification on the provided data with Sutro. The intention is that the implemented code should be very easy to extend further, while showing a basic structure for large-scale classification with Sutro.
+
+        It uses structured outputs with a scratchpad field, enabling the model to reason step-by-step before providing the final classification.
+        The method supports various input formats including lists, DataFrames (Polars or Pandas), file paths, and datasets.
+        The method will wait for the classification job to complete before returning the results.
+
+        Args:
+            data (Union[List, pd.DataFrame, pl.DataFrame, str]): The data to classify. Each row should contain some text to classifiy that fits into one of the passed in labels.
+            classes (Union[dict[str, str], list[str]]): The classification classes. Can be either:
+                - A list of class names, ie ["Positive", "Negative", "Neutral"]
+                - A dict mapping class labels to descriptions, ie {"Positive": "Expresses satisfaction...", ...}
+                Providing descriptions can improve classification accuracy, especially for ambiguous or domain-specific categories.
+            model (ModelOptions, optional): The LLM to use. Defaults to "gemma-3-12b-it"; a model chosen for its balance of performance and efficiency, that also retains competency across a broad number of different domains.
+            job_priority (int, optional): The priority of the job. Defaults to 0.
+            name (Union[str, List[str]], optional): A job name for experiment/metadata tracking purposes. Defaults to None.
+            description (Union[str, List[str]], optional): A job description for experiment/metadata tracking purposes. Defaults to None.
+            output_column (str, optional): The column name to store the classification results in if the input is a DataFrame. Defaults to "inference_result".
+            column (Union[str, List[str]], optional): The column name to use for classification. Required if data is a DataFrame, file path, or dataset. If a list is supplied, it will concatenate the columns of the list into a single column, accepting separator strings.
+            truncate_rows (bool, optional): If True, any rows that have a token count exceeding the context window length of the selected model will be truncated to the max length that will fit within the context window. Defaults to True.
+            include_scratchpad (bool, optional): If True, includes the model's thinking scratchpad in the output. If False, only returns the final classification. Defaults to False.
+
+        Returns:
+            The completed classification results for the provided data. If include_scratchpad is True, returns both scratchpad and classification fields in JSON object. If False, returns only the classification as a string.
+
+        """
+        if isinstance(classes, dict):
+            formatted_classes = "\n".join(
+                [f"- {name}: {desc}" for name, desc in classes.items()]
+            )
+        else:
+            formatted_classes = "\n".join([f"- {c}" for c in classes])
+
+        system_prompt = f"""You are an expert classifier. Your task is to accurately categorize the input into one of the provided classes.
+
+## Classes
+
+{formatted_classes}
+
+## Instructions
+
+1. **Analyze the input carefully**: Read and understand the full context - identify key elements, themes, and characteristics
+
+2. **Consider each class**: For each possible class, evaluate how similar the input is to its typical characteristics
+
+3. **Provide your reasoning in the scratchpad**: Think through which class fits best and why
+
+4. **Provide output**: Give your final classification
+
+If needed, use the scratchpad field to work through steps 1-3, then provide your final answer in the classification field.
+
+## Guidelines
+
+- Select exactly ONE class, even if multiple seem applicable (choose the best match)
+- If the input is ambiguous, choose the closest fit and explain your reasoning
+- Base your decision on the actual content, not assumptions or implications
+- Similar inputs should receive the same classification
+
+Respond using the structured format with scratchpad and classification fields."""
+
+        class ClassificationOutput(BaseModel):
+            # Since we're using structured outputs, we want to give the model some
+            # space to reason and think as needed
+            scratchpad: str
+            classification: str
+
+        job_id = self.infer(
+            data,
+            model,
+            name,
+            description,
+            system_prompt=system_prompt,
+            output_schema=ClassificationOutput,
+            column=column,
+            output_column=output_column,
+            job_priority=job_priority,
+            truncate_rows=truncate_rows,
+            stay_attached=False,
+        )
+
+        results = self.await_job_completion(job_id)
+
+        # Filter out scratchpad if not wanted
+        if not include_scratchpad:
+            results = results.with_columns(
+                pl.col(output_column)
+                .map_elements(
+                    lambda x: json.loads(x)["classification"], return_dtype=pl.Utf8
+                )
+                .alias(output_column)
+            )
+
+        return results

sutro/templates/embed.py

@@ -0,0 +1,53 @@
+from typing import Union, List
+import polars as pl
+import pandas as pd
+from ..common import EmbeddingModelOptions
+from ..interfaces import BaseSutroClient
+
+
+class EmbeddingTemplates(BaseSutroClient):
+    def embed(
+        self,
+        data: Union[List, pd.DataFrame, pl.DataFrame, str],
+        model: EmbeddingModelOptions = "qwen-3-embedding-0.6b",
+        job_priority: int = 0,
+        name: Union[str, List[str]] = None,
+        description: Union[str, List[str]] = None,
+        output_column: str = "inference_result",
+        column: Union[str, List[str]] = None,
+        truncate_rows: bool = True,
+    ):
+        """
+        A simple template style function to generate embeddings for the provided data, with Sutro. The intention is that the implemented code should be very easy to extend further, while showing a basic structure for large scale embedding generation with Sutro.
+
+        This method allows you to generate vector embeddings for the provided data using Sutro.
+        It supports various options for inputting data, such as lists, DataFrames (Polars or Pandas), file paths and datasets.
+        The method will wait for the embedding job to complete before returning the results.
+
+        Args:
+            data (Union[List, pd.DataFrame, pl.DataFrame, str]): The data to generate embeddings for.
+            model (ModelOptions, optional): The embedding model to use. Defaults to "qwen-3-embedding-0.6b"; a model we chose as its small & fast, yet performs well on a variety of tasks.
+            job_priority (int, optional): The priority of the job. Defaults to 0.
+            name (Union[str, List[str]], optional): A job name for experiment/metadata tracking purposes. Defaults to None.
+            description (Union[str, List[str]], optional): A job description for experiment/metadata tracking purposes. Defaults to None.
+            output_column (str, optional): The column name to store the embedding results in if the input is a DataFrame. Defaults to "inference_result".
+            column (Union[str, List[str]], optional): The column name to use for embedding generation. Required if data is a DataFrame, file path, or dataset. If a list is supplied, it will concatenate the columns of the list into a single column, accepting separator strings.
+            truncate_rows (bool, optional): If True, any rows that have a token count exceeding the context window length of the selected model will be truncated to the max length that will fit within the context window. Defaults to True.
+
+        Returns:
+            The completed embedding results for the provided data.
+
+        """
+        job_id = self.infer(
+            data,
+            model,
+            name,
+            description,
+            column,
+            output_column,
+            job_priority,
+            truncate_rows=truncate_rows,
+            stay_attached=False,
+        )
+
+        return self.await_job_completion(job_id)

sutro/templates/evals.py

@@ -0,0 +1,340 @@
+from typing import Union, List, Tuple
+import polars as pl
+import pandas as pd
+import numpy as np
+import math
+from ..common import ModelOptions
+from ..interfaces import BaseSutroClient
+from collections import defaultdict
+from itertools import combinations
+
+
+class Score(BaseSutroClient):
+    def score(
+        self,
+        data: Union[List, pd.DataFrame, pl.DataFrame, str],
+        model: ModelOptions = "gemma-3-12b-it",
+        job_priority: int = 0,
+        name: Union[str, List[str]] = None,
+        description: Union[str, List[str]] = None,
+        column: Union[str, List[str]] = None,
+        # function-specific parameters
+        criteria: Union[str, List[str]] = None,
+        score_column_name: str = "score",
+        range: Tuple[int, int] = (0, 10),
+    ):
+        """
+        A simple invocation of an LLM-as-a-judge numerical scoring function, with a default 0-10 range.
+
+        Accepts a normal Sutro input data type, as well as a string or list of strings to use as criteria,
+        a column name to use for the scoring, and a range to use for the scoring (default 0-10).
+
+        Returns a pandas or polars dataframe with the scores as a column, corresponding to the column name provided.
+        """
+
+        if isinstance(criteria, str):
+            criteria = [criteria]
+
+        system_prompt = f"""You are a judge. Your job is to score the data presented to you according to the following criteria:
+{", ".join(criteria)}
+Return a score between {range[0]} and {range[1]}, and nothing else."""
+
+        json_schema = {
+            "type": "object",
+            "properties": {
+                f"{score_column_name}": {
+                    "type": "integer",
+                    "minimum": range[0],
+                    "maximum": range[1],
+                },
+            },
+            "required": [score_column_name],
+        }
+
+        job_id = self.infer(
+            data=data,
+            model=model,
+            name=name,
+            description=description,
+            column=column,
+            system_prompt=system_prompt,
+            output_schema=json_schema,
+            job_priority=job_priority,
+            stay_attached=False,
+        )
+
+        res = self.await_job_completion(job_id)
+        if isinstance(data, pl.DataFrame):
+            return data.with_columns(
+                pl.Series(score_column_name, res[score_column_name])
+            )
+        elif isinstance(data, pd.DataFrame):
+            return data.assign(**{score_column_name: res[score_column_name]})
+        else:
+            return res
+
+
+class Rank(BaseSutroClient):
+    def rank(
+        self,
+        model: ModelOptions = "gemma-3-12b-it",
+        job_priority: int = 0,
+        name: Union[str, List[str]] = None,
+        description: Union[str, List[str]] = None,
+        # function-specific parameters
+        data: Union[
+            List[List], pd.DataFrame, pl.DataFrame, str
+        ] = None,  # data is always required, but this method accepts a list of lists as well
+        option_labels: List[str] = None,
+        criteria: Union[str, List[str]] = None,
+        ranking_column_name: str = "ranking",
+        run_elo: bool = True,
+    ):
+        """
+        A simple invocation of a LLM-as-a-judge ranking (pairwise comparison) function, accepting multiple options to rank.
+        Accepts a list of lists, a pandas or polars dataframe, as well as option labels to use for the ranking.
+
+        If using a lists of lists, the option labels should correspond to the labels you would like to use for the ranking, in the same order as the lists.
+        If using a pandas or polars dataframe, the option labels should correspond to the column names of the dataframe to use for the ranking.
+
+        Returns a list of lists of rankings ordered from best to worst, corresponding to the option labels.
+        If using a pandas or polars dataframe, the rankings will be returned as a column in the original dataframe.
+        """
+
+        if isinstance(criteria, str):
+            criteria = [criteria]
+
+        system_prompt = f"""You are a judge. Your job is to rank the options presented to you according to the following criteria:
+{", ".join(criteria)}
+The option labels are: {", ".join(option_labels)}
+Return a ranking of the options as an ordered list of the labels from best to worst, and nothing else."""
+
+        json_schema = {
+            "type": "object",
+            "properties": {
+                f"{ranking_column_name}": {
+                    "type": "array",
+                    "items": {"type": "string"},
+                },
+            },
+            "required": [ranking_column_name],
+        }
+
+        if isinstance(data, list):
+            # create a polars dataframe from the list of lists
+            data = pl.DataFrame(data, schema=option_labels)
+        elif isinstance(data, pd.DataFrame):
+            # convert to polars dataframe
+            data = data.from_pandas(data)
+
+        exprs = []  # because the option literals are the same as the same as the column names we don't use the built-in column concatenation helper function
+        for _, label in enumerate(option_labels):
+            exprs.append(pl.lit(label + ":"))
+            exprs.append(pl.col(label))
+
+        data = data.select(
+            pl.concat_str(exprs, separator=" ", ignore_nulls=False).alias(
+                "options_with_labels"
+            )
+        )
+
+        job_id = self.infer(
+            data=data,
+            column="options_with_labels",
+            model=model,
+            name=name,
+            description=description,
+            system_prompt=system_prompt,
+            output_schema=json_schema,
+            job_priority=job_priority,
+            stay_attached=False,
+        )
+
+        res = self.await_job_completion(job_id, output_column=ranking_column_name)
+
+        # This doesn't work when do as a single step for some reason
+        res = (
+            res.with_columns(
+                pl.col(ranking_column_name).str.json_decode().alias("_decoded")
+            )
+            .with_columns(
+                pl.col("_decoded")
+                .struct.field(ranking_column_name)
+                .alias(ranking_column_name)
+            )
+            .drop("_decoded")
+        )
+
+        if run_elo:
+            elo_ratings = self.elo(data=res, column=ranking_column_name)
+            print(elo_ratings[["elo", "wins", "losses", "matches"]].to_markdown())
+
+        if isinstance(data, pl.DataFrame):
+            return data.with_columns(
+                pl.Series(ranking_column_name, res[ranking_column_name])
+            )
+        elif isinstance(data, pd.DataFrame):
+            return data.assign(**{ranking_column_name: res[ranking_column_name]})
+        else:
+            return res
+
+    @staticmethod
+    def elo(
+        data: Union[List, pd.DataFrame, pl.DataFrame] = None,
+        column: Union[str, List[str]] = None,
+        laplace: float = 0.5,
+        max_iter: int = 1000,
+        tol: float = 1e-8,
+        elo_mean: float = 1500.0,
+    ):
+        """
+        Accepts ordered ranking outputs produced by the rank method, and produces an Elo rating for each label option.
+        """
+
+        if isinstance(data, pl.DataFrame):
+            if column is None:
+                raise ValueError("column is required when using a polars dataframe")
+            rankings = data.select(pl.col(column)).to_series().to_list()
+        elif isinstance(data, pd.DataFrame):
+            if column is None:
+                raise ValueError("column is required when using a pandas dataframe")
+            rankings = data.loc[:, [column]].tolist()
+        else:
+            rankings = data
+
+        """ 
+        Convert ballots of ordered rankings into pairwise counts, then run Bradley–Terry MM.
+
+        rankings:
+        - Strict order: ["B", "A", "C"] means B>A, B>C, A>C
+        - With ties: ["B", ("A","C"), "D"] means B > A=C > D
+                        (A and C tie once on that ballot)
+
+        Other params are passed to the underlying BT solver.
+        """
+        # --- build (winner, loser) counts and tie counts from rankings ---
+        pair_counts = defaultdict(float)
+        tie_counts = defaultdict(float)  # unordered keys (min(name), max(name))
+
+        def as_group(x):
+            # allow tuple/list/set to denote a tie group; strings remain atomic
+            if isinstance(x, (list, tuple, set)) and not isinstance(x, (str, bytes)):
+                return list(x)
+            return [x]
+
+        for ballot in rankings:
+            # normalize ballot into list of groups, each group a list of items tied at that rank
+            groups = [as_group(g) for g in ballot if g is not None]
+
+            # wins across groups: every item in an earlier (better) group beats every item in any later group
+            for gi in range(len(groups)):
+                for gj in range(gi + 1, len(groups)):
+                    for w in groups[gi]:
+                        for l in groups[gj]:
+                            if w != l:
+                                pair_counts[(str(w), str(l))] += 1.0
+
+            # ties within a group: count one tie per unordered pair inside that group
+            for g in groups:
+                if len(g) >= 2:
+                    for a, b in combinations(g, 2):
+                        a, b = str(a), str(b)
+                        key = (a, b) if a < b else (b, a)
+                        if a != b:
+                            tie_counts[key] += 1.0
+
+        pair_counts = dict(pair_counts)
+        ties = dict(tie_counts) if tie_counts else None
+
+        """
+        pair_counts: { (winner, loser): wins } for all observed directed pairs.
+        ties: optional { (a, b): tie_count } counted once per unordered pair (a,b).
+            If provided, each tie contributes 0.5 win to both directions.
+        laplace: additive smoothing to each *directed* count (prevents zeros).
+        """
+
+        # ---- Build model list ----
+        models = sorted(set([k[0] for k in pair_counts] + [k[1] for k in pair_counts]))
+        m = len(models)
+        idx = {name: i for i, name in enumerate(models)}
+
+        # ---- Build directed wins matrix W[i,j] = times i beat j ----
+        W = np.zeros((m, m), dtype=float)
+        for (w, l), c in pair_counts.items():
+            if w == l:
+                continue
+            W[idx[w], idx[l]] += float(c)
+
+        # ---- Optional ties: add 0.5 to both directions for each tie ----
+        if ties:
+            for (a, b), t in ties.items():
+                if a == b:
+                    continue
+                i, j = idx[a], idx[b]
+                W[i, j] += 0.5 * t
+                W[j, i] += 0.5 * t
+
+        # ---- Laplace smoothing on directed edges (excluding diagonal) ----
+        if laplace and laplace > 0:
+            W += laplace
+            np.fill_diagonal(W, 0.0)
+
+        # Unordered totals N_ij = W_ij + W_ji
+        N = W + W.T
+        np.fill_diagonal(N, 0.0)
+
+        # Guard: drop models with zero matches
+        active = N.sum(axis=1) > 0
+        if not np.all(active):
+            keep = np.where(active)[0]
+            models = [models[i] for i in keep]
+            idx = {name: i for i, name in enumerate(models)}
+            W = W[np.ix_(keep, keep)]
+            N = N[np.ix_(keep, keep)]
+            m = len(models)
+
+        # ---- Bradley–Terry via MM updates (Hunter 2004) ----
+        s = np.ones(m, dtype=float)  # abilities (positive)
+        for _ in range(max_iter):
+            s_old = s.copy()
+            w_i = W.sum(axis=1)  # total (smoothed) wins per model
+            # denom_i = sum_j N_ij / (s_i + s_j)
+            denom = (N / (s.reshape(-1, 1) + s.reshape(1, -1) + 1e-12)).sum(axis=1)
+            upd = denom > 0
+            s[upd] = w_i[upd] / denom[upd]
+            # normalize to keep scale stable (geometric mean = 1)
+            s /= np.prod(s) ** (1.0 / m)
+            if np.max(np.abs(np.log(s + 1e-12) - np.log(s_old + 1e-12))) < tol:
+                break
+
+        # ---- Convert to beta and Elo-like ratings ----
+        beta = np.log(s + 1e-12)
+        elo = (400.0 / math.log(10.0)) * beta
+        elo = elo - np.mean(elo) + elo_mean  # center
+
+        # ---- Summaries and expected probabilities ----
+        wins = W.sum(axis=1)
+        losses = W.sum(axis=0)
+        matches = N.sum(axis=1)  # unordered total vs all opponents
+
+        ratings = pd.DataFrame(
+            {
+                "ability": s,
+                "beta": beta,
+                "elo": elo,
+                "wins": wins,
+                "losses": losses,
+                "matches": matches,
+            },
+            index=models,
+        ).sort_values("elo", ascending=False)
+
+        P = s.reshape(-1, 1) / (s.reshape(-1, 1) + s.reshape(1, -1))
+        np.fill_diagonal(P, np.nan)
+        p_matrix = pd.DataFrame(P, index=models, columns=models)
+
+        return ratings
+
+
+class EvalTemplates(Score, Rank):
+    pass

sutro/validation.py

@@ -0,0 +1,60 @@
+import importlib.metadata
+import json
+import os
+
+import requests
+
+from sutro.common import to_colored_text
+
+
+def check_version(package_name: str):
+    try:
+        # Local version
+        local_version = importlib.metadata.version(package_name)
+    except importlib.metadata.PackageNotFoundError:
+        print(f"{package_name} is not installed.")
+        return
+
+    try:
+        # Latest release from PyPI
+        resp = requests.get(f"https://pypi.org/pypi/{package_name}/json", timeout=2)
+        resp.raise_for_status()
+        latest_version = resp.json()["info"]["version"]
+
+        if local_version != latest_version:
+            msg = (
+                f"⚠️  You are using {package_name} {local_version}, "
+                f"but the latest release is {latest_version}. "
+                f"Run `[uv] pip install -U {package_name}` to upgrade."
+            )
+            print(to_colored_text(msg, state="callout"))
+    except Exception:
+        # Fail silently or log, you don’t want this blocking usage
+        pass
+
+
+def check_for_api_key():
+    """
+    Check for an API key in the user's home directory.
+
+    This method looks for a configuration file named 'config.json' in the
+    '.sutro' directory within the user's home directory.
+    If the file exists, it attempts to read the API key from it.
+
+    Returns:
+        str or None: The API key if found in the configuration file, or None if not found.
+
+    Note:
+        The expected structure of the config.json file is:
+        {
+            "api_key": "your_api_key_here"
+        }
+    """
+    CONFIG_DIR = os.path.expanduser("~/.sutro")
+    CONFIG_FILE = os.path.join(CONFIG_DIR, "config.json")
+    if os.path.exists(CONFIG_FILE):
+        with open(CONFIG_FILE, "r") as f:
+            config = json.load(f)
+        return config.get("api_key")
+    else:
+        return None

{sutro-0.1.33.dist-info → sutro-0.1.40.dist-info}/METADATA

@@ -1,24 +1,22 @@
 Metadata-Version: 2.4
 Name: sutro
-Version: 0.1.33
+Version: 0.1.40
 Summary: Sutro Python SDK
-Project-URL: Homepage, https://sutro.sh
-Project-URL: Documentation, https://docs.sutro.sh
 License-Expression: Apache-2.0
-License-File: LICENSE
+Requires-Dist: numpy>=2.1.1,<3.0.0
+Requires-Dist: requests>=2.32.3,<3.0.0
+Requires-Dist: pandas>=2.2.3,<3.0.0
+Requires-Dist: polars>=1.33.0,<=1.34.0
+Requires-Dist: click>=8.1.7,<9.0.0
+Requires-Dist: colorama>=0.4.4,<1.0.0
+Requires-Dist: yaspin>=3.2.0,<4.0.0
+Requires-Dist: tqdm>=4.67.1,<5.0.0
+Requires-Dist: pydantic>=2.11.4,<3.0.0
+Requires-Dist: pyarrow>=21.0.0,<22.0.0
+Requires-Dist: tabulate>=0.9.0,<1.0.0
 Requires-Python: >=3.10
-Requires-Dist: click==8.1.7
-Requires-Dist: colorama==0.4.4
-Requires-Dist: numpy==2.1.1
-Requires-Dist: pandas==2.2.3
-Requires-Dist: polars==1.8.2
-Requires-Dist: pyarrow==21.0.0
-Requires-Dist: pydantic==2.11.4
-Requires-Dist: requests==2.32.3
-Requires-Dist: tqdm==4.67.1
-Requires-Dist: yaspin==3.1.0
-Provides-Extra: dev
-Requires-Dist: ruff==0.13.1; extra == 'dev'
+Project-URL: Documentation, https://docs.sutro.sh
+Project-URL: Homepage, https://sutro.sh
 Description-Content-Type: text/markdown
 
 ![Sutro Logo](./assets/sutro-logo-dark.png)

sutro-0.1.40.dist-info/RECORD

@@ -0,0 +1,13 @@
+sutro/__init__.py,sha256=jf7vtLNyWoY6IISSpfrDRR_anBt3UyeRh1XTgitcd6U,584
+sutro/cli.py,sha256=0NuqRInXA-_7TRw-T0OxP8otmUHUarMtY7kuLbWDous,13751
+sutro/common.py,sha256=FuTYTzy82Ul56r9SVH0XMOqcBBspDAFvrtHM93ZbT_8,6945
+sutro/interfaces.py,sha256=nYdb2jj1-0MGCPqq_33E-dBChJs8XuzQ51AV75F58J0,3021
+sutro/sdk.py,sha256=KKmk10AiXG7CgH_LaF22QNVmk_Noqs9ilLpLeopihS8,58446
+sutro/templates/classification.py,sha256=iNFiyuR8bZc9Xe-NdimklpQUveqg3p_eJOlEAHaj7Is,6080
+sutro/templates/embed.py,sha256=csvLA0hw5Qaro_yZvALRRp9_SbfWABFN0iQXrf8E8_I,2941
+sutro/templates/evals.py,sha256=YRmA2yrvfZ0cBvhCdXgp5SXnEvGzxJ7t85hrHlz7vhE,12910
+sutro/validation.py,sha256=FlFH5e5PAPIPpCrzU7mwfZKDDvrmkHt2yYsFm0Ahfmg,1849
+sutro-0.1.40.dist-info/WHEEL,sha256=X16MKk8bp2DRsAuyteHJ-9qOjzmnY0x1aj0P1ftqqWA,78
+sutro-0.1.40.dist-info/entry_points.txt,sha256=s-dtPZ0AScjvR8S_ykhzXxtVcUjrRlxVxyJymI81A3E,41
+sutro-0.1.40.dist-info/METADATA,sha256=d36n5krdsupu_rQC2-Maq6NMO2Ymk5VHtCFG93tZhAI,6232
+sutro-0.1.40.dist-info/RECORD,,

sutro-0.1.40.dist-info/WHEEL

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

{sutro-0.1.33.dist-info → sutro-0.1.40.dist-info}/entry_points.txt

@@ -1,2 +1,3 @@
 [console_scripts]
 sutro = sutro.cli:cli
+

sutro-0.1.33.dist-info/RECORD

@@ -1,8 +0,0 @@
-sutro/__init__.py,sha256=yUiVwcZ8QamSqDdRHgzoANyTZ-x3cPzlt2Fs5OllR_w,402
-sutro/cli.py,sha256=_FU8PwP4dMzXXg5ldxCXP3kaZvQtOKdA8Kzjc34xmQ0,13727
-sutro/sdk.py,sha256=DOvAQuL_5RiXwTfQC3FnNiE3x9DZBugEhDJ8r494NKo,56980
-sutro-0.1.33.dist-info/METADATA,sha256=rvf-ZGByzYtE8ArzXDvx49TCUCtJxXAEVpJpBjtJfYk,6206
-sutro-0.1.33.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-sutro-0.1.33.dist-info/entry_points.txt,sha256=eXvr4dvMV4UmZgR0zmrY8KOmNpo64cJkhNDywiadRFM,40
-sutro-0.1.33.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
-sutro-0.1.33.dist-info/RECORD,,

sutro-0.1.33.dist-info/WHEEL

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