|
| 1 | +import 'dart:collection'; |
| 2 | +import 'dart:developer'; |
| 3 | +import 'dart:math'; |
| 4 | + |
| 5 | +// ignore: unused_import |
| 6 | +import 'debug_visualizers.dart'; |
| 7 | + |
| 8 | +final _rnd = Random(); |
| 9 | + |
| 10 | +String Function() visualize; |
| 11 | + |
| 12 | +void main() { |
| 13 | + debugger(); |
| 14 | + // Open a Debug Visualizer window and evalute the expression "visualize()" |
| 15 | + // and then press Continue to step through the samples. |
| 16 | + plotly_demo(); |
| 17 | + graph_demo(); |
| 18 | + tree_demo(); |
| 19 | +} |
| 20 | + |
| 21 | +void plotly_demo() { |
| 22 | + final values = <int>[]; |
| 23 | + visualize = () => plotly(values); |
| 24 | + for (var i = 0; i < 20; i++) { |
| 25 | + debugger(); |
| 26 | + values.add(i + _rnd.nextInt(5) - 2); |
| 27 | + } |
| 28 | +} |
| 29 | + |
| 30 | +void graph_demo() { |
| 31 | + graphFromDoubleLinked<T>( |
| 32 | + DoubleLinkedQueue<T> values, String Function(T) toString) { |
| 33 | + node(T s) => GraphNode(toString(s), toString(s)); |
| 34 | + edge(DoubleLinkedQueueEntry<T> e) => [ |
| 35 | + if (e.nextEntry() != null) |
| 36 | + GraphEdge( |
| 37 | + toString(e.element), |
| 38 | + toString(e.nextEntry().element), |
| 39 | + "next", |
| 40 | + ), |
| 41 | + if (e.previousEntry() != null) |
| 42 | + GraphEdge( |
| 43 | + toString(e.element), |
| 44 | + toString(e.previousEntry().element), |
| 45 | + "prev", |
| 46 | + ), |
| 47 | + ]; |
| 48 | + |
| 49 | + final nodes = values.map(node).toList(); |
| 50 | + final edges = <GraphEdge>[]; |
| 51 | + values.forEachEntry((e) => edges.addAll(edge(e))); |
| 52 | + return graph(nodes, edges); |
| 53 | + } |
| 54 | + |
| 55 | + final values = DoubleLinkedQueue<String>(); |
| 56 | + visualize = () => graphFromDoubleLinked(values, (s) => s); |
| 57 | + |
| 58 | + for (var i = 0; i < 10; i++) { |
| 59 | + debugger(); |
| 60 | + values.addLast('Node $i'); |
| 61 | + } |
| 62 | +} |
| 63 | + |
| 64 | +void tree_demo() { |
| 65 | + var nodeNum = 1; |
| 66 | + TreeNode createNode(int levels) { |
| 67 | + final name = 'Node ${nodeNum++}'; |
| 68 | + final children = |
| 69 | + levels > 0 ? List.generate(2, (_) => createNode(levels - 1)) : null; |
| 70 | + return TreeNode(children, [TreeNodeItem(name)], name); |
| 71 | + } |
| 72 | + |
| 73 | + var levels = 0; |
| 74 | + visualize = () { |
| 75 | + nodeNum = 1; |
| 76 | + return tree(createNode(levels)); |
| 77 | + }; |
| 78 | + |
| 79 | + for (var i = 1; i < 5; i++) { |
| 80 | + debugger(); |
| 81 | + levels = i; |
| 82 | + } |
| 83 | +} |
0 commit comments