incipit 0.2.3

Workspace identity vocabulary for Mere: the stable ids of a graph and a session, and view-local curation (subgraph specifications and folds), and, behind the `arrangement` feature, forme: the workbench arrangement authority. No dependency on the graph itself.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
// Copyright 2026 Mark Alan Boykin
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
// SPDX-License-Identifier: MPL-2.0

//! `Arrangement` — forme's graph-capable workbench arrangement (v1).
//!
//! This is forme advanced to its own charter: an arrangement is "whatever
//! shape the typesetter locks up — not forced into a tree." It is a small
//! **graph** of arrangement nodes (members, tiles, groups, …) connected by
//! arrangement edges (stacked, split, compare, …). A *tree* is one
//! [projection](../../../../../design_docs/mere_docs/technical_architecture/2026-05-21_mere_composition_spine.md)
//! of it (platen's job), not its essence.
//!
//! **Geometry-free** by design: an arrangement holds *semantic* placement
//! (these two are stacked, that one is pinned) — never coordinates or split
//! ratios. Geometry lives in projection state, keyed `(FormeRef,
//! ProjectionKind)`; camera/focus lives in the pane view-intent.
//!
//! **Discipline (spine §3, §10):** graph *shape*, small vocabulary. The
//! subgraph-reconciliation / pressure / lens machinery from the graphshell era
//! is *parked* — `Supernode` is the only minimal hook kept for the
//! future derived-arrangement lane.
//!
//! forme stays framework-free: members are referenced by their stable graph id
//! ([`GraphMemberId`] = the kernel node UUID); forme holds the id, the host resolves
//! it against the kernel graph.

use std::collections::BTreeMap;

use serde::{Deserialize, Serialize};
use uuid::Uuid;

/// Stable id of a graph member (kernel `Node` UUID) an arrangement references.
pub type GraphMemberId = Uuid;

/// Local id of a node *within one arrangement* — distinct from a graph member
/// id (one member may appear as several arrangement nodes: mirrors, compares).
#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]
pub struct ArrangementNodeId(Uuid);

impl ArrangementNodeId {
    /// Mint a fresh id.
    pub fn new() -> Self {
        Self(Uuid::new_v4())
    }

    /// Construct from a known UUID (persistence / tests).
    pub fn from_uuid(id: Uuid) -> Self {
        Self(id)
    }

    pub fn as_uuid(self) -> Uuid {
        self.0
    }
}

impl Default for ArrangementNodeId {
    fn default() -> Self {
        Self::new()
    }
}

/// What an arrangement node *is*. The small v1 vocabulary; not every node is a
/// rendered tile (hence `forme`/`Arrangement`, not `TileGraph`).
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub enum ArrangementNodeKind {
    /// The arrangement's root. Exactly one per arrangement.
    WorkbenchRoot,
    /// "Show this graph member" — the curated reference into graph truth.
    MemberIntent { member: GraphMemberId },
    /// A curated tile, optionally bound to a graph member (a tile may present
    /// non-member content, e.g. a tool).
    TileIntent { member: Option<GraphMemberId> },
    /// A grouping container (its members attach via `MemberOf`).
    Group,
    /// A mirror/portal of another arrangement node (the original lives
    /// elsewhere in the arrangement; the `MirrorOf` edge points to it).
    Portal,
    /// Minimal hook for the future derived-arrangement lane (a subgraph shown
    /// collapsed). Parked: no reconciliation machinery in v1.
    Supernode,
}

/// One arrangement node: a local id, a kind, an optional label.
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct ArrangementNode {
    pub id: ArrangementNodeId,
    pub kind: ArrangementNodeKind,
    pub label: Option<String>,
}

