lucent/lucent-laravel
2
0
Fork 0
Code Issues 14 Pull Requests Releases 1 Activity

edges reordser fix

Browse Source
This commit is contained in:
Alex Lingris
2023-11-01 13:09:32 +02:00
parent 7ac59fc0fe
commit 1442b68503
4 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files
front/dist/assets/main.016edc6c.js → front/dist/assets/main.96863591.js
Vendored
+1 -1
View File
File diff suppressed because one or more lines are too long
front/dist/manifest.json
Vendored
+1 -1
View File
@@ -1,6 +1,6 @@
{ {
"main.js": { "main.js": {
"file": "assets/main.016edc6c.js", "file": "assets/main.96863591.js",
"src": "main.js", "src": "main.js",
"isEntry": true, "isEntry": true,
"css": [ "css": [
front/js/svelte/records/elements/ReferenceTable.svelte
-1
View File
@@ -21,7 +21,6 @@
.map((edge) => { .map((edge) => {
return graph.records.find((increc) => increc.id === edge.target && record.id === edge.source); return graph.records.find((increc) => increc.id === edge.target && record.id === edge.source);
}).filter((rec) => (rec?.id ? true : false)) ?? []; }).filter((rec) => (rec?.id ? true : false)) ?? [];
let collections = channel.schemas.filter((aschema) => let collections = channel.schemas.filter((aschema) =>
field.collections.includes(aschema.name) field.collections.includes(aschema.name)
); );
front/js/svelte/records/elements/reference.js
+2 -1
View File
@@ -8,6 +8,7 @@ export function insertEdges(graph, sourceRecord, targetRecords, fieldName, actio
sourceSchema: sourceRecord.schema, sourceSchema: sourceRecord.schema,
targetSchema: r.schema, targetSchema: r.schema,
field: fieldName, field: fieldName,
depth: 1,
rank: "" rank: ""
}; };
}); });
@@ -18,6 +19,6 @@ export function insertEdges(graph, sourceRecord, targetRecords, fieldName, actio
} }
graph.records = uniqBy([...graph.records, ...targetRecords], (r) => r.id); graph.records = uniqBy([...graph.records, ...targetRecords], (r) => r.id);
graph.edges = uniqBy([...replacedEdges, ...newEdges], (edge) => edge.source + edge.target + edge.field); graph.edges = uniqBy([...replacedEdges, ...newEdges], (edge) => edge.source + edge.target + edge.field + edge.depth);
return graph; return graph;
} }