headson 0.5.1__cp310-abi3-win_amd64.whl → 0.5.3__cp310-abi3-win_amd64.whl

{headson-0.5.1.dist-info → headson-0.5.3.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: headson
-Version: 0.5.1
+Version: 0.5.3
 Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Rust
@@ -58,8 +58,9 @@ If you’re comfortable with tools like `head` and `tail`, use `headson` when yo
 
 Common flags:
 
-- `-n, --budget <BYTES>`: per‑file output budget. When multiple input files are provided, the total budget equals `<BYTES> * number_of_inputs`.
-- `-N, --global-budget <BYTES>`: total output budget across all inputs. Useful when you want a fixed-size preview across many files (may omit entire files). Mutually exclusive with `--budget`.
+- `-n, --budget <BYTES>`: per‑file output budget. When multiple input files are provided, the default total budget equals `<BYTES> * number_of_inputs`.
+- `-N, --global-budget <BYTES>`: total output budget across all inputs. Useful when you want a fixed-size preview across many files (may omit entire files).
+  - When used together with `--budget`, the final total budget is `min(global, per_file * number_of_inputs)`. Files are only truncated if they don't fit into this final global limit, and no single file expands beyond the per‑file budget.
 - `-f, --template <json|pseudo|js>`: output style (default: `pseudo`)
 - `-m, --compact`: no indentation, no spaces, no newlines
 - `--no-newline`: single line output
@@ -167,48 +168,14 @@ print(
 
 # Algorithm
 
-```mermaid
-%%{init: {"themeCSS": ".cluster > rect { fill: transparent; stroke: transparent; } .clusterLabel > text { font-size: 16px; font-weight: 600; } .clusterLabel span { padding: 6px 10px; font-size: 16px; font-weight: 600; }"}}%%
-flowchart TD
-    subgraph Deserialization
-        direction TB
-        A["Input file(s)"]
-        A -- Single --> C["Parse into optimized tree (with array pre‑sampling) ¹"]
-        A -- Multiple --> D["Parse each file and wrap into a fileset object"]
-        D --> C
-    end
-    subgraph Prioritization
-        direction TB
-        E["Build priority order ²"]
-        F["Choose top N nodes ³"]
-    end
-    subgraph Serialization
-        direction TB
-        G["Render attempt ⁴"]
-        H["Output preview string"]
-    end
-    C --> E
-    E --> F
-    F --> G
-    G --> F
-    F --> H
-    %% Color classes for categories
-    classDef des fill:#eaf2ff,stroke:#3b82f6,stroke-width:1px,color:#0f172a;
-    classDef prio fill:#ecfdf5,stroke:#10b981,stroke-width:1px,color:#064e3b;
-    classDef ser fill:#fff1f2,stroke:#f43f5e,stroke-width:1px,color:#7f1d1d;
-    class A,C,D des;
-    class E,F prio;
-    class G,H ser;
-    style Deserialization fill:transparent,stroke:transparent
-    style Prioritization fill:transparent,stroke:transparent
-    style Serialization fill:transparent,stroke:transparent
-```
+![Algorithm overview](https://raw.githubusercontent.com/kantord/headson/main/docs/assets/algorithm.svg)
 
 ## Footnotes
  - <sup><b>[1]</b></sup> <b>Optimized tree representation</b>: An arena‑style tree stored in flat, contiguous buffers. Each node records its kind and value plus index ranges into shared child and key arrays. Arrays are ingested in a single pass and may be deterministically pre‑sampled: the first element is always kept; additional elements are selected via a fixed per‑index inclusion test; for kept elements, original indices are stored and full lengths are counted. This enables accurate omission info and internal gap markers later, while minimizing pointer chasing.
  - <sup><b>[2]</b></sup> <b>Priority order</b>: Nodes are scored so previews surface representative structure and values first. Arrays can favor head/mid/tail coverage (default) or strictly the head; tail preference flips head/tail when configured. Object properties are ordered by key, and strings expand by grapheme with early characters prioritized over very deep expansions.
  - <sup><b>[3]</b></sup> <b>Choose top N nodes (binary search)</b>: Iteratively picks N so that the rendered preview fits within the character budget, looping between “choose N” and a render attempt to converge quickly.
  - <sup><b>[4]</b></sup> <b>Render attempt</b>: Serializes the currently included nodes using the selected template. Omission summaries and per-file section headers appear in display templates (pseudo/js); json remains strict. For arrays, display templates may insert internal gap markers between non‑contiguous kept items using original indices.
+ - <sup><b>[5]</b></sup> <b>Diagram source</b>: The Algorithm diagram is generated from `docs/diagrams/algorithm.mmd`. Regenerate the SVG with `cargo make diagrams` before releasing.
 
 ## License
 

headson-0.5.3.dist-info/RECORD

@@ -0,0 +1,6 @@
+headson-0.5.3.dist-info/METADATA,sha256=w9hkkRLvHrtuywIx6KEG4ZALXLlEAQ9SPbu5JStBfFU,8696
+headson-0.5.3.dist-info/WHEEL,sha256=4EDp_7DiFfWl1yYv5M4wSosAn5L_xgD1dyrQxQxfCx8,95
+headson-0.5.3.dist-info/licenses/LICENSE,sha256=85XxIce4vPe2JysuORWOYpzGI-ypir_79W6aOF8y534,1093
+headson/__init__.py,sha256=8DXFB8ahlywyQXJsscl3w_wgbcQi7sj7zEuV28wR60E,187
+headson/headson.pyd,sha256=oZoPB15PqkQ0TJYFyKgn9e8wfbhMx0QgqQEJQzGV_bo,460288
+headson-0.5.3.dist-info/RECORD,,

headson-0.5.1.dist-info/RECORD

@@ -1,6 +0,0 @@
-headson-0.5.1.dist-info/METADATA,sha256=2Rt8fw8CFuMS5yMrJfxEZ9lXRzc86nwPZtbZ7zlvTx0,9571
-headson-0.5.1.dist-info/WHEEL,sha256=4EDp_7DiFfWl1yYv5M4wSosAn5L_xgD1dyrQxQxfCx8,95
-headson-0.5.1.dist-info/licenses/LICENSE,sha256=85XxIce4vPe2JysuORWOYpzGI-ypir_79W6aOF8y534,1093
-headson/__init__.py,sha256=8DXFB8ahlywyQXJsscl3w_wgbcQi7sj7zEuV28wR60E,187
-headson/headson.pyd,sha256=WUz1T49mORx-d8IkpI_yIxCWA4PasGQ3-SV-Ip2UbI0,460288
-headson-0.5.1.dist-info/RECORD,,