/// Semantic placement relations between arrangement nodes. These are the
/// arrangement *facts*; geometry (which side, what ratio) is a projection
/// concern.
#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub enum ArrangementEdgeKind {
    /// Containment: `from` is a member of `to` (a tile in the root or a group).
    MemberOf,
    /// Tabbed together (one visible at a time in a tree projection).
    StackedWith,
    /// Side-by-side (a split in a tree projection).
    SplitWith,
    /// Loosely adjacent (spatial benches; ordering hint).
    AdjacentTo,
    /// Part of a comparison set (compare-fan projection).
    CompareWith,
    /// Ordered focus/navigation path (corridor projection; traversal order a
    /// tree gets for free, a graph must state).
    FocusPath,
    /// Pinned within a container (survives reflow).
    PinnedIn,
    /// `from` is a mirror/portal of `to`.
    MirrorOf,
}

/// A directed arrangement relation.
#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct ArrangementEdge {
    pub from: ArrangementNodeId,
    pub to: ArrangementNodeId,
    pub kind: ArrangementEdgeKind,
}

/// A workbench arrangement: a small graph of nodes + relations, rooted at a
/// single [`ArrangementNodeKind::WorkbenchRoot`]. Geometry-free.
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct Arrangement {
    root: ArrangementNodeId,
    nodes: BTreeMap<ArrangementNodeId, ArrangementNode>,
    edges: Vec<ArrangementEdge>,
}

impl Arrangement {
    /// A fresh arrangement with just its `WorkbenchRoot`.
    pub fn new() -> Self {
        let root = ArrangementNodeId::new();
        let mut nodes = BTreeMap::new();
        nodes.insert(
            root,
            ArrangementNode {
                id: root,
                kind: ArrangementNodeKind::WorkbenchRoot,
                label: None,
            },
        );
        Self {
            root,
            nodes,
            edges: Vec::new(),
        }
    }

    /// A read-through *Identity* arrangement (spine §14.2 `FormeRef::Identity`):
    /// every `member` as a [`MemberIntent`](ArrangementNodeKind::MemberIntent) under
    /// the root, no curation. The orrery's binding — derived from a graph's current
    /// node set, never a stored or copied roster. This is the Cartography
    /// projection's membership source, mirroring how a curated arrangement sources
    /// the Tree projection (the tiled workbench): the seam that makes the orrery and
    /// the workbench two projections of one arrangement.
    pub fn identity(members: impl IntoIterator<Item = GraphMemberId>) -> Self {
        let mut arrangement = Self::new();
        for member in members {
            arrangement.add_member_intent(member);
        }
        arrangement
    }

    /// The root node's id.
    pub fn root(&self) -> ArrangementNodeId {
        self.root
    }

    /// Retain the root and existing member-intent identities when a tree
    /// projection rebuilds its semantic arrangement. Reuse a member's id only
    /// when its occurrence is unique in both arrangements. Repeated references
    /// keep their supplied occurrence ids: member identity alone cannot match
    /// mirrors or compares. Never overwrite a node that now has another kind.
    pub fn preserve_member_identity(&mut self, previous: &Self) {
        let member_ids = |arrangement: &Self| {
            let mut members = BTreeMap::<GraphMemberId, Vec<ArrangementNodeId>>::new();
            for node in arrangement.nodes.values() {
                if let ArrangementNodeKind::MemberIntent { member } = node.kind {
                    members.entry(member).or_default().push(node.id);
                }
            }
            members
        };
        let old_members = member_ids(previous);
        let mut ids = BTreeMap::from([(self.root, previous.root)]);
        for (member, current) in member_ids(self) {
            if let [id] = current.as_slice()
                && let Some(old) = old_members.get(&member)
                && let [old_id] = old.as_slice()
                && (id == old_id || !self.nodes.contains_key(old_id))
            {
                ids.insert(*id, *old_id);
            }
        }
        self.root = previous.root;
        self.nodes = std::mem::take(&mut self.nodes)
            .into_values()
            .map(|mut node| {
                node.id = ids.get(&node.id).copied().unwrap_or(node.id);
                (node.id, node)
            })
            .collect();
        for edge in &mut self.edges {
            edge.from = ids.get(&edge.from).copied().unwrap_or(edge.from);
            edge.to = ids.get(&edge.to).copied().unwrap_or(edge.to);
        }
    }

