25 lines
861 B
JavaScript
25 lines
861 B
JavaScript
import has from 'lodash/has'; // @ts-expect-error
|
|
|
|
import toposort from 'toposort';
|
|
import { split } from 'property-expr';
|
|
import Ref from '../Reference';
|
|
import isSchema from './isSchema';
|
|
export default function sortFields(fields, excludedEdges = []) {
|
|
let edges = [];
|
|
let nodes = new Set();
|
|
let excludes = new Set(excludedEdges.map(([a, b]) => `${a}-${b}`));
|
|
|
|
function addNode(depPath, key) {
|
|
let node = split(depPath)[0];
|
|
nodes.add(node);
|
|
if (!excludes.has(`${key}-${node}`)) edges.push([key, node]);
|
|
}
|
|
|
|
for (const key in fields) if (has(fields, key)) {
|
|
let value = fields[key];
|
|
nodes.add(key);
|
|
if (Ref.isRef(value) && value.isSibling) addNode(value.path, key);else if (isSchema(value) && 'deps' in value) value.deps.forEach(path => addNode(path, key));
|
|
}
|
|
|
|
return toposort.array(Array.from(nodes), edges).reverse();
|
|
} |