[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10,"_11":12},"actionData","errors","root",{"_228":-5,"_231":232,"_233":234},"routes/shell",{"_40":41,"_227":-5,"_228":-5,"_229":230},"routes/repo",{"_33":-7,"_34":35,"_36":37,"_38":39,"_40":41,"_42":31,"_43":31,"_44":31,"_45":31,"_46":31,"_47":31,"_48":49,"_50":49,"_51":31,"_52":-7,"_53":-7,"_54":55,"_56":57,"_58":59,"_60":-5,"_61":62,"_63":64,"_65":66,"_67":68},"routes/repo.blob",{"_13":14,"_15":16,"_17":18,"_19":20,"_21":14,"_22":23,"_24":-5,"_25":26,"_27":28,"_28":29,"_30":31,"_32":14},"ref","935ece24afa0ca79c8a18f5bdfb78e67b8632e4e","path","apps/server/src/tasks/graphs.ts","oid","14c79865bbc70b2d871419c83031c524c5fa7365","size",16779,"commit","mounts",[],"source","plain",{"_13":14,"_15":16},"kind","text","/**\n * Durable implementation work belongs beside a plan, not inside its prose.\n *\n * The adapter owns document lookup and persistence. This model only decides\n * whether a graph is valid and which version may change at a given plan\n * revision, so a hosted backend can use the same rules as the local one.\n */\n\nexport type Task = {\n\tid: string;\n\ttitle: string;\n\tcontext: string;\n\tgoal: string;\n\tacceptance: string[];\n\tdependsOn: string[];\n};\n\nexport type Definition = {\n\ttasks: Task[];\n};\n\nexport type State = \"draft\" | \"approved\" | \"locked\" | \"superseded\";\n\nexport type Version = {\n\tnumber: number;\n\t/** Changes whenever a draft definition changes. */\n\trevision: number;\n\tplanRevision: number;\n\tstate: State;\n\tdefinition: Definition;\n};\n\nexport type Graph = {\n\tversions: Version[];\n};\n\n/** Durable ownership of the external session implementing one locked graph. */\nexport type Run = {\n\tid: string;\n\tuser: string;\n\tclient: { name: string; version: string };\n\tsession: string;\n\tplanRevision: number;\n\tgraphVersion: number;\n\tgraphRevision: number;\n\trepository: string;\n\tbranch: string;\n\tcommit: string;\n\tstartedAt: string;\n};\n\nexport type ClaimInput = {\n\tplanRevision: number;\n\tgraphRevision: number;\n\trun: Run;\n};\n\nexport type ClaimResult =\n\t| { kind: \"started\"; graph: Graph; run: Run }\n\t| { kind: \"active\"; run: Run }\n\t| { kind: \"refused\"; reason: string };\n\nexport type GraphAdapter = {\n\t/** Runs the change against one current graph and plan revision. */\n\ttransact(\n\t\tdocument: Document,\n\t\tchange: (current: { graph: Graph | undefined; revision: number | undefined }) => Result,\n\t): Promise>;\n};\n\nexport type Result = { ok: true; value: T } | { ok: false; reason: string };\n\nexport type Operation =\n\t| { op: \"add\"; task: Task }\n\t| { op: \"replace\"; id: string; task: Task }\n\t| { op: \"reorder\"; ids: string[] }\n\t| { op: \"remove\"; id: string };\n\nexport type Revision = {\n\t/** The plan revision returned by the planner's graph read. */\n\tplanRevision: number;\n\t/** The current draft revision, or zero before a graph exists. */\n\tgraphRevision: number;\n\toperations: Operation[];\n};\n\ntype Validation = Exclude, { ok: true }>;\n\nfunction copy(value: T): T {\n\treturn structuredClone(value);\n}\n\nfunction invalid(reason: string): Validation {\n\treturn { ok: false, reason };\n}\n\nfunction text(value: string): boolean {\n\treturn value.trim().length > 0;\n}\n\n/** Validate references before looking for cycles, for useful refusal reasons. */\nexport function validate(definition: unknown): Result {\n\tif (\n\t\t!definition || typeof definition !== \"object\"\n\t\t|| !Array.isArray((definition as Definition).tasks)\n\t) {\n\t\treturn invalid(\"task\");\n\t}\n\tlet valid = definition as Definition;\n\tlet ids = new Set();\n\tfor (let task of valid.tasks) {\n\t\tif (\n\t\t\t!task || typeof task !== \"object\" || !Array.isArray(task.acceptance)\n\t\t\t|| !Array.isArray(task.dependsOn)\n\t\t) {\n\t\t\treturn invalid(\"task\");\n\t\t}\n\t\tif (\n\t\t\ttypeof task.id !== \"string\" || typeof task.title !== \"string\"\n\t\t\t|| typeof task.context !== \"string\"\n\t\t\t|| typeof task.goal !== \"string\" || task.dependsOn.some(item => typeof item !== \"string\")\n\t\t) {\n\t\t\treturn invalid(\"task\");\n\t\t}\n\t\tif (!text(task.id) || !text(task.title) || !text(task.context) || !text(task.goal)) {\n\t\t\treturn invalid(\"task\");\n\t\t}\n\t\tif (ids.has(task.id)) return invalid(\"duplicate\");\n\t\tids.add(task.id);\n\t\tif (\n\t\t\ttask.acceptance.length < 2 || task.acceptance.length > 8\n\t\t\t|| task.acceptance.some(criterion => typeof criterion !== \"string\" || !text(criterion))\n\t\t) return invalid(\"acceptance\");\n\t}\n\n\tfor (let task of valid.tasks) {\n\t\tfor (let dependency of task.dependsOn) {\n\t\t\tif (!ids.has(dependency)) return invalid(\"missing\");\n\t\t\tif (dependency === task.id) return invalid(\"self\");\n\t\t}\n\t}\n\tlet visiting = new Set();\n\tlet visited = new Set();\n\tlet tasks = new Map(valid.tasks.map(task => [task.id, task]));\n\tfunction visit(id: string): boolean {\n\t\tif (visiting.has(id)) return true;\n\t\tif (visited.has(id)) return false;\n\t\tvisiting.add(id);\n\t\tlet cycle = tasks.get(id)?.dependsOn.some(visit) ?? false;\n\t\tvisiting.delete(id);\n\t\tvisited.add(id);\n\t\treturn cycle;\n\t}\n\n\tif (valid.tasks.some(task => visit(task.id))) return invalid(\"cycle\");\n\tif (\n\t\tvalid.tasks.length === 0 || !valid.tasks.some(task => task.dependsOn.length === 0)\n\t) {\n\t\treturn invalid(\"root\");\n\t}\n\treturn { ok: true, value: copy(valid) };\n}\n\nfunction current(graph: Graph): Version | undefined {\n\treturn graph.versions.at(-1);\n}\n\nexport function matches(run: Run, version: Version): boolean {\n\treturn run.graphVersion === version.number\n\t\t&& run.graphRevision === version.revision\n\t\t&& run.planRevision === version.planRevision;\n}\n\nfunction state(value: unknown): State | undefined {\n\treturn value === \"draft\" || value === \"approved\" || value === \"locked\" || value === \"superseded\"\n\t\t? value\n\t\t: undefined;\n}\n\nfunction item(value: unknown, keys: string[]): Record | undefined {\n\tif (!value || typeof value !== \"object\" || Array.isArray(value)) return undefined;\n\tlet record = value as Record;\n\tlet found = Object.keys(record).sort();\n\tlet expected = [...keys].sort();\n\treturn found.length === expected.length && found.every((key, index) => key === expected[index])\n\t\t? record\n\t\t: undefined;\n}\n\nfunction definition(value: unknown): Definition | undefined {\n\tlet stored = item(value, [\"tasks\"]);\n\tif (!stored || !Array.isArray(stored.tasks)) return undefined;\n\tlet tasks: Task[] = [];\n\tfor (let value of stored.tasks) {\n\t\tlet task = item(value, [\"acceptance\", \"context\", \"dependsOn\", \"goal\", \"id\", \"title\"]);\n\t\tif (\n\t\t\t!task\n\t\t\t|| typeof task.id !== \"string\"\n\t\t\t|| typeof task.title !== \"string\"\n\t\t\t|| typeof task.context !== \"string\"\n\t\t\t|| typeof task.goal !== \"string\"\n\t\t\t|| !Array.isArray(task.acceptance)\n\t\t\t|| !Array.isArray(task.dependsOn)\n\t\t\t|| task.acceptance.some(value => typeof value !== \"string\")\n\t\t\t|| task.dependsOn.some(value => typeof value !== \"string\")\n\t\t) return undefined;\n\t\ttasks.push({\n\t\t\tid: task.id,\n\t\t\ttitle: task.title,\n\t\t\tcontext: task.context,\n\t\t\tgoal: task.goal,\n\t\t\tacceptance: task.acceptance,\n\t\t\tdependsOn: task.dependsOn,\n\t\t});\n\t}\n\tlet checked = validate({ tasks });\n\treturn checked.ok ? checked.value : undefined;\n}\n\nfunction history(versions: Version[]): boolean {\n\tlet latest = versions.at(-1);\n\tif (!latest || latest.state === \"superseded\") return false;\n\tif (\n\t\tversions.some((version, index) =>\n\t\t\tindex > 0 && version.planRevision < versions[index - 1].planRevision\n\t\t)\n\t) {\n\t\treturn false;\n\t}\n\tlet prior = versions.slice(0, -1);\n\tif (latest.state === \"draft\") {\n\t\treturn prior.every((version, index) =>\n\t\t\tversion.state === \"superseded\"\n\t\t\t|| index === prior.length - 1 && version.state === \"approved\"\n\t\t);\n\t}\n\treturn prior.every(version => version.state === \"superseded\");\n}\n\nfunction run(value: unknown): Run | undefined {\n\tlet stored = item(value, [\n\t\t\"branch\",\n\t\t\"client\",\n\t\t\"commit\",\n\t\t\"graphRevision\",\n\t\t\"graphVersion\",\n\t\t\"id\",\n\t\t\"planRevision\",\n\t\t\"repository\",\n\t\t\"session\",\n\t\t\"startedAt\",\n\t\t\"user\",\n\t]);\n\tlet client = stored && item(stored.client, [\"name\", \"version\"]);\n\tlet strings = stored && client && [\n\t\tstored.id,\n\t\tstored.user,\n\t\tstored.session,\n\t\tstored.repository,\n\t\tstored.branch,\n\t\tstored.commit,\n\t\tstored.startedAt,\n\t\tclient.name,\n\t\tclient.version,\n\t];\n\tif (\n\t\t!stored\n\t\t|| !client\n\t\t|| !strings\n\t\t|| strings.some(value => typeof value !== \"string\" || !value.trim())\n\t\t|| !Number.isSafeInteger(stored.planRevision)\n\t\t|| (stored.planRevision as number) < 0\n\t\t|| !Number.isSafeInteger(stored.graphVersion)\n\t\t|| (stored.graphVersion as number) < 1\n\t\t|| !Number.isSafeInteger(stored.graphRevision)\n\t\t|| (stored.graphRevision as number) < 1\n\t) return undefined;\n\treturn {\n\t\tid: stored.id as string,\n\t\tuser: stored.user as string,\n\t\tclient: { name: client.name as string, version: client.version as string },\n\t\tsession: stored.session as string,\n\t\tplanRevision: stored.planRevision as number,\n\t\tgraphVersion: stored.graphVersion as number,\n\t\tgraphRevision: stored.graphRevision as number,\n\t\trepository: stored.repository as string,\n\t\tbranch: stored.branch as string,\n\t\tcommit: stored.commit as string,\n\t\tstartedAt: stored.startedAt as string,\n\t};\n}\n\n/** Restore a run only when it names this sidecar's locked graph and revision. */\nexport function restoreRun(\n\tvalue: unknown,\n\tgraph: Graph | undefined,\n\trevision: number,\n): Run | undefined {\n\tlet restored = run(value);\n\tlet version = graph?.versions.at(-1);\n\tif (\n\t\t!restored\n\t\t|| !version\n\t\t|| version.state !== \"locked\"\n\t\t|| version.planRevision !== revision\n\t\t|| !matches(restored, version)\n\t) return undefined;\n\treturn copy(restored);\n}\n\n/** Restore a historical run against the graph version it originally claimed. */\nexport function restoreRunVersion(value: unknown, graph: Graph): Run | undefined {\n\tlet restored = run(value);\n\tif (\n\t\t!restored\n\t\t|| !graph.versions.some(version => matches(restored, version))\n\t) return undefined;\n\treturn copy(restored);\n}\n\n/** Lock exactly one approved graph revision and record its owner atomically. */\nexport function claim(\n\tstate: { graph: Graph | undefined; revision: number | undefined; execution: Run | undefined },\n\tinput: ClaimInput,\n): ClaimResult {\n\tif (state.execution) return { kind: \"active\", run: copy(state.execution) };\n\tif (state.revision !== input.planRevision) return { kind: \"refused\", reason: \"stale-plan\" };\n\tlet graph = state.graph && copy(state.graph);\n\tlet version = graph?.versions.at(-1);\n\tlet owner = run(input.run);\n\tif (!graph || !version) return { kind: \"refused\", reason: \"missing\" };\n\tif (!owner) return { kind: \"refused\", reason: \"run\" };\n\tif (version.revision !== input.graphRevision) return { kind: \"refused\", reason: \"stale-graph\" };\n\tif (version.state !== \"approved\") return { kind: \"refused\", reason: \"not-approved\" };\n\tif (version.planRevision !== state.revision) return { kind: \"refused\", reason: \"stale-plan\" };\n\tif (!matches(owner, version)) {\n\t\treturn { kind: \"refused\", reason: \"run\" };\n\t}\n\n\tgraph.versions[graph.versions.length - 1] = { ...version, state: \"locked\" };\n\treturn { kind: \"started\", graph, run: copy(owner) };\n}\n\n/** Apply a planner's whole graph batch before deciding whether it is valid. */\nfunction revise(definition: Definition, operations: unknown[]): Result {\n\tlet next = copy(definition);\n\tfor (let operation of operations) {\n\t\tif (!operation || typeof operation !== \"object\") return invalid(\"operation\");\n\t\tlet value = operation as Partial;\n\t\tswitch (value.op) {\n\t\t\tcase \"add\":\n\t\t\t\tif (!value.task) return invalid(\"operation\");\n\t\t\t\tnext.tasks.push(value.task);\n\t\t\t\tbreak;\n\t\t\tcase \"replace\": {\n\t\t\t\tif (typeof value.id !== \"string\" || !value.task) return invalid(\"operation\");\n\t\t\t\tlet index = next.tasks.findIndex(task => task.id === value.id);\n\t\t\t\tif (index < 0) return invalid(\"missing\");\n\t\t\t\tnext.tasks[index] = value.task;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"remove\": {\n\t\t\t\tif (typeof value.id !== \"string\") return invalid(\"operation\");\n\t\t\t\tlet index = next.tasks.findIndex(task => task.id === value.id);\n\t\t\t\tif (index < 0) return invalid(\"missing\");\n\t\t\t\tnext.tasks.splice(index, 1);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"reorder\": {\n\t\t\t\tif (!Array.isArray(value.ids) || value.ids.some(id => typeof id !== \"string\")) {\n\t\t\t\t\treturn invalid(\"operation\");\n\t\t\t\t}\n\t\t\t\tlet tasks = new Map(next.tasks.map(task => [task.id, task]));\n\t\t\t\tif (\n\t\t\t\t\tvalue.ids.length !== next.tasks.length || new Set(value.ids).size !== value.ids.length\n\t\t\t\t\t|| value.ids.some(id => !tasks.has(id))\n\t\t\t\t) return invalid(\"reorder\");\n\t\t\t\tnext.tasks = value.ids.map(id => tasks.get(id)!);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\treturn invalid(\"operation\");\n\t\t}\n\t}\n\treturn validate(next);\n}\n\n/** Read a graph back from a sidecar without trusting handwritten JSON. */\nexport function restore(value: unknown): Graph | undefined {\n\tlet stored = item(value, [\"versions\"]);\n\tif (!stored || !Array.isArray(stored.versions) || stored.versions.length === 0) return undefined;\n\tlet versions: Version[] = [];\n\tfor (let [index, value] of stored.versions.entries()) {\n\t\tlet version = item(value, [\"definition\", \"number\", \"planRevision\", \"revision\", \"state\"])\n\t\t\t?? item(value, [\"definition\", \"number\", \"planRevision\", \"state\"]);\n\t\tlet checked = version && definition(version.definition);\n\t\tlet number = version?.number;\n\t\tlet revision = version?.revision ?? 1;\n\t\tlet planRevision = version?.planRevision;\n\t\tlet versionState = state(version?.state);\n\t\tif (\n\t\t\t!version\n\t\t\t|| typeof number !== \"number\"\n\t\t\t|| number !== index + 1\n\t\t\t|| typeof revision !== \"number\"\n\t\t\t|| !Number.isInteger(revision)\n\t\t\t|| revision < 1\n\t\t\t|| typeof planRevision !== \"number\"\n\t\t\t|| !Number.isInteger(planRevision)\n\t\t\t|| planRevision < 0\n\t\t\t|| !versionState\n\t\t\t|| !checked\n\t\t) return undefined;\n\t\tversions.push({\n\t\t\tnumber,\n\t\t\trevision,\n\t\t\tplanRevision,\n\t\t\tstate: versionState,\n\t\t\tdefinition: checked,\n\t\t});\n\t}\n\treturn history(versions) ? { versions } : undefined;\n}\n\n/**\n * Mutations go through this service rather than directly to a snapshot. The\n * caller gives it an adapter so graph state remains a backend concern and\n * never becomes an MDX node.\n */\nexport class Graphs {\n\t#adapter: GraphAdapter;\n\n\tconstructor(adapter: GraphAdapter) {\n\t\tthis.#adapter = adapter;\n\t}\n\n\tasync #transact(\n\t\tdocument: Document,\n\t\tchange: (current: { graph: Graph | undefined; revision: number | undefined }) => Result,\n\t): Promise> {\n\t\tlet result = await this.#adapter.transact(document, current => {\n\t\t\tlet next = change({\n\t\t\t\tgraph: current.graph && copy(current.graph),\n\t\t\t\trevision: current.revision,\n\t\t\t});\n\t\t\treturn next.ok ? { ok: true, value: copy(next.value) } : next;\n\t\t});\n\t\treturn result.ok ? { ok: true, value: copy(result.value) } : result;\n\t}\n\n\t/** Change a graph by operations from one particular planner read. */\n\tasync revise(document: Document, change: Revision): Promise> {\n\t\treturn await this.#transact(document, ({ graph, revision }) => {\n\t\t\tif (revision !== change.planRevision) return { ok: false, reason: \"stale-plan\" };\n\t\t\tlet version = graph && current(graph);\n\t\t\tif ((version?.revision ?? 0) !== change.graphRevision) {\n\t\t\t\treturn { ok: false, reason: \"stale-graph\" };\n\t\t\t}\n\t\t\tif (version?.state === \"locked\") return { ok: false, reason: \"locked\" };\n\t\t\tif (version?.state === \"superseded\") return { ok: false, reason: \"superseded\" };\n\t\t\tif (change.operations.length === 0) return { ok: false, reason: \"operation\" };\n\n\t\t\tlet checked = revise(version?.definition ?? { tasks: [] }, change.operations);\n\t\t\tif (!checked.ok) return checked;\n\t\t\tif (!graph || !version) {\n\t\t\t\treturn {\n\t\t\t\t\tok: true,\n\t\t\t\t\tvalue: {\n\t\t\t\t\t\tversions: [{\n\t\t\t\t\t\t\tnumber: 1,\n\t\t\t\t\t\t\trevision: 1,\n\t\t\t\t\t\t\tplanRevision: revision,\n\t\t\t\t\t\t\tstate: \"draft\",\n\t\t\t\t\t\t\tdefinition: checked.value,\n\t\t\t\t\t\t}],\n\t\t\t\t\t},\n\t\t\t\t};\n\t\t\t}\n\t\t\tif (version.state === \"draft\") {\n\t\t\t\tgraph.versions[graph.versions.length - 1] = {\n\t\t\t\t\t...version,\n\t\t\t\t\trevision: version.revision + 1,\n\t\t\t\t\tplanRevision: revision,\n\t\t\t\t\tdefinition: checked.value,\n\t\t\t\t};\n\t\t\t} else {\n\t\t\t\tgraph.versions.push({\n\t\t\t\t\tnumber: version.number + 1,\n\t\t\t\t\trevision: 1,\n\t\t\t\t\tplanRevision: revision,\n\t\t\t\t\tstate: \"draft\",\n\t\t\t\t\tdefinition: checked.value,\n\t\t\t\t});\n\t\t\t}\n\t\t\treturn { ok: true, value: graph };\n\t\t});\n\t}\n\n\tasync approve(document: Document): Promise> {\n\t\treturn await this.#transact(document, ({ graph, revision }) => {\n\t\t\tlet version = graph && current(graph);\n\t\t\tif (!graph || !version) return { ok: false, reason: \"missing\" };\n\t\t\tif (version.state !== \"draft\") return { ok: false, reason: \"not-draft\" };\n\t\t\tif (revision === undefined) return { ok: false, reason: \"missing-document\" };\n\t\t\tif (version.planRevision !== revision) return { ok: false, reason: \"stale-plan\" };\n\t\t\tlet checked = validate(version.definition);\n\t\t\tif (!checked.ok) return checked;\n\n\t\t\tfor (let prior of graph.versions) {\n\t\t\t\tif (prior.state === \"approved\") prior.state = \"superseded\";\n\t\t\t}\n\t\t\tgraph.versions[graph.versions.length - 1] = {\n\t\t\t\t...graph.versions[graph.versions.length - 1],\n\t\t\t\tstate: \"approved\",\n\t\t\t\tdefinition: checked.value,\n\t\t\t};\n\t\t\treturn { ok: true, value: graph };\n\t\t});\n\t}\n\n\tasync start(document: Document): Promise> {\n\t\treturn await this.#transact(document, ({ graph, revision }) => {\n\t\t\tlet version = graph && current(graph);\n\t\t\tif (!graph || !version) return { ok: false, reason: \"missing\" };\n\t\t\tif (version.state !== \"approved\") return { ok: false, reason: \"not-approved\" };\n\t\t\tif (revision === undefined) return { ok: false, reason: \"missing-document\" };\n\t\t\tif (version.planRevision !== revision) return { ok: false, reason: \"stale-plan\" };\n\n\t\t\tgraph.versions[graph.versions.length - 1] = {\n\t\t\t\t...graph.versions[graph.versions.length - 1],\n\t\t\t\tstate: \"locked\",\n\t\t\t};\n\t\t\treturn { ok: true, value: graph };\n\t\t});\n\t}\n}\n","editable",false,"branch","documentNavigation","repo","githubnext/chopin","repoId","7d1a8ac3-35b0-4dea-85d4-06a980f3bada","ownerId","org:89615882","site","nexthub","private","admin","settings","maintainer","triage","starred","stars",0,"watchers","watching","pinned","notify","views",[183,184,185,186,187,188,189,190,191,192,193,194,195],"navigation",{"_54":55,"_139":140,"_141":142,"_143":144,"_145":146,"_147":148,"_149":150},"sources",[],"viewer","meta",{"_131":132,"_133":134,"_135":136,"_42":31,"_137":126,"_138":31,"_48":49,"_50":49},"branches",[73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130],"tags",[69,70,71,72],"cloneUrl","https://git.nexthub.sh/githubnext/chopin.git","color-controls-slice-1","color-controls-slice-2","color-controls-slice-3","color-controls-slice-4","Krzysztof-Cieslak-patch-1","Krzysztof-Cieslak-patch-2","Maggie/app-preview-toolkit","Maggie/ci-playwright-install-timeout","Maggie/collaborative-visual-decision","Maggie/design-audit","Maggie/generic-visual-decision-runtime","Maggie/impeccable-chopin-metadata","Maggie/jev-chat-product","Maggie/jev-composed-assessment","Maggie/native-document-layouts","Maggie/openui-composition-product","Maggie/openui-composition-trial","Maggie/planner-visual-authoring","Maggie/planner-visual-requests","Maggie/visual-selection-eval","artifacts/pr-419-live-preview-20261009","automation/pr-maintenance-state","automation/use-effect/callout-disabled-picker-8cf9e49ba5c09471","automation/use-effect/collaboration-options-ref-4e3a5a08a879a5ae","automation/use-effect/room-workspace-effective-access-a57d40866c71bed0","chore/bun-1.4.2","color-controls","color-controls-plan","comments","design-pr-assets","design/archived-decisions-badge","design/channel-route-remount","design/chat-decision-entry","design/conversation-analysis-markers","design/decision-evidence","design/settled-line-icon","dev/integration","diagram-step-controls","feat/liveapp-frontend-pilot","feat/local-experiments","feat/local-launcher-tracer","fix/autolink-mdx-crash","github-pills/2-pills","github-pills/3-hover-card","maggie/app-preview-toolkit","maggie/ci-playwright-install-timeout","maggie/collaborative-visual-decision","maggie/design-audit","maggie/generic-visual-decision-runtime","maggie/impeccable-chopin-metadata","maggie/jev-composed-assessment","maggie/native-document-layouts","maggie/openui-composition-product","maggie/openui-composition-trial","maggie/planner-visual-authoring","maggie/planner-visual-requests","maggie/visual-selection-eval","main","plain-text-fence-chrome","tokens/09-copy","wireframes/2-renderer","wireframes/3-planner","description","Let's compose rich plans together","owner","githubnext","section","","head","empty","pins",[165,166,167],"documents",{"_160":161,"_162":163},"code",{"_156":157,"_158":159},"automations",{"_153":154,"_155":-5},"delivery",{"_151":49,"_152":-5},"tag","04zvKQ8QOrDUF8TO1Ovz0Zy8_TT","releases","applications","workflows",3,"deployments","commits",1000,"changes",13,"counts",{"_164":163},"total",11,"issue",{"_168":158,"_170":181,"_15":158,"_172":182,"_52":174,"_175":31,"_176":174,"_177":159},{"_168":178,"_170":179,"_15":178,"_172":180,"_52":174,"_175":31,"_176":174,"_177":49},{"_168":169,"_170":171,"_15":169,"_172":173,"_52":174,"_175":31,"_176":174,"_177":163},"id","issues","name","Issues","filters",{},true,"saved","pinnable","count","tasks","Tasks",{},"Changes",{},{"_168":158,"_170":181,"_15":158,"_172":226,"_52":174,"_175":31,"_176":174},{"_168":178,"_170":179,"_15":178,"_172":225,"_52":174,"_175":31,"_176":174},{"_168":169,"_170":171,"_15":169,"_172":224,"_52":174,"_175":31,"_176":174},{"_168":221,"_170":222,"_15":221,"_172":223,"_52":31,"_175":31,"_176":174},{"_168":218,"_170":219,"_15":218,"_172":220,"_52":31,"_175":31,"_176":174},{"_168":153,"_170":216,"_15":145,"_172":217,"_52":31,"_175":31,"_176":174},{"_168":155,"_170":213,"_15":214,"_172":215,"_52":31,"_175":31,"_176":174},{"_168":151,"_170":211,"_15":151,"_172":212,"_52":31,"_175":31,"_176":174},{"_168":207,"_170":208,"_15":209,"_172":210,"_52":31,"_175":31,"_176":174},{"_168":141,"_170":205,"_15":141,"_172":206,"_52":31,"_175":31,"_176":31},{"_168":202,"_170":203,"_15":202,"_172":204,"_52":31,"_175":31,"_176":31},{"_168":199,"_170":200,"_15":199,"_172":201,"_52":31,"_175":31,"_176":31},{"_168":196,"_170":197,"_15":196,"_172":198,"_52":31,"_175":31,"_176":31},"decisions","Decisions",{},"changelog","Changelog",{},"roadmap","Roadmap",{},"Documents",{},"activity","Activity","insights",{},"Releases",{},"Deployments","automations/deployments",{},"Workflows",{},"discussions","Discussions",{},"goals","Goals",{},{},{},{},"groups","user","agents",[],"now",1794438397532,"sidebar","expanded"]