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
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
//! State methods for the Diagram component.
use super::graph::IndexedGraph;
use super::layout::{
ForceDirectedLayout, LayoutAlgorithm, LayoutHints, LayoutResult, SugiyamaLayout,
};
use super::types::{
DiagramCluster, DiagramEdge, DiagramNode, LayoutMode, NodeStatus, Orientation, RenderMode,
};
use super::{DiagramOutput, DiagramState, navigation};
impl DiagramState {
/// Creates a new empty diagram state.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(state.nodes().is_empty());
/// assert!(state.edges().is_empty());
/// assert!(state.clusters().is_empty());
/// ```
pub fn new() -> Self {
Self::default()
}
// -- Builders --
/// Adds a node to the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let state = DiagramState::new()
/// .with_node(DiagramNode::new("api", "API"));
/// assert_eq!(state.nodes().len(), 1);
/// ```
pub fn with_node(mut self, node: DiagramNode) -> Self {
self.nodes.push(node);
self.layout_dirty = true;
self
}
/// Adds an edge to the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode, DiagramEdge};
///
/// let state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"))
/// .with_node(DiagramNode::new("b", "B"))
/// .with_edge(DiagramEdge::new("a", "b"));
/// assert_eq!(state.edges().len(), 1);
/// ```
pub fn with_edge(mut self, edge: DiagramEdge) -> Self {
self.edges.push(edge);
self.layout_dirty = true;
self
}
/// Adds a cluster to the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramCluster};
///
/// let state = DiagramState::new()
/// .with_cluster(DiagramCluster::new("prod", "Production"));
/// assert_eq!(state.clusters().len(), 1);
/// ```
pub fn with_cluster(mut self, cluster: DiagramCluster) -> Self {
self.clusters.push(cluster);
self.layout_dirty = true;
self
}
/// Sets the diagram title.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new().with_title("My Diagram");
/// assert_eq!(state.title(), Some("My Diagram"));
/// ```
pub fn with_title(mut self, title: impl Into<String>) -> Self {
self.title = Some(title.into());
self
}
/// Sets the layout algorithm.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, LayoutMode};
///
/// let state = DiagramState::new().with_layout_mode(LayoutMode::ForceDirected);
/// assert_eq!(state.layout_mode(), &LayoutMode::ForceDirected);
/// ```
pub fn with_layout_mode(mut self, mode: LayoutMode) -> Self {
self.layout_mode = mode;
self.layout_dirty = true;
self
}
/// Sets the layout orientation.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, Orientation};
///
/// let state = DiagramState::new().with_orientation(Orientation::TopToBottom);
/// assert_eq!(state.orientation(), &Orientation::TopToBottom);
/// ```
pub fn with_orientation(mut self, orientation: Orientation) -> Self {
self.orientation = orientation;
self.layout_dirty = true;
self
}
/// Sets the rendering mode.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, RenderMode};
///
/// let state = DiagramState::new().with_render_mode(RenderMode::Braille);
/// assert_eq!(state.render_mode(), &RenderMode::Braille);
/// ```
pub fn with_render_mode(mut self, mode: RenderMode) -> Self {
self.render_mode = mode;
self
}
/// Enables or disables edge labels.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new().with_show_edge_labels(true);
/// assert!(state.show_edge_labels());
/// ```
pub fn with_show_edge_labels(mut self, show: bool) -> Self {
self.show_edge_labels = show;
self
}
/// Enables or disables the minimap.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new().with_show_minimap(true);
/// assert!(state.show_minimap());
/// ```
pub fn with_show_minimap(mut self, show: bool) -> Self {
self.show_minimap = show;
self
}
// -- Getters --
/// Returns the nodes in the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(state.nodes().is_empty());
/// ```
pub fn nodes(&self) -> &[DiagramNode] {
&self.nodes
}
/// Returns mutable access to the nodes.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"));
/// state.nodes_mut().push(DiagramNode::new("b", "B"));
/// assert_eq!(state.nodes().len(), 2);
/// ```
pub fn nodes_mut(&mut self) -> &mut Vec<DiagramNode> {
self.layout_dirty = true;
&mut self.nodes
}
/// Returns the edges in the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(state.edges().is_empty());
/// ```
pub fn edges(&self) -> &[DiagramEdge] {
&self.edges
}
/// Returns mutable access to the edges.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramEdge};
///
/// let mut state = DiagramState::new();
/// state.edges_mut().push(DiagramEdge::new("a", "b"));
/// assert_eq!(state.edges().len(), 1);
/// ```
pub fn edges_mut(&mut self) -> &mut Vec<DiagramEdge> {
self.layout_dirty = true;
&mut self.edges
}
/// Returns the clusters in the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(state.clusters().is_empty());
/// ```
pub fn clusters(&self) -> &[DiagramCluster] {
&self.clusters
}
/// Returns the selected node index, if any.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert_eq!(state.selected(), None);
/// ```
pub fn selected(&self) -> Option<usize> {
self.selected
}
/// Returns the selected node, if any.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let state = DiagramState::new()
/// .with_node(DiagramNode::new("api", "API"));
/// assert_eq!(state.selected_node(), None);
/// ```
pub fn selected_node(&self) -> Option<&DiagramNode> {
self.selected.and_then(|i| self.nodes.get(i))
}
/// Returns the diagram title, if set.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert_eq!(state.title(), None);
/// ```
pub fn title(&self) -> Option<&str> {
self.title.as_deref()
}
/// Returns the current layout mode.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, LayoutMode};
///
/// let state = DiagramState::new();
/// assert_eq!(state.layout_mode(), &LayoutMode::Hierarchical);
/// ```
pub fn layout_mode(&self) -> &LayoutMode {
&self.layout_mode
}
/// Returns the current layout orientation.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, Orientation};
///
/// let state = DiagramState::new();
/// assert_eq!(state.orientation(), &Orientation::LeftToRight);
/// ```
pub fn orientation(&self) -> &Orientation {
&self.orientation
}
/// Returns the rendering mode.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, RenderMode};
///
/// let state = DiagramState::new();
/// assert_eq!(state.render_mode(), &RenderMode::BoxDrawing);
/// ```
pub fn render_mode(&self) -> &RenderMode {
&self.render_mode
}
/// Returns whether search mode is currently active.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(!state.is_searching());
/// ```
pub fn is_searching(&self) -> bool {
self.search.active
}
/// Returns whether edge labels are shown.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(!state.show_edge_labels());
/// ```
pub fn show_edge_labels(&self) -> bool {
self.show_edge_labels
}
/// Returns whether the minimap is shown.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let state = DiagramState::new();
/// assert!(!state.show_minimap());
/// ```
pub fn show_minimap(&self) -> bool {
self.show_minimap
}
// -- Setters --
/// Sets the diagram title.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::DiagramState;
///
/// let mut state = DiagramState::new();
/// state.set_title("Updated");
/// assert_eq!(state.title(), Some("Updated"));
/// ```
pub fn set_title(&mut self, title: impl Into<String>) {
self.title = Some(title.into());
}
/// Sets the layout mode.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, LayoutMode};
///
/// let mut state = DiagramState::new();
/// state.set_layout_mode(LayoutMode::ForceDirected);
/// assert_eq!(state.layout_mode(), &LayoutMode::ForceDirected);
/// ```
pub fn set_layout_mode(&mut self, mode: LayoutMode) {
self.layout_mode = mode;
self.layout_dirty = true;
}
/// Sets the layout orientation.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, Orientation};
///
/// let mut state = DiagramState::new();
/// state.set_orientation(Orientation::TopToBottom);
/// assert_eq!(state.orientation(), &Orientation::TopToBottom);
/// ```
pub fn set_orientation(&mut self, orientation: Orientation) {
self.orientation = orientation;
self.layout_dirty = true;
}
// -- Mutations --
/// Adds a node to the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new();
/// state.add_node(DiagramNode::new("a", "A"));
/// assert_eq!(state.nodes().len(), 1);
/// ```
pub fn add_node(&mut self, node: DiagramNode) {
self.nodes.push(node);
self.layout_dirty = true;
}
/// Adds an edge to the diagram.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramEdge};
///
/// let mut state = DiagramState::new();
/// state.add_edge(DiagramEdge::new("a", "b"));
/// assert_eq!(state.edges().len(), 1);
/// ```
pub fn add_edge(&mut self, edge: DiagramEdge) {
self.edges.push(edge);
self.layout_dirty = true;
}
/// Removes a node by ID, returning it if found.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"));
/// let removed = state.remove_node("a");
/// assert!(removed.is_some());
/// assert!(state.nodes().is_empty());
/// ```
pub fn remove_node(&mut self, id: &str) -> Option<DiagramNode> {
let pos = self.nodes.iter().position(|n| n.id() == id)?;
// Adjust selected index
match self.selected {
Some(sel) if sel == pos => self.selected = None,
Some(sel) if sel > pos => self.selected = Some(sel - 1),
_ => {}
}
self.layout_dirty = true;
Some(self.nodes.remove(pos))
}
/// Removes an edge by (from, to) pair, returning it if found.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramEdge};
///
/// let mut state = DiagramState::new()
/// .with_edge(DiagramEdge::new("a", "b"));
/// let removed = state.remove_edge("a", "b");
/// assert!(removed.is_some());
/// assert!(state.edges().is_empty());
/// ```
pub fn remove_edge(&mut self, from: &str, to: &str) -> Option<DiagramEdge> {
let pos = self
.edges
.iter()
.position(|e| e.from() == from && e.to() == to)?;
self.layout_dirty = true;
Some(self.edges.remove(pos))
}
/// Updates a node's status, returning the old status if found.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode, NodeStatus};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("db", "Database"));
/// let old = state.update_node_status("db", NodeStatus::Down);
/// assert_eq!(old, Some(NodeStatus::Healthy));
/// assert_eq!(state.nodes()[0].status(), &NodeStatus::Down);
/// ```
pub fn update_node_status(&mut self, id: &str, status: NodeStatus) -> Option<NodeStatus> {
let node = self.nodes.iter_mut().find(|n| n.id() == id)?;
let old = node.status().clone();
node.set_status(status);
// Status changes do NOT dirty the layout
Some(old)
}
/// Clears all nodes, edges, clusters, and selection.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"));
/// state.clear();
/// assert!(state.nodes().is_empty());
/// ```
pub fn clear(&mut self) {
self.nodes.clear();
self.edges.clear();
self.clusters.clear();
self.selected = None;
self.selection_history.clear();
self.layout_dirty = true;
}
// -- Navigation --
/// Selects the next node (by index order).
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"))
/// .with_node(DiagramNode::new("b", "B"));
/// assert!(state.select_next());
/// assert_eq!(state.selected(), Some(0));
/// assert!(state.select_next());
/// assert_eq!(state.selected(), Some(1));
/// ```
pub fn select_next(&mut self) -> bool {
if self.nodes.is_empty() {
return false;
}
self.selected = Some(match self.selected {
None => 0,
Some(i) => (i + 1) % self.nodes.len(),
});
true
}
/// Selects the previous node (by index order).
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"))
/// .with_node(DiagramNode::new("b", "B"));
/// state.select_next(); // select "a"
/// state.select_prev(); // wrap to "b"
/// assert_eq!(state.selected(), Some(1));
/// ```
pub fn select_prev(&mut self) -> bool {
if self.nodes.is_empty() {
return false;
}
self.selected = Some(match self.selected {
None => self.nodes.len() - 1,
Some(0) => self.nodes.len() - 1,
Some(i) => i - 1,
});
true
}
/// Selects the nearest node in the given direction using spatial navigation.
///
/// Returns `true` if the selection changed.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"))
/// .with_node(DiagramNode::new("b", "B"));
/// // Spatial nav requires layout to be computed first
/// state.select_next(); // select something first
/// ```
pub(crate) fn select_direction(&mut self, direction: navigation::Direction) -> bool {
let current = match self.selected {
Some(idx) => idx,
None => {
// No selection — select first node
if !self.nodes.is_empty() {
self.selected = Some(0);
return true;
}
return false;
}
};
let layout = self.ensure_layout().clone();
if let Some(target) =
navigation::find_nearest_in_direction(current, layout.node_positions(), direction)
{
self.selected = Some(target);
true
} else {
false
}
}
/// Follows an outgoing edge from the selected node.
///
/// If the node has exactly one outgoing edge, jumps directly.
/// If it has multiple, sets `follow_targets` for the caller to
/// show a picker.
///
/// Returns the appropriate output, or `None` if no selection or no edges.
pub(crate) fn follow_edge(&mut self) -> Option<DiagramOutput> {
let sel_idx = self.selected?;
let graph = IndexedGraph::build(&self.nodes, &self.edges);
let targets = navigation::outgoing_targets(sel_idx, &graph);
match targets.len() {
0 => None,
1 => {
let target_idx = targets[0];
let from_id = self.nodes[sel_idx].id().to_string();
let to_id = self.nodes[target_idx].id().to_string();
self.selection_history.push(sel_idx);
self.selected = Some(target_idx);
Some(DiagramOutput::EdgeFollowed {
from: from_id,
to: to_id,
})
}
_ => {
let from_id = self.nodes[sel_idx].id().to_string();
let target_ids: Vec<String> = targets
.iter()
.filter_map(|&idx| self.nodes.get(idx).map(|n| n.id().to_string()))
.collect();
self.follow_targets = Some(target_ids.clone());
Some(DiagramOutput::EdgeChoiceRequired {
from: from_id,
targets: target_ids,
})
}
}
}
/// Follows a specific edge choice from the follow targets list.
pub(crate) fn follow_edge_choice(&mut self, choice_idx: usize) -> Option<DiagramOutput> {
let targets = self.follow_targets.take()?;
let target_id = targets.get(choice_idx)?;
let sel_idx = self.selected?;
let from_id = self.nodes[sel_idx].id().to_string();
if let Some(target_idx) = self.nodes.iter().position(|n| n.id() == target_id) {
self.selection_history.push(sel_idx);
self.selected = Some(target_idx);
Some(DiagramOutput::EdgeFollowed {
from: from_id,
to: target_id.clone(),
})
} else {
None
}
}
/// Goes back to the previous node in selection history.
///
/// # Examples
///
/// ```
/// use envision::component::diagram::{DiagramState, DiagramNode};
///
/// let mut state = DiagramState::new()
/// .with_node(DiagramNode::new("a", "A"))
/// .with_node(DiagramNode::new("b", "B"));
/// state.select_next(); // select a (index 0)
/// state.select_next(); // select b (index 1)
/// // go_back not available here since we used select_next, not follow_edge
/// assert!(!state.go_back());
/// ```
pub fn go_back(&mut self) -> bool {
if let Some(prev) = self.selection_history.pop() {
self.selected = Some(prev);
self.follow_targets = None;
true
} else {
false
}
}
/// Computes the layout if dirty, returning a reference to the cached result.
pub(crate) fn ensure_layout(&mut self) -> &LayoutResult {
if self.layout_dirty || self.cached_layout.is_none() {
let graph = IndexedGraph::build(&self.nodes, &self.edges);
let hints = LayoutHints {
orientation: self.orientation.clone(),
previous_layout: self.cached_layout.as_ref(),
..LayoutHints::default()
};
let result = match self.layout_mode {
LayoutMode::Hierarchical => SugiyamaLayout::default().compute(
&graph,
&self.nodes,
&self.edges,
&self.clusters,
&hints,
),
LayoutMode::ForceDirected => ForceDirectedLayout::default().compute(
&graph,
&self.nodes,
&self.edges,
&self.clusters,
&hints,
),
};
self.viewport
.set_content_bounds(result.bounding_box.clone());
self.cached_layout = Some(result);
self.layout_dirty = false;
}
self.cached_layout.as_ref().expect("layout just computed")
}
}