    /// Insert a node of `kind` with an optional label; returns its id. The
    /// node is *not* attached to anything — use [`attach`](Self::attach) or the
    /// `add_*` helpers, which attach to the root by default.
    pub fn insert(
        &mut self,
        kind: ArrangementNodeKind,
        label: Option<String>,
    ) -> ArrangementNodeId {
        let id = ArrangementNodeId::new();
        self.nodes.insert(id, ArrangementNode { id, kind, label });
        id
    }

    /// Add a `MemberIntent` for `member`, attached to the root.
    pub fn add_member_intent(&mut self, member: GraphMemberId) -> ArrangementNodeId {
        let id = self.insert(ArrangementNodeKind::MemberIntent { member }, None);
        self.attach(id, self.root);
        id
    }

    /// Add a `TileIntent` (optionally bound to a member), attached to the root.
    pub fn add_tile_intent(&mut self, member: Option<GraphMemberId>) -> ArrangementNodeId {
        let id = self.insert(ArrangementNodeKind::TileIntent { member }, None);
        self.attach(id, self.root);
        id
    }

    /// Add a `Group`, attached to the root.
    pub fn add_group(&mut self, label: Option<String>) -> ArrangementNodeId {
        let id = self.insert(ArrangementNodeKind::Group, label);
        self.attach(id, self.root);
        id
    }

    /// Make `child` a member of `parent` (a `MemberOf` edge). Re-parenting:
    /// drops any existing `MemberOf` out-edge from `child` first, so a node has
    /// exactly one container.
    pub fn attach(&mut self, child: ArrangementNodeId, parent: ArrangementNodeId) {
        self.edges
            .retain(|e| !(e.from == child && e.kind == ArrangementEdgeKind::MemberOf));
        self.relate(child, parent, ArrangementEdgeKind::MemberOf);
    }

    /// Add a relation edge (idempotent for the exact triple).
    pub fn relate(
        &mut self,
        from: ArrangementNodeId,
        to: ArrangementNodeId,
        kind: ArrangementEdgeKind,
    ) {
        let edge = ArrangementEdge { from, to, kind };
        if !self.edges.contains(&edge) {
            self.edges.push(edge);
        }
    }

    /// Tab two nodes together (`StackedWith`).
    pub fn stack(&mut self, a: ArrangementNodeId, b: ArrangementNodeId) {
        self.relate(a, b, ArrangementEdgeKind::StackedWith);
    }

    /// Split two nodes side-by-side (`SplitWith`).
    pub fn split(&mut self, a: ArrangementNodeId, b: ArrangementNodeId) {
        self.relate(a, b, ArrangementEdgeKind::SplitWith);
    }

    /// Look up a node.
    pub fn node(&self, id: ArrangementNodeId) -> Option<&ArrangementNode> {
        self.nodes.get(&id)
    }

    /// Bind (or unbind) a `TileIntent` node to a graph member. Returns whether
    /// `id` was a tile-intent node.
    pub fn set_tile_member(
        &mut self,
        id: ArrangementNodeId,
        member: Option<GraphMemberId>,
    ) -> bool {
        match self.nodes.get_mut(&id).map(|n| &mut n.kind) {
            Some(ArrangementNodeKind::TileIntent { member: slot }) => {
                *slot = member;
                true
            },
            _ => false,
        }
    }

    /// Iterate all nodes (deterministic order).
    pub fn nodes(&self) -> impl Iterator<Item = &ArrangementNode> {
        self.nodes.values()
    }

    /// Iterate all edges.
    pub fn edges(&self) -> impl Iterator<Item = &ArrangementEdge> {
        self.edges.iter()
    }

    /// Number of nodes (including the root).
    pub fn len(&self) -> usize {
        self.nodes.len()
    }

