@dxos/react-ui-graph 0.9.1-staging.ee54ba693a → 0.11.0
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/dist/lib/chunk-useStateRef.mjs +61 -0
- package/dist/lib/chunk-useStateRef.mjs.map +1 -0
- package/dist/lib/index.mjs +3679 -0
- package/dist/lib/index.mjs.map +1 -0
- package/dist/lib/testing.mjs +158 -0
- package/dist/lib/testing.mjs.map +1 -0
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +20 -20
- package/dist/lib/browser/chunk-EASNZZ7B.mjs +0 -52
- package/dist/lib/browser/chunk-EASNZZ7B.mjs.map +0 -7
- package/dist/lib/browser/index.mjs +0 -4427
- package/dist/lib/browser/index.mjs.map +0 -7
- package/dist/lib/browser/meta.json +0 -1
- package/dist/lib/browser/testing/index.mjs +0 -180
- package/dist/lib/browser/testing/index.mjs.map +0 -7
- package/dist/lib/node-esm/chunk-JSE2X4ML.mjs +0 -54
- package/dist/lib/node-esm/chunk-JSE2X4ML.mjs.map +0 -7
- package/dist/lib/node-esm/index.mjs +0 -4428
- package/dist/lib/node-esm/index.mjs.map +0 -7
- package/dist/lib/node-esm/meta.json +0 -1
- package/dist/lib/node-esm/testing/index.mjs +0 -181
- package/dist/lib/node-esm/testing/index.mjs.map +0 -7
|
@@ -0,0 +1,158 @@
|
|
|
1
|
+
import { n as useStateRef } from "./chunk-useStateRef.mjs";
|
|
2
|
+
import { random } from "@dxos/random";
|
|
3
|
+
import update from "immutability-helper";
|
|
4
|
+
import { GraphModel } from "@dxos/graph";
|
|
5
|
+
//#region src/testing/data.ts
|
|
6
|
+
var seed = (seed) => random.seed(seed);
|
|
7
|
+
var createNode = (type = void 0) => ({
|
|
8
|
+
id: random.string.uuid(),
|
|
9
|
+
type,
|
|
10
|
+
label: random.lorem.words(3).replace(/ /g, "-")
|
|
11
|
+
});
|
|
12
|
+
var createNodes = (n = 0, types) => Array.from({ length: n }, () => createNode(types ? random.helpers.arrayElement(types) : void 0));
|
|
13
|
+
var createEdge = (source, target) => ({
|
|
14
|
+
id: `${source.id}-${target.id}`,
|
|
15
|
+
source: source.id,
|
|
16
|
+
target: target.id
|
|
17
|
+
});
|
|
18
|
+
/**
|
|
19
|
+
* Creates a random tree.
|
|
20
|
+
* @param depth Depth of tree.
|
|
21
|
+
* @param children Branching factor.
|
|
22
|
+
*/
|
|
23
|
+
var createTree = ({ depth = 2, children = 3 } = {}) => {
|
|
24
|
+
const createChildren = (root, d = 0) => {
|
|
25
|
+
if (d < depth) {
|
|
26
|
+
const max = Math.round(Math.log(depth + 1 - d) * children);
|
|
27
|
+
const num = random.number.int({
|
|
28
|
+
min: 1,
|
|
29
|
+
max
|
|
30
|
+
});
|
|
31
|
+
root.children = [...new Array(num)].map(() => {
|
|
32
|
+
return createChildren(createNode(), d + 1);
|
|
33
|
+
});
|
|
34
|
+
}
|
|
35
|
+
return root;
|
|
36
|
+
};
|
|
37
|
+
return createChildren(createNode());
|
|
38
|
+
};
|
|
39
|
+
/**
|
|
40
|
+
* Converts a tree into a graph.
|
|
41
|
+
* @param root
|
|
42
|
+
*/
|
|
43
|
+
var convertTreeToGraph = (root) => {
|
|
44
|
+
const traverse = (node, graph) => {
|
|
45
|
+
graph.nodes.push(node);
|
|
46
|
+
node.children?.forEach((child) => {
|
|
47
|
+
graph.edges.push(createEdge(node, child));
|
|
48
|
+
traverse(child, graph);
|
|
49
|
+
});
|
|
50
|
+
return graph;
|
|
51
|
+
};
|
|
52
|
+
return traverse(root, {
|
|
53
|
+
nodes: [],
|
|
54
|
+
edges: []
|
|
55
|
+
});
|
|
56
|
+
};
|
|
57
|
+
/**
|
|
58
|
+
* Creates a random graph.
|
|
59
|
+
* @param numNodes
|
|
60
|
+
* @param numEdges
|
|
61
|
+
*/
|
|
62
|
+
var createGraph = (numNodes = 0, numEdges = 0, types) => {
|
|
63
|
+
const nodes = createNodes(numNodes, types);
|
|
64
|
+
const edges = /* @__PURE__ */ new Map();
|
|
65
|
+
if (numEdges && nodes.length >= 2) for (let i = 0; i < numEdges; i++) {
|
|
66
|
+
const source = random.helpers.arrayElement(nodes);
|
|
67
|
+
const target = random.helpers.arrayElement(nodes);
|
|
68
|
+
if (source.id !== target.id) {
|
|
69
|
+
const edge = createEdge(source, target);
|
|
70
|
+
if (!edges.get(edge.id)) edges.set(edge.id, edge);
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
return {
|
|
74
|
+
nodes,
|
|
75
|
+
edges: Array.from(edges.values())
|
|
76
|
+
};
|
|
77
|
+
};
|
|
78
|
+
//#endregion
|
|
79
|
+
//#region src/testing/hooks.ts
|
|
80
|
+
/**
|
|
81
|
+
* Returns a state object and setter, with addition live getter and updater (for the current up-to-date reference).
|
|
82
|
+
* https://reactjs.org/docs/hooks-faq.html#why-am-i-seeing-stale-props-or-state-inside-my-function
|
|
83
|
+
*/
|
|
84
|
+
var useObjectMutator = (initalValue) => {
|
|
85
|
+
const [data, setData, dataRef] = useStateRef(initalValue);
|
|
86
|
+
return [
|
|
87
|
+
data,
|
|
88
|
+
(data) => {
|
|
89
|
+
setData(data);
|
|
90
|
+
},
|
|
91
|
+
(mutation) => {
|
|
92
|
+
setData((current) => update(current, mutation));
|
|
93
|
+
return dataRef.current;
|
|
94
|
+
}
|
|
95
|
+
];
|
|
96
|
+
};
|
|
97
|
+
/**
|
|
98
|
+
* Test data set generator and mutator.
|
|
99
|
+
*/
|
|
100
|
+
var useGraphGenerator = (options = {}) => {
|
|
101
|
+
const [data, setData, updateData] = useObjectMutator(options.data || {
|
|
102
|
+
nodes: [],
|
|
103
|
+
edges: []
|
|
104
|
+
});
|
|
105
|
+
let interval;
|
|
106
|
+
const mutator = () => {
|
|
107
|
+
const parent = data.nodes.length ? random.helpers.arrayElement(data.nodes) : void 0;
|
|
108
|
+
const node = createNode();
|
|
109
|
+
updateData({
|
|
110
|
+
nodes: { $push: [node] },
|
|
111
|
+
edges: Object.assign({}, parent && { $push: [createEdge(parent, node)] })
|
|
112
|
+
});
|
|
113
|
+
};
|
|
114
|
+
const reset = (options = { count: 0 }) => {
|
|
115
|
+
const { count = 0 } = options;
|
|
116
|
+
setData({
|
|
117
|
+
nodes: [],
|
|
118
|
+
edges: []
|
|
119
|
+
});
|
|
120
|
+
for (let i = 0; i < count; i++) mutator();
|
|
121
|
+
};
|
|
122
|
+
const start = ({ delay = 250 } = {}) => {
|
|
123
|
+
stop();
|
|
124
|
+
interval = setInterval(mutator, delay);
|
|
125
|
+
return stop;
|
|
126
|
+
};
|
|
127
|
+
const stop = () => {
|
|
128
|
+
if (interval) {
|
|
129
|
+
clearInterval(interval);
|
|
130
|
+
interval = void 0;
|
|
131
|
+
}
|
|
132
|
+
};
|
|
133
|
+
return {
|
|
134
|
+
data,
|
|
135
|
+
mutator,
|
|
136
|
+
reset,
|
|
137
|
+
start,
|
|
138
|
+
stop
|
|
139
|
+
};
|
|
140
|
+
};
|
|
141
|
+
//#endregion
|
|
142
|
+
//#region src/testing/model.ts
|
|
143
|
+
var TestGraphModel = class extends GraphModel.ReactiveGraphModel {
|
|
144
|
+
getRandomNode() {
|
|
145
|
+
return random.helpers.arrayElement(this._graph.nodes);
|
|
146
|
+
}
|
|
147
|
+
createNodes(node = void 0, n = 1) {
|
|
148
|
+
Array.from({ length: n }).forEach(() => {
|
|
149
|
+
const child = this.addNode(createNode());
|
|
150
|
+
const parent = node || random.helpers.arrayElement(this._graph.nodes);
|
|
151
|
+
if (parent) this.addEdge(createEdge(parent, child));
|
|
152
|
+
});
|
|
153
|
+
}
|
|
154
|
+
};
|
|
155
|
+
//#endregion
|
|
156
|
+
export { TestGraphModel, convertTreeToGraph, createEdge, createGraph, createNode, createNodes, createTree, seed, useGraphGenerator, useObjectMutator };
|
|
157
|
+
|
|
158
|
+
//# sourceMappingURL=testing.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"testing.mjs","names":[],"sources":["../../src/testing/data.ts","../../src/testing/hooks.ts","../../src/testing/model.ts"],"sourcesContent":["//\n// Copyright 2020 DXOS.org\n//\n\nimport { type Graph } from '@dxos/graph';\nimport { random } from '@dxos/random';\n\nimport { type TestNode } from './model';\n\n// https://www.npmjs.com/package/random#setting-a-randomness-seed\nexport const seed = (seed: number) => random.seed(seed);\n\n//\n// Create data.\n//\n\nexport const createNode = (type: string = undefined): TestNode => ({\n id: random.string.uuid(),\n type,\n label: random.lorem.words(3).replace(/ /g, '-'),\n});\n\nexport const createNodes = (n = 0, types?: string[]): TestNode[] =>\n Array.from({ length: n }, () => createNode(types ? random.helpers.arrayElement(types) : undefined));\n\nexport const createEdge = (source: TestNode, target: TestNode): Graph.Edge.Any => ({\n id: `${source.id}-${target.id}`,\n source: source.id,\n target: target.id,\n});\n\n/**\n * Creates a random tree.\n * @param depth Depth of tree.\n * @param children Branching factor.\n */\nexport const createTree = ({ depth = 2, children = 3 } = {}): TestNode => {\n const createChildren = (root: TestNode, d = 0) => {\n if (d < depth) {\n const max = Math.round(Math.log(depth + 1 - d) * children);\n const num = random.number.int({ min: 1, max });\n root.children = [...new Array(num)].map(() => {\n return createChildren(createNode(), d + 1);\n });\n }\n\n return root;\n };\n\n return createChildren(createNode());\n};\n\n/**\n * Converts a tree into a graph.\n * @param root\n */\nexport const convertTreeToGraph = (root: TestNode): Graph.Any => {\n const traverse = (node: TestNode, graph: Graph.Any) => {\n graph.nodes.push(node);\n node.children?.forEach((child) => {\n graph.edges.push(createEdge(node, child));\n traverse(child, graph);\n });\n\n return graph;\n };\n\n return traverse(root, {\n nodes: [],\n edges: [],\n });\n};\n\n/**\n * Creates a random graph.\n * @param numNodes\n * @param numEdges\n */\nexport const createGraph = (numNodes = 0, numEdges = 0, types?: string[]): Graph.Any => {\n const nodes = createNodes(numNodes, types);\n\n const edges = new Map();\n if (numEdges && nodes.length >= 2) {\n for (let i = 0; i < numEdges; i++) {\n const source = random.helpers.arrayElement(nodes);\n const target = random.helpers.arrayElement(nodes);\n if (source.id !== target.id) {\n const edge = createEdge(source, target);\n if (!edges.get(edge.id)) {\n edges.set(edge.id, edge);\n }\n }\n }\n }\n\n return {\n nodes,\n edges: Array.from(edges.values()),\n };\n};\n","//\n// Copyright 2020 DXOS.org\n//\n\nimport update from 'immutability-helper';\n\nimport { type Graph } from '@dxos/graph';\nimport { random } from '@dxos/random';\n\nimport { useStateRef } from '../hooks';\nimport { createEdge, createNode } from './data';\nimport { type TestNode } from './model';\n\nexport type ObjectMutator<T> = [\n T, // Current value.\n (data: T) => void, // Set value.\n (mutation: any) => T, // Apply update mutation.\n];\n\n/**\n * Returns a state object and setter, with addition live getter and updater (for the current up-to-date reference).\n * https://reactjs.org/docs/hooks-faq.html#why-am-i-seeing-stale-props-or-state-inside-my-function\n */\nexport const useObjectMutator = <T>(initalValue: T): ObjectMutator<T> => {\n const [data, setData, dataRef] = useStateRef<T>(initalValue);\n\n return [\n // Get data state (snapshot).\n data,\n\n // Update data state.\n (data: T) => {\n setData(data);\n },\n\n // Updater.\n // https://github.com/kolodny/immutability-helper\n // NOTE: Use $apply to update variable (e.g., push to potentially null object).\n (mutation: any): T => {\n setData((current) => update<T>(current, mutation));\n return dataRef.current;\n },\n ];\n};\n\n/**\n * Test data set generator and mutator.\n */\nexport const useGraphGenerator = (options: { data?: Graph.Any } = {}) => {\n const [data, setData, updateData] = useObjectMutator(options.data || { nodes: [], edges: [] });\n\n let interval;\n\n const mutator = () => {\n const parent = data.nodes.length ? random.helpers.arrayElement(data.nodes) : undefined;\n const node = createNode();\n\n updateData({\n nodes: {\n $push: [node],\n },\n edges: Object.assign(\n {},\n parent && {\n $push: [createEdge(parent as TestNode, node)],\n },\n ),\n });\n };\n\n const reset = (options = { count: 0 }) => {\n const { count = 0 } = options;\n setData({\n nodes: [],\n edges: [],\n });\n\n for (let i = 0; i < count; i++) {\n mutator();\n }\n };\n\n const start = ({ delay = 250 } = {}) => {\n stop();\n interval = setInterval(mutator, delay);\n return stop;\n };\n\n const stop = () => {\n if (interval) {\n clearInterval(interval);\n interval = undefined;\n }\n };\n\n return {\n data,\n mutator,\n reset,\n start,\n stop,\n };\n};\n","//\n// Copyright 2022 DXOS.org\n//\n\nimport { type Graph, GraphModel } from '@dxos/graph';\nimport { random } from '@dxos/random';\n\nimport { createEdge, createNode } from './data';\n\nexport type TestNode = Graph.Node.Any & {\n label?: string;\n children?: TestNode[];\n};\n\nexport class TestGraphModel extends GraphModel.ReactiveGraphModel<TestNode> {\n getRandomNode() {\n return random.helpers.arrayElement(this._graph.nodes);\n }\n\n createNodes(node: TestNode = undefined, n = 1): void {\n Array.from({ length: n }).forEach(() => {\n const child = this.addNode(createNode());\n const parent = node || random.helpers.arrayElement(this._graph.nodes);\n if (parent) {\n this.addEdge(createEdge(parent, child));\n }\n });\n }\n}\n"],"mappings":";;;;;AAUA,IAAa,QAAQ,SAAiB,OAAO,KAAK,IAAI;AAMtD,IAAa,cAAc,OAAe,KAAA,OAAyB;CACjE,IAAI,OAAO,OAAO,KAAK;CACvB;CACA,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,GAAG;AAChD;AAEA,IAAa,eAAe,IAAI,GAAG,UACjC,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,WAAW,QAAQ,OAAO,QAAQ,aAAa,KAAK,IAAI,KAAA,CAAS,CAAC;AAEpG,IAAa,cAAc,QAAkB,YAAsC;CACjF,IAAI,GAAG,OAAO,GAAG,GAAG,OAAO;CAC3B,QAAQ,OAAO;CACf,QAAQ,OAAO;AACjB;;;;;;AAOA,IAAa,cAAc,EAAE,QAAQ,GAAG,WAAW,MAAM,CAAC,MAAgB;CACxE,MAAM,kBAAkB,MAAgB,IAAI,MAAM;EAChD,IAAI,IAAI,OAAO;GACb,MAAM,MAAM,KAAK,MAAM,KAAK,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ;GACzD,MAAM,MAAM,OAAO,OAAO,IAAI;IAAE,KAAK;IAAG;GAAI,CAAC;GAC7C,KAAK,WAAW,CAAC,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU;IAC5C,OAAO,eAAe,WAAW,GAAG,IAAI,CAAC;GAC3C,CAAC;EACH;EAEA,OAAO;CACT;CAEA,OAAO,eAAe,WAAW,CAAC;AACpC;;;;;AAMA,IAAa,sBAAsB,SAA8B;CAC/D,MAAM,YAAY,MAAgB,UAAqB;EACrD,MAAM,MAAM,KAAK,IAAI;EACrB,KAAK,UAAU,SAAS,UAAU;GAChC,MAAM,MAAM,KAAK,WAAW,MAAM,KAAK,CAAC;GACxC,SAAS,OAAO,KAAK;EACvB,CAAC;EAED,OAAO;CACT;CAEA,OAAO,SAAS,MAAM;EACpB,OAAO,CAAC;EACR,OAAO,CAAC;CACV,CAAC;AACH;;;;;;AAOA,IAAa,eAAe,WAAW,GAAG,WAAW,GAAG,UAAgC;CACtF,MAAM,QAAQ,YAAY,UAAU,KAAK;CAEzC,MAAM,wBAAQ,IAAI,IAAI;CACtB,IAAI,YAAY,MAAM,UAAU,GAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;EACjC,MAAM,SAAS,OAAO,QAAQ,aAAa,KAAK;EAChD,MAAM,SAAS,OAAO,QAAQ,aAAa,KAAK;EAChD,IAAI,OAAO,OAAO,OAAO,IAAI;GAC3B,MAAM,OAAO,WAAW,QAAQ,MAAM;GACtC,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,GACpB,MAAM,IAAI,KAAK,IAAI,IAAI;EAE3B;CACF;CAGF,OAAO;EACL;EACA,OAAO,MAAM,KAAK,MAAM,OAAO,CAAC;CAClC;AACF;;;;;;;AC5EA,IAAa,oBAAuB,gBAAqC;CACvE,MAAM,CAAC,MAAM,SAAS,WAAW,YAAe,WAAW;CAE3D,OAAO;EAEL;GAGC,SAAY;GACX,QAAQ,IAAI;EACd;GAKC,aAAqB;GACpB,SAAS,YAAY,OAAU,SAAS,QAAQ,CAAC;GACjD,OAAO,QAAQ;EACjB;CACF;AACF;;;;AAKA,IAAa,qBAAqB,UAAgC,CAAC,MAAM;CACvE,MAAM,CAAC,MAAM,SAAS,cAAc,iBAAiB,QAAQ,QAAQ;EAAE,OAAO,CAAC;EAAG,OAAO,CAAC;CAAE,CAAC;CAE7F,IAAI;CAEJ,MAAM,gBAAgB;EACpB,MAAM,SAAS,KAAK,MAAM,SAAS,OAAO,QAAQ,aAAa,KAAK,KAAK,IAAI,KAAA;EAC7E,MAAM,OAAO,WAAW;EAExB,WAAW;GACT,OAAO,EACL,OAAO,CAAC,IAAI,EACd;GACA,OAAO,OAAO,OACZ,CAAC,GACD,UAAU,EACR,OAAO,CAAC,WAAW,QAAoB,IAAI,CAAC,EAC9C,CACF;EACF,CAAC;CACH;CAEA,MAAM,SAAS,UAAU,EAAE,OAAO,EAAE,MAAM;EACxC,MAAM,EAAE,QAAQ,MAAM;EACtB,QAAQ;GACN,OAAO,CAAC;GACR,OAAO,CAAC;EACV,CAAC;EAED,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ;CAEZ;CAEA,MAAM,SAAS,EAAE,QAAQ,QAAQ,CAAC,MAAM;EACtC,KAAK;EACL,WAAW,YAAY,SAAS,KAAK;EACrC,OAAO;CACT;CAEA,MAAM,aAAa;EACjB,IAAI,UAAU;GACZ,cAAc,QAAQ;GACtB,WAAW,KAAA;EACb;CACF;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;;;ACxFA,IAAa,iBAAb,cAAoC,WAAW,mBAA6B;CAC1E,gBAAgB;EACd,OAAO,OAAO,QAAQ,aAAa,KAAK,OAAO,KAAK;CACtD;CAEA,YAAY,OAAiB,KAAA,GAAW,IAAI,GAAS;EACnD,MAAM,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,cAAc;GACtC,MAAM,QAAQ,KAAK,QAAQ,WAAW,CAAC;GACvC,MAAM,SAAS,QAAQ,OAAO,QAAQ,aAAa,KAAK,OAAO,KAAK;GACpE,IAAI,QACF,KAAK,QAAQ,WAAW,QAAQ,KAAK,CAAC;EAE1C,CAAC;CACH;AACF"}
|