@elaraai/east-codex-plugin 1.0.103 → 1.0.105
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.build/daemon/lsp.js +1 -1
- package/.build/daemon/server.js +1 -1
- package/.codex-plugin/plugin.json +1 -1
- package/index.json +1042 -669
- package/package.json +1 -1
- package/skills/e3/SKILL.md +15 -8
- package/skills/e3/reference/cli.md +1 -1
- package/skills/e3/reference/from-code.md +8 -4
- package/skills/e3/reference/record-indexes.md +51 -1
- package/skills/e3-ui/SKILL.md +81 -48
- package/skills/east/SKILL.md +3 -0
- package/skills/east/reference/beast2.md +10 -1
- package/skills/east/reference/queries.md +13 -1
- package/skills/east-ontology/SKILL.md +6 -7
- package/skills/east-py/reference/beast2.md +1 -1
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
---
|
|
2
2
|
name: east-ontology
|
|
3
|
-
description: "Build an Economic Ontology of a business and render it with the e3-ui Ontology editor. Use when: (1) Modelling how a business creates value as a graph of resources, activities, KPIs, decisions, objectives, policies, data/systems ('map our supply chain', 'build an ontology', 'model the business', 'create a digital twin', 'what should we optimize or automate', 'where is the value created'), (2) Running an ontology-elicitation workshop and turning the captured activity table into nodes + links, (3) Encoding that graph as an `OntologyType` e3.input and surfacing it via `Ontology.Root` with staged commit/discard
|
|
3
|
+
description: "Build an Economic Ontology of a business and render it with the e3-ui Ontology editor. Use when: (1) Modelling how a business creates value as a graph of resources, activities, KPIs, decisions, objectives, policies, data/systems ('map our supply chain', 'build an ontology', 'model the business', 'create a digital twin', 'what should we optimize or automate', 'where is the value created'), (2) Running an ontology-elicitation workshop and turning the captured activity table into nodes + links, (3) Encoding that graph as an `OntologyType` e3.input and surfacing it via `Ontology.Root` with staged commit/discard, (4) Using the ontology to identify high-value, decision-improving AI / optimization initiatives."
|
|
4
4
|
---
|
|
5
5
|
|
|
6
6
|
# Economic Ontology
|
|
@@ -135,22 +135,22 @@ const ontology = e3.input('supply_chain', OntologyType, variant('value', {
|
|
|
135
135
|
const editor = East.function([], UIComponentType, (_$) =>
|
|
136
136
|
Reactive.Root(East.function([], UIComponentType, $ => {
|
|
137
137
|
const view = $.let(Data.bind(ontology));
|
|
138
|
-
return Ontology.Root({
|
|
138
|
+
return Ontology.Root({ value: view });
|
|
139
139
|
})),
|
|
140
140
|
);
|
|
141
141
|
```
|
|
142
142
|
|
|
143
143
|
### `Ontology.Root` options
|
|
144
144
|
|
|
145
|
-
`Ontology.Root({ value, ... })` — only `value` is required (pass the `Data.bind` handle over an `OntologyType` dataset). Options: `readonly` (hide mutation surfaces;
|
|
145
|
+
`Ontology.Root({ value, ... })` — only `value` is required (pass the `Data.bind` handle over an `OntologyType` dataset). Options: `readonly` (hide mutation surfaces; the property drawer still renders), `hideMiniMap`, `hideSearch`, `density` (`'comfortable'` | `'compact'` | `'condensed'`), `defaultView` (`'graph'` | `'table'` — the header's segmented control switches at runtime either way), `onCommitted` / `onDiscarded`, `style` (per-surface colour escape hatches — see `OntologyStyleType`).
|
|
146
146
|
|
|
147
147
|
### The table view
|
|
148
148
|
|
|
149
149
|
The editor's header has a segmented `Graph | Table` control. The table is a value-driver-tree projection of the same bound value: rows are `process` nodes **grouped by the objective they serve** (via KPI `drives` paths), ordered by **value-chain stage** (topological order of `uses`/`produces` resource flow, with cycles — e.g. cash → materials → goods → cash — condensed, sharing a stage, and flagged ↺). Each row shows uses/produces/KPIs/data/**decisions**/policies plus owning agents; expanding a row reveals what feeds it and what it feeds (with the carrying resources) and completeness warnings (no inputs, no outputs, no KPI, no decision). Hovering any chip highlights every occurrence of that node across the table.
|
|
150
150
|
|
|
151
|
-
### Edit modes
|
|
151
|
+
### Edit modes and commit
|
|
152
152
|
|
|
153
|
-
|
|
153
|
+
Every edit goes through the binding. `Data.bind(dataset)` **without `mode`** is direct: each edit is written straight to the dataset. Bind `{ mode: 'staged' }` to hold edits until they are applied: while a change waits the editor's header shows *Unsaved changes* with **Discard** and **Apply**, which drop or commit it (`onDiscarded` / `onCommitted` fire after). A page can do the same through the handle's `commit()` / `discard()`. For a locked view, `readonly: some(true)`.
|
|
154
154
|
|
|
155
155
|
## Validation
|
|
156
156
|
|
|
@@ -165,7 +165,7 @@ The graph exists to find the decisions worth improving. For each `decision` node
|
|
|
165
165
|
|
|
166
166
|
## Related skills
|
|
167
167
|
|
|
168
|
-
- **e3-ui** — the `Ontology
|
|
168
|
+
- **e3-ui** — the `Ontology` and `Data.bind` API this builds on (and `ui()` to ship the editor as an e3 task).
|
|
169
169
|
- **east-ui** — layout (`Card`, `Stack`) for composing the editor into a dashboard.
|
|
170
170
|
- **east-design** — turn the prioritised decisions into an implementation plan.
|
|
171
171
|
- **east-py-datascience** — the optimization / ML that improves a targeted decision.
|
|
@@ -176,6 +176,5 @@ The graph exists to find the decisions worth improving. For each `decision` node
|
|
|
176
176
|
Ground the encoding in real graphs via `search_east_examples`:
|
|
177
177
|
- `Ontology supply-chain process kpi objective` — a full activity/resource/KPI graph
|
|
178
178
|
- `Ontology governance policy decision document` — policy/decision/document-heavy graph
|
|
179
|
-
- `Ontology Diff review pending patch` — editor + Diff panel for staged commits
|
|
180
179
|
- `Ontology readonly viewer` — locked, mutation-free view
|
|
181
180
|
- `Ontology density compact` — density presets
|
|
@@ -70,7 +70,7 @@ with open_beast2_file("table.beast2") as t: # Dict<String, Float>
|
|
|
70
70
|
| `encode_beast2_for(T)` / `decode_beast2_for(T)` | **Headerless** type-directed bytes: the reader must know `T` exactly, and mutable containers (Array/Set/Dict/Ref) are refused. In TypeScript `encodeBeast2For` is the FULL container — do not port a call site by name |
|
|
71
71
|
| `Beast2ElementWriter(T, stream, *, codec="deflate", parallel=False)` | The canonical writer (a context manager): `.add(el)` — an Array/Set element or a Dict `(key, value)` pair — and `.add_all(batch)` (the loop in east-c); Set elements and Dict keys strictly ascending in East order. Segments fall where the cut rule places them — the bytes the managed writer, TypeScript and east-c write; memory is one open segment; `.close()` writes the last segment, the terminator and the index; `.segments` counts the closed ones. An element that does not ascend, or fails to encode, raises and leaves the writer as it was |
|
|
72
72
|
| `encode_beast2_paged_for(T, *, codec="deflate") -> (value) -> bytes` | A whole collection through the canonical writer — the write side of `open_beast2_pages_for` |
|
|
73
|
-
| `Beast2RunSorter(T, open_run, *, merge=None, union=False, codec="deflate", parallel=False)` | A Set's or Dict's elements in ANY order in, sorted canonical runs out: `.add(el)` encodes at once; at `RUN_MAX_COUNT` elements or `RUN_MAX_BYTES` it sorts the run — stably, so a key's values keep the order they came in — folds a repeated key (`merge`, a compiled `(K, V, V) -> V` East function, for a Dict; `union=True` for a Set; neither: it raises) and writes the run to `open_run(run)` (anything with `write(bytes)` and `close()`) as its value's canonical blob. `.finish()` writes the last run; `.runs` counts them. The runs are the ones east-c and TypeScript write; a sink's exception comes back out of the call that wrote the run; a key repeated across runs is the merge's to fold |
|
|
73
|
+
| `Beast2RunSorter(T, open_run, *, merge=None, union=False, codec="deflate", parallel=False)` | A Set's or Dict's elements in ANY order in, sorted canonical runs out: `.add(el)` encodes at once; at `RUN_MAX_COUNT` elements or `RUN_MAX_BYTES` it sorts the run — stably, so a key's values keep the order they came in — folds a repeated key (`merge`, a compiled `(K, V, V) -> V` East function, for a Dict; `union=True` for a Set; neither: it raises) and writes the run to `open_run(run)` (anything with `write(bytes)` and `close()`) as its value's canonical blob. `.finish()` writes the last run; `.runs` counts them. A fold whose values do not grow — `merge` over a bounded value type (Null, Boolean, Integer, Float, DateTime, Structs and Variants of those), or `union` — folds each key's values as they are added, in a table of at most `FOLD_TABLE_MAX_KEYS` keys and `FOLD_TABLE_MAX_KEY_BYTES` that spills into the open run, so few keys make one small run. The runs are the ones east-c and TypeScript write; a sink's exception comes back out of the call that wrote the run; a key repeated across runs is the merge's to fold |
|
|
74
74
|
| `Beast2Writer(T, stream, *, codec="deflate", self_contained=True, index=True, parallel=False)` | Segments of your choosing (a context manager): `.write(batch)` appends one segment per non-empty batch; `.close()` writes the terminator and the index; `.segments` counts. Set/Dict batches must ascend strictly across the stream. **Keep both defaults** — `index` and `self_contained` are what `open_beast2_pages_for` needs, and turning either off silently forfeits random access. `codec="none"` for already-compressed payloads or raw write throughput |
|
|
75
75
|
| `encode_beast2_segments_for(T, **opts) -> (batches) -> bytes` | In-memory `Beast2Writer`: one segment per non-empty batch |
|
|
76
76
|
| `encode_beast2_v5_for(T, *, codec="deflate", index=False) -> (value) -> bytes` | A whole value of any root type as v5; decode with `decode_beast2_with_header_for` |
|