    pub fn is_empty(&self) -> bool {
        // The root always exists, so an arrangement is never truly empty;
        // "empty" here means "only the root".
        self.nodes.len() <= 1
    }

    /// Direct members of `container` (incoming `MemberOf` edges).
    pub fn members_of(
        &self,
        container: ArrangementNodeId,
    ) -> impl Iterator<Item = ArrangementNodeId> + '_ {
        self.edges
            .iter()
            .filter(move |e| e.to == container && e.kind == ArrangementEdgeKind::MemberOf)
            .map(|e| e.from)
    }

    /// The graph members referenced anywhere in the arrangement
    /// (`MemberIntent` + bound `TileIntent`). Deduped, deterministic.
    pub fn referenced_members(&self) -> Vec<GraphMemberId> {
        let mut out: Vec<GraphMemberId> = self
            .nodes
            .values()
            .filter_map(|n| match &n.kind {
                ArrangementNodeKind::MemberIntent { member } => Some(*member),
                ArrangementNodeKind::TileIntent { member: Some(m) } => Some(*m),
                _ => None,
            })
            .collect();
        out.sort();
        out.dedup();
        out
    }
}

impl Default for Arrangement {
    fn default() -> Self {
        Self::new()
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn identity_preservation_does_not_merge_repeated_member_appearances() {
        let member = Uuid::from_u128(1);
        let mut previous = Arrangement::new();
        previous.add_member_intent(member);
        previous.add_member_intent(member);
        let mut next = Arrangement::new();
        let first = next.add_member_intent(member);
        let second = next.add_member_intent(member);
        next.stack(first, second);
        next.preserve_member_identity(&previous);
        assert_eq!(next.len(), 3);
        assert!(next.node(first).is_some());
        assert!(next.node(second).is_some());
        assert!(next.edges().any(|edge| {
            edge.from == first && edge.to == second && edge.kind == ArrangementEdgeKind::StackedWith
        }));
        assert_eq!(next.root(), previous.root());
    }

    #[test]
    fn identity_preservation_reuses_only_unambiguous_member_ids() {
        let member = Uuid::from_u128(1);
        let mut previous = Arrangement::new();
        let old = previous.add_member_intent(member);
        let mut next = Arrangement::new();
        next.add_member_intent(member);
        next.preserve_member_identity(&previous);
        assert!(next.node(old).is_some());

        let mut repeated = Arrangement::new();
        let first = repeated.add_member_intent(member);
        let second = repeated.add_member_intent(member);
        repeated.preserve_member_identity(&previous);
        assert_eq!(repeated.len(), 3);
        assert!(repeated.node(first).is_some());
        assert!(repeated.node(second).is_some());
        repeated.preserve_member_identity(&repeated.clone());
        assert!(repeated.node(first).is_some());
        assert!(repeated.node(second).is_some());
    }

    #[test]
    fn identity_preservation_does_not_overwrite_a_rebound_node() {
        let member = Uuid::from_u128(1);
        let mut previous = Arrangement::new();
        let old = previous.add_member_intent(member);
        let mut next = previous.clone();
        next.nodes.get_mut(&old).unwrap().kind = ArrangementNodeKind::TileIntent {
            member: Some(member),
        };
        let new = next.add_member_intent(member);
        next.preserve_member_identity(&previous);
        assert_eq!(next.len(), 3);
        assert_eq!(
            next.node(old).unwrap().kind,
            ArrangementNodeKind::TileIntent {
                member: Some(member)
            }
        );
        assert!(next.node(new).is_some());
    }

    #[test]
    fn new_arrangement_has_only_root() {
        let a = Arrangement::new();
        assert_eq!(a.len(), 1);
        assert!(a.is_empty());
        assert_eq!(
            a.node(a.root()).unwrap().kind,
            ArrangementNodeKind::WorkbenchRoot
        );
    }

    #[test]
    fn identity_references_every_member_under_the_root() {
        let a = Arrangement::identity([Uuid::from_u128(3), Uuid::from_u128(1), Uuid::from_u128(2)]);
        assert_eq!(
            a.referenced_members(),
            vec![Uuid::from_u128(1), Uuid::from_u128(2), Uuid::from_u128(3)]
        );
        assert_eq!(a.len(), 4, "root + three member intents");
        // Every member intent is a direct member of the root (read-through, no groups).
        assert_eq!(a.members_of(a.root()).count(), 3);
    }

    #[test]
    fn member_intents_attach_to_root() {
        let mut a = Arrangement::new();
        let m1 = a.add_member_intent(Uuid::from_u128(1));
        let m2 = a.add_member_intent(Uuid::from_u128(2));
        let members: Vec<_> = a.members_of(a.root()).collect();
        assert!(members.contains(&m1));
        assert!(members.contains(&m2));
        assert_eq!(a.len(), 3); // root + 2
    }

    #[test]
    fn referenced_members_dedupes_and_sorts() {
        let mut a = Arrangement::new();
        a.add_member_intent(Uuid::from_u128(2));
        a.add_tile_intent(Some(Uuid::from_u128(1)));
        a.add_member_intent(Uuid::from_u128(2)); // dup member, distinct node
        a.add_tile_intent(None); // unbound tile contributes nothing
        assert_eq!(
            a.referenced_members(),
            vec![Uuid::from_u128(1), Uuid::from_u128(2)]
        );
    }

    #[test]
    fn stack_and_split_are_relations_not_containment() {
        let mut a = Arrangement::new();
        let t1 = a.add_tile_intent(None);
        let t2 = a.add_tile_intent(None);
        a.stack(t1, t2);
        a.split(t1, t2);
        let kinds: Vec<_> = a
            .edges()
            .filter(|e| e.from == t1 && e.to == t2)
            .map(|e| e.kind)
            .collect();
        assert!(kinds.contains(&ArrangementEdgeKind::StackedWith));
        assert!(kinds.contains(&ArrangementEdgeKind::SplitWith));
    }

    #[test]
    fn attach_reparents_exactly_once() {
        let mut a = Arrangement::new();
        let group = a.add_group(Some("g".into()));
        let tile = a.add_tile_intent(None); // attached to root
        a.attach(tile, group); // reparent into the group
        // Exactly one MemberOf out-edge from `tile`, pointing at the group.
        let parents: Vec<_> = a
            .edges()
            .filter(|e| e.from == tile && e.kind == ArrangementEdgeKind::MemberOf)
            .map(|e| e.to)
            .collect();
        assert_eq!(parents, vec![group]);
    }

    #[test]
    fn relate_is_idempotent() {
        let mut a = Arrangement::new();
        let t1 = a.add_tile_intent(None);
        let t2 = a.add_tile_intent(None);
        a.stack(t1, t2);
        a.stack(t1, t2);
        let count = a
            .edges()
            .filter(|e| e.kind == ArrangementEdgeKind::StackedWith)
            .count();
        assert_eq!(count, 1);
    }

    #[test]
    fn round_trips_through_json() {
        let mut a = Arrangement::new();
        let g = a.add_group(Some("research".into()));
        let t = a.add_tile_intent(Some(Uuid::from_u128(7)));
        a.attach(t, g);
        let json = serde_json::to_string(&a).unwrap();
        let back: Arrangement = serde_json::from_str(&json).unwrap();
        assert_eq!(a, back);
    }

    #[test]
    fn set_tile_member_rebinds_only_tile_intents() {
        let mut a = Arrangement::new();
        let tile = a.add_tile_intent(None);
        let group = a.add_group(Some("g".into()));

        assert!(a.set_tile_member(tile, Some(Uuid::from_u128(9))));
        assert!(matches!(
            a.node(tile).map(|n| &n.kind),
            Some(ArrangementNodeKind::TileIntent { member: Some(_) })
        ));
        // Not a tile-intent → no-op, returns false.
        assert!(!a.set_tile_member(group, Some(Uuid::from_u128(1))));
    }
}