GitHub/jsoncrack.com
1
0
Fork 0
mirror of https://github.com/AykutSarac/jsoncrack.com.git synced 2025-01-12 19:02:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

create node for object key

Browse Source
This commit is contained in:
AykutSarac 2022-02-02 02:25:14 +03:00
parent 2e44f635fc
commit 67fd016330
1 changed files with 4 additions and 86 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

90
src/utils/json-editor-parser.js
View File

@ -1,88 +1,6 @@
export function transform(source = [], result = [], nodeInfo = {}) {
let { id = 0, parent = null, pAggregate = null, edgeItems = [] } = nodeInfo;
const createEdgeItem = (id, pid) => ({
id: `e${id}-${pid}`,
source: id.toString(),
target: pid.toString(),
});
if (Array.isArray(source)) {
result.push(
...source.flatMap((item, idx) =>
parser(item, [], {
id: (id + idx).toString(),
parent,
pAggregate,
edgeItems,
})
)
);
} else {
Object.entries(source).forEach(([key, value], idx) => {
const dataNode = {};
if (value && (Array.isArray(value) || typeof value === "object")) {
// every object's iterable property is supposed
// to be created as an own parent entity.
result.push(
Object.assign(dataNode, {
id: (++id).toString(),
data: { label: key },
position: { x: 0, y: 0 },
type: "special",
})
);
if (parent !== null) {
edgeItems.push(createEdgeItem(id, parent.id));
}
parent = dataNode;
result.push(
...parser(value, [], {
id,
parent,
pAggregate,
edgeItems,
})
);
} else {
if (idx === 0) {
// every object's first property (though not iterable)
// is supposed to be created as an own parent entity.
result.push(
Object.assign(dataNode, {
id: (++id).toString(),
data: { label: { [key]: value } },
position: { x: 0, y: 0 },
type: "special",
})
);
if (parent !== null) {
edgeItems.push(createEdgeItem(id, parent.id));
}
pAggregate = parent = dataNode;
} else {
// aggreagat all non interable properties at
// most recent, recursion-free parent level.
pAggregate.data.label[key] = value;
}
}
});
}
if (parent === null) {
// append all additionally collected edge items
// in the end of all the recursion.
result.push(...edgeItems);
}
return result;
}
export const parser = (input) => {
if (!Array.isArray(input)) input = [input];
const extract = (
os,
nextId = (
@ -90,7 +8,7 @@ export const parser = (input) => {
String(++id)
)(0)
) =>
os.map((o) => ({
[os].flat().map((o) => ({
id: nextId(),
data: {
label: Object.fromEntries(
@ -100,7 +18,7 @@ export const parser = (input) => {
position: { x: 0, y: 0 },
type: "special",
children: Object.entries(o)
.filter(([k, v]) => Array.isArray(v))
.filter(([k, v]) => Array.isArray(v) || typeof v === "object")
.flatMap(([k, v]) => [
{
id: nextId(),