@knowvah/dot-engine 2.9.0 → 2.10.1
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/common/graph-init.d.ts.map +1 -1
- package/dist/common/htmltable.d.ts +1 -1
- package/dist/common/htmltable.d.ts.map +1 -1
- package/dist/common/poly-init.d.ts +8 -8
- package/dist/common/poly-init.d.ts.map +1 -1
- package/dist/common/safefile.d.ts +15 -0
- package/dist/common/safefile.d.ts.map +1 -1
- package/dist/gvc/context.d.ts +7 -1
- package/dist/gvc/context.d.ts.map +1 -1
- package/dist/gvc/device.d.ts +2 -3
- package/dist/gvc/device.d.ts.map +1 -1
- package/dist/gvc/emit-xdot.d.ts +11 -0
- package/dist/gvc/emit-xdot.d.ts.map +1 -0
- package/dist/gvc/image-resolver.d.ts +5 -0
- package/dist/gvc/image-resolver.d.ts.map +1 -1
- package/dist/gvc/init-xdot.d.ts +7 -0
- package/dist/gvc/init-xdot.d.ts.map +1 -0
- package/dist/gvc/landscape.d.ts +11 -0
- package/dist/gvc/landscape.d.ts.map +1 -0
- package/dist/gvc/layout-bb.d.ts +17 -0
- package/dist/gvc/layout-bb.d.ts.map +1 -0
- package/dist/gvc/layout-reset.d.ts +26 -0
- package/dist/gvc/layout-reset.d.ts.map +1 -0
- package/dist/gvc/viewport.d.ts +1 -10
- package/dist/gvc/viewport.d.ts.map +1 -1
- package/dist/index.js +2497 -1650
- package/dist/index.js.map +4 -4
- package/dist/layout/circo/blocks.d.ts +2 -0
- package/dist/layout/circo/blocks.d.ts.map +1 -1
- package/dist/layout/circo/blocktree.d.ts +6 -0
- package/dist/layout/circo/blocktree.d.ts.map +1 -1
- package/dist/layout/circo/circular.d.ts +6 -0
- package/dist/layout/circo/circular.d.ts.map +1 -1
- package/dist/layout/dot/edge-route-rank.d.ts +34 -0
- package/dist/layout/dot/edge-route-rank.d.ts.map +1 -1
- package/dist/layout/dot/index.d.ts.map +1 -1
- package/dist/layout/dot/init.d.ts.map +1 -1
- package/dist/layout/dot/splines-flat-labeled.d.ts.map +1 -1
- package/dist/layout/dot/splines-flat-multi.d.ts.map +1 -1
- package/dist/layout/dot/splines-flat.d.ts +1 -2
- package/dist/layout/dot/splines-flat.d.ts.map +1 -1
- package/dist/layout/dot/splines.d.ts +2 -2
- package/dist/layout/dot/splines.d.ts.map +1 -1
- package/dist/layout/neato/__fixtures__/kk-models.d.ts +59 -0
- package/dist/layout/neato/__fixtures__/kk-models.d.ts.map +1 -0
- package/dist/layout/neato/__fixtures__/quad-prog-vpsc-dir1-n40.d.ts +12 -0
- package/dist/layout/neato/__fixtures__/quad-prog-vpsc-dir1-n40.d.ts.map +1 -0
- package/dist/layout/neato/__fixtures__/quad-prog-vpsc.d.ts +6 -0
- package/dist/layout/neato/__fixtures__/quad-prog-vpsc.d.ts.map +1 -1
- package/dist/layout/neato/circuit.d.ts +38 -0
- package/dist/layout/neato/circuit.d.ts.map +1 -1
- package/dist/layout/neato/constrained-majorization.d.ts.map +1 -1
- package/dist/layout/neato/dijkstra.d.ts +7 -0
- package/dist/layout/neato/dijkstra.d.ts.map +1 -1
- package/dist/layout/neato/index.d.ts +6 -3
- package/dist/layout/neato/index.d.ts.map +1 -1
- package/dist/layout/neato/init.d.ts.map +1 -1
- package/dist/layout/neato/kk-paths.d.ts +11 -1
- package/dist/layout/neato/kk-paths.d.ts.map +1 -1
- package/dist/layout/neato/kk-solve.d.ts.map +1 -1
- package/dist/layout/neato/kk.d.ts +5 -3
- package/dist/layout/neato/kk.d.ts.map +1 -1
- package/dist/layout/neato/kkutils.d.ts +45 -0
- package/dist/layout/neato/kkutils.d.ts.map +1 -1
- package/dist/layout/neato/splines.d.ts +7 -3
- package/dist/layout/neato/splines.d.ts.map +1 -1
- package/dist/layout/neato/start.d.ts +11 -10
- package/dist/layout/neato/start.d.ts.map +1 -1
- package/dist/layout/neato/stress-models.d.ts +25 -19
- package/dist/layout/neato/stress-models.d.ts.map +1 -1
- package/dist/layout/pack/ccomps.d.ts +32 -0
- package/dist/layout/pack/ccomps.d.ts.map +1 -0
- package/dist/layout/pack/index.d.ts +1 -24
- package/dist/layout/pack/index.d.ts.map +1 -1
- package/dist/layout/sfdp/init.d.ts.map +1 -1
- package/dist/render/dot/write-back.d.ts +37 -0
- package/dist/render/dot/write-back.d.ts.map +1 -0
- package/dist/render/dot.d.ts +5 -7
- package/dist/render/dot.d.ts.map +1 -1
- package/dist/render/json.d.ts +16 -21
- package/dist/render/json.d.ts.map +1 -1
- package/dist/render.js +2899 -2052
- package/dist/render.js.map +4 -4
- package/dist/util/libcxx-sort.d.ts +7 -0
- package/dist/util/libcxx-sort.d.ts.map +1 -0
- package/dist/vpsc/SweepLine.d.ts +23 -10
- package/dist/vpsc/SweepLine.d.ts.map +1 -1
- package/dist/vpsc/sweepTypes.d.ts +12 -2
- package/dist/vpsc/sweepTypes.d.ts.map +1 -1
- package/package.json +1 -1
- package/src/common/graph-init.ts +5 -1
- package/src/common/htmltable.ts +6 -4
- package/src/common/poly-init.ts +35 -15
- package/src/common/safefile.ts +20 -2
- package/src/gvc/__fixtures__/p8/bad.png +1 -0
- package/src/gvc/__fixtures__/p8/d/r.png +0 -0
- package/src/gvc/__fixtures__/p8/html-img-bad.gv +1 -0
- package/src/gvc/__fixtures__/p8/html-img-bad.svg +19 -0
- package/src/gvc/__fixtures__/p8/html-img-bad.svg.stderr +3 -0
- package/src/gvc/__fixtures__/p8/html-img-bad.xdot +13 -0
- package/src/gvc/__fixtures__/p8/html-img-bad.xdot.stderr +3 -0
- package/src/gvc/__fixtures__/p8/ip-shapefile.gv +1 -0
- package/src/gvc/__fixtures__/p8/ip-shapefile.svg +19 -0
- package/src/gvc/__fixtures__/p8/ip-shapefile.svg.stderr +0 -0
- package/src/gvc/__fixtures__/p8/ip-shapefile.xdot +15 -0
- package/src/gvc/__fixtures__/p8/ip-shapefile.xdot.stderr +0 -0
- package/src/gvc/__fixtures__/p8/regen.sh +13 -0
- package/src/gvc/__fixtures__/replay-native.json +422 -0
- package/src/gvc/__fixtures__/rerender/background.dot.seq-xdot-svg.1 +25 -0
- package/src/gvc/__fixtures__/rerender/background.dot.seq-xdot-svg.2 +37 -0
- package/src/gvc/__fixtures__/rerender/background.gv +1 -0
- package/src/gvc/__fixtures__/rerender/cluster-lrvn.dot.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/cluster-lrvn.dot.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/cluster-lrvn.dot.xdot.1 +25 -0
- package/src/gvc/__fixtures__/rerender/cluster-lrvn.dot.xdot.2 +25 -0
- package/src/gvc/__fixtures__/rerender/cluster-lrvn.gv +1 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.plain.1 +7 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.plain.2 +7 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-dot-dot.1 +18 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-dot-dot.2 +18 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-plain-xdot.1 +7 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-plain-xdot.2 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-dot.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-dot.2 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-plain.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-plain.2 +7 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-svg.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-svg.2 +46 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-then-svg.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-then-svg.2 +47 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-xdot.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.seq-xdot-xdot.2 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.xdot.1 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.dot.xdot.2 +33 -0
- package/src/gvc/__fixtures__/rerender/cluster-skeleton.gv +1 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.circo.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.then-circo.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.then-fdp.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.plain.then-neato.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-dot-dot.1 +11 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-dot-dot.2 +11 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-json-json.1 +148 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-json-json.2 +162 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-plain-xdot.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-plain-xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-dot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-dot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-plain.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-svg.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-svg.2 +30 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-then-svg.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-then-svg.2 +31 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.seq-xdot-xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.dot.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.fdp.xdot.2 +21 -0
- package/src/gvc/__fixtures__/rerender/filing.gv +1 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.seq-xdot-then-svg.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.seq-xdot-then-svg.2 +31 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.neato.xdot.2 +21 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.osage.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.patchwork.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.sfdp.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.plain.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.plain.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.plain.nofree.1 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.plain.nofree.2 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.plain.nofree.3 +5 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.xdot.1 +20 -0
- package/src/gvc/__fixtures__/rerender/filing.twopi.xdot.2 +20 -0
- package/src/gvc/__fixtures__/rerender/mixed.circo.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.circo.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.circo.xdot.1 +103 -0
- package/src/gvc/__fixtures__/rerender/mixed.circo.xdot.2 +104 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-dot-dot.1 +75 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-dot-dot.2 +75 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-plain-xdot.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-plain-xdot.2 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-dot.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-dot.2 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-plain.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-svg.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-svg.2 +127 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-then-svg.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-then-svg.2 +128 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-xdot.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.seq-xdot-xdot.2 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.xdot.1 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.dot.xdot.2 +119 -0
- package/src/gvc/__fixtures__/rerender/mixed.fdp.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.fdp.xdot.1 +117 -0
- package/src/gvc/__fixtures__/rerender/mixed.gv +8 -0
- package/src/gvc/__fixtures__/rerender/mixed.neato.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.neato.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.neato.xdot.1 +117 -0
- package/src/gvc/__fixtures__/rerender/mixed.neato.xdot.2 +118 -0
- package/src/gvc/__fixtures__/rerender/mixed.osage.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.osage.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.osage.xdot.1 +117 -0
- package/src/gvc/__fixtures__/rerender/mixed.osage.xdot.2 +117 -0
- package/src/gvc/__fixtures__/rerender/mixed.patchwork.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.patchwork.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.patchwork.xdot.1 +78 -0
- package/src/gvc/__fixtures__/rerender/mixed.patchwork.xdot.2 +79 -0
- package/src/gvc/__fixtures__/rerender/mixed.sfdp.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.sfdp.xdot.1 +103 -0
- package/src/gvc/__fixtures__/rerender/mixed.twopi.plain.1 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.twopi.plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/mixed.twopi.xdot.1 +103 -0
- package/src/gvc/__fixtures__/rerender/mixed.twopi.xdot.2 +103 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.dot.plain.nofree.1 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.dot.plain.nofree.2 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.dot.plain.nofree.3 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.fdp.plain.nofree.1 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.fdp.plain.nofree.2 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.fdp.plain.nofree.3 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.gv +16 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.patchwork.plain.nofree.1 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.patchwork.plain.nofree.2 +29 -0
- package/src/gvc/__fixtures__/rerender/multi-edge.patchwork.plain.nofree.3 +29 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.gv +1 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-dot-plain.1 +34 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-dot-plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-json-plain.1 +471 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-json-plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-json0-plain.1 +121 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-json0-plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-xdot-plain.1 +60 -0
- package/src/gvc/__fixtures__/rerender/neato-pos.neato.seq-xdot-plain.2 +18 -0
- package/src/gvc/__fixtures__/rerender/regen.sh +81 -0
- package/src/gvc/__fixtures__/rerender/sized-clip.gv +18 -0
- package/src/gvc/__fixtures__/rerender/sized-clip.neato.xdot.1 +86 -0
- package/src/gvc/__fixtures__/rerender/sized-clip.neato.xdot.2 +86 -0
- package/src/gvc/context.ts +13 -1
- package/src/gvc/device.ts +6 -6
- package/src/gvc/emit-xdot.ts +208 -0
- package/src/gvc/image-resolver.ts +8 -0
- package/src/gvc/init-xdot.ts +36 -0
- package/src/gvc/landscape.ts +36 -0
- package/src/gvc/layout-bb.ts +43 -0
- package/src/gvc/layout-reset.ts +62 -0
- package/src/gvc/viewport.ts +1 -32
- package/src/layout/circo/__fixtures__/root/both-connected.gv +11 -0
- package/src/layout/circo/__fixtures__/root/both-connected.xdot +53 -0
- package/src/layout/circo/__fixtures__/root/both-connected.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/both-per-component.gv +18 -0
- package/src/layout/circo/__fixtures__/root/both-per-component.xdot +97 -0
- package/src/layout/circo/__fixtures__/root/both-per-component.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/graph-none-node.gv +11 -0
- package/src/layout/circo/__fixtures__/root/graph-none-node.xdot +53 -0
- package/src/layout/circo/__fixtures__/root/graph-none-node.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/graph-root-first.gv +17 -0
- package/src/layout/circo/__fixtures__/root/graph-root-first.xdot +96 -0
- package/src/layout/circo/__fixtures__/root/graph-root-first.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/graph-root-later.gv +17 -0
- package/src/layout/circo/__fixtures__/root/graph-root-later.xdot +96 -0
- package/src/layout/circo/__fixtures__/root/graph-root-later.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/graph-root-none.gv +17 -0
- package/src/layout/circo/__fixtures__/root/graph-root-none.xdot +96 -0
- package/src/layout/circo/__fixtures__/root/graph-root-none.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/graph-root-paths.gv +7 -0
- package/src/layout/circo/__fixtures__/root/graph-root-paths.xdot +46 -0
- package/src/layout/circo/__fixtures__/root/graph-root-paths.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/no-root-connected.gv +9 -0
- package/src/layout/circo/__fixtures__/root/no-root-connected.xdot +51 -0
- package/src/layout/circo/__fixtures__/root/no-root-connected.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/no-root.gv +16 -0
- package/src/layout/circo/__fixtures__/root/no-root.xdot +95 -0
- package/src/layout/circo/__fixtures__/root/no-root.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/node-root-connected.gv +10 -0
- package/src/layout/circo/__fixtures__/root/node-root-connected.xdot +52 -0
- package/src/layout/circo/__fixtures__/root/node-root-connected.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/node-root-false.gv +10 -0
- package/src/layout/circo/__fixtures__/root/node-root-false.xdot +52 -0
- package/src/layout/circo/__fixtures__/root/node-root-false.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/node-root-later.gv +17 -0
- package/src/layout/circo/__fixtures__/root/node-root-later.xdot +96 -0
- package/src/layout/circo/__fixtures__/root/node-root-later.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/node-root-two.gv +11 -0
- package/src/layout/circo/__fixtures__/root/node-root-two.xdot +53 -0
- package/src/layout/circo/__fixtures__/root/node-root-two.xdot.stderr +0 -0
- package/src/layout/circo/__fixtures__/root/regen.sh +16 -0
- package/src/layout/circo/blocks.ts +3 -0
- package/src/layout/circo/blocktree.ts +17 -3
- package/src/layout/circo/circular.ts +13 -1
- package/src/layout/dot/edge-route-rank.ts +72 -0
- package/src/layout/dot/edge-route.ts +6 -6
- package/src/layout/dot/index.ts +2 -0
- package/src/layout/dot/init.ts +17 -5
- package/src/layout/dot/splines-flat-labeled.ts +2 -1
- package/src/layout/dot/splines-flat-multi.ts +2 -1
- package/src/layout/dot/splines-flat.ts +3 -3
- package/src/layout/dot/splines.ts +9 -9
- package/src/layout/neato/__fixtures__/kk-models.ts +82 -0
- package/src/layout/neato/__fixtures__/models/hier-circuit.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-circuit.xdot +92 -0
- package/src/layout/neato/__fixtures__/models/hier-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-default.gv +14 -0
- package/src/layout/neato/__fixtures__/models/hier-default.xdot +91 -0
- package/src/layout/neato/__fixtures__/models/hier-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-disc-circuit.gv +9 -0
- package/src/layout/neato/__fixtures__/models/hier-disc-circuit.xdot +54 -0
- package/src/layout/neato/__fixtures__/models/hier-disc-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-len-circuit.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-len-circuit.xdot +97 -0
- package/src/layout/neato/__fixtures__/models/hier-len-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-len-mds.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-len-mds.xdot +97 -0
- package/src/layout/neato/__fixtures__/models/hier-len-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-len-subset.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-len-subset.xdot +97 -0
- package/src/layout/neato/__fixtures__/models/hier-len-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-long-mds.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-long-mds.xdot +95 -0
- package/src/layout/neato/__fixtures__/models/hier-long-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-mds-nolen.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-mds-nolen.xdot +92 -0
- package/src/layout/neato/__fixtures__/models/hier-mds-nolen.xdot.stderr +2 -0
- package/src/layout/neato/__fixtures__/models/hier-pin-disc-circuit.gv +10 -0
- package/src/layout/neato/__fixtures__/models/hier-pin-disc-circuit.xdot +54 -0
- package/src/layout/neato/__fixtures__/models/hier-pin-disc-circuit.xdot.stderr +3 -0
- package/src/layout/neato/__fixtures__/models/hier-shortpath.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-shortpath.xdot +92 -0
- package/src/layout/neato/__fixtures__/models/hier-shortpath.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/hier-subset.gv +15 -0
- package/src/layout/neato/__fixtures__/models/hier-subset.xdot +92 -0
- package/src/layout/neato/__fixtures__/models/hier-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-circuit.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-circuit.xdot +81 -0
- package/src/layout/neato/__fixtures__/models/kk-circuit.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-default.gv +14 -0
- package/src/layout/neato/__fixtures__/models/kk-default.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/kk-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit-pack.gv +10 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit-pack.native-crash +1 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit-pack.xdot +0 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit-pack.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit.gv +9 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit.xdot +49 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-circuit.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-shortpath-pack.gv +10 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-shortpath-pack.xdot +50 -0
- package/src/layout/neato/__fixtures__/models/kk-disc-shortpath-pack.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-circuit-pack.gv +13 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-circuit-pack.native-crash +1 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-circuit-pack.xdot +0 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-circuit-pack.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-shortpath-pack.gv +13 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-shortpath-pack.xdot +66 -0
- package/src/layout/neato/__fixtures__/models/kk-disc4-shortpath-pack.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-circuit.gv +11 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-circuit.xdot +51 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-circuit.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-circuit.gv +11 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-circuit.xdot +57 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-circuit.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-mds.gv +11 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-mds.xdot +57 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-len-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-long-mds.gv +11 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-long-mds.xdot +57 -0
- package/src/layout/neato/__fixtures__/models/kk-iso-long-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-large.gv +203 -0
- package/src/layout/neato/__fixtures__/models/kk-large.pow.json +1088 -0
- package/src/layout/neato/__fixtures__/models/kk-large.xdot +1208 -0
- package/src/layout/neato/__fixtures__/models/kk-large.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-len-circuit.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-len-circuit.xdot +86 -0
- package/src/layout/neato/__fixtures__/models/kk-len-circuit.xdot.stderr +4 -0
- package/src/layout/neato/__fixtures__/models/kk-len-mds.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-len-mds.xdot +86 -0
- package/src/layout/neato/__fixtures__/models/kk-len-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-len-subset.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-len-subset.xdot +86 -0
- package/src/layout/neato/__fixtures__/models/kk-len-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-mds-nolen.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-mds-nolen.xdot +81 -0
- package/src/layout/neato/__fixtures__/models/kk-mds-nolen.xdot.stderr +2 -0
- package/src/layout/neato/__fixtures__/models/kk-shortpath.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-shortpath.xdot +81 -0
- package/src/layout/neato/__fixtures__/models/kk-shortpath.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/kk-subset.gv +15 -0
- package/src/layout/neato/__fixtures__/models/kk-subset.xdot +81 -0
- package/src/layout/neato/__fixtures__/models/kk-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/large-circuit.gv +203 -0
- package/src/layout/neato/__fixtures__/models/large-circuit.xdot +1208 -0
- package/src/layout/neato/__fixtures__/models/large-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-circuit.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-circuit.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-default.gv +13 -0
- package/src/layout/neato/__fixtures__/models/major-default.xdot +79 -0
- package/src/layout/neato/__fixtures__/models/major-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-disc-circuit.gv +8 -0
- package/src/layout/neato/__fixtures__/models/major-disc-circuit.xdot +48 -0
- package/src/layout/neato/__fixtures__/models/major-disc-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-len-circuit.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-len-circuit.xdot +85 -0
- package/src/layout/neato/__fixtures__/models/major-len-circuit.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-len-mds.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-len-mds.xdot +85 -0
- package/src/layout/neato/__fixtures__/models/major-len-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-len-subset.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-len-subset.xdot +85 -0
- package/src/layout/neato/__fixtures__/models/major-len-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-long-mds.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-long-mds.xdot +83 -0
- package/src/layout/neato/__fixtures__/models/major-long-mds.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-long-shortpath.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-long-shortpath.xdot +83 -0
- package/src/layout/neato/__fixtures__/models/major-long-shortpath.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-mds-edge-default.gv +15 -0
- package/src/layout/neato/__fixtures__/models/major-mds-edge-default.xdot +81 -0
- package/src/layout/neato/__fixtures__/models/major-mds-edge-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen-anon.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen-anon.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen-anon.xdot.stderr +2 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-mds-nolen.xdot.stderr +2 -0
- package/src/layout/neato/__fixtures__/models/major-model-Subset.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-model-Subset.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-model-Subset.xdot.stderr +1 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo-anon.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo-anon.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo-anon.xdot.stderr +1 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-model-foo.xdot.stderr +1 -0
- package/src/layout/neato/__fixtures__/models/major-pin-disc-circuit.gv +9 -0
- package/src/layout/neato/__fixtures__/models/major-pin-disc-circuit.xdot +48 -0
- package/src/layout/neato/__fixtures__/models/major-pin-disc-circuit.xdot.stderr +2 -0
- package/src/layout/neato/__fixtures__/models/major-shortpath.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-shortpath.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-shortpath.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/major-subset.gv +14 -0
- package/src/layout/neato/__fixtures__/models/major-subset.xdot +80 -0
- package/src/layout/neato/__fixtures__/models/major-subset.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/models/regen.sh +46 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-default.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-default.xdot +115 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-epsilon.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-epsilon.xdot +116 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-epsilon.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiter3.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiter3.xdot +116 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiter3.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiterneg.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiterneg.xdot +116 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-maxiterneg.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-stresswt.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-stresswt.xdot +116 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/hier-stresswt.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-default.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-default.xdot +102 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-epsilon.gv +19 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-epsilon.xdot +103 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-epsilon.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiter3.gv +19 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiter3.xdot +103 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiter3.xdot.stderr +3 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiterneg.gv +19 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiterneg.xdot +103 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-maxiterneg.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-stresswt.gv +19 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-stresswt.xdot +103 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/kk-stresswt.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-default.gv +16 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-default.xdot +100 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-epsilon.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-epsilon.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-epsilon.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-cluster.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-cluster.xdot +106 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-cluster.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-pin.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-pin.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3-pin.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiter3.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiterneg.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiterneg.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-maxiterneg.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-stresswt.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-stresswt.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/major-stresswt.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/regen.sh +16 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-default.gv +17 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-default.xdot +101 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-default.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-epsilon.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-epsilon.xdot +102 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-epsilon.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiter3.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiter3.xdot +102 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiter3.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiterneg.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiterneg.xdot +102 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-maxiterneg.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-stresswt.gv +18 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-stresswt.xdot +102 -0
- package/src/layout/neato/__fixtures__/multi-component-attrs/sgd-stresswt.xdot.stderr +0 -0
- package/src/layout/neato/__fixtures__/quad-prog-vpsc-dir1-n40.ts +14 -0
- package/src/layout/neato/__fixtures__/quad-prog-vpsc.ts +7 -1
- package/src/layout/neato/circuit.ts +67 -2
- package/src/layout/neato/constrained-majorization.ts +5 -22
- package/src/layout/neato/dijkstra.ts +12 -3
- package/src/layout/neato/index.ts +41 -14
- package/src/layout/neato/init.ts +9 -13
- package/src/layout/neato/kk-paths.ts +23 -1
- package/src/layout/neato/kk-solve.ts +5 -3
- package/src/layout/neato/kk.ts +53 -21
- package/src/layout/neato/kkutils.ts +108 -3
- package/src/layout/neato/splines.ts +18 -18
- package/src/layout/neato/start.ts +20 -65
- package/src/layout/neato/stress-models.ts +55 -59
- package/src/layout/pack/ccomps.ts +131 -0
- package/src/layout/pack/index.ts +1 -95
- package/src/layout/sfdp/__fixtures__/start-warning/regen.sh +16 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-5.gv +15 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-5.xdot +77 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-5.xdot.stderr +0 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-random5.gv +15 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-random5.xdot +77 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-random5.xdot.stderr +0 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-regular.gv +15 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-regular.xdot +77 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-regular.xdot.stderr +1 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self-label-scheme.gv +16 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self-label-scheme.xdot +78 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self-label-scheme.xdot.stderr +2 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self.gv +15 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self.xdot +77 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-self.xdot.stderr +1 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-unset.gv +14 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-unset.xdot +76 -0
- package/src/layout/sfdp/__fixtures__/start-warning/start-unset.xdot.stderr +0 -0
- package/src/layout/sfdp/index.ts +1 -1
- package/src/layout/sfdp/init.ts +9 -1
- package/src/layout/twopi/index.ts +1 -1
- package/src/render/dot/agwrite.ts +1 -1
- package/src/render/dot/write-back.ts +137 -0
- package/src/render/dot.ts +12 -12
- package/src/render/json.ts +34 -34
- package/src/util/libcxx-sort.ts +461 -0
- package/src/vpsc/SweepLine.ts +50 -38
- package/src/vpsc/sweepTypes.ts +13 -2
package/dist/index.js
CHANGED
|
@@ -3729,6 +3729,10 @@ var SharedEmptyAttrs = class extends Map {
|
|
|
3729
3729
|
}
|
|
3730
3730
|
};
|
|
3731
3731
|
var EMPTY_ATTRS = new SharedEmptyAttrs();
|
|
3732
|
+
function ownAttrs(o) {
|
|
3733
|
+
if (o.attrs === EMPTY_ATTRS) o.attrs = /* @__PURE__ */ new Map();
|
|
3734
|
+
return o.attrs;
|
|
3735
|
+
}
|
|
3732
3736
|
|
|
3733
3737
|
// src/model/algData.ts
|
|
3734
3738
|
var THETA_UNSET = 10;
|
|
@@ -5571,159 +5575,421 @@ var P_LPROMOTER = {
|
|
|
5571
5575
|
vertices: null
|
|
5572
5576
|
};
|
|
5573
5577
|
|
|
5574
|
-
// src/gvc/
|
|
5575
|
-
|
|
5576
|
-
|
|
5577
|
-
static insertionIdx(renderers, plugin) {
|
|
5578
|
-
const pPfx = plugin.type.split(":")[0];
|
|
5579
|
-
for (let i = 0; i < renderers.length; i++) {
|
|
5580
|
-
const e = renderers[i];
|
|
5581
|
-
const ePfx = e.type.split(":")[0];
|
|
5582
|
-
if (ePfx < pPfx) continue;
|
|
5583
|
-
if (ePfx > pPfx) return i;
|
|
5584
|
-
if (e.quality > plugin.quality) continue;
|
|
5585
|
-
return i;
|
|
5586
|
-
}
|
|
5587
|
-
return renderers.length;
|
|
5588
|
-
}
|
|
5589
|
-
};
|
|
5590
|
-
function checkMeasurer(m) {
|
|
5591
|
-
if (typeof m !== "object" || m === null || typeof m.measure !== "function") {
|
|
5592
|
-
throw invalidArgType("measurer", "TextMeasurer", m);
|
|
5593
|
-
}
|
|
5578
|
+
// src/gvc/layout-reset.ts
|
|
5579
|
+
function layoutWasFreed(g) {
|
|
5580
|
+
return g.info?.laidOut === true && g.info.cleanup === void 0;
|
|
5594
5581
|
}
|
|
5595
|
-
function
|
|
5596
|
-
|
|
5597
|
-
|
|
5598
|
-
if (!ok) throw invalidArgType("p", "RendererPlugin or LayoutEngine", p);
|
|
5582
|
+
function resetGraphRecords(g) {
|
|
5583
|
+
g.info = makeGraphInfo();
|
|
5584
|
+
for (const subg of g.subgraphs.values()) resetGraphRecords(subg);
|
|
5599
5585
|
}
|
|
5600
|
-
|
|
5601
|
-
|
|
5602
|
-
|
|
5603
|
-
|
|
5604
|
-
|
|
5605
|
-
|
|
5606
|
-
|
|
5607
|
-
|
|
5608
|
-
|
|
5609
|
-
|
|
5610
|
-
|
|
5611
|
-
|
|
5612
|
-
|
|
5613
|
-
|
|
5614
|
-
|
|
5615
|
-
|
|
5616
|
-
|
|
5617
|
-
|
|
5618
|
-
|
|
5619
|
-
|
|
5620
|
-
|
|
5621
|
-
|
|
5622
|
-
|
|
5586
|
+
function resetLayoutRecords(g) {
|
|
5587
|
+
for (const n of g.nodes.values()) n.info = makeNodeInfo();
|
|
5588
|
+
for (const e of g.edges) e.info = makeEdgeInfo(makePort(), makePort());
|
|
5589
|
+
resetGraphRecords(g);
|
|
5590
|
+
}
|
|
5591
|
+
|
|
5592
|
+
// src/xdot/types.ts
|
|
5593
|
+
var XDOT_PARSE_ERROR = 1;
|
|
5594
|
+
|
|
5595
|
+
// src/xdot/parse.ts
|
|
5596
|
+
var ULONG_MAX = 0xffffffffffffffffn;
|
|
5597
|
+
var XdotParser = class _XdotParser {
|
|
5598
|
+
static isWs(c) {
|
|
5599
|
+
return c === " " || c === " " || c === "\n" || c === "\r";
|
|
5600
|
+
}
|
|
5601
|
+
static skipWs(s, pos) {
|
|
5602
|
+
while (pos < s.length && _XdotParser.isWs(s[pos])) pos++;
|
|
5603
|
+
return pos;
|
|
5604
|
+
}
|
|
5605
|
+
static consumeDigits(s, i) {
|
|
5606
|
+
while (i < s.length && s[i] >= "0" && s[i] <= "9") i++;
|
|
5607
|
+
return i;
|
|
5608
|
+
}
|
|
5609
|
+
static consumeExponent(s, i) {
|
|
5610
|
+
if (i < s.length && (s[i] === "e" || s[i] === "E")) {
|
|
5611
|
+
i++;
|
|
5612
|
+
if (i < s.length && (s[i] === "+" || s[i] === "-")) i++;
|
|
5613
|
+
i = _XdotParser.consumeDigits(s, i);
|
|
5623
5614
|
}
|
|
5624
|
-
|
|
5625
|
-
this.debug = options?.debug;
|
|
5615
|
+
return i;
|
|
5626
5616
|
}
|
|
5627
|
-
|
|
5628
|
-
|
|
5629
|
-
|
|
5630
|
-
|
|
5631
|
-
|
|
5632
|
-
|
|
5633
|
-
|
|
5617
|
+
static parseReal(s, pos) {
|
|
5618
|
+
let i = _XdotParser.skipWs(s, pos);
|
|
5619
|
+
const start = i;
|
|
5620
|
+
if (i < s.length && (s[i] === "-" || s[i] === "+")) i++;
|
|
5621
|
+
const digStart = i;
|
|
5622
|
+
i = _XdotParser.consumeDigits(s, i);
|
|
5623
|
+
if (i < s.length && s[i] === ".") {
|
|
5624
|
+
i++;
|
|
5625
|
+
i = _XdotParser.consumeDigits(s, i);
|
|
5634
5626
|
}
|
|
5627
|
+
i = _XdotParser.consumeExponent(s, i);
|
|
5628
|
+
if (i === start || i === digStart) return null;
|
|
5629
|
+
return { val: parseFloat(s.slice(start, i)), pos: i };
|
|
5630
|
+
}
|
|
5631
|
+
static parseInt_(s, pos) {
|
|
5632
|
+
let i = _XdotParser.skipWs(s, pos);
|
|
5633
|
+
const start = i;
|
|
5634
|
+
if (i < s.length && (s[i] === "-" || s[i] === "+")) i++;
|
|
5635
|
+
const digStart = i;
|
|
5636
|
+
i = _XdotParser.consumeDigits(s, i);
|
|
5637
|
+
if (i === digStart) return null;
|
|
5638
|
+
return { val: parseInt(s.slice(start, i), 10), pos: i };
|
|
5635
5639
|
}
|
|
5636
5640
|
/**
|
|
5637
|
-
*
|
|
5638
|
-
*
|
|
5639
|
-
*
|
|
5640
|
-
*
|
|
5641
|
-
* @throws TypeError (ERR_INVALID_ARG_TYPE) if format is not a string
|
|
5642
|
-
* @throws TypeError (ERR_INVALID_ARG_VALUE) if no renderer is registered
|
|
5643
|
-
* for format
|
|
5644
|
-
* @see lib/gvc/gvplugin.c:gvplugin_find
|
|
5641
|
+
* strtoul(s, &endp, 10) cast to unsigned int: optional sign, a leading "-"
|
|
5642
|
+
* negates modulo 2^64, magnitude overflow saturates to ULONG_MAX, and the
|
|
5643
|
+
* result keeps the low 32 bits.
|
|
5644
|
+
* @see lib/xdot/xdot.c:parseUInt
|
|
5645
5645
|
*/
|
|
5646
|
-
|
|
5647
|
-
|
|
5648
|
-
|
|
5646
|
+
static parseUInt_(s, pos) {
|
|
5647
|
+
const i = _XdotParser.skipWs(s, pos);
|
|
5648
|
+
let start = i;
|
|
5649
|
+
const negative = i < s.length && s[i] === "-";
|
|
5650
|
+
if (i < s.length && (s[i] === "-" || s[i] === "+")) start++;
|
|
5651
|
+
const end = _XdotParser.consumeDigits(s, start);
|
|
5652
|
+
if (end === start) return null;
|
|
5653
|
+
const mag = BigInt(s.slice(start, end));
|
|
5654
|
+
const clamped = mag > ULONG_MAX ? ULONG_MAX : mag;
|
|
5655
|
+
const wrapped = negative && mag <= ULONG_MAX ? BigInt.asUintN(64, -clamped) : clamped;
|
|
5656
|
+
return { val: Number(BigInt.asUintN(32, wrapped)), pos: end };
|
|
5657
|
+
}
|
|
5658
|
+
static parseRect(s, pos) {
|
|
5659
|
+
const rx = _XdotParser.parseReal(s, pos);
|
|
5660
|
+
if (!rx) return null;
|
|
5661
|
+
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
5662
|
+
if (!ry) return null;
|
|
5663
|
+
const rw = _XdotParser.parseReal(s, ry.pos);
|
|
5664
|
+
if (!rw) return null;
|
|
5665
|
+
const rh = _XdotParser.parseReal(s, rw.pos);
|
|
5666
|
+
if (!rh) return null;
|
|
5667
|
+
return { val: { x: rx.val, y: ry.val, w: rw.val, h: rh.val }, pos: rh.pos };
|
|
5668
|
+
}
|
|
5669
|
+
static parsePoint(s, pos) {
|
|
5670
|
+
const rx = _XdotParser.parseReal(s, pos);
|
|
5671
|
+
if (!rx) return null;
|
|
5672
|
+
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
5673
|
+
if (!ry) return null;
|
|
5674
|
+
return { val: { x: rx.val, y: ry.val, z: 0 }, pos: ry.pos };
|
|
5675
|
+
}
|
|
5676
|
+
static parsePolyline(s, pos) {
|
|
5677
|
+
const ri = _XdotParser.parseUInt_(s, pos);
|
|
5678
|
+
if (!ri) return null;
|
|
5679
|
+
let cur = ri.pos;
|
|
5680
|
+
const pts = [];
|
|
5681
|
+
for (let i = 0; i < ri.val; i++) {
|
|
5682
|
+
const rp = _XdotParser.parsePoint(s, cur);
|
|
5683
|
+
if (!rp) return null;
|
|
5684
|
+
pts.push(rp.val);
|
|
5685
|
+
cur = rp.pos;
|
|
5649
5686
|
}
|
|
5650
|
-
|
|
5651
|
-
|
|
5687
|
+
return { val: { pts }, pos: cur };
|
|
5688
|
+
}
|
|
5689
|
+
/** UTF-8 byte length of one code point (mirrors dot.ts utf8Len per char). */
|
|
5690
|
+
static cpByteLen(cp) {
|
|
5691
|
+
if (cp < 128) return 1;
|
|
5692
|
+
if (cp < 2048) return 2;
|
|
5693
|
+
if (cp < 65536) return 3;
|
|
5694
|
+
return 4;
|
|
5695
|
+
}
|
|
5696
|
+
static parseString(s, pos) {
|
|
5697
|
+
const ri = _XdotParser.parseInt_(s, pos);
|
|
5698
|
+
if (!ri || ri.val <= 0) return null;
|
|
5699
|
+
const len = ri.val;
|
|
5700
|
+
let cur = _XdotParser.skipWs(s, ri.pos);
|
|
5701
|
+
if (s[cur] !== "-") return null;
|
|
5702
|
+
cur++;
|
|
5703
|
+
let out = "";
|
|
5704
|
+
let accounted = 0;
|
|
5705
|
+
let j = 0;
|
|
5706
|
+
while (accounted < len) {
|
|
5707
|
+
if (cur + j >= s.length) return null;
|
|
5708
|
+
const ch = s[cur + j];
|
|
5709
|
+
const prev = j > 0 ? s[cur + j - 1] : "";
|
|
5710
|
+
out += ch;
|
|
5711
|
+
if (ch === "\\" && prev !== "\\") {
|
|
5712
|
+
j++;
|
|
5713
|
+
continue;
|
|
5714
|
+
}
|
|
5715
|
+
const cp = s.codePointAt(cur + j);
|
|
5716
|
+
accounted += _XdotParser.cpByteLen(cp);
|
|
5717
|
+
if (cp > 65535) {
|
|
5718
|
+
out += s[cur + j + 1];
|
|
5719
|
+
j++;
|
|
5720
|
+
}
|
|
5721
|
+
j++;
|
|
5652
5722
|
}
|
|
5653
|
-
|
|
5654
|
-
throw invalidArgValue("format", format, [...prefixes]);
|
|
5723
|
+
return { val: out, pos: cur + j };
|
|
5655
5724
|
}
|
|
5656
|
-
|
|
5657
|
-
|
|
5658
|
-
if (
|
|
5659
|
-
|
|
5725
|
+
static parseAlign(s, pos) {
|
|
5726
|
+
const ri = _XdotParser.parseInt_(s, pos);
|
|
5727
|
+
if (!ri) return null;
|
|
5728
|
+
const align = ri.val < 0 ? "left" : ri.val > 0 ? "right" : "center";
|
|
5729
|
+
return { val: align, pos: ri.pos };
|
|
5730
|
+
}
|
|
5731
|
+
static parseStops(s, pos, n) {
|
|
5732
|
+
let cur = pos;
|
|
5733
|
+
const stops = [];
|
|
5734
|
+
for (let i = 0; i < n; i++) {
|
|
5735
|
+
const rf = _XdotParser.parseReal(s, cur);
|
|
5736
|
+
if (!rf) return null;
|
|
5737
|
+
const rc = _XdotParser.parseString(s, rf.pos);
|
|
5738
|
+
if (!rc) return null;
|
|
5739
|
+
stops.push({ frac: rf.val, color: rc.val });
|
|
5740
|
+
cur = rc.pos;
|
|
5660
5741
|
}
|
|
5661
|
-
|
|
5662
|
-
|
|
5742
|
+
return { stops, pos: cur };
|
|
5743
|
+
}
|
|
5744
|
+
static linGradient(s, pos) {
|
|
5745
|
+
const rx0 = _XdotParser.parseReal(s, pos);
|
|
5746
|
+
if (!rx0) return null;
|
|
5747
|
+
const ry0 = _XdotParser.parseReal(s, rx0.pos);
|
|
5748
|
+
if (!ry0) return null;
|
|
5749
|
+
const rx1 = _XdotParser.parseReal(s, ry0.pos);
|
|
5750
|
+
if (!rx1) return null;
|
|
5751
|
+
const ry1 = _XdotParser.parseReal(s, rx1.pos);
|
|
5752
|
+
if (!ry1) return null;
|
|
5753
|
+
const rn = _XdotParser.parseUInt_(s, ry1.pos);
|
|
5754
|
+
if (!rn) return null;
|
|
5755
|
+
const rs = _XdotParser.parseStops(s, rn.pos, rn.val);
|
|
5756
|
+
if (!rs) return null;
|
|
5757
|
+
return { x0: rx0.val, y0: ry0.val, x1: rx1.val, y1: ry1.val, stops: rs.stops };
|
|
5758
|
+
}
|
|
5759
|
+
static radGradient(s, pos) {
|
|
5760
|
+
const rx0 = _XdotParser.parseReal(s, pos);
|
|
5761
|
+
if (!rx0) return null;
|
|
5762
|
+
const ry0 = _XdotParser.parseReal(s, rx0.pos);
|
|
5763
|
+
if (!ry0) return null;
|
|
5764
|
+
const rr0 = _XdotParser.parseReal(s, ry0.pos);
|
|
5765
|
+
if (!rr0) return null;
|
|
5766
|
+
const rx1 = _XdotParser.parseReal(s, rr0.pos);
|
|
5767
|
+
if (!rx1) return null;
|
|
5768
|
+
const ry1 = _XdotParser.parseReal(s, rx1.pos);
|
|
5769
|
+
if (!ry1) return null;
|
|
5770
|
+
const rr1 = _XdotParser.parseReal(s, ry1.pos);
|
|
5771
|
+
if (!rr1) return null;
|
|
5772
|
+
const rn = _XdotParser.parseUInt_(s, rr1.pos);
|
|
5773
|
+
if (!rn) return null;
|
|
5774
|
+
const rs = _XdotParser.parseStops(s, rn.pos, rn.val);
|
|
5775
|
+
if (!rs) return null;
|
|
5776
|
+
return { x0: rx0.val, y0: ry0.val, r0: rr0.val, x1: rx1.val, y1: ry1.val, r1: rr1.val, stops: rs.stops };
|
|
5777
|
+
}
|
|
5778
|
+
static isAlnum(c) {
|
|
5779
|
+
return c >= "a" && c <= "z" || c >= "A" && c <= "Z" || c >= "0" && c <= "9";
|
|
5780
|
+
}
|
|
5781
|
+
static parseXDotColorAt(s, pos) {
|
|
5782
|
+
const c = pos < s.length ? s[pos] : "";
|
|
5783
|
+
if (c === "[") {
|
|
5784
|
+
const g = _XdotParser.linGradient(s, pos + 1);
|
|
5785
|
+
if (!g) return null;
|
|
5786
|
+
return { val: { type: "linear", ling: g }, pos };
|
|
5663
5787
|
}
|
|
5664
|
-
|
|
5665
|
-
|
|
5666
|
-
|
|
5788
|
+
if (c === "(") {
|
|
5789
|
+
const g = _XdotParser.radGradient(s, pos + 1);
|
|
5790
|
+
if (!g) return null;
|
|
5791
|
+
return { val: { type: "radial", ring: g }, pos };
|
|
5667
5792
|
}
|
|
5668
|
-
|
|
5793
|
+
if (c === "#" || c === "/" || _XdotParser.isAlnum(c))
|
|
5794
|
+
return { val: { type: "none", clr: s.slice(pos) }, pos };
|
|
5795
|
+
return null;
|
|
5669
5796
|
}
|
|
5670
|
-
|
|
5671
|
-
|
|
5672
|
-
|
|
5673
|
-
|
|
5674
|
-
|
|
5675
|
-
|
|
5676
|
-
|
|
5677
|
-
|
|
5678
|
-
|
|
5679
|
-
|
|
5680
|
-
|
|
5681
|
-
|
|
5682
|
-
|
|
5683
|
-
|
|
5684
|
-
|
|
5685
|
-
|
|
5686
|
-
|
|
5687
|
-
|
|
5688
|
-
|
|
5689
|
-
|
|
5690
|
-
|
|
5691
|
-
|
|
5692
|
-
|
|
5693
|
-
|
|
5694
|
-
const
|
|
5695
|
-
|
|
5696
|
-
|
|
5697
|
-
|
|
5698
|
-
|
|
5699
|
-
|
|
5700
|
-
|
|
5701
|
-
|
|
5702
|
-
|
|
5703
|
-
|
|
5704
|
-
|
|
5797
|
+
static parseEllipseOp(ch, s, pos, fns) {
|
|
5798
|
+
const r = _XdotParser.parseRect(s, pos);
|
|
5799
|
+
if (!r) return "error";
|
|
5800
|
+
const op = { kind: ch === "E" ? "filled_ellipse" : "unfilled_ellipse", ellipse: r.val };
|
|
5801
|
+
fns.ellipse?.(op, 0);
|
|
5802
|
+
return { op, pos: r.pos };
|
|
5803
|
+
}
|
|
5804
|
+
static parsePolygonOp(ch, s, pos, fns) {
|
|
5805
|
+
const r = _XdotParser.parsePolyline(s, pos);
|
|
5806
|
+
if (!r) return "error";
|
|
5807
|
+
const op = { kind: ch === "P" ? "filled_polygon" : "unfilled_polygon", polygon: r.val };
|
|
5808
|
+
fns.polygon?.(op, 0);
|
|
5809
|
+
return { op, pos: r.pos };
|
|
5810
|
+
}
|
|
5811
|
+
static parseBezierOp(ch, s, pos, fns) {
|
|
5812
|
+
const r = _XdotParser.parsePolyline(s, pos);
|
|
5813
|
+
if (!r) return "error";
|
|
5814
|
+
const op = { kind: ch === "b" ? "filled_bezier" : "unfilled_bezier", bezier: r.val };
|
|
5815
|
+
fns.bezier?.(op, 0);
|
|
5816
|
+
return { op, pos: r.pos };
|
|
5817
|
+
}
|
|
5818
|
+
static parsePolylineOp(s, pos, fns) {
|
|
5819
|
+
const r = _XdotParser.parsePolyline(s, pos);
|
|
5820
|
+
if (!r) return "error";
|
|
5821
|
+
const op = { kind: "polyline", polyline: r.val };
|
|
5822
|
+
fns.polyline?.(op, 0);
|
|
5823
|
+
return { op, pos: r.pos };
|
|
5824
|
+
}
|
|
5825
|
+
static parseTextOp(s, pos, fns) {
|
|
5826
|
+
const rx = _XdotParser.parseReal(s, pos);
|
|
5827
|
+
if (!rx) return "error";
|
|
5828
|
+
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
5829
|
+
if (!ry) return "error";
|
|
5830
|
+
const ra = _XdotParser.parseAlign(s, ry.pos);
|
|
5831
|
+
if (!ra) return "error";
|
|
5832
|
+
const rw = _XdotParser.parseReal(s, ra.pos);
|
|
5833
|
+
if (!rw) return "error";
|
|
5834
|
+
const rt = _XdotParser.parseString(s, rw.pos);
|
|
5835
|
+
if (!rt) return "error";
|
|
5836
|
+
const text = { x: rx.val, y: ry.val, align: ra.val, width: rw.val, text: rt.val };
|
|
5837
|
+
const op = { kind: "text", text };
|
|
5838
|
+
fns.text?.(op, 0);
|
|
5839
|
+
return { op, pos: rt.pos };
|
|
5840
|
+
}
|
|
5841
|
+
static parseColorOp(ch, s, pos, fns) {
|
|
5842
|
+
const rs = _XdotParser.parseString(s, pos);
|
|
5843
|
+
if (!rs) return "error";
|
|
5844
|
+
const rc = _XdotParser.parseXDotColorAt(rs.val, 0);
|
|
5845
|
+
if (!rc) return "error";
|
|
5846
|
+
const clr = rc.val;
|
|
5847
|
+
if (clr.type === "none") {
|
|
5848
|
+
const op2 = { kind: ch === "C" ? "fill_color" : "pen_color", color: clr.clr };
|
|
5849
|
+
(ch === "C" ? fns.fill_color : fns.pen_color)?.(op2, 0);
|
|
5850
|
+
return { op: op2, pos: rs.pos };
|
|
5705
5851
|
}
|
|
5706
|
-
|
|
5707
|
-
|
|
5708
|
-
|
|
5709
|
-
if (g.info) g.info.laidOut = true;
|
|
5852
|
+
const op = { kind: ch === "C" ? "grad_fill_color" : "grad_pen_color", gradColor: clr };
|
|
5853
|
+
fns.grad_color?.(op, 0);
|
|
5854
|
+
return { op, pos: rs.pos };
|
|
5710
5855
|
}
|
|
5711
|
-
|
|
5712
|
-
|
|
5713
|
-
|
|
5714
|
-
|
|
5715
|
-
|
|
5716
|
-
|
|
5717
|
-
|
|
5718
|
-
|
|
5719
|
-
|
|
5720
|
-
|
|
5721
|
-
|
|
5722
|
-
|
|
5723
|
-
|
|
5856
|
+
static parseFontOp(s, pos, fns) {
|
|
5857
|
+
const rs = _XdotParser.parseReal(s, pos);
|
|
5858
|
+
if (!rs) return "error";
|
|
5859
|
+
const rn = _XdotParser.parseString(s, rs.pos);
|
|
5860
|
+
if (!rn) return "error";
|
|
5861
|
+
const op = { kind: "font", font: { size: rs.val, name: rn.val } };
|
|
5862
|
+
fns.font?.(op, 0);
|
|
5863
|
+
return { op, pos: rn.pos };
|
|
5864
|
+
}
|
|
5865
|
+
static parseStyleOp(s, pos, fns) {
|
|
5866
|
+
const r = _XdotParser.parseString(s, pos);
|
|
5867
|
+
if (!r) return "error";
|
|
5868
|
+
const op = { kind: "style", style: r.val };
|
|
5869
|
+
fns.style?.(op, 0);
|
|
5870
|
+
return { op, pos: r.pos };
|
|
5871
|
+
}
|
|
5872
|
+
static parseImageOp(s, pos, fns) {
|
|
5873
|
+
const rr = _XdotParser.parseRect(s, pos);
|
|
5874
|
+
if (!rr) return "error";
|
|
5875
|
+
const rn = _XdotParser.parseString(s, rr.pos);
|
|
5876
|
+
if (!rn) return "error";
|
|
5877
|
+
const op = { kind: "image", image: { pos: rr.val, name: rn.val } };
|
|
5878
|
+
fns.image?.(op, 0);
|
|
5879
|
+
return { op, pos: rn.pos };
|
|
5880
|
+
}
|
|
5881
|
+
static parseFontcharOp(s, pos, fns) {
|
|
5882
|
+
const r = _XdotParser.parseUInt_(s, pos);
|
|
5883
|
+
if (!r) return "error";
|
|
5884
|
+
const op = { kind: "fontchar", fontchar: r.val };
|
|
5885
|
+
fns.fontchar?.(op, 0);
|
|
5886
|
+
return { op, pos: r.pos };
|
|
5887
|
+
}
|
|
5888
|
+
static parseShapeOp(ch, s, pos, fns) {
|
|
5889
|
+
if (ch === "E" || ch === "e") return _XdotParser.parseEllipseOp(ch, s, pos, fns);
|
|
5890
|
+
if (ch === "P" || ch === "p") return _XdotParser.parsePolygonOp(ch, s, pos, fns);
|
|
5891
|
+
if (ch === "b" || ch === "B") return _XdotParser.parseBezierOp(ch, s, pos, fns);
|
|
5892
|
+
if (ch === "L") return _XdotParser.parsePolylineOp(s, pos, fns);
|
|
5893
|
+
return null;
|
|
5894
|
+
}
|
|
5895
|
+
static parseMetaOp(ch, s, pos, fns) {
|
|
5896
|
+
if (ch === "T") return _XdotParser.parseTextOp(s, pos, fns);
|
|
5897
|
+
if (ch === "C" || ch === "c") return _XdotParser.parseColorOp(ch, s, pos, fns);
|
|
5898
|
+
if (ch === "F") return _XdotParser.parseFontOp(s, pos, fns);
|
|
5899
|
+
if (ch === "S") return _XdotParser.parseStyleOp(s, pos, fns);
|
|
5900
|
+
if (ch === "I") return _XdotParser.parseImageOp(s, pos, fns);
|
|
5901
|
+
if (ch === "t") return _XdotParser.parseFontcharOp(s, pos, fns);
|
|
5902
|
+
if (ch === "\0") return null;
|
|
5903
|
+
return "error";
|
|
5904
|
+
}
|
|
5905
|
+
static parseOp(s, pos, fns) {
|
|
5906
|
+
pos = _XdotParser.skipWs(s, pos);
|
|
5907
|
+
if (pos >= s.length) return null;
|
|
5908
|
+
const ch = s[pos++];
|
|
5909
|
+
const shape = _XdotParser.parseShapeOp(ch, s, pos, fns);
|
|
5910
|
+
if (shape !== null) return shape;
|
|
5911
|
+
return _XdotParser.parseMetaOp(ch, s, pos, fns);
|
|
5912
|
+
}
|
|
5913
|
+
static parseXDotFOn(s, opFns, _sz, x) {
|
|
5914
|
+
if (!s) return x;
|
|
5915
|
+
const result = x ?? { ops: [], flags: 0 };
|
|
5916
|
+
let pos = 0;
|
|
5917
|
+
while (pos < s.length) {
|
|
5918
|
+
const r = _XdotParser.parseOp(s, pos, opFns);
|
|
5919
|
+
if (r === null) break;
|
|
5920
|
+
if (r === "error") {
|
|
5921
|
+
result.flags |= XDOT_PARSE_ERROR;
|
|
5922
|
+
break;
|
|
5923
|
+
}
|
|
5924
|
+
result.ops.push(r.op);
|
|
5925
|
+
pos = r.pos;
|
|
5724
5926
|
}
|
|
5927
|
+
return result.ops.length === 0 ? null : result;
|
|
5928
|
+
}
|
|
5929
|
+
static parseXDotF(s, opFns, sz) {
|
|
5930
|
+
return _XdotParser.parseXDotFOn(s, opFns, sz, null);
|
|
5931
|
+
}
|
|
5932
|
+
static parseXDot(s) {
|
|
5933
|
+
return _XdotParser.parseXDotF(s, {}, 0);
|
|
5934
|
+
}
|
|
5935
|
+
static parseXDotColor(s) {
|
|
5936
|
+
const r = _XdotParser.parseXDotColorAt(s, 0);
|
|
5937
|
+
return r ? r.val : null;
|
|
5725
5938
|
}
|
|
5726
5939
|
};
|
|
5940
|
+
function parseXDot(s) {
|
|
5941
|
+
return XdotParser.parseXDot(s);
|
|
5942
|
+
}
|
|
5943
|
+
|
|
5944
|
+
// src/xdot/misc.ts
|
|
5945
|
+
var SHAPE_LETTER = {
|
|
5946
|
+
filled_ellipse: "E",
|
|
5947
|
+
unfilled_ellipse: "e",
|
|
5948
|
+
filled_polygon: "P",
|
|
5949
|
+
unfilled_polygon: "p",
|
|
5950
|
+
filled_bezier: "b",
|
|
5951
|
+
unfilled_bezier: "B",
|
|
5952
|
+
polyline: "L"
|
|
5953
|
+
};
|
|
5954
|
+
var SHAPE_KINDS = new Set(Object.keys(SHAPE_LETTER));
|
|
5955
|
+
|
|
5956
|
+
// src/gvc/init-xdot.ts
|
|
5957
|
+
var xdotsByGraph = /* @__PURE__ */ new WeakMap();
|
|
5958
|
+
function initXdot(g) {
|
|
5959
|
+
xdotsByGraph.delete(g);
|
|
5960
|
+
const p = g.attrs?.get("_background") || g.attrs?.get("_draw_");
|
|
5961
|
+
if (!p) return;
|
|
5962
|
+
const xd = parseXDot(p);
|
|
5963
|
+
if (xd === null) {
|
|
5964
|
+
agwarningf(`Could not parse "_background" attribute in graph ${g.name}`);
|
|
5965
|
+
agerr("prev", ` "${p}"`);
|
|
5966
|
+
return;
|
|
5967
|
+
}
|
|
5968
|
+
xdotsByGraph.set(g, xd);
|
|
5969
|
+
}
|
|
5970
|
+
function graphXdots(g) {
|
|
5971
|
+
return xdotsByGraph.get(g);
|
|
5972
|
+
}
|
|
5973
|
+
|
|
5974
|
+
// src/common/arith.ts
|
|
5975
|
+
function cround(v) {
|
|
5976
|
+
return v >= 0 ? Math.floor(v + 0.5) : Math.ceil(v - 0.5);
|
|
5977
|
+
}
|
|
5978
|
+
var INT64_MAX = 2n ** 63n - 1n;
|
|
5979
|
+
var INT64_MIN = -(2n ** 63n);
|
|
5980
|
+
var TWO_POW_63 = 2 ** 63;
|
|
5981
|
+
function croundNarrow32(v) {
|
|
5982
|
+
const r = cround(v);
|
|
5983
|
+
let i64;
|
|
5984
|
+
if (Number.isNaN(r)) i64 = 0n;
|
|
5985
|
+
else if (r >= TWO_POW_63) i64 = INT64_MAX;
|
|
5986
|
+
else if (r < -TWO_POW_63) i64 = INT64_MIN;
|
|
5987
|
+
else i64 = BigInt(r);
|
|
5988
|
+
return Number(BigInt.asIntN(32, i64));
|
|
5989
|
+
}
|
|
5990
|
+
function RADIANS(deg) {
|
|
5991
|
+
return deg / 180 * Math.PI;
|
|
5992
|
+
}
|
|
5727
5993
|
|
|
5728
5994
|
// src/util/printf-round.ts
|
|
5729
5995
|
function decomposeFloat64(v) {
|
|
@@ -5817,6 +6083,207 @@ function printfSig(v, sig) {
|
|
|
5817
6083
|
return sign2 + "0." + "0".repeat(-(e + 1)) + digitsStr;
|
|
5818
6084
|
}
|
|
5819
6085
|
|
|
6086
|
+
// src/gvc/landscape.ts
|
|
6087
|
+
function landscapeMapbool(s) {
|
|
6088
|
+
const v = s.toLowerCase();
|
|
6089
|
+
if (v === "" || v === "false" || v === "no") return false;
|
|
6090
|
+
if (v === "true" || v === "yes") return true;
|
|
6091
|
+
return Number.parseInt(s, 10) !== 0;
|
|
6092
|
+
}
|
|
6093
|
+
function parseLandscape(g) {
|
|
6094
|
+
const rotate = g.attrs.get("rotate");
|
|
6095
|
+
if (rotate !== void 0) return Number.parseInt(rotate, 10) === 90;
|
|
6096
|
+
const orientation = g.attrs.get("orientation");
|
|
6097
|
+
if (orientation !== void 0) {
|
|
6098
|
+
return orientation[0] === "l" || orientation[0] === "L";
|
|
6099
|
+
}
|
|
6100
|
+
const landscape = g.attrs.get("landscape");
|
|
6101
|
+
if (landscape !== void 0) return landscapeMapbool(landscape);
|
|
6102
|
+
return false;
|
|
6103
|
+
}
|
|
6104
|
+
|
|
6105
|
+
// src/gvc/layout-bb.ts
|
|
6106
|
+
var layoutBbByGraph = /* @__PURE__ */ new WeakMap();
|
|
6107
|
+
function writeLayoutBb(g) {
|
|
6108
|
+
const bb = g.info?.bb;
|
|
6109
|
+
if (bb === void 0 || !g.attrs) return;
|
|
6110
|
+
const parts = parseLandscape(g) ? [bb.ll.y, bb.ll.x, bb.ur.y, bb.ur.x] : [bb.ll.x, bb.ll.y, bb.ur.x, bb.ur.y];
|
|
6111
|
+
const written = parts.map((v) => printfFixed(cround(v), 0)).join(" ");
|
|
6112
|
+
layoutBbByGraph.set(g, { written, replaced: g.attrs.get("bb") });
|
|
6113
|
+
g.attrs.set("bb", written);
|
|
6114
|
+
}
|
|
6115
|
+
function attrsWithoutLayoutBb(g) {
|
|
6116
|
+
const own = layoutBbByGraph.get(g);
|
|
6117
|
+
if (own === void 0 || g.attrs.get("bb") !== own.written) return g.attrs;
|
|
6118
|
+
const attrs = new Map(g.attrs);
|
|
6119
|
+
if (own.replaced === void 0) attrs.delete("bb");
|
|
6120
|
+
else attrs.set("bb", own.replaced);
|
|
6121
|
+
return attrs;
|
|
6122
|
+
}
|
|
6123
|
+
|
|
6124
|
+
// src/gvc/context.ts
|
|
6125
|
+
var PluginRegistry = class {
|
|
6126
|
+
/** @see lib/gvc/gvplugin.c:gvplugin_install — ordering rules */
|
|
6127
|
+
static insertionIdx(renderers, plugin) {
|
|
6128
|
+
const pPfx = plugin.type.split(":")[0];
|
|
6129
|
+
for (let i = 0; i < renderers.length; i++) {
|
|
6130
|
+
const e = renderers[i];
|
|
6131
|
+
const ePfx = e.type.split(":")[0];
|
|
6132
|
+
if (ePfx < pPfx) continue;
|
|
6133
|
+
if (ePfx > pPfx) return i;
|
|
6134
|
+
if (e.quality > plugin.quality) continue;
|
|
6135
|
+
return i;
|
|
6136
|
+
}
|
|
6137
|
+
return renderers.length;
|
|
6138
|
+
}
|
|
6139
|
+
};
|
|
6140
|
+
function checkMeasurer(m) {
|
|
6141
|
+
if (typeof m !== "object" || m === null || typeof m.measure !== "function") {
|
|
6142
|
+
throw invalidArgType("measurer", "TextMeasurer", m);
|
|
6143
|
+
}
|
|
6144
|
+
}
|
|
6145
|
+
function checkPlugin(p) {
|
|
6146
|
+
const o = p;
|
|
6147
|
+
const ok = typeof p === "object" && p !== null && typeof o.type === "string" && ("quality" in o ? typeof o.quality === "number" : typeof o.layout === "function" && typeof o.cleanup === "function");
|
|
6148
|
+
if (!ok) throw invalidArgType("p", "RendererPlugin or LayoutEngine", p);
|
|
6149
|
+
}
|
|
6150
|
+
var GvcContext = class {
|
|
6151
|
+
renderers = [];
|
|
6152
|
+
layouts = /* @__PURE__ */ new Map();
|
|
6153
|
+
textMeasurer;
|
|
6154
|
+
debug;
|
|
6155
|
+
/**
|
|
6156
|
+
* Per-context HTML `<IMG>` sizer; takes precedence over the global
|
|
6157
|
+
* `setImageSizer`. Undefined by default. @see ADR-2 (async-api)
|
|
6158
|
+
*/
|
|
6159
|
+
imageSizer;
|
|
6160
|
+
/**
|
|
6161
|
+
* Per-context image resolver for `inlineImages`; takes precedence over the
|
|
6162
|
+
* global `setImageResolver`. Undefined by default. @see ADR-2 (async-api)
|
|
6163
|
+
*/
|
|
6164
|
+
imageResolver;
|
|
6165
|
+
/**
|
|
6166
|
+
* @throws TypeError `ERR_INVALID_ARG_TYPE` if `measurer` has no `measure`
|
|
6167
|
+
* function or `options` is neither undefined nor an object
|
|
6168
|
+
*/
|
|
6169
|
+
constructor(measurer, options) {
|
|
6170
|
+
checkMeasurer(measurer);
|
|
6171
|
+
if (options !== void 0 && (typeof options !== "object" || options === null)) {
|
|
6172
|
+
throw invalidArgType("options", "object or undefined", options);
|
|
6173
|
+
}
|
|
6174
|
+
this.textMeasurer = measurer;
|
|
6175
|
+
this.debug = options?.debug;
|
|
6176
|
+
}
|
|
6177
|
+
register(p) {
|
|
6178
|
+
checkPlugin(p);
|
|
6179
|
+
if ("quality" in p) {
|
|
6180
|
+
const idx = PluginRegistry.insertionIdx(this.renderers, p);
|
|
6181
|
+
this.renderers.splice(idx, 0, p);
|
|
6182
|
+
} else {
|
|
6183
|
+
this.layouts.set(p.type, p);
|
|
6184
|
+
}
|
|
6185
|
+
}
|
|
6186
|
+
/**
|
|
6187
|
+
* Return the first registered renderer whose type prefix matches format.
|
|
6188
|
+
* Because renderers are sorted quality-descending within a prefix, the first
|
|
6189
|
+
* match is always the highest-quality one (last-registered wins on tie).
|
|
6190
|
+
*
|
|
6191
|
+
* @throws TypeError (ERR_INVALID_ARG_TYPE) if format is not a string
|
|
6192
|
+
* @throws TypeError (ERR_INVALID_ARG_VALUE) if no renderer is registered
|
|
6193
|
+
* for format
|
|
6194
|
+
* @see lib/gvc/gvplugin.c:gvplugin_find
|
|
6195
|
+
*/
|
|
6196
|
+
bestRenderer(format) {
|
|
6197
|
+
if (typeof format !== "string") {
|
|
6198
|
+
throw invalidArgType("format", "string", format);
|
|
6199
|
+
}
|
|
6200
|
+
for (const r of this.renderers) {
|
|
6201
|
+
if (r.type.split(":")[0] === format) return r;
|
|
6202
|
+
}
|
|
6203
|
+
const prefixes = new Set(this.renderers.map((r) => r.type.split(":")[0]));
|
|
6204
|
+
throw invalidArgValue("format", format, [...prefixes]);
|
|
6205
|
+
}
|
|
6206
|
+
/** Validate the `(g, engineName)` arguments shared by layout/freeLayout. */
|
|
6207
|
+
checkLayoutArgs(g, engineName) {
|
|
6208
|
+
if (typeof g !== "object" || g === null) {
|
|
6209
|
+
throw invalidArgType("g", "object", g);
|
|
6210
|
+
}
|
|
6211
|
+
if (typeof engineName !== "string") {
|
|
6212
|
+
throw invalidArgType("engine", "string", engineName);
|
|
6213
|
+
}
|
|
6214
|
+
const engine = this.layouts.get(engineName);
|
|
6215
|
+
if (engine === void 0) {
|
|
6216
|
+
throw invalidArgValue("engine", engineName, [...this.layouts.keys()]);
|
|
6217
|
+
}
|
|
6218
|
+
return engine;
|
|
6219
|
+
}
|
|
6220
|
+
/**
|
|
6221
|
+
* Run layout on g using engineName. Engine cleanup is deferred to
|
|
6222
|
+
* freeLayout, matching C's gvLayoutJobs / gvFreeLayout split —
|
|
6223
|
+
* rendering happens in between and must see the layout state
|
|
6224
|
+
* (e.g. cluster arrays).
|
|
6225
|
+
*
|
|
6226
|
+
* Contract (AD-4/AD-8): first resets the C process state (RNG streams,
|
|
6227
|
+
* sequence counters, once-only warnings), so each `layout` call behaves
|
|
6228
|
+
* as one native run — drive one graph per `layout`. Caller-installed hooks
|
|
6229
|
+
* (setTextMeasurer, setImageSizer, setImageResolver, the per-context
|
|
6230
|
+
* measurer/sizer/resolver) are configuration and are not reset.
|
|
6231
|
+
*
|
|
6232
|
+
* After a freeLayout, the engine sees new records, as it does in C (part-9
|
|
6233
|
+
* AD-11, see layout-reset.ts). Without one it sees the stale records, as it
|
|
6234
|
+
* does in C.
|
|
6235
|
+
*
|
|
6236
|
+
* @throws TypeError (ERR_INVALID_ARG_TYPE / ERR_INVALID_ARG_VALUE) for a
|
|
6237
|
+
* bad `g`, or an engine argument that is not registered
|
|
6238
|
+
* @throws RenderError (UNKNOWN_LAYOUT) if the `layout` attribute names no
|
|
6239
|
+
* registered engine
|
|
6240
|
+
* @throws RenderError (RENDER_ERROR / UNSUPPORTED_FEATURE) or InternalError
|
|
6241
|
+
* from the engine itself, unwrapped; a foreign throw from an engine bug
|
|
6242
|
+
* also propagates unwrapped (only the public render functions wrap it)
|
|
6243
|
+
* @see lib/gvc/gvlayout.c:gvLayoutJobs
|
|
6244
|
+
*/
|
|
6245
|
+
layout(g, engineName) {
|
|
6246
|
+
resetRenderState();
|
|
6247
|
+
const selected = this.checkLayoutArgs(g, engineName);
|
|
6248
|
+
const attr2 = g.attrs?.get("layout");
|
|
6249
|
+
let engine = selected;
|
|
6250
|
+
if (attr2 !== void 0 && attr2 !== "") {
|
|
6251
|
+
const override2 = this.layouts.get(attr2);
|
|
6252
|
+
if (override2 === void 0) {
|
|
6253
|
+
throw new RenderError(
|
|
6254
|
+
`Layout type: "${attr2}" not recognized`,
|
|
6255
|
+
"UNKNOWN_LAYOUT"
|
|
6256
|
+
);
|
|
6257
|
+
}
|
|
6258
|
+
engine = override2;
|
|
6259
|
+
}
|
|
6260
|
+
if (layoutWasFreed(g)) resetLayoutRecords(g);
|
|
6261
|
+
if (g.info) g.info.gvc = this;
|
|
6262
|
+
initXdot(g);
|
|
6263
|
+
engine.layout(g);
|
|
6264
|
+
writeLayoutBb(g);
|
|
6265
|
+
if (g.info) g.info.cleanup = (x) => engine.cleanup(x);
|
|
6266
|
+
if (g.info) g.info.laidOut = true;
|
|
6267
|
+
}
|
|
6268
|
+
/**
|
|
6269
|
+
* Release engine layout state after rendering. The records themselves stay,
|
|
6270
|
+
* for getLayout, until the next layout replaces them (part-9 AD-11, see
|
|
6271
|
+
* layout-reset.ts).
|
|
6272
|
+
*
|
|
6273
|
+
* @throws TypeError (ERR_INVALID_ARG_TYPE / ERR_INVALID_ARG_VALUE) for a
|
|
6274
|
+
* bad `g`, or an engine argument that is not registered
|
|
6275
|
+
* @see lib/gvc/gvlayout.c:gvFreeLayout
|
|
6276
|
+
*/
|
|
6277
|
+
freeLayout(g, engineName) {
|
|
6278
|
+
this.checkLayoutArgs(g, engineName);
|
|
6279
|
+
const cleanup = g.info?.cleanup;
|
|
6280
|
+
if (cleanup) {
|
|
6281
|
+
cleanup(g);
|
|
6282
|
+
g.info.cleanup = void 0;
|
|
6283
|
+
}
|
|
6284
|
+
}
|
|
6285
|
+
};
|
|
6286
|
+
|
|
5820
6287
|
// src/gvc/job.ts
|
|
5821
6288
|
var EMIT_SORTED = 1 << 0;
|
|
5822
6289
|
var EMIT_COLORS = 1 << 1;
|
|
@@ -6107,6 +6574,9 @@ function gvrenderTextspan(renderer, pos, span, job) {
|
|
|
6107
6574
|
|
|
6108
6575
|
// src/gvc/image-resolver.ts
|
|
6109
6576
|
var activeResolver = null;
|
|
6577
|
+
function getGlobalImageResolver() {
|
|
6578
|
+
return activeResolver;
|
|
6579
|
+
}
|
|
6110
6580
|
function setImageResolver(fn) {
|
|
6111
6581
|
if (fn !== null && typeof fn !== "function") {
|
|
6112
6582
|
throw invalidArgType("resolver", "function or null", fn);
|
|
@@ -6178,6 +6648,18 @@ var imagePathState = { value: void 0 };
|
|
|
6178
6648
|
registerRenderState(() => {
|
|
6179
6649
|
imagePathState.value = void 0;
|
|
6180
6650
|
});
|
|
6651
|
+
var imageHooksState = {
|
|
6652
|
+
sizer: void 0,
|
|
6653
|
+
resolver: void 0
|
|
6654
|
+
};
|
|
6655
|
+
registerRenderState(() => {
|
|
6656
|
+
imageHooksState.sizer = void 0;
|
|
6657
|
+
imageHooksState.resolver = void 0;
|
|
6658
|
+
});
|
|
6659
|
+
function setImageHooks(sizer, resolver) {
|
|
6660
|
+
imageHooksState.sizer = sizer;
|
|
6661
|
+
imageHooksState.resolver = resolver;
|
|
6662
|
+
}
|
|
6181
6663
|
function setImagePath(imagepath) {
|
|
6182
6664
|
imagePathState.value = imagepath;
|
|
6183
6665
|
}
|
|
@@ -6185,7 +6667,7 @@ function mkDirlist(list) {
|
|
|
6185
6667
|
return list === "" ? [] : list.split(PATHSEP);
|
|
6186
6668
|
}
|
|
6187
6669
|
function findPath(dirs, str) {
|
|
6188
|
-
return dirs.length > 0 && imageIsSupplied(str) ? str : null;
|
|
6670
|
+
return dirs.length > 0 && imageIsSupplied(str, imageHooksState.sizer, imageHooksState.resolver) ? str : null;
|
|
6189
6671
|
}
|
|
6190
6672
|
function safefile(filename) {
|
|
6191
6673
|
if (filename === void 0 || filename === "") return null;
|
|
@@ -6284,6 +6766,13 @@ function usershapeType(name, resolver) {
|
|
|
6284
6766
|
const found = findImageBytes(name, resolver);
|
|
6285
6767
|
return found === null ? null : imagetype(found.bytes);
|
|
6286
6768
|
}
|
|
6769
|
+
function imageNotFoundWarning(name) {
|
|
6770
|
+
return `"${name}" was not found as a file or as a shape library member`;
|
|
6771
|
+
}
|
|
6772
|
+
function imageOpenFailure(name, sizer, resolver) {
|
|
6773
|
+
if (!imageIsSupplied(name, sizer, resolver)) return imageOpenWarning(name);
|
|
6774
|
+
return usershapeType(name, resolver)?.type === ImageType.FT_NULL ? imageNotFoundWarning(name) : null;
|
|
6775
|
+
}
|
|
6287
6776
|
function imageOpenWarning(name) {
|
|
6288
6777
|
if (safefile(name) === null) return `Filename "${name}" is unsafe`;
|
|
6289
6778
|
return `${STRERROR_ENOENT} while opening ${name}`;
|
|
@@ -13564,13 +14053,15 @@ var sizeTextContent = (texts, measurer, env = defaultSizeEnv()) => {
|
|
|
13564
14053
|
var missingImages = { set: /* @__PURE__ */ new WeakSet() };
|
|
13565
14054
|
var sizeHtmlImg = (img, { imageSizer, imageResolver, imageDpi, stderr }) => {
|
|
13566
14055
|
if (img.width !== void 0 && img.height !== void 0) return missingImages.set.has(img) ? 1 : 0;
|
|
13567
|
-
const
|
|
14056
|
+
const resolver = imageResolver ?? getGlobalImageResolver() ?? void 0;
|
|
14057
|
+
const sz = usershapeSizePts(img.src, imageDpi ?? DEFAULT_DPI, imageSizer, resolver);
|
|
13568
14058
|
if (sz !== null) {
|
|
13569
14059
|
img.width = sz.x;
|
|
13570
14060
|
img.height = sz.y;
|
|
13571
14061
|
return 0;
|
|
13572
14062
|
}
|
|
13573
|
-
|
|
14063
|
+
const failure = imageOpenFailure(img.src, imageSizer, resolver);
|
|
14064
|
+
if (failure !== null) agerrLine(stderr, `Warning: ${failure}`);
|
|
13574
14065
|
agerrLine(stderr, `Error: No or improper image file="${img.src}"`);
|
|
13575
14066
|
img.width = 0;
|
|
13576
14067
|
img.height = 0;
|
|
@@ -20335,26 +20826,6 @@ function makeSelfEdge(edges, cnt, sizex, sizey, sinfo) {
|
|
|
20335
20826
|
}
|
|
20336
20827
|
}
|
|
20337
20828
|
|
|
20338
|
-
// src/common/arith.ts
|
|
20339
|
-
function cround(v) {
|
|
20340
|
-
return v >= 0 ? Math.floor(v + 0.5) : Math.ceil(v - 0.5);
|
|
20341
|
-
}
|
|
20342
|
-
var INT64_MAX = 2n ** 63n - 1n;
|
|
20343
|
-
var INT64_MIN = -(2n ** 63n);
|
|
20344
|
-
var TWO_POW_63 = 2 ** 63;
|
|
20345
|
-
function croundNarrow32(v) {
|
|
20346
|
-
const r = cround(v);
|
|
20347
|
-
let i64;
|
|
20348
|
-
if (Number.isNaN(r)) i64 = 0n;
|
|
20349
|
-
else if (r >= TWO_POW_63) i64 = INT64_MAX;
|
|
20350
|
-
else if (r < -TWO_POW_63) i64 = INT64_MIN;
|
|
20351
|
-
else i64 = BigInt(r);
|
|
20352
|
-
return Number(BigInt.asIntN(32, i64));
|
|
20353
|
-
}
|
|
20354
|
-
function RADIANS(deg) {
|
|
20355
|
-
return deg / 180 * Math.PI;
|
|
20356
|
-
}
|
|
20357
|
-
|
|
20358
20829
|
// src/layout/dot/position-aux.ts
|
|
20359
20830
|
var CL_OFFSET = 8;
|
|
20360
20831
|
function clusterMarginOf(g) {
|
|
@@ -25515,29 +25986,44 @@ function buildNodeLabel(n, g, measurer) {
|
|
|
25515
25986
|
const content = isHtml ? htmlValueContent(labelAttr) : labelAttr ?? n.name;
|
|
25516
25987
|
n.info.label = makeAnyLabel(content, isHtml, font, measurer, n);
|
|
25517
25988
|
}
|
|
25989
|
+
function warnShapefileOpen(g, shapefile) {
|
|
25990
|
+
const gvc = g.root.info.gvc;
|
|
25991
|
+
const resolver = gvc?.imageResolver ?? getGlobalImageResolver() ?? void 0;
|
|
25992
|
+
if (usershapeSizePts(shapefile, usershapeDpi(g.root.attrs), gvc?.imageSizer, resolver) !== null) return true;
|
|
25993
|
+
const failure = imageOpenFailure(shapefile, gvc?.imageSizer, resolver);
|
|
25994
|
+
if (failure !== null) agwarningf(failure);
|
|
25995
|
+
return false;
|
|
25996
|
+
}
|
|
25518
25997
|
function warnPolyInitImages(n, g) {
|
|
25519
25998
|
const shape = boundShape(n, g);
|
|
25520
25999
|
if (shape.usershape) {
|
|
25521
26000
|
if (shape.name !== CUSTOM_SHAPE_NAME) return;
|
|
25522
26001
|
const shapefile = nodeAttr(n, g, "shapefile");
|
|
25523
|
-
if (shapefile !== void 0 && shapefile !== ""
|
|
26002
|
+
if (shapefile !== void 0 && shapefile !== "" && warnShapefileOpen(g, shapefile)) return;
|
|
25524
26003
|
agwarningf(`No or improper shapefile="${shapefile ?? "<nil>"}" for node "${n.name}"`);
|
|
25525
26004
|
return;
|
|
25526
26005
|
}
|
|
25527
26006
|
const image = nodeAttr(n, g, "image");
|
|
25528
26007
|
if (image === void 0 || image === "") return;
|
|
25529
26008
|
const gvc = g.root.info.gvc;
|
|
25530
|
-
|
|
25531
|
-
|
|
26009
|
+
const failure = imageOpenFailure(image, gvc?.imageSizer, gvc?.imageResolver ?? getGlobalImageResolver() ?? void 0);
|
|
26010
|
+
if (failure === null) return;
|
|
26011
|
+
agwarningf(failure);
|
|
25532
26012
|
agwarningf(`No or improper image="${image}" for node "${n.name}"`);
|
|
25533
26013
|
}
|
|
25534
26014
|
function boundShape(n, g) {
|
|
25535
26015
|
return n.info.shape ?? bindShape(nodeAttr(n, g, "shape") ?? "ellipse", nodeAttr(n, g, "shapefile"));
|
|
25536
26016
|
}
|
|
25537
26017
|
function nodeImageSize(n, g) {
|
|
25538
|
-
|
|
26018
|
+
const shape = boundShape(n, g);
|
|
26019
|
+
if (shape.usershape && shape.name !== CUSTOM_SHAPE_NAME) return void 0;
|
|
25539
26020
|
const gvc = g.root.info.gvc;
|
|
25540
|
-
const sz = usershapeSizePts(
|
|
26021
|
+
const sz = usershapeSizePts(
|
|
26022
|
+
shape.usershape ? nodeAttr(n, g, "shapefile") : nodeAttr(n, g, "image"),
|
|
26023
|
+
usershapeDpi(g.root.attrs),
|
|
26024
|
+
gvc?.imageSizer,
|
|
26025
|
+
gvc?.imageResolver ?? getGlobalImageResolver() ?? void 0
|
|
26026
|
+
);
|
|
25541
26027
|
if (sz === null) return void 0;
|
|
25542
26028
|
g.root.info.has_images = true;
|
|
25543
26029
|
return { x: sz.x + 2, y: sz.y + 2 };
|
|
@@ -26627,6 +27113,8 @@ function fontnameCodes() {
|
|
|
26627
27113
|
function graphInit(g, useRankdir) {
|
|
26628
27114
|
g.info.charset = findCharset(g);
|
|
26629
27115
|
setImagePath(g.attrs.get("imagepath"));
|
|
27116
|
+
const gvc = g.root.info.gvc;
|
|
27117
|
+
setImageHooks(gvc?.imageSizer, gvc?.imageResolver);
|
|
26630
27118
|
let rankdir = RANKDIR_TB;
|
|
26631
27119
|
const rd = g.attrs.get("rankdir");
|
|
26632
27120
|
if (rd === "LR") rankdir = RANKDIR_LR;
|
|
@@ -26721,9 +27209,17 @@ function dotInitSubg(g) {
|
|
|
26721
27209
|
if (clust && clust[c - 1]) dotInitSubg(clust[c - 1]);
|
|
26722
27210
|
}
|
|
26723
27211
|
}
|
|
27212
|
+
function clearFastGraphLists(n) {
|
|
27213
|
+
n.info.in = void 0;
|
|
27214
|
+
n.info.out = void 0;
|
|
27215
|
+
n.info.flat_in = void 0;
|
|
27216
|
+
n.info.flat_out = void 0;
|
|
27217
|
+
n.info.other = void 0;
|
|
27218
|
+
}
|
|
26724
27219
|
function dotInitNodeEdge(g) {
|
|
26725
27220
|
for (const n of nodesInSeq(g)) {
|
|
26726
27221
|
commonInitNode(n, g);
|
|
27222
|
+
clearFastGraphLists(n);
|
|
26727
27223
|
dotInitNode(n);
|
|
26728
27224
|
}
|
|
26729
27225
|
const measurer = g.root.info.gvc?.textMeasurer;
|
|
@@ -26764,11 +27260,7 @@ function dotCleanup(g) {
|
|
|
26764
27260
|
let n = g.info.nlist;
|
|
26765
27261
|
while (n !== void 0) {
|
|
26766
27262
|
const next = n.info.next;
|
|
26767
|
-
n
|
|
26768
|
-
n.info.out = void 0;
|
|
26769
|
-
n.info.flat_in = void 0;
|
|
26770
|
-
n.info.flat_out = void 0;
|
|
26771
|
-
n.info.other = void 0;
|
|
27263
|
+
clearFastGraphLists(n);
|
|
26772
27264
|
n.info.next = void 0;
|
|
26773
27265
|
n.info.prev = void 0;
|
|
26774
27266
|
n = next;
|
|
@@ -28645,23 +29137,6 @@ function parseGraphMargin(raw) {
|
|
|
28645
29137
|
}
|
|
28646
29138
|
return { x: SVG_MARGIN, y: SVG_MARGIN };
|
|
28647
29139
|
}
|
|
28648
|
-
function landscapeMapbool(s) {
|
|
28649
|
-
const v = s.toLowerCase();
|
|
28650
|
-
if (v === "" || v === "false" || v === "no") return false;
|
|
28651
|
-
if (v === "true" || v === "yes") return true;
|
|
28652
|
-
return Number.parseInt(s, 10) !== 0;
|
|
28653
|
-
}
|
|
28654
|
-
function parseLandscape(g) {
|
|
28655
|
-
const rotate = g.attrs.get("rotate");
|
|
28656
|
-
if (rotate !== void 0) return Number.parseInt(rotate, 10) === 90;
|
|
28657
|
-
const orientation = g.attrs.get("orientation");
|
|
28658
|
-
if (orientation !== void 0) {
|
|
28659
|
-
return orientation[0] === "l" || orientation[0] === "L";
|
|
28660
|
-
}
|
|
28661
|
-
const landscape = g.attrs.get("landscape");
|
|
28662
|
-
if (landscape !== void 0) return landscapeMapbool(landscape);
|
|
28663
|
-
return false;
|
|
28664
|
-
}
|
|
28665
29140
|
function drawingNeedsFit(size, szx, szy) {
|
|
28666
29141
|
const tooBig = size.x < szx || size.y < szy;
|
|
28667
29142
|
const fillsUp = size.filled && size.x > szx && size.y > szy;
|
|
@@ -29178,6 +29653,138 @@ function nextLayer(job, cur) {
|
|
|
29178
29653
|
}
|
|
29179
29654
|
}
|
|
29180
29655
|
|
|
29656
|
+
// src/gvc/emit-xdot.ts
|
|
29657
|
+
var DEFAULT_COLOR5 = "black";
|
|
29658
|
+
var DEFAULT_FILL2 = "lightgrey";
|
|
29659
|
+
var DEFAULT_LINE_STYLE2 = ["solid", "setlinewidth(1)"];
|
|
29660
|
+
function deviceClip(g, renderer, job) {
|
|
29661
|
+
if (renderer.type === "svg") return job.clip;
|
|
29662
|
+
const attr2 = g.attrs.get("pad");
|
|
29663
|
+
const pad = attr2 ? parseGraphPad(attr2) : { x: 0, y: 0 };
|
|
29664
|
+
const size = parseDrawingSize(g.attrs.get("size"));
|
|
29665
|
+
return setupPageClip(job.bb, size, pad, initJobViewportZoom(job.bb, size, pad));
|
|
29666
|
+
}
|
|
29667
|
+
function zeroBoxInClip(clip) {
|
|
29668
|
+
return clip.ll.x <= 0 && clip.ll.y <= 0 && clip.ur.x >= 0 && clip.ur.y >= 0;
|
|
29669
|
+
}
|
|
29670
|
+
function applyBackgroundState(g, renderer, obj) {
|
|
29671
|
+
const attr2 = g.attrs.get("bgcolor");
|
|
29672
|
+
const color = attr2 !== void 0 && attr2 !== "" ? attr2 : "white";
|
|
29673
|
+
const trueColor = renderer.type === "svg";
|
|
29674
|
+
if (trueColor && color === "transparent") {
|
|
29675
|
+
obj.penColor = resolveRenderColor(DEFAULT_COLOR5);
|
|
29676
|
+
obj.fillColor = resolveFillColorName(DEFAULT_FILL2);
|
|
29677
|
+
return;
|
|
29678
|
+
}
|
|
29679
|
+
const str = color === "transparent" ? "white" : color;
|
|
29680
|
+
obj.penColor = resolveRenderColor("transparent");
|
|
29681
|
+
const stop = str.includes(":") ? findStopColor(str) : null;
|
|
29682
|
+
if (stop === null) {
|
|
29683
|
+
obj.fillColor = resolveFillColorName(str);
|
|
29684
|
+
return;
|
|
29685
|
+
}
|
|
29686
|
+
obj.fillColor = resolveFillColorName(stop.fillColor);
|
|
29687
|
+
obj.stopColor = resolveFillColorName(stop.stopColor);
|
|
29688
|
+
obj.gradientAngle = lateInt(g.attrs.get("gradientangle"), 0, 0);
|
|
29689
|
+
obj.gradientFrac = stop.frac;
|
|
29690
|
+
}
|
|
29691
|
+
function setGradientFill(obj, color) {
|
|
29692
|
+
if (color.type === "none") return;
|
|
29693
|
+
const ramp = color.type === "radial" ? color.ring : color.ling;
|
|
29694
|
+
obj.fillColor = resolveFillColorName(ramp.stops[0].color);
|
|
29695
|
+
obj.stopColor = resolveFillColorName(ramp.stops[1].color);
|
|
29696
|
+
obj.gradientFrac = ramp.stops[1].frac;
|
|
29697
|
+
if (color.type === "radial") {
|
|
29698
|
+
const r = color.ring;
|
|
29699
|
+
obj.gradientAngle = r.x1 === r.x0 && r.y1 === r.y0 ? 0 : Math.trunc(180 * Math.acos((r.x0 - r.x1) / r.r0) / Math.PI) || 0;
|
|
29700
|
+
obj.fill = 3 /* Radial */;
|
|
29701
|
+
} else {
|
|
29702
|
+
const l = color.ling;
|
|
29703
|
+
obj.gradientAngle = Math.trunc(180 * Math.atan2(l.y1 - l.y0, l.x1 - l.x0) / Math.PI);
|
|
29704
|
+
obj.fill = 2 /* Linear */;
|
|
29705
|
+
}
|
|
29706
|
+
}
|
|
29707
|
+
function setStyle(obj, tokens) {
|
|
29708
|
+
gvrenderSetStyle(tokens);
|
|
29709
|
+
obj.rawStyle = [...tokens];
|
|
29710
|
+
const flags = parseStyleFlags(tokens.join(","));
|
|
29711
|
+
obj.pen = resolvePenType(flags);
|
|
29712
|
+
obj.penWidth = resolvePenWidth(flags, void 0);
|
|
29713
|
+
}
|
|
29714
|
+
function devicePoints(pts, job) {
|
|
29715
|
+
return pts.map((p) => transformPoint({ x: p.x, y: p.y }, job));
|
|
29716
|
+
}
|
|
29717
|
+
function drawOp(op, renderer, job) {
|
|
29718
|
+
switch (op.kind) {
|
|
29719
|
+
case "filled_ellipse":
|
|
29720
|
+
case "unfilled_ellipse": {
|
|
29721
|
+
const { x, y, w, h } = op.ellipse;
|
|
29722
|
+
const c = transformPoint({ x, y }, job);
|
|
29723
|
+
renderer.ellipse(c, w, h, op.kind === "filled_ellipse", job);
|
|
29724
|
+
return true;
|
|
29725
|
+
}
|
|
29726
|
+
case "filled_polygon":
|
|
29727
|
+
case "unfilled_polygon":
|
|
29728
|
+
renderer.polygon(devicePoints(op.polygon.pts, job), op.kind === "filled_polygon", job);
|
|
29729
|
+
return true;
|
|
29730
|
+
case "filled_bezier":
|
|
29731
|
+
case "unfilled_bezier":
|
|
29732
|
+
renderer.bezier(devicePoints(op.bezier.pts, job), op.kind === "filled_bezier", job);
|
|
29733
|
+
return true;
|
|
29734
|
+
case "polyline":
|
|
29735
|
+
renderer.polyline(devicePoints(op.polyline.pts, job), job);
|
|
29736
|
+
return true;
|
|
29737
|
+
default:
|
|
29738
|
+
return false;
|
|
29739
|
+
}
|
|
29740
|
+
}
|
|
29741
|
+
function stateOp(op, obj, warned2) {
|
|
29742
|
+
switch (op.kind) {
|
|
29743
|
+
case "fill_color":
|
|
29744
|
+
obj.fillColor = resolveFillColorName(op.color);
|
|
29745
|
+
obj.fill = 1 /* Solid */;
|
|
29746
|
+
break;
|
|
29747
|
+
case "pen_color":
|
|
29748
|
+
obj.penColor = resolveRenderColor(op.color);
|
|
29749
|
+
obj.fill = 1 /* Solid */;
|
|
29750
|
+
break;
|
|
29751
|
+
case "grad_fill_color":
|
|
29752
|
+
setGradientFill(obj, op.gradColor);
|
|
29753
|
+
break;
|
|
29754
|
+
case "grad_pen_color":
|
|
29755
|
+
agwarningf("gradient pen colors not yet supported.");
|
|
29756
|
+
break;
|
|
29757
|
+
case "style":
|
|
29758
|
+
setStyle(obj, styleTokens2(op.style));
|
|
29759
|
+
break;
|
|
29760
|
+
case "image":
|
|
29761
|
+
if (!warned2.image) agwarningf('Images unsupported in "background" attribute');
|
|
29762
|
+
warned2.image = true;
|
|
29763
|
+
break;
|
|
29764
|
+
default:
|
|
29765
|
+
break;
|
|
29766
|
+
}
|
|
29767
|
+
}
|
|
29768
|
+
function emitXdot(g, renderer, job) {
|
|
29769
|
+
const xd = graphXdots(g);
|
|
29770
|
+
const obj = job.obj;
|
|
29771
|
+
if (xd === void 0 || obj === null) return;
|
|
29772
|
+
applyBackgroundState(g, renderer, obj);
|
|
29773
|
+
const inClip = zeroBoxInClip(deviceClip(g, renderer, job));
|
|
29774
|
+
const warned2 = { image: false };
|
|
29775
|
+
let styled = false;
|
|
29776
|
+
for (const op of xd.ops) {
|
|
29777
|
+
styled ||= op.kind === "style";
|
|
29778
|
+
if (op.kind === "text") continue;
|
|
29779
|
+
if (!inClip && isDrawing(op)) continue;
|
|
29780
|
+
if (!drawOp(op, renderer, job)) stateOp(op, obj, warned2);
|
|
29781
|
+
}
|
|
29782
|
+
if (styled) setStyle(obj, DEFAULT_LINE_STYLE2);
|
|
29783
|
+
}
|
|
29784
|
+
function isDrawing(op) {
|
|
29785
|
+
return op.kind.endsWith("ellipse") || op.kind.endsWith("polygon") || op.kind.endsWith("bezier") || op.kind === "polyline";
|
|
29786
|
+
}
|
|
29787
|
+
|
|
29181
29788
|
// src/gvc/device-labels.ts
|
|
29182
29789
|
var VALIGN_TOP = "t".charCodeAt(0);
|
|
29183
29790
|
var VALIGN_BOTTOM = "b".charCodeAt(0);
|
|
@@ -29440,6 +30047,7 @@ function renderPage(g, renderer, job, info) {
|
|
|
29440
30047
|
withColorScheme(g.attrs.get("colorscheme"), () => {
|
|
29441
30048
|
reportColorNames(backgroundColors(g.attrs.get("bgcolor"), renderer.type === "svg"));
|
|
29442
30049
|
renderer.pageBackground?.(g, job);
|
|
30050
|
+
emitXdot(g, renderer, job);
|
|
29443
30051
|
renderGraphLabel(g, renderer, job);
|
|
29444
30052
|
});
|
|
29445
30053
|
if (anchored) renderer.endAnchor?.(job);
|
|
@@ -32647,6 +33255,37 @@ function getSplineBounds(g) {
|
|
|
32647
33255
|
function resetSplineBounds(g) {
|
|
32648
33256
|
boundsSnapshotByGraph.delete(g);
|
|
32649
33257
|
}
|
|
33258
|
+
var staleBeziersByEdge = /* @__PURE__ */ new WeakMap();
|
|
33259
|
+
function beginRoutingPass(g) {
|
|
33260
|
+
resetSplineBounds(g);
|
|
33261
|
+
for (const e of g.edges) {
|
|
33262
|
+
e.info.lost = void 0;
|
|
33263
|
+
if (e.info.spl === void 0) staleBeziersByEdge.delete(e);
|
|
33264
|
+
else staleBeziersByEdge.set(e, e.info.spl.size);
|
|
33265
|
+
}
|
|
33266
|
+
}
|
|
33267
|
+
function routedThisPass(e) {
|
|
33268
|
+
const spl = e.info.spl;
|
|
33269
|
+
if (spl === void 0) return false;
|
|
33270
|
+
const stale = staleBeziersByEdge.get(e);
|
|
33271
|
+
return stale === void 0 || spl.size > stale;
|
|
33272
|
+
}
|
|
33273
|
+
function staleBezierCount(e) {
|
|
33274
|
+
return staleBeziersByEdge.get(e) ?? 0;
|
|
33275
|
+
}
|
|
33276
|
+
function staleAdjacent(e) {
|
|
33277
|
+
return staleBezierCount(e) > 0 && (e.info.adjacent ?? 0) !== 0;
|
|
33278
|
+
}
|
|
33279
|
+
function swapStaleBeziers(g) {
|
|
33280
|
+
for (const e of g.edges) {
|
|
33281
|
+
const stale = staleBezierCount(e);
|
|
33282
|
+
const spl = e.info.spl;
|
|
33283
|
+
if (stale === 0 || spl === void 0 || !swapEndsP(e)) continue;
|
|
33284
|
+
const old = spl.list.splice(0, stale).reverse();
|
|
33285
|
+
for (const bz of old) swapBezier(bz);
|
|
33286
|
+
spl.list.push(...old);
|
|
33287
|
+
}
|
|
33288
|
+
}
|
|
32650
33289
|
function rankEdgeInfoOf(g, tailNode, headNode) {
|
|
32651
33290
|
const rankTable = g.info.rank;
|
|
32652
33291
|
if (rankTable === void 0) return void 0;
|
|
@@ -36272,6 +36911,7 @@ function makeFlatAdjEdges(g, edges, cnt, et) {
|
|
|
36272
36911
|
function isFlatAdjacent(g, e) {
|
|
36273
36912
|
const r = e.tail.info.rank;
|
|
36274
36913
|
if (r === void 0 || e.head.info.rank !== r) return false;
|
|
36914
|
+
if (staleAdjacent(e)) return true;
|
|
36275
36915
|
const rank3 = g.info.rank?.[r];
|
|
36276
36916
|
if (rank3 === void 0) return false;
|
|
36277
36917
|
const to = e.tail.info.order ?? 0;
|
|
@@ -36615,7 +37255,7 @@ function makeSimpleFlat(group, et) {
|
|
|
36615
37255
|
}
|
|
36616
37256
|
function makeAdjFlatNoPortEdge(g, e) {
|
|
36617
37257
|
if (!isAdjFlatCandidate(e)) return false;
|
|
36618
|
-
if (e
|
|
37258
|
+
if (routedThisPass(e)) return true;
|
|
36619
37259
|
const group = collectAdjFlatGroup(g, e);
|
|
36620
37260
|
const et = edgeType(g);
|
|
36621
37261
|
if (group.some((x) => x.info.label !== void 0)) makeSimpleFlatLabels(group, et);
|
|
@@ -36633,7 +37273,7 @@ function flatPortKey(e, lo) {
|
|
|
36633
37273
|
return e.tail === lo ? { loP: e.info.tail_port, hiP: e.info.head_port } : { loP: e.info.head_port, hiP: e.info.tail_port };
|
|
36634
37274
|
}
|
|
36635
37275
|
function isNonAdjGroupable(x, g) {
|
|
36636
|
-
return x
|
|
37276
|
+
return !routedThisPass(x) && x.tail.info.rank !== void 0 && x.tail.info.rank === x.head.info.rank && !isFlatAdjacent(g, x);
|
|
36637
37277
|
}
|
|
36638
37278
|
function samePortsAs(x, lo, key) {
|
|
36639
37279
|
const k = flatPortKey(x, lo);
|
|
@@ -37018,7 +37658,7 @@ function isAdjacentPortFlat(e, g) {
|
|
|
37018
37658
|
return e.tail.info.rank !== void 0 && e.tail.info.rank === e.head.info.rank && isFlatAdjacent(g, e) && hasDefinedPort(e);
|
|
37019
37659
|
}
|
|
37020
37660
|
function isGroupableFlat(x, g) {
|
|
37021
|
-
return x
|
|
37661
|
+
return !routedThisPass(x) && x.tail.info.rank !== void 0 && x.tail.info.rank === x.head.info.rank && isFlatAdjacent(g, x);
|
|
37022
37662
|
}
|
|
37023
37663
|
function joinsPortedFlatGroup(e, g) {
|
|
37024
37664
|
return isAdjFlatCandidate(e) && isGroupableFlat(e, g) && collectAdjacentFlatGroup(e, g).some(hasDefinedPort);
|
|
@@ -37036,11 +37676,11 @@ function routeFaithfulSidePort(e, g) {
|
|
|
37036
37676
|
const sameRank = e.tail.info.rank !== void 0 && e.tail.info.rank === e.head.info.rank;
|
|
37037
37677
|
if (sameRank && isFlatAdjacent(g, e)) {
|
|
37038
37678
|
const group = collectAdjacentFlatGroup(e, g);
|
|
37039
|
-
return makeFlatAdjEdges(g, group, group.length, edgeType(g)) === 0 && e
|
|
37679
|
+
return makeFlatAdjEdges(g, group, group.length, edgeType(g)) === 0 && routedThisPass(e);
|
|
37040
37680
|
}
|
|
37041
37681
|
if (sameRank) {
|
|
37042
37682
|
const group = collectNonAdjacentFlatGroup(e, g);
|
|
37043
|
-
return routeFlatEdgeGroupFaithful(g, group, group.length, edgeType(g)) && e
|
|
37683
|
+
return routeFlatEdgeGroupFaithful(g, group, group.length, edgeType(g)) && routedThisPass(e);
|
|
37044
37684
|
}
|
|
37045
37685
|
const pts = routeRegularEdgeFaithful(g, e);
|
|
37046
37686
|
if (pts === null) return false;
|
|
@@ -37066,7 +37706,7 @@ function routeFlatEdge(e, g) {
|
|
|
37066
37706
|
if ((hasSidePort(e) || isAdjacentPortFlat(e, g)) && routeFaithfulSidePort(e, g)) return true;
|
|
37067
37707
|
if (e.tail.info.rank !== void 0 && e.tail.info.rank === e.head.info.rank && e.info.label === void 0 && !isFlatAdjacent(g, e)) {
|
|
37068
37708
|
const group = collectNonAdjacentFlatGroup(e, g);
|
|
37069
|
-
if (group.length > 0 && routeFlatEdgeGroupFaithful(g, group, group.length, edgeType(g)) && e
|
|
37709
|
+
if (group.length > 0 && routeFlatEdgeGroupFaithful(g, group, group.length, edgeType(g)) && routedThisPass(e)) return true;
|
|
37070
37710
|
}
|
|
37071
37711
|
return false;
|
|
37072
37712
|
}
|
|
@@ -37094,7 +37734,7 @@ function orderedDotEdges(g) {
|
|
|
37094
37734
|
return edges;
|
|
37095
37735
|
}
|
|
37096
37736
|
function routeLoneEdge(e, g) {
|
|
37097
|
-
if (e
|
|
37737
|
+
if (routedThisPass(e) || e.info.lost === true) return;
|
|
37098
37738
|
const et = e.info.edge_type ?? 0;
|
|
37099
37739
|
if (et === FLATORDER || et === IGNORED) return;
|
|
37100
37740
|
if (e.tail === e.head) return;
|
|
@@ -39905,13 +40545,13 @@ function swapBezier(b) {
|
|
|
39905
40545
|
b.eArrowOps = so;
|
|
39906
40546
|
}
|
|
39907
40547
|
}
|
|
39908
|
-
function swapSpline(s) {
|
|
39909
|
-
s.list.reverse();
|
|
39910
|
-
for (
|
|
40548
|
+
function swapSpline(s, stale = 0) {
|
|
40549
|
+
s.list.push(...s.list.splice(stale).reverse());
|
|
40550
|
+
for (let i = stale; i < s.list.length; i++) swapBezier(s.list[i]);
|
|
39911
40551
|
}
|
|
39912
40552
|
function swapEdgeSpline(e) {
|
|
39913
40553
|
if (e.info.spl === void 0) return;
|
|
39914
|
-
swapSpline(e.info.spl);
|
|
40554
|
+
swapSpline(e.info.spl, staleBezierCount(e));
|
|
39915
40555
|
const t = e.info.tailArrowOps;
|
|
39916
40556
|
e.info.tailArrowOps = e.info.headArrowOps;
|
|
39917
40557
|
e.info.headArrowOps = t;
|
|
@@ -40002,6 +40642,7 @@ function finalizeSplines(g, et, normalize) {
|
|
|
40002
40642
|
placeRegularEdgeLabels(g);
|
|
40003
40643
|
if (normalize) edgeNormalize(g);
|
|
40004
40644
|
if (et !== EDGETYPE_CURVED) routeDotEdges(g);
|
|
40645
|
+
if (normalize) swapStaleBeziers(g);
|
|
40005
40646
|
placePortLabels(g);
|
|
40006
40647
|
setState(GVSPLINES);
|
|
40007
40648
|
g.info.edgeLabelsDone = true;
|
|
@@ -40012,7 +40653,7 @@ function dotSplines_(g, normalize) {
|
|
|
40012
40653
|
if (et === EDGETYPE_ORTHO) return orthoDispatch(g);
|
|
40013
40654
|
if (et === EDGETYPE_CURVED) curvedTop(g);
|
|
40014
40655
|
markLowclusters(g);
|
|
40015
|
-
|
|
40656
|
+
beginRoutingPass(g);
|
|
40016
40657
|
const edges = [];
|
|
40017
40658
|
collectRankEdges(g, edges);
|
|
40018
40659
|
gvQsort(edges, edgecmp);
|
|
@@ -40845,6 +41486,75 @@ function polyGraphs(gs, root, pinfo, bbs) {
|
|
|
40845
41486
|
return ctx.places;
|
|
40846
41487
|
}
|
|
40847
41488
|
|
|
41489
|
+
// src/layout/pack/ccomps.ts
|
|
41490
|
+
function dfsCollect(g, start, visited) {
|
|
41491
|
+
const stack = [start];
|
|
41492
|
+
const comp = [];
|
|
41493
|
+
while (stack.length > 0) {
|
|
41494
|
+
const n = stack.pop();
|
|
41495
|
+
if (visited.has(n.name)) continue;
|
|
41496
|
+
visited.add(n.name);
|
|
41497
|
+
comp.push(n);
|
|
41498
|
+
for (const e of g.edges) {
|
|
41499
|
+
if (e.tail === n && !visited.has(e.head.name)) stack.push(e.head);
|
|
41500
|
+
if (e.head === n && !visited.has(e.tail.name)) stack.push(e.tail);
|
|
41501
|
+
}
|
|
41502
|
+
}
|
|
41503
|
+
return comp;
|
|
41504
|
+
}
|
|
41505
|
+
function buildSubgraph(root, nodes, name) {
|
|
41506
|
+
const sg = new root.constructor(name, "directed");
|
|
41507
|
+
sg.info.dotroot = root;
|
|
41508
|
+
sg.parent = root;
|
|
41509
|
+
sg.root = root.root;
|
|
41510
|
+
for (const n of [...nodes].sort((a, b) => a.id - b.id)) sg.nodes.set(n.name, n);
|
|
41511
|
+
const ns = new Set(nodes);
|
|
41512
|
+
sg.edges = root.edges.filter((e) => ns.has(e.tail) && ns.has(e.head));
|
|
41513
|
+
return sg;
|
|
41514
|
+
}
|
|
41515
|
+
function copyParentAttrs(parent2, sg) {
|
|
41516
|
+
for (const [k, v] of parent2.attrs) sg.attrs.set(k, v);
|
|
41517
|
+
return sg;
|
|
41518
|
+
}
|
|
41519
|
+
function isLegal(p) {
|
|
41520
|
+
return /^[A-Za-z0-9_]*$/.test(p);
|
|
41521
|
+
}
|
|
41522
|
+
function setPrefix(pfx) {
|
|
41523
|
+
return pfx == null || !isLegal(pfx) ? "_cc_" : pfx;
|
|
41524
|
+
}
|
|
41525
|
+
function ccomps(g, pfx) {
|
|
41526
|
+
const visited = /* @__PURE__ */ new Set();
|
|
41527
|
+
const result = [];
|
|
41528
|
+
let idx = 0;
|
|
41529
|
+
for (const n of g.nodes.values()) {
|
|
41530
|
+
if (visited.has(n.name)) continue;
|
|
41531
|
+
const comp = dfsCollect(g, n, visited);
|
|
41532
|
+
result.push(copyParentAttrs(g, buildSubgraph(g, comp, `${setPrefix(pfx)}${idx++}`)));
|
|
41533
|
+
}
|
|
41534
|
+
return result;
|
|
41535
|
+
}
|
|
41536
|
+
function pccomps(g, pfx) {
|
|
41537
|
+
const visited = /* @__PURE__ */ new Set();
|
|
41538
|
+
const result = [];
|
|
41539
|
+
let idx = 0;
|
|
41540
|
+
let pinned = false;
|
|
41541
|
+
const pinnedNodes = [];
|
|
41542
|
+
for (const n of g.nodes.values()) {
|
|
41543
|
+
if (visited.has(n.name) || !n.info.pinned) continue;
|
|
41544
|
+
for (const m of dfsCollect(g, n, visited)) pinnedNodes.push(m);
|
|
41545
|
+
pinned = true;
|
|
41546
|
+
}
|
|
41547
|
+
if (pinnedNodes.length > 0) {
|
|
41548
|
+
result.push(copyParentAttrs(g, buildSubgraph(g, pinnedNodes, `${setPrefix(pfx)}${idx++}`)));
|
|
41549
|
+
}
|
|
41550
|
+
for (const n of g.nodes.values()) {
|
|
41551
|
+
if (visited.has(n.name)) continue;
|
|
41552
|
+
const comp = dfsCollect(g, n, visited);
|
|
41553
|
+
result.push(copyParentAttrs(g, buildSubgraph(g, comp, `${setPrefix(pfx)}${idx++}`)));
|
|
41554
|
+
}
|
|
41555
|
+
return { graphs: result, pinned };
|
|
41556
|
+
}
|
|
41557
|
+
|
|
40848
41558
|
// src/layout/pack/index.ts
|
|
40849
41559
|
function putRects(ng, bbs, pinfo) {
|
|
40850
41560
|
if (ng <= 0) return [];
|
|
@@ -41021,63 +41731,6 @@ function shiftGraphs(ng, gs, pp, _root, _doSplines) {
|
|
|
41021
41731
|
}
|
|
41022
41732
|
return 0;
|
|
41023
41733
|
}
|
|
41024
|
-
function dfsCollect(g, start, visited) {
|
|
41025
|
-
const stack = [start];
|
|
41026
|
-
const comp = [];
|
|
41027
|
-
while (stack.length > 0) {
|
|
41028
|
-
const n = stack.pop();
|
|
41029
|
-
if (visited.has(n.name)) continue;
|
|
41030
|
-
visited.add(n.name);
|
|
41031
|
-
comp.push(n);
|
|
41032
|
-
for (const e of g.edges) {
|
|
41033
|
-
if (e.tail === n && !visited.has(e.head.name)) stack.push(e.head);
|
|
41034
|
-
if (e.head === n && !visited.has(e.tail.name)) stack.push(e.tail);
|
|
41035
|
-
}
|
|
41036
|
-
}
|
|
41037
|
-
return comp;
|
|
41038
|
-
}
|
|
41039
|
-
function buildSubgraph(root, nodes, name) {
|
|
41040
|
-
const sg = new root.constructor(name, "directed");
|
|
41041
|
-
sg.info.dotroot = root;
|
|
41042
|
-
sg.parent = root;
|
|
41043
|
-
sg.root = root.root;
|
|
41044
|
-
for (const n of [...nodes].sort((a, b) => a.id - b.id)) sg.nodes.set(n.name, n);
|
|
41045
|
-
const ns = new Set(nodes);
|
|
41046
|
-
sg.edges = root.edges.filter((e) => ns.has(e.tail) && ns.has(e.head));
|
|
41047
|
-
return sg;
|
|
41048
|
-
}
|
|
41049
|
-
function ccomps(g, pfx) {
|
|
41050
|
-
const visited = /* @__PURE__ */ new Set();
|
|
41051
|
-
const result = [];
|
|
41052
|
-
let idx = 0;
|
|
41053
|
-
for (const n of g.nodes.values()) {
|
|
41054
|
-
if (visited.has(n.name)) continue;
|
|
41055
|
-
const comp = dfsCollect(g, n, visited);
|
|
41056
|
-
result.push(buildSubgraph(g, comp, `${pfx}_${idx++}`));
|
|
41057
|
-
}
|
|
41058
|
-
return result;
|
|
41059
|
-
}
|
|
41060
|
-
function pccomps(g, pfx) {
|
|
41061
|
-
const visited = /* @__PURE__ */ new Set();
|
|
41062
|
-
const result = [];
|
|
41063
|
-
let idx = 0;
|
|
41064
|
-
let pinned = false;
|
|
41065
|
-
const pinnedNodes = [];
|
|
41066
|
-
for (const n of g.nodes.values()) {
|
|
41067
|
-
if (visited.has(n.name) || !n.info.pinned) continue;
|
|
41068
|
-
for (const m of dfsCollect(g, n, visited)) pinnedNodes.push(m);
|
|
41069
|
-
pinned = true;
|
|
41070
|
-
}
|
|
41071
|
-
if (pinnedNodes.length > 0) {
|
|
41072
|
-
result.push(buildSubgraph(g, pinnedNodes, `${pfx}_${idx++}`));
|
|
41073
|
-
}
|
|
41074
|
-
for (const n of g.nodes.values()) {
|
|
41075
|
-
if (visited.has(n.name)) continue;
|
|
41076
|
-
const comp = dfsCollect(g, n, visited);
|
|
41077
|
-
result.push(buildSubgraph(g, comp, `${pfx}_${idx++}`));
|
|
41078
|
-
}
|
|
41079
|
-
return { graphs: result, pinned };
|
|
41080
|
-
}
|
|
41081
41734
|
var PACK_FLAG_CHARS = {
|
|
41082
41735
|
c: PK_COL_MAJOR,
|
|
41083
41736
|
i: PK_INPUT_ORDER,
|
|
@@ -41351,6 +42004,7 @@ function setEdgeTypeFromAttr(g, defaultValue) {
|
|
|
41351
42004
|
setEdgeType(g, et);
|
|
41352
42005
|
}
|
|
41353
42006
|
function dotPhaseInit(g) {
|
|
42007
|
+
for (const e of g.edges) e.info.weight = void 0;
|
|
41354
42008
|
dotGraphInit(g);
|
|
41355
42009
|
setEdgeTypeFromAttr(g, EDGETYPE_SPLINE);
|
|
41356
42010
|
setAspect(g);
|
|
@@ -41591,7 +42245,11 @@ function ngIncreaseKey(h, increasedVertex, newDist, dist5) {
|
|
|
41591
42245
|
h.index[increasedVertex] = i;
|
|
41592
42246
|
}
|
|
41593
42247
|
function toDistType(w) {
|
|
41594
|
-
|
|
42248
|
+
const f = Math.fround(w);
|
|
42249
|
+
if (Number.isNaN(f)) return 0;
|
|
42250
|
+
if (f >= 2147483648) return MAX_DIST;
|
|
42251
|
+
if (f < -2147483648) return -2147483648;
|
|
42252
|
+
return Math.trunc(f);
|
|
41595
42253
|
}
|
|
41596
42254
|
function ngdijkstra(vertex, graph, n, dist5) {
|
|
41597
42255
|
let prevClosestDist = MAX_DIST;
|
|
@@ -42170,7 +42828,11 @@ var selfOnce = { warned: false };
|
|
|
42170
42828
|
registerRenderState(() => {
|
|
42171
42829
|
selfOnce.warned = false;
|
|
42172
42830
|
});
|
|
42173
|
-
|
|
42831
|
+
function warnStartSelfOnce() {
|
|
42832
|
+
if (selfOnce.warned) return;
|
|
42833
|
+
selfOnce.warned = true;
|
|
42834
|
+
agwarningf(WARN_SELF_IGNORED);
|
|
42835
|
+
}
|
|
42174
42836
|
function parseStart(p, dflt) {
|
|
42175
42837
|
let init = dflt;
|
|
42176
42838
|
let rest = p ?? "";
|
|
@@ -42200,7 +42862,7 @@ function initRegular(g, nG) {
|
|
|
42200
42862
|
function checkStart(g, nG = g.nodes.size, dflt = INIT_RANDOM) {
|
|
42201
42863
|
const { init, seed } = parseStart(g.root.attrs.get("start"), dflt);
|
|
42202
42864
|
if (init !== INIT_RANDOM && [...g.nodes.values()].some((n) => n.attrs.has("pos"))) {
|
|
42203
|
-
|
|
42865
|
+
agwarningf(WARN_POS_IGNORED);
|
|
42204
42866
|
}
|
|
42205
42867
|
if (init === INIT_REGULAR) initRegular(g, nG);
|
|
42206
42868
|
srand48(seed);
|
|
@@ -42234,65 +42896,17 @@ function checkStartAttr(g, mode) {
|
|
|
42234
42896
|
const value = g.root.attrs.get("start");
|
|
42235
42897
|
if (parseStart(value, INIT_RANDOM).init !== INIT_SELF) return;
|
|
42236
42898
|
if (mode === MODE_MAJOR) unsupported("start", value ?? "", "smart initialisation");
|
|
42237
|
-
if (
|
|
42238
|
-
selfOnce.warned = true;
|
|
42239
|
-
agerrLineOn("warn", WARN_SELF_IGNORED);
|
|
42240
|
-
}
|
|
42899
|
+
if (mode === MODE_SGD) warnStartSelfOnce();
|
|
42241
42900
|
}
|
|
42242
|
-
function
|
|
42243
|
-
const nodes = [...g.nodes.values()];
|
|
42244
|
-
if (nodes.length === 0) return true;
|
|
42245
|
-
const adj = new Map(nodes.map((n) => [n, []]));
|
|
42246
|
-
for (const e of g.edges) {
|
|
42247
|
-
adj.get(e.tail)?.push(e.head);
|
|
42248
|
-
adj.get(e.head)?.push(e.tail);
|
|
42249
|
-
}
|
|
42250
|
-
const seen2 = /* @__PURE__ */ new Set([nodes[0]]);
|
|
42251
|
-
const stack = [nodes[0]];
|
|
42252
|
-
for (let n = stack.pop(); n !== void 0; n = stack.pop()) {
|
|
42253
|
-
for (const m of adj.get(n) ?? []) if (!seen2.has(m)) {
|
|
42254
|
-
seen2.add(m);
|
|
42255
|
-
stack.push(m);
|
|
42256
|
-
}
|
|
42257
|
-
}
|
|
42258
|
-
return seen2.size === nodes.length;
|
|
42259
|
-
}
|
|
42260
|
-
function kkCircuitFallsBack(g) {
|
|
42261
|
-
const packed = getPack(g.root, -1, 0) >= 0 || (g.root.attrs.get("packmode") ?? "") !== "";
|
|
42262
|
-
return !packed && !isConnected(g.root);
|
|
42263
|
-
}
|
|
42264
|
-
function warnCircuitDisconnected(g) {
|
|
42265
|
-
if (circuitWarned.has(g.root)) return;
|
|
42266
|
-
circuitWarned.add(g.root);
|
|
42267
|
-
agerrLineOn(
|
|
42268
|
-
"warn",
|
|
42269
|
-
`graph ${agNameOf(g.root)} is disconnected. Hence, the circuit model
|
|
42270
|
-
is undefined. Reverting to the shortest path model.
|
|
42271
|
-
Alternatively, consider running neato using -Gpack=true or decomposing
|
|
42272
|
-
the graph into connected components.`
|
|
42273
|
-
);
|
|
42274
|
-
}
|
|
42275
|
-
function checkModel(g, mode, model) {
|
|
42276
|
-
const value = g.root.attrs.get("model") ?? "";
|
|
42277
|
-
const stressPath = mode === MODE_MAJOR || mode === MODE_KK;
|
|
42278
|
-
if (model === MODEL_SUBSET && stressPath) unsupported("model", value, "the subset distance model");
|
|
42279
|
-
if (model !== MODEL_CIRCUIT || !stressPath) return;
|
|
42280
|
-
if (mode === MODE_KK && kkCircuitFallsBack(g)) {
|
|
42281
|
-
warnCircuitDisconnected(g);
|
|
42282
|
-
return;
|
|
42283
|
-
}
|
|
42284
|
-
unsupported("model", value, "the circuit distance model");
|
|
42285
|
-
}
|
|
42286
|
-
function assertSupported(g, mode, model) {
|
|
42901
|
+
function assertSupported(g, mode) {
|
|
42287
42902
|
if (maxIterNegative(g)) return;
|
|
42288
42903
|
checkStartAttr(g, mode);
|
|
42289
|
-
checkModel(g, mode, model);
|
|
42290
42904
|
}
|
|
42291
42905
|
|
|
42292
42906
|
// src/layout/neato/sgd.ts
|
|
42293
42907
|
var MODEL_SHORTPATH = 0;
|
|
42294
|
-
var
|
|
42295
|
-
var
|
|
42908
|
+
var MODEL_CIRCUIT = 1;
|
|
42909
|
+
var MODEL_SUBSET = 2;
|
|
42296
42910
|
var MODEL_MDS = 3;
|
|
42297
42911
|
var SGD_EPSILON = 0.01;
|
|
42298
42912
|
var SGD_DFLT_ITERATIONS = 30;
|
|
@@ -42384,7 +42998,7 @@ function extractAdjacency(g, model) {
|
|
|
42384
42998
|
pinneds: new Array(nNodes).fill(false)
|
|
42385
42999
|
};
|
|
42386
43000
|
fillCsrEdges(g, graph);
|
|
42387
|
-
if (model ===
|
|
43001
|
+
if (model === MODEL_SUBSET) {
|
|
42388
43002
|
applySubsetWeights(graph);
|
|
42389
43003
|
}
|
|
42390
43004
|
return graph;
|
|
@@ -42482,7 +43096,7 @@ function buildUnfixed(g, n) {
|
|
|
42482
43096
|
return unfixed;
|
|
42483
43097
|
}
|
|
42484
43098
|
function resolveModel(model) {
|
|
42485
|
-
if (model ===
|
|
43099
|
+
if (model === MODEL_CIRCUIT) {
|
|
42486
43100
|
agerrLineOn(
|
|
42487
43101
|
"warn",
|
|
42488
43102
|
"circuit model not yet supported in Gmode=sgd, reverting to shortpath model"
|
|
@@ -42530,369 +43144,611 @@ function sgdLayout(g, model) {
|
|
|
42530
43144
|
posFromArray(g, pos);
|
|
42531
43145
|
}
|
|
42532
43146
|
|
|
42533
|
-
// src/layout/neato/
|
|
42534
|
-
var
|
|
42535
|
-
function
|
|
42536
|
-
|
|
42537
|
-
|
|
42538
|
-
|
|
42539
|
-
|
|
42540
|
-
|
|
42541
|
-
|
|
42542
|
-
let istar = 0;
|
|
42543
|
-
for (let ii = i; ii < n; ii++) {
|
|
42544
|
-
const dum = Math.abs(a[ii * n + i]);
|
|
42545
|
-
if (dum < amax) continue;
|
|
42546
|
-
istar = ii;
|
|
42547
|
-
amax = dum;
|
|
42548
|
-
}
|
|
42549
|
-
if (amax < MIN_PIVOT) return false;
|
|
42550
|
-
for (let j = i; j < n; j++) swap2(a, istar * n + j, i * n + j);
|
|
42551
|
-
swap2(c, istar, i);
|
|
42552
|
-
for (let ii = i + 1; ii < n; ii++) {
|
|
42553
|
-
const pivot = a[ii * n + i] / a[i * n + i];
|
|
42554
|
-
c[ii] -= pivot * c[i];
|
|
42555
|
-
for (let j = 0; j < n; j++) a[ii * n + j] = a[ii * n + j] - pivot * a[i * n + j];
|
|
43147
|
+
// src/layout/neato/kkutils.ts
|
|
43148
|
+
var SIZE_T_MODULUS = 2 ** 64;
|
|
43149
|
+
function commonNeighbors(graph, u, vVector) {
|
|
43150
|
+
let numSharedNeighbors = 0;
|
|
43151
|
+
for (let j = 1; j < graph[u].nedges; j++) {
|
|
43152
|
+
const neighbor2 = graph[u].edges[j];
|
|
43153
|
+
if (vVector[neighbor2] > 0) {
|
|
43154
|
+
numSharedNeighbors++;
|
|
43155
|
+
}
|
|
42556
43156
|
}
|
|
42557
|
-
return
|
|
43157
|
+
return numSharedNeighbors;
|
|
42558
43158
|
}
|
|
42559
|
-
function
|
|
42560
|
-
|
|
42561
|
-
|
|
42562
|
-
let ok = true;
|
|
42563
|
-
for (let i = 0; i < n - 1 && ok; i++) ok = eliminate(a, c, n, i);
|
|
42564
|
-
if (!ok || Math.abs(a[n * n - 1]) < MIN_PIVOT) {
|
|
42565
|
-
console.warn("ill-conditioned");
|
|
42566
|
-
return;
|
|
43159
|
+
function fillNeighborsVecUnweighted(graph, vtx, vtxVec) {
|
|
43160
|
+
for (let j = 1; j < graph[vtx].nedges; j++) {
|
|
43161
|
+
vtxVec[graph[vtx].edges[j]] = 1;
|
|
42567
43162
|
}
|
|
42568
|
-
|
|
42569
|
-
|
|
42570
|
-
|
|
42571
|
-
|
|
42572
|
-
for (let j = m + 1; j < n; j++) b[m] -= a[m * n + j] * b[j];
|
|
42573
|
-
b[m] /= a[m * n + m];
|
|
43163
|
+
}
|
|
43164
|
+
function emptyNeighborsVec(graph, vtx, vtxVec) {
|
|
43165
|
+
for (let j = 1; j < graph[vtx].nedges; j++) {
|
|
43166
|
+
vtxVec[graph[vtx].edges[j]] = 0;
|
|
42574
43167
|
}
|
|
42575
|
-
c.set(csave);
|
|
42576
|
-
a.set(asave);
|
|
42577
43168
|
}
|
|
42578
|
-
|
|
42579
|
-
|
|
42580
|
-
|
|
42581
|
-
return
|
|
42582
|
-
n,
|
|
42583
|
-
dist: dist5,
|
|
42584
|
-
adj,
|
|
42585
|
-
initialDist: initialDist2,
|
|
42586
|
-
heap: new Int32Array(n + 1),
|
|
42587
|
-
heapSize: 0,
|
|
42588
|
-
heapIndex: new Int32Array(n).fill(-1),
|
|
42589
|
-
nd: new Float64Array(n),
|
|
42590
|
-
hops: new Int32Array(n)
|
|
42591
|
-
};
|
|
43169
|
+
function compareKeys(a, b) {
|
|
43170
|
+
if (a < b) return -1;
|
|
43171
|
+
if (a > b) return 1;
|
|
43172
|
+
return 0;
|
|
42592
43173
|
}
|
|
42593
|
-
function
|
|
42594
|
-
|
|
42595
|
-
|
|
42596
|
-
|
|
42597
|
-
if (s.nd[u] <= s.nd[v]) break;
|
|
42598
|
-
s.heap[par] = v;
|
|
42599
|
-
s.heapIndex[v] = par;
|
|
42600
|
-
s.heap[i] = u;
|
|
42601
|
-
s.heapIndex[u] = i;
|
|
42602
|
-
}
|
|
43174
|
+
function gvSortByPlace(place, ordering, first, count) {
|
|
43175
|
+
const slice = Array.from(ordering.subarray(first, first + count));
|
|
43176
|
+
gvQsort(slice, (x, y) => compareKeys(place[x], place[y]));
|
|
43177
|
+
for (let i = 0; i < count; i++) ordering[first + i] = slice[i];
|
|
42603
43178
|
}
|
|
42604
|
-
function
|
|
42605
|
-
|
|
42606
|
-
|
|
42607
|
-
|
|
42608
|
-
|
|
42609
|
-
|
|
42610
|
-
if (s.nd[v] <= s.nd[u]) break;
|
|
42611
|
-
s.heap[c] = v;
|
|
42612
|
-
s.heapIndex[v] = c;
|
|
42613
|
-
s.heap[i] = u;
|
|
42614
|
-
s.heapIndex[u] = i;
|
|
42615
|
-
i = c;
|
|
43179
|
+
function quicksortPlace(place, ordering, size) {
|
|
43180
|
+
gvSortByPlace(place, ordering, 0, size);
|
|
43181
|
+
}
|
|
43182
|
+
function quicksortPlacef(place, ordering, first, last) {
|
|
43183
|
+
if (first < last) {
|
|
43184
|
+
gvSortByPlace(place, ordering, first, last - first + 1);
|
|
42616
43185
|
}
|
|
42617
43186
|
}
|
|
42618
|
-
function
|
|
42619
|
-
const
|
|
42620
|
-
|
|
42621
|
-
|
|
42622
|
-
|
|
43187
|
+
function computeApspDijkstra(graph, n) {
|
|
43188
|
+
const dij = [];
|
|
43189
|
+
for (let i = 0; i < n; i++) dij.push(new Int32Array(n));
|
|
43190
|
+
for (let i = 0; i < n; i++) ngdijkstra(i, graph, n, dij[i]);
|
|
43191
|
+
return dij;
|
|
42623
43192
|
}
|
|
42624
|
-
function
|
|
42625
|
-
|
|
42626
|
-
|
|
42627
|
-
|
|
42628
|
-
|
|
42629
|
-
s.heap[0] = v;
|
|
42630
|
-
s.heapIndex[v] = 0;
|
|
42631
|
-
if (i > 1) heapDown(s, v);
|
|
42632
|
-
s.heapIndex[rv] = -1;
|
|
42633
|
-
return rv;
|
|
43193
|
+
function computeApspSimple(graph, n) {
|
|
43194
|
+
const dij = [];
|
|
43195
|
+
for (let i = 0; i < n; i++) dij.push(new Int32Array(n));
|
|
43196
|
+
for (let i = 0; i < n; i++) bfs(i, graph, n, dij[i]);
|
|
43197
|
+
return dij;
|
|
42634
43198
|
}
|
|
42635
|
-
function
|
|
42636
|
-
|
|
42637
|
-
s.dist[v * s.n + u] = f;
|
|
43199
|
+
function computeApsp(graph, n) {
|
|
43200
|
+
return graph[0].ewgts.length > 0 ? computeApspDijkstra(graph, n) : computeApspSimple(graph, n);
|
|
42638
43201
|
}
|
|
42639
|
-
function
|
|
42640
|
-
|
|
42641
|
-
|
|
42642
|
-
|
|
42643
|
-
|
|
42644
|
-
|
|
42645
|
-
|
|
42646
|
-
|
|
42647
|
-
|
|
42648
|
-
|
|
42649
|
-
|
|
42650
|
-
|
|
42651
|
-
|
|
42652
|
-
|
|
42653
|
-
|
|
42654
|
-
}
|
|
43202
|
+
function artificialWeight(graph, degI, neighbor2, vtxVec) {
|
|
43203
|
+
const degJ = graph[neighbor2].nedges - 1;
|
|
43204
|
+
const w = degI + degJ - 2 * commonNeighbors(graph, neighbor2, vtxVec);
|
|
43205
|
+
return Math.fround(w < 0 ? w + SIZE_T_MODULUS : w);
|
|
43206
|
+
}
|
|
43207
|
+
function computeNewWeights(graph, n) {
|
|
43208
|
+
const vtxVec = new Int32Array(n);
|
|
43209
|
+
for (let i = 0; i < n; i++) {
|
|
43210
|
+
const weights = new Array(graph[i].nedges).fill(0);
|
|
43211
|
+
graph[i].ewgts = weights;
|
|
43212
|
+
fillNeighborsVecUnweighted(graph, i, vtxVec);
|
|
43213
|
+
const degI = graph[i].nedges - 1;
|
|
43214
|
+
for (let j = 1; j <= degI; j++) {
|
|
43215
|
+
const neighbor2 = graph[i].edges[j];
|
|
43216
|
+
weights[j] = artificialWeight(graph, degI, neighbor2, vtxVec);
|
|
42655
43217
|
}
|
|
43218
|
+
emptyNeighborsVec(graph, i, vtxVec);
|
|
42656
43219
|
}
|
|
42657
43220
|
}
|
|
42658
|
-
function
|
|
42659
|
-
|
|
42660
|
-
|
|
42661
|
-
|
|
42662
|
-
|
|
42663
|
-
|
|
42664
|
-
for (const k of [i * n + j, j * n + i]) if (k < dist5.length) dist5[k] = len;
|
|
43221
|
+
function restoreOldWeights(graph, n, oldWeights) {
|
|
43222
|
+
graph[0].ewgts = [];
|
|
43223
|
+
if (oldWeights !== null) {
|
|
43224
|
+
for (let i = 0; i < n; i++) {
|
|
43225
|
+
graph[i].ewgts = oldWeights[i];
|
|
43226
|
+
}
|
|
42665
43227
|
}
|
|
42666
43228
|
}
|
|
42667
|
-
|
|
42668
|
-
|
|
42669
|
-
|
|
42670
|
-
|
|
42671
|
-
|
|
42672
|
-
|
|
42673
|
-
var SPRING_COEFF2 = 1;
|
|
42674
|
-
function atoi(s) {
|
|
42675
|
-
const v = parseInt(s, 10);
|
|
42676
|
-
return Number.isNaN(v) ? 0 : v;
|
|
43229
|
+
function computeApspArtificialWeights(graph, n) {
|
|
43230
|
+
const oldWeights = graph[0].ewgts.length === 0 ? null : graph.slice(0, n).map((v) => v.ewgts);
|
|
43231
|
+
computeNewWeights(graph, n);
|
|
43232
|
+
const Dij = computeApspDijkstra(graph, n);
|
|
43233
|
+
restoreOldWeights(graph, n, oldWeights);
|
|
43234
|
+
return Dij;
|
|
42677
43235
|
}
|
|
42678
|
-
|
|
42679
|
-
|
|
42680
|
-
|
|
42681
|
-
|
|
42682
|
-
|
|
42683
|
-
|
|
42684
|
-
|
|
42685
|
-
|
|
42686
|
-
|
|
42687
|
-
|
|
43236
|
+
|
|
43237
|
+
// src/layout/neato/quad-prog-solve.ts
|
|
43238
|
+
var fr2 = Math.fround;
|
|
43239
|
+
var TOLERANCE = fr2(0.01);
|
|
43240
|
+
var BOUND = 1e9;
|
|
43241
|
+
var BLOCK_EPSILON = 1e-9;
|
|
43242
|
+
var NO_SPLIT = -1;
|
|
43243
|
+
var BITS = new DataView(new ArrayBuffer(8));
|
|
43244
|
+
function oddNeighbour(s, awayFromZero) {
|
|
43245
|
+
BITS.setFloat64(0, s);
|
|
43246
|
+
const hi = BITS.getUint32(0);
|
|
43247
|
+
const lo = BITS.getUint32(4);
|
|
43248
|
+
if (awayFromZero) {
|
|
43249
|
+
BITS.setUint32(4, lo + 1);
|
|
43250
|
+
} else if (lo === 0) {
|
|
43251
|
+
BITS.setUint32(0, hi - 1);
|
|
43252
|
+
BITS.setUint32(4, 4294967295);
|
|
43253
|
+
} else {
|
|
43254
|
+
BITS.setUint32(4, lo - 1);
|
|
42688
43255
|
}
|
|
42689
|
-
return
|
|
43256
|
+
return BITS.getFloat64(0);
|
|
42690
43257
|
}
|
|
42691
|
-
function
|
|
42692
|
-
const
|
|
42693
|
-
|
|
42694
|
-
const
|
|
42695
|
-
|
|
43258
|
+
function fmaf(a, b, c) {
|
|
43259
|
+
const p = a * b;
|
|
43260
|
+
const s = p + c;
|
|
43261
|
+
const bv = s - p;
|
|
43262
|
+
const err = p - (s - bv) + (c - bv);
|
|
43263
|
+
if (err === 0 || !Number.isFinite(s)) return fr2(s);
|
|
43264
|
+
BITS.setFloat64(0, s);
|
|
43265
|
+
if ((BITS.getUint32(4) & 1) !== 0) return fr2(s);
|
|
43266
|
+
return fr2(oddNeighbour(s, err > 0 === s > 0));
|
|
42696
43267
|
}
|
|
42697
|
-
function
|
|
42698
|
-
const
|
|
42699
|
-
return
|
|
43268
|
+
function blockPlaceNumerator(blockDeg, desPlaceBlock, negLapTimesDesired, toBlockConnectivity, curPlace) {
|
|
43269
|
+
const t = fmaf(blockDeg, desPlaceBlock, negLapTimesDesired);
|
|
43270
|
+
return fmaf(toBlockConnectivity, curPlace, t);
|
|
42700
43271
|
}
|
|
42701
|
-
function
|
|
42702
|
-
|
|
42703
|
-
const inn = /* @__PURE__ */ new Map();
|
|
42704
|
-
for (const e of g.edges) {
|
|
42705
|
-
if (e.head === e.tail) continue;
|
|
42706
|
-
const l = inn.get(e.head);
|
|
42707
|
-
if (l === void 0) inn.set(e.head, [e]);
|
|
42708
|
-
else l.push(e);
|
|
42709
|
-
}
|
|
42710
|
-
return nodes.map((np) => {
|
|
42711
|
-
const ins = (inn.get(np) ?? []).sort((a, b) => a.tail.id - b.tail.id || a.seq - b.seq);
|
|
42712
|
-
const outs = (out.get(np) ?? []).filter((e) => e.head !== e.tail);
|
|
42713
|
-
return [...outs, ...ins].map((e) => ({
|
|
42714
|
-
id: (e.tail === np ? e.head : e.tail).info.id,
|
|
42715
|
-
len: lens.get(e)
|
|
42716
|
-
}));
|
|
42717
|
-
});
|
|
43272
|
+
function equals(a, b) {
|
|
43273
|
+
return Math.abs(fr2(a - b)) < TOLERANCE;
|
|
42718
43274
|
}
|
|
42719
|
-
function
|
|
42720
|
-
|
|
42721
|
-
|
|
42722
|
-
|
|
42723
|
-
np.info.id = i;
|
|
42724
|
-
np.info.heapindex = -1;
|
|
42725
|
-
});
|
|
42726
|
-
const epsilon = epsilonOf(g, n);
|
|
42727
|
-
const damp = g.root.attrs.get("Damping");
|
|
42728
|
-
const { total, lens } = setEdgeLens(g, nodes);
|
|
42729
|
-
const ini = initialDist(g, total, epsilon);
|
|
42730
|
-
const st = {
|
|
42731
|
-
n,
|
|
42732
|
-
nodes,
|
|
42733
|
-
dist: new Float64Array(n * n).fill(ini),
|
|
42734
|
-
spring: new Float64Array(n * n).fill(1),
|
|
42735
|
-
sumT: new Float64Array(n * NDIM).fill(1),
|
|
42736
|
-
t: new Float64Array(n * n * NDIM),
|
|
42737
|
-
damping: damp === void 0 ? DEFAULT_DAMPING : parseFloat(damp) || 0,
|
|
42738
|
-
epsilon,
|
|
42739
|
-
maxIter,
|
|
42740
|
-
move: 0
|
|
42741
|
-
};
|
|
42742
|
-
return { st, adj: neighbours(g, nodes, lens), ini, lens };
|
|
43275
|
+
function fminf(a, b) {
|
|
43276
|
+
if (Number.isNaN(a)) return b;
|
|
43277
|
+
if (Number.isNaN(b)) return a;
|
|
43278
|
+
return a < b ? a : b;
|
|
42743
43279
|
}
|
|
42744
|
-
function
|
|
42745
|
-
|
|
42746
|
-
|
|
43280
|
+
function fmaxf(a, b) {
|
|
43281
|
+
if (Number.isNaN(a)) return b;
|
|
43282
|
+
if (Number.isNaN(b)) return a;
|
|
43283
|
+
return a > b ? a : b;
|
|
42747
43284
|
}
|
|
42748
|
-
function
|
|
42749
|
-
const
|
|
42750
|
-
|
|
42751
|
-
for (
|
|
42752
|
-
|
|
42753
|
-
|
|
43285
|
+
function unpackMatrix(packedMat, n) {
|
|
43286
|
+
const flat = new Float32Array(n * n);
|
|
43287
|
+
const mat = new Array(n);
|
|
43288
|
+
for (let i = 0; i < n; i++) mat[i] = flat.subarray(i * n, (i + 1) * n);
|
|
43289
|
+
for (let i = 0, k = 0; i < n; i++) {
|
|
43290
|
+
for (let j = i; j < n; j++, k++) {
|
|
43291
|
+
mat[j][i] = mat[i][j] = packedMat[k];
|
|
43292
|
+
}
|
|
42754
43293
|
}
|
|
43294
|
+
return mat;
|
|
42755
43295
|
}
|
|
42756
|
-
function
|
|
42757
|
-
let
|
|
42758
|
-
|
|
42759
|
-
|
|
42760
|
-
|
|
43296
|
+
function ensureMonotonicOrderingWithGaps(place, n, ordering, levels, numLevels, levelsGap) {
|
|
43297
|
+
let lowerBound = fr2(-1e9);
|
|
43298
|
+
let level = -1;
|
|
43299
|
+
let maxInLevel = 0;
|
|
43300
|
+
for (let i = 0; i < n; i++) {
|
|
43301
|
+
if (i >= maxInLevel) {
|
|
43302
|
+
level++;
|
|
43303
|
+
maxInLevel = level === numLevels ? n : levels[level];
|
|
43304
|
+
lowerBound = i > 0 ? fr2(place[ordering[i - 1]] + levelsGap) : fr2(-1e9);
|
|
43305
|
+
quicksortPlacef(place, ordering, i, maxInLevel - 1);
|
|
43306
|
+
}
|
|
43307
|
+
const node = ordering[i];
|
|
43308
|
+
if (place[node] < lowerBound) place[node] = lowerBound;
|
|
42761
43309
|
}
|
|
42762
|
-
return Math.sqrt(dist5);
|
|
42763
43310
|
}
|
|
42764
|
-
function
|
|
42765
|
-
const
|
|
42766
|
-
|
|
42767
|
-
|
|
42768
|
-
|
|
42769
|
-
if (
|
|
42770
|
-
|
|
43311
|
+
function computeNodeLevels(e) {
|
|
43312
|
+
const lev = new Int32Array(e.n);
|
|
43313
|
+
let level = -1;
|
|
43314
|
+
let maxInLevel = 0;
|
|
43315
|
+
for (let i = 0; i < e.n; i++) {
|
|
43316
|
+
if (i >= maxInLevel) {
|
|
43317
|
+
level++;
|
|
43318
|
+
maxInLevel = level === e.numLevels ? e.n : e.levels[level];
|
|
42771
43319
|
}
|
|
43320
|
+
lev[e.ordering[i]] = level;
|
|
42772
43321
|
}
|
|
42773
|
-
return
|
|
43322
|
+
return lev;
|
|
42774
43323
|
}
|
|
42775
|
-
function
|
|
42776
|
-
const
|
|
42777
|
-
|
|
42778
|
-
|
|
42779
|
-
|
|
42780
|
-
|
|
42781
|
-
|
|
42782
|
-
|
|
42783
|
-
|
|
43324
|
+
function growBlock(c, left2, curPlace) {
|
|
43325
|
+
const { place, lev, levelsGap, e } = c;
|
|
43326
|
+
const gap = e.fArray4;
|
|
43327
|
+
let targetPlace = curPlace;
|
|
43328
|
+
gap[e.ordering[left2]] = 0;
|
|
43329
|
+
let right2;
|
|
43330
|
+
for (right2 = left2 + 1; right2 < e.n; right2++) {
|
|
43331
|
+
if (lev[right2] > lev[right2 - 1]) {
|
|
43332
|
+
targetPlace = fr2(targetPlace + levelsGap);
|
|
42784
43333
|
}
|
|
43334
|
+
const node = e.ordering[right2];
|
|
43335
|
+
if (Math.abs(fr2(place[node] - targetPlace)) > BLOCK_EPSILON) break;
|
|
43336
|
+
gap[node] = fr2(place[node] - curPlace);
|
|
42785
43337
|
}
|
|
43338
|
+
return right2;
|
|
42786
43339
|
}
|
|
42787
|
-
function
|
|
42788
|
-
const {
|
|
42789
|
-
|
|
42790
|
-
|
|
42791
|
-
|
|
42792
|
-
|
|
42793
|
-
|
|
42794
|
-
if (
|
|
42795
|
-
|
|
42796
|
-
st.spring[j * n + i] = f;
|
|
43340
|
+
function computeDesiredPlaces(c, left2, right2) {
|
|
43341
|
+
const { e, place, b } = c;
|
|
43342
|
+
for (let i = left2; i < right2; i++) {
|
|
43343
|
+
const node = e.ordering[i];
|
|
43344
|
+
let newPlaceI = -b[node];
|
|
43345
|
+
const lapNode = e.A[node];
|
|
43346
|
+
for (let j = 0; j < e.n; j++) {
|
|
43347
|
+
if (j === node) continue;
|
|
43348
|
+
newPlaceI = fmaf(lapNode[j], place[j], newPlaceI);
|
|
42797
43349
|
}
|
|
43350
|
+
e.fArray1[node] = fr2(fr2(newPlaceI / -lapNode[node]) - e.fArray4[node]);
|
|
42798
43351
|
}
|
|
42799
|
-
st.sumT.fill(0);
|
|
42800
|
-
const del = new Float64Array(NDIM);
|
|
42801
|
-
for (let i = 0; i < n; i++) fillRow(st, i, del);
|
|
42802
43352
|
}
|
|
42803
|
-
function
|
|
42804
|
-
|
|
42805
|
-
|
|
42806
|
-
|
|
42807
|
-
|
|
42808
|
-
|
|
42809
|
-
|
|
42810
|
-
|
|
42811
|
-
|
|
42812
|
-
|
|
42813
|
-
|
|
42814
|
-
|
|
42815
|
-
|
|
42816
|
-
|
|
42817
|
-
|
|
43353
|
+
function collectWhere(c, from, to, test) {
|
|
43354
|
+
for (let j = from; j < to; j++) {
|
|
43355
|
+
const node = c.e.ordering[j];
|
|
43356
|
+
if (test(c.e.fArray1[node])) c.block.push(node);
|
|
43357
|
+
}
|
|
43358
|
+
}
|
|
43359
|
+
function orderBlockByLevels(c, left2, right2, curPlace) {
|
|
43360
|
+
const { e } = c;
|
|
43361
|
+
c.block.length = 0;
|
|
43362
|
+
let firstNextLevel = 0;
|
|
43363
|
+
for (let i = left2; i < right2; i = firstNextLevel) {
|
|
43364
|
+
const level = c.lev[e.ordering[i]];
|
|
43365
|
+
firstNextLevel = level === e.numLevels ? right2 : Math.min(right2, e.levels[level]);
|
|
43366
|
+
collectWhere(c, i, firstNextLevel, (d) => d < curPlace);
|
|
43367
|
+
collectWhere(c, i, firstNextLevel, (d) => d === curPlace);
|
|
43368
|
+
collectWhere(c, i, firstNextLevel, (d) => d > curPlace);
|
|
43369
|
+
}
|
|
43370
|
+
}
|
|
43371
|
+
function computePrefixDesiredPlaces(c, curPlace) {
|
|
43372
|
+
const { e, block } = c;
|
|
43373
|
+
let desPlaceBlock = 0;
|
|
43374
|
+
let blockDeg = 0;
|
|
43375
|
+
for (let i = 0; i < block.length; i++) {
|
|
43376
|
+
const node = block[i];
|
|
43377
|
+
let toBlockConnectivity = 0;
|
|
43378
|
+
const lapNode = e.A[node];
|
|
43379
|
+
for (let j = 0; j < i; j++) {
|
|
43380
|
+
toBlockConnectivity = fr2(toBlockConnectivity - lapNode[block[j]]);
|
|
42818
43381
|
}
|
|
43382
|
+
toBlockConnectivity = fr2(toBlockConnectivity * 2);
|
|
43383
|
+
const num2 = blockPlaceNumerator(
|
|
43384
|
+
blockDeg,
|
|
43385
|
+
desPlaceBlock,
|
|
43386
|
+
fr2(-lapNode[node] * e.fArray1[node]),
|
|
43387
|
+
toBlockConnectivity,
|
|
43388
|
+
curPlace
|
|
43389
|
+
);
|
|
43390
|
+
desPlaceBlock = fr2(num2 / fr2(fr2(blockDeg - lapNode[node]) + toBlockConnectivity));
|
|
43391
|
+
e.fArray2[i] = desPlaceBlock;
|
|
43392
|
+
blockDeg = fr2(blockDeg + fr2(toBlockConnectivity - lapNode[node]));
|
|
43393
|
+
}
|
|
43394
|
+
if (e.n >= 0 && block.length === e.n) {
|
|
43395
|
+
e.fArray2[e.n - 1] = curPlace;
|
|
42819
43396
|
}
|
|
42820
43397
|
}
|
|
42821
|
-
function
|
|
42822
|
-
const {
|
|
42823
|
-
|
|
42824
|
-
|
|
42825
|
-
|
|
43398
|
+
function computeSuffixDesiredPlaces(c, curPlace) {
|
|
43399
|
+
const { e, block } = c;
|
|
43400
|
+
let desPlaceBlock = 0;
|
|
43401
|
+
let blockDeg = 0;
|
|
43402
|
+
for (let i = block.length - 1; i >= 0; i--) {
|
|
43403
|
+
const node = block[i];
|
|
43404
|
+
let toBlockConnectivity = 0;
|
|
43405
|
+
const lapNode = e.A[node];
|
|
43406
|
+
for (let j = i + 1; j < block.length; j++) {
|
|
43407
|
+
toBlockConnectivity = fr2(toBlockConnectivity - lapNode[block[j]]);
|
|
43408
|
+
}
|
|
43409
|
+
toBlockConnectivity = fr2(toBlockConnectivity * 2);
|
|
43410
|
+
const num2 = blockPlaceNumerator(
|
|
43411
|
+
blockDeg,
|
|
43412
|
+
desPlaceBlock,
|
|
43413
|
+
fr2(-lapNode[node] * e.fArray1[node]),
|
|
43414
|
+
toBlockConnectivity,
|
|
43415
|
+
curPlace
|
|
43416
|
+
);
|
|
43417
|
+
desPlaceBlock = fr2(num2 / fr2(fr2(blockDeg - lapNode[node]) + toBlockConnectivity));
|
|
43418
|
+
e.fArray3[i] = desPlaceBlock;
|
|
43419
|
+
blockDeg = fr2(blockDeg + fr2(toBlockConnectivity - lapNode[node]));
|
|
43420
|
+
}
|
|
43421
|
+
if (e.n >= 0 && block.length === e.n) {
|
|
43422
|
+
e.fArray3[0] = curPlace;
|
|
43423
|
+
}
|
|
43424
|
+
}
|
|
43425
|
+
var LIMITED = new Float64Array(2);
|
|
43426
|
+
function limitMoves(prefix, suffix, curPlace) {
|
|
43427
|
+
if (suffix < prefix) {
|
|
43428
|
+
if (suffix < curPlace) {
|
|
43429
|
+
if (prefix > curPlace) prefix = curPlace;
|
|
43430
|
+
suffix = prefix;
|
|
43431
|
+
} else if (prefix > curPlace) {
|
|
43432
|
+
prefix = suffix;
|
|
43433
|
+
}
|
|
43434
|
+
}
|
|
43435
|
+
LIMITED[0] = prefix;
|
|
43436
|
+
LIMITED[1] = suffix;
|
|
43437
|
+
}
|
|
43438
|
+
function findBestSplit(c, curPlace) {
|
|
43439
|
+
const { e, block } = c;
|
|
43440
|
+
let bestI = NO_SPLIT;
|
|
43441
|
+
let maxMovement = 0;
|
|
43442
|
+
for (let i = 0; i < block.length; i++) {
|
|
43443
|
+
const suffixDesPlace = e.fArray3[i];
|
|
43444
|
+
const prefixDesPlace = i > 0 ? e.fArray2[i - 1] : suffixDesPlace;
|
|
43445
|
+
limitMoves(prefixDesPlace, suffixDesPlace, curPlace);
|
|
43446
|
+
const movement = (block.length - i) * Math.abs(fr2(LIMITED[1] - curPlace)) + i * Math.abs(fr2(LIMITED[0] - curPlace));
|
|
43447
|
+
if (movement > maxMovement) {
|
|
43448
|
+
maxMovement = movement;
|
|
43449
|
+
bestI = i;
|
|
43450
|
+
}
|
|
43451
|
+
}
|
|
43452
|
+
return bestI;
|
|
43453
|
+
}
|
|
43454
|
+
function computeUpperBound(c, right2) {
|
|
43455
|
+
const { e, place, lev, levelsGap, block } = c;
|
|
43456
|
+
if (right2 >= e.n) return BOUND;
|
|
43457
|
+
const lastGap = e.fArray4[block[block.length - 1]];
|
|
43458
|
+
const nextPlace = place[e.ordering[right2]];
|
|
43459
|
+
if (lev[e.ordering[right2]] > lev[e.ordering[right2 - 1]]) {
|
|
43460
|
+
return fr2(fr2(nextPlace - levelsGap) - lastGap);
|
|
43461
|
+
}
|
|
43462
|
+
return fr2(nextPlace - lastGap);
|
|
43463
|
+
}
|
|
43464
|
+
function nextLowerBound(c, right2) {
|
|
43465
|
+
const { e, place, lev, levelsGap, block } = c;
|
|
43466
|
+
const last = place[block[block.length - 1]];
|
|
43467
|
+
if (right2 < e.n && lev[e.ordering[right2]] > lev[e.ordering[right2 - 1]]) {
|
|
43468
|
+
return fr2(last + levelsGap);
|
|
43469
|
+
}
|
|
43470
|
+
return last;
|
|
43471
|
+
}
|
|
43472
|
+
function moveSplitBlock(c, bestI, left2, right2, curPlace) {
|
|
43473
|
+
const { e, place, block } = c;
|
|
43474
|
+
let suffixDesPlace = e.fArray3[bestI];
|
|
43475
|
+
let prefixDesPlace = bestI > 0 ? e.fArray2[bestI - 1] : suffixDesPlace;
|
|
43476
|
+
suffixDesPlace = fminf(suffixDesPlace, computeUpperBound(c, right2));
|
|
43477
|
+
prefixDesPlace = fmaxf(prefixDesPlace, c.lowerBound);
|
|
43478
|
+
limitMoves(prefixDesPlace, suffixDesPlace, curPlace);
|
|
43479
|
+
prefixDesPlace = LIMITED[0];
|
|
43480
|
+
suffixDesPlace = LIMITED[1];
|
|
43481
|
+
for (let i = 0; i < bestI; i++) {
|
|
43482
|
+
place[block[i]] = fr2(prefixDesPlace + e.fArray4[block[i]]);
|
|
43483
|
+
}
|
|
43484
|
+
for (let i = bestI; i < block.length; i++) {
|
|
43485
|
+
place[block[i]] = fr2(suffixDesPlace + e.fArray4[block[i]]);
|
|
43486
|
+
}
|
|
43487
|
+
c.lowerBound = nextLowerBound(c, right2);
|
|
43488
|
+
for (let i = left2; i < right2; i++) e.ordering[i] = block[i - left2];
|
|
43489
|
+
c.converged = c.converged && equals(prefixDesPlace, curPlace) && equals(suffixDesPlace, curPlace);
|
|
43490
|
+
}
|
|
43491
|
+
function processBlock(c, left2) {
|
|
43492
|
+
const curPlace = c.place[c.e.ordering[left2]];
|
|
43493
|
+
const right2 = growBlock(c, left2, curPlace);
|
|
43494
|
+
computeDesiredPlaces(c, left2, right2);
|
|
43495
|
+
orderBlockByLevels(c, left2, right2, curPlace);
|
|
43496
|
+
computePrefixDesiredPlaces(c, curPlace);
|
|
43497
|
+
computeSuffixDesiredPlaces(c, curPlace);
|
|
43498
|
+
const bestI = findBestSplit(c, curPlace);
|
|
43499
|
+
if (bestI !== NO_SPLIT) {
|
|
43500
|
+
moveSplitBlock(c, bestI, left2, right2, curPlace);
|
|
43501
|
+
} else {
|
|
43502
|
+
c.lowerBound = nextLowerBound(c, right2);
|
|
43503
|
+
}
|
|
43504
|
+
return right2;
|
|
43505
|
+
}
|
|
43506
|
+
function constrainedMajorizationNewWithGaps(e, b, coords, curAxis, maxIterations, levelsGap) {
|
|
43507
|
+
const place = coords[curAxis];
|
|
43508
|
+
if (maxIterations <= 0) return;
|
|
43509
|
+
const gap = fr2(levelsGap);
|
|
43510
|
+
ensureMonotonicOrderingWithGaps(place, e.n, e.ordering, e.levels, e.numLevels, gap);
|
|
43511
|
+
const c = {
|
|
43512
|
+
e,
|
|
43513
|
+
place,
|
|
43514
|
+
b,
|
|
43515
|
+
lev: computeNodeLevels(e),
|
|
43516
|
+
levelsGap: gap,
|
|
43517
|
+
block: [],
|
|
43518
|
+
lowerBound: fr2(-BOUND),
|
|
43519
|
+
converged: false
|
|
43520
|
+
};
|
|
43521
|
+
for (let counter = 0; counter < maxIterations && !c.converged; counter++) {
|
|
43522
|
+
c.converged = true;
|
|
43523
|
+
c.lowerBound = fr2(-BOUND);
|
|
43524
|
+
for (let left2 = 0, right2; left2 < e.n; left2 = right2) {
|
|
43525
|
+
right2 = processBlock(c, left2);
|
|
43526
|
+
}
|
|
43527
|
+
orthog1f(e.n, place);
|
|
43528
|
+
}
|
|
43529
|
+
}
|
|
43530
|
+
function initConstrainedMajorization(packedMat, n, ordering, levels, numLevels) {
|
|
43531
|
+
return {
|
|
43532
|
+
A: unpackMatrix(packedMat, n),
|
|
43533
|
+
n,
|
|
43534
|
+
fArray1: new Float32Array(n),
|
|
43535
|
+
fArray2: new Float32Array(n),
|
|
43536
|
+
fArray3: new Float32Array(n),
|
|
43537
|
+
fArray4: new Float32Array(n),
|
|
43538
|
+
ordering,
|
|
43539
|
+
levels,
|
|
43540
|
+
numLevels
|
|
43541
|
+
};
|
|
43542
|
+
}
|
|
43543
|
+
|
|
43544
|
+
// src/layout/neato/lu.ts
|
|
43545
|
+
var DOT_VECTOR_TERMS = 8;
|
|
43546
|
+
function newArray(m, n, ival) {
|
|
43547
|
+
const mem = new Float64Array(m * n);
|
|
43548
|
+
const rv = [];
|
|
43549
|
+
for (let i = 0; i < m; i++) {
|
|
43550
|
+
rv.push(mem.subarray(i * n, (i + 1) * n));
|
|
43551
|
+
rv[i].fill(ival);
|
|
43552
|
+
}
|
|
43553
|
+
return rv;
|
|
43554
|
+
}
|
|
43555
|
+
function luScaleRows(lu, a, n, scales) {
|
|
43556
|
+
const m = lu.lu;
|
|
43557
|
+
const ps = lu.ps;
|
|
42826
43558
|
for (let i = 0; i < n; i++) {
|
|
42827
|
-
|
|
42828
|
-
|
|
42829
|
-
|
|
42830
|
-
|
|
42831
|
-
|
|
42832
|
-
|
|
43559
|
+
let biggest = 0;
|
|
43560
|
+
for (let j = 0; j < n; j++) biggest = fmaxf(biggest, Math.abs(m[i][j] = a[i][j]));
|
|
43561
|
+
if (biggest > 0) scales[i] = 1 / biggest;
|
|
43562
|
+
else return false;
|
|
43563
|
+
ps[i] = i;
|
|
43564
|
+
}
|
|
43565
|
+
return true;
|
|
43566
|
+
}
|
|
43567
|
+
function luFindPivot(lu, k, n, scales, pivotindex) {
|
|
43568
|
+
const m = lu.lu;
|
|
43569
|
+
const ps = lu.ps;
|
|
43570
|
+
let biggest = 0;
|
|
43571
|
+
for (let i = k; i < n; i++) {
|
|
43572
|
+
const tempf = Math.abs(m[ps[i]][k]) * scales[ps[i]];
|
|
43573
|
+
if (biggest < tempf) {
|
|
43574
|
+
biggest = tempf;
|
|
43575
|
+
pivotindex = i;
|
|
42833
43576
|
}
|
|
42834
|
-
|
|
42835
|
-
|
|
42836
|
-
|
|
42837
|
-
|
|
42838
|
-
|
|
42839
|
-
|
|
43577
|
+
}
|
|
43578
|
+
if (biggest <= 0) return -1;
|
|
43579
|
+
return pivotindex;
|
|
43580
|
+
}
|
|
43581
|
+
function luEliminate(lu, k, n) {
|
|
43582
|
+
const m = lu.lu;
|
|
43583
|
+
const ps = lu.ps;
|
|
43584
|
+
const rowK = m[ps[k]];
|
|
43585
|
+
const pivot = rowK[k];
|
|
43586
|
+
for (let i = k + 1; i < n; i++) {
|
|
43587
|
+
const rowI = m[ps[i]];
|
|
43588
|
+
const mult = rowI[k] = rowI[k] / pivot;
|
|
43589
|
+
for (let j = k + 1; j < n; j++) rowI[j] = fma(-mult, rowK[j], rowI[j]);
|
|
43590
|
+
}
|
|
43591
|
+
}
|
|
43592
|
+
function luDecompose(lu, a, n) {
|
|
43593
|
+
lu.lu = newArray(n, n, 0);
|
|
43594
|
+
lu.ps = new Int32Array(n);
|
|
43595
|
+
const scales = new Float64Array(n);
|
|
43596
|
+
if (!luScaleRows(lu, a, n, scales)) {
|
|
43597
|
+
luFree(lu);
|
|
43598
|
+
return 0;
|
|
43599
|
+
}
|
|
43600
|
+
for (let k = 0, pivotindex = 0; k < n - 1; k++) {
|
|
43601
|
+
pivotindex = luFindPivot(lu, k, n, scales, pivotindex);
|
|
43602
|
+
if (pivotindex < 0) {
|
|
43603
|
+
luFree(lu);
|
|
43604
|
+
return 0;
|
|
42840
43605
|
}
|
|
43606
|
+
if (pivotindex !== k) {
|
|
43607
|
+
const ps = lu.ps;
|
|
43608
|
+
const t = ps[k];
|
|
43609
|
+
ps[k] = ps[pivotindex];
|
|
43610
|
+
ps[pivotindex] = t;
|
|
43611
|
+
}
|
|
43612
|
+
luEliminate(lu, k, n);
|
|
42841
43613
|
}
|
|
42842
|
-
|
|
42843
|
-
|
|
43614
|
+
if (lu.lu[lu.ps[n - 1]][n - 1] === 0) {
|
|
43615
|
+
luFree(lu);
|
|
43616
|
+
return 0;
|
|
42844
43617
|
}
|
|
43618
|
+
return 1;
|
|
42845
43619
|
}
|
|
42846
|
-
function
|
|
42847
|
-
|
|
42848
|
-
let
|
|
42849
|
-
let
|
|
42850
|
-
for (
|
|
42851
|
-
|
|
42852
|
-
|
|
42853
|
-
|
|
42854
|
-
|
|
42855
|
-
|
|
42856
|
-
|
|
43620
|
+
function luDot(row, x, from, to) {
|
|
43621
|
+
const vecEnd = from + (to - from) - (to - from) % DOT_VECTOR_TERMS;
|
|
43622
|
+
let dot = 0;
|
|
43623
|
+
let j = from;
|
|
43624
|
+
for (; j < vecEnd; j++) dot += row[j] * x[j];
|
|
43625
|
+
for (; j < to; j++) dot = fma(row[j], x[j], dot);
|
|
43626
|
+
return dot;
|
|
43627
|
+
}
|
|
43628
|
+
function luSolve(lu, x, bi, n) {
|
|
43629
|
+
const m = lu.lu;
|
|
43630
|
+
const ps = lu.ps;
|
|
43631
|
+
for (let i = 0; i < n; i++) {
|
|
43632
|
+
const dot = luDot(m[ps[i]], x, 0, i);
|
|
43633
|
+
x[i] = (ps[i] === bi ? 1 : 0) - dot;
|
|
43634
|
+
}
|
|
43635
|
+
for (let i = n - 1; i >= 0; i--) {
|
|
43636
|
+
const row = m[ps[i]];
|
|
43637
|
+
const dot = luDot(row, x, i + 1, n);
|
|
43638
|
+
x[i] = (x[i] - dot) / row[i];
|
|
43639
|
+
}
|
|
43640
|
+
}
|
|
43641
|
+
function luFree(lu) {
|
|
43642
|
+
if (lu === null) {
|
|
43643
|
+
return;
|
|
43644
|
+
}
|
|
43645
|
+
lu.lu = null;
|
|
43646
|
+
lu.ps = null;
|
|
43647
|
+
}
|
|
43648
|
+
|
|
43649
|
+
// src/layout/neato/matinv.ts
|
|
43650
|
+
function matinv(A3, Ainv, n) {
|
|
43651
|
+
const lu = { lu: null, ps: null };
|
|
43652
|
+
if (luDecompose(lu, A3, n) === 0) return 0;
|
|
43653
|
+
for (let i = 0; i < n; i++) {
|
|
43654
|
+
luSolve(lu, Ainv[i], i, n);
|
|
43655
|
+
}
|
|
43656
|
+
luFree(lu);
|
|
43657
|
+
for (let i = 0; i < n; i++) {
|
|
43658
|
+
for (let j = 0; j < i; j++) {
|
|
43659
|
+
const t = Ainv[i][j];
|
|
43660
|
+
Ainv[i][j] = Ainv[j][i];
|
|
43661
|
+
Ainv[j][i] = t;
|
|
42857
43662
|
}
|
|
42858
43663
|
}
|
|
42859
|
-
return
|
|
43664
|
+
return 1;
|
|
42860
43665
|
}
|
|
42861
|
-
|
|
42862
|
-
|
|
42863
|
-
|
|
42864
|
-
|
|
42865
|
-
|
|
42866
|
-
|
|
42867
|
-
|
|
42868
|
-
|
|
42869
|
-
|
|
42870
|
-
|
|
42871
|
-
pos[i] += b[i];
|
|
43666
|
+
|
|
43667
|
+
// src/layout/neato/circuit.ts
|
|
43668
|
+
function solveCircuit(nG, Gm, GmInv) {
|
|
43669
|
+
for (let i = 0; i < nG; i++) {
|
|
43670
|
+
const row = Gm[i];
|
|
43671
|
+
let sum = 0;
|
|
43672
|
+
for (let j = 0; j < nG; j++) {
|
|
43673
|
+
if (i !== j) sum += row[j];
|
|
43674
|
+
}
|
|
43675
|
+
row[i] = -sum;
|
|
42872
43676
|
}
|
|
42873
|
-
|
|
42874
|
-
updateArrays(st, m);
|
|
43677
|
+
return matinv(Gm, GmInv, nG - 1);
|
|
42875
43678
|
}
|
|
42876
|
-
function
|
|
42877
|
-
|
|
42878
|
-
|
|
42879
|
-
|
|
43679
|
+
function circuitConductances(g, nG, lens) {
|
|
43680
|
+
const Gm = newArray(nG, nG, 0);
|
|
43681
|
+
const cells = new Float64Array(Gm[0].buffer);
|
|
43682
|
+
for (const v of g.nodes.values()) {
|
|
43683
|
+
for (const e of [...v.outEdges(g), ...v.inEdges(g)]) {
|
|
43684
|
+
const i = e.tail.id + 1;
|
|
43685
|
+
const j = e.head.id + 1;
|
|
43686
|
+
if (i === j) continue;
|
|
43687
|
+
const conductance = -1 / lens.get(e);
|
|
43688
|
+
for (const k of [j * nG + i, i * nG + j]) if (k < cells.length) cells[k] = conductance;
|
|
43689
|
+
}
|
|
42880
43690
|
}
|
|
43691
|
+
return Gm;
|
|
42881
43692
|
}
|
|
42882
|
-
function
|
|
42883
|
-
|
|
42884
|
-
|
|
43693
|
+
function circuitDistances(GmInv, nG, dist5) {
|
|
43694
|
+
for (let i = 0; i < nG; i++) {
|
|
43695
|
+
for (let j = 0; j < nG; j++) {
|
|
43696
|
+
dist5[i * nG + j] = GmInv[i][i] + GmInv[j][j] - 2 * GmInv[i][j];
|
|
43697
|
+
}
|
|
43698
|
+
}
|
|
42885
43699
|
}
|
|
42886
|
-
function
|
|
42887
|
-
const
|
|
42888
|
-
const
|
|
42889
|
-
|
|
42890
|
-
|
|
42891
|
-
|
|
42892
|
-
|
|
42893
|
-
|
|
42894
|
-
|
|
42895
|
-
|
|
43700
|
+
function circuitModel(g, nG, dist5, lens) {
|
|
43701
|
+
const Gm = circuitConductances(g, nG, lens);
|
|
43702
|
+
const GmInv = newArray(nG, nG, 0);
|
|
43703
|
+
const rv = solveCircuit(nG, Gm, GmInv);
|
|
43704
|
+
if (rv) circuitDistances(GmInv, nG, dist5);
|
|
43705
|
+
return rv === 1;
|
|
43706
|
+
}
|
|
43707
|
+
|
|
43708
|
+
// src/layout/neato/kk-solve.ts
|
|
43709
|
+
var MIN_PIVOT = 1e-10;
|
|
43710
|
+
function swap2(x, i, j) {
|
|
43711
|
+
const t = x[i];
|
|
43712
|
+
x[i] = x[j];
|
|
43713
|
+
x[j] = t;
|
|
43714
|
+
}
|
|
43715
|
+
function eliminate(a, c, n, i) {
|
|
43716
|
+
let amax = 0;
|
|
43717
|
+
let istar = 0;
|
|
43718
|
+
for (let ii = i; ii < n; ii++) {
|
|
43719
|
+
const dum = Math.abs(a[ii * n + i]);
|
|
43720
|
+
if (dum < amax) continue;
|
|
43721
|
+
istar = ii;
|
|
43722
|
+
amax = dum;
|
|
43723
|
+
}
|
|
43724
|
+
if (amax < MIN_PIVOT) return false;
|
|
43725
|
+
for (let j = i; j < n; j++) swap2(a, istar * n + j, i * n + j);
|
|
43726
|
+
swap2(c, istar, i);
|
|
43727
|
+
for (let ii = i + 1; ii < n; ii++) {
|
|
43728
|
+
const pivot = a[ii * n + i] / a[i * n + i];
|
|
43729
|
+
c[ii] = fms(pivot, c[i], c[ii]);
|
|
43730
|
+
for (let j = 0; j < n; j++) a[ii * n + j] = fms(pivot, a[i * n + j], a[ii * n + j]);
|
|
43731
|
+
}
|
|
43732
|
+
return true;
|
|
43733
|
+
}
|
|
43734
|
+
function solve(a, b, c, n) {
|
|
43735
|
+
const asave = Float64Array.from(a);
|
|
43736
|
+
const csave = Float64Array.from(c);
|
|
43737
|
+
let ok = true;
|
|
43738
|
+
for (let i = 0; i < n - 1 && ok; i++) ok = eliminate(a, c, n, i);
|
|
43739
|
+
if (!ok || Math.abs(a[n * n - 1]) < MIN_PIVOT) {
|
|
43740
|
+
console.warn("ill-conditioned");
|
|
43741
|
+
return;
|
|
43742
|
+
}
|
|
43743
|
+
b[n - 1] = c[n - 1] / a[n * n - 1];
|
|
43744
|
+
for (let k = 0; k < n - 1; k++) {
|
|
43745
|
+
const m = n - k - 2;
|
|
43746
|
+
b[m] = c[m];
|
|
43747
|
+
for (let j = m + 1; j < n; j++) b[m] = fms(a[m * n + j], b[j], b[m]);
|
|
43748
|
+
b[m] /= a[m * n + m];
|
|
43749
|
+
}
|
|
43750
|
+
c.set(csave);
|
|
43751
|
+
a.set(asave);
|
|
42896
43752
|
}
|
|
42897
43753
|
|
|
42898
43754
|
// src/layout/neato/make-graph-data.ts
|
|
@@ -42984,346 +43840,353 @@ function makeGraphDataC(g, nodeList, haveLen, haveDir, mode = -1) {
|
|
|
42984
43840
|
return vtx;
|
|
42985
43841
|
}
|
|
42986
43842
|
|
|
42987
|
-
// src/layout/neato/
|
|
42988
|
-
function
|
|
42989
|
-
|
|
42990
|
-
|
|
42991
|
-
|
|
42992
|
-
|
|
42993
|
-
|
|
42994
|
-
|
|
42995
|
-
|
|
42996
|
-
|
|
43843
|
+
// src/layout/neato/kk-paths.ts
|
|
43844
|
+
function newPathState(n, dist5, adj, initialDist2) {
|
|
43845
|
+
return {
|
|
43846
|
+
n,
|
|
43847
|
+
dist: dist5,
|
|
43848
|
+
adj,
|
|
43849
|
+
initialDist: initialDist2,
|
|
43850
|
+
heap: new Int32Array(n + 1),
|
|
43851
|
+
heapSize: 0,
|
|
43852
|
+
heapIndex: new Int32Array(n).fill(-1),
|
|
43853
|
+
nd: new Float64Array(n),
|
|
43854
|
+
hops: new Int32Array(n)
|
|
43855
|
+
};
|
|
42997
43856
|
}
|
|
42998
|
-
function
|
|
42999
|
-
|
|
43857
|
+
function heapUp(s, v) {
|
|
43858
|
+
for (let i = s.heapIndex[v], par; i > 0; i = par) {
|
|
43859
|
+
par = i - 1 >> 1;
|
|
43860
|
+
const u = s.heap[par];
|
|
43861
|
+
if (s.nd[u] <= s.nd[v]) break;
|
|
43862
|
+
s.heap[par] = v;
|
|
43863
|
+
s.heapIndex[v] = par;
|
|
43864
|
+
s.heap[i] = u;
|
|
43865
|
+
s.heapIndex[u] = i;
|
|
43866
|
+
}
|
|
43000
43867
|
}
|
|
43001
|
-
function
|
|
43002
|
-
|
|
43003
|
-
|
|
43868
|
+
function heapDown(s, v) {
|
|
43869
|
+
let i = s.heapIndex[v];
|
|
43870
|
+
for (let left2 = 2 * i + 1; left2 < s.heapSize; left2 = 2 * i + 1) {
|
|
43871
|
+
const right2 = left2 + 1;
|
|
43872
|
+
const c = right2 < s.heapSize && s.nd[s.heap[right2]] < s.nd[s.heap[left2]] ? right2 : left2;
|
|
43873
|
+
const u = s.heap[c];
|
|
43874
|
+
if (s.nd[v] <= s.nd[u]) break;
|
|
43875
|
+
s.heap[c] = v;
|
|
43876
|
+
s.heapIndex[v] = c;
|
|
43877
|
+
s.heap[i] = u;
|
|
43878
|
+
s.heapIndex[u] = i;
|
|
43879
|
+
i = c;
|
|
43004
43880
|
}
|
|
43005
43881
|
}
|
|
43006
|
-
function
|
|
43007
|
-
const
|
|
43008
|
-
|
|
43009
|
-
|
|
43010
|
-
|
|
43882
|
+
function enqueue(s, v) {
|
|
43883
|
+
const i = s.heapSize++;
|
|
43884
|
+
s.heapIndex[v] = i;
|
|
43885
|
+
s.heap[i] = v;
|
|
43886
|
+
if (i > 0) heapUp(s, v);
|
|
43011
43887
|
}
|
|
43012
|
-
function
|
|
43013
|
-
|
|
43014
|
-
|
|
43015
|
-
|
|
43016
|
-
|
|
43888
|
+
function dequeue(s) {
|
|
43889
|
+
if (s.heapSize === 0) return -1;
|
|
43890
|
+
const rv = s.heap[0];
|
|
43891
|
+
const i = --s.heapSize;
|
|
43892
|
+
const v = s.heap[i];
|
|
43893
|
+
s.heap[0] = v;
|
|
43894
|
+
s.heapIndex[v] = 0;
|
|
43895
|
+
if (i > 1) heapDown(s, v);
|
|
43896
|
+
s.heapIndex[rv] = -1;
|
|
43897
|
+
return rv;
|
|
43017
43898
|
}
|
|
43018
|
-
function
|
|
43019
|
-
|
|
43899
|
+
function makeSpring(s, u, v, f) {
|
|
43900
|
+
s.dist[u * s.n + v] = f;
|
|
43901
|
+
s.dist[v * s.n + u] = f;
|
|
43020
43902
|
}
|
|
43021
|
-
|
|
43022
|
-
|
|
43023
|
-
|
|
43024
|
-
|
|
43025
|
-
|
|
43026
|
-
|
|
43027
|
-
|
|
43028
|
-
|
|
43029
|
-
|
|
43030
|
-
|
|
43031
|
-
|
|
43032
|
-
|
|
43033
|
-
|
|
43034
|
-
|
|
43035
|
-
|
|
43036
|
-
|
|
43037
|
-
|
|
43038
|
-
} else {
|
|
43039
|
-
BITS.setUint32(4, lo - 1);
|
|
43903
|
+
function s1(s, src) {
|
|
43904
|
+
s.nd.fill(s.initialDist);
|
|
43905
|
+
s.nd[src] = 0;
|
|
43906
|
+
s.hops[src] = 0;
|
|
43907
|
+
enqueue(s, src);
|
|
43908
|
+
for (let v = dequeue(s); v >= 0; v = dequeue(s)) {
|
|
43909
|
+
if (v !== src) makeSpring(s, src, v, s.nd[v]);
|
|
43910
|
+
for (const { id: u, len } of s.adj[v]) {
|
|
43911
|
+
const f = s.nd[v] + len;
|
|
43912
|
+
if (s.nd[u] <= f) continue;
|
|
43913
|
+
s.nd[u] = f;
|
|
43914
|
+
if (s.heapIndex[u] >= 0) heapUp(s, u);
|
|
43915
|
+
else {
|
|
43916
|
+
s.hops[u] = s.hops[v] + 1;
|
|
43917
|
+
enqueue(s, u);
|
|
43918
|
+
}
|
|
43919
|
+
}
|
|
43040
43920
|
}
|
|
43041
|
-
return BITS.getFloat64(0);
|
|
43042
43921
|
}
|
|
43043
|
-
function
|
|
43044
|
-
|
|
43045
|
-
const s = p + c;
|
|
43046
|
-
const bv = s - p;
|
|
43047
|
-
const err = p - (s - bv) + (c - bv);
|
|
43048
|
-
if (err === 0 || !Number.isFinite(s)) return fr2(s);
|
|
43049
|
-
BITS.setFloat64(0, s);
|
|
43050
|
-
if ((BITS.getUint32(4) & 1) !== 0) return fr2(s);
|
|
43051
|
-
return fr2(oddNeighbour(s, err > 0 === s > 0));
|
|
43052
|
-
}
|
|
43053
|
-
function blockPlaceNumerator(blockDeg, desPlaceBlock, negLapTimesDesired, toBlockConnectivity, curPlace) {
|
|
43054
|
-
const t = fmaf(blockDeg, desPlaceBlock, negLapTimesDesired);
|
|
43055
|
-
return fmaf(toBlockConnectivity, curPlace, t);
|
|
43922
|
+
function shortestPath2(s) {
|
|
43923
|
+
for (let v = 0; v < s.n; v++) s1(s, v);
|
|
43056
43924
|
}
|
|
43057
|
-
function
|
|
43058
|
-
|
|
43925
|
+
function subsetModel(g, nG, dist5) {
|
|
43926
|
+
const gp = makeGraphDataC(g, [...g.nodes.values()], false, false);
|
|
43927
|
+
const Dij = computeApspArtificialWeights(gp, nG);
|
|
43928
|
+
for (let i = 0; i < nG; i++) {
|
|
43929
|
+
for (let j = 0; j < nG; j++) {
|
|
43930
|
+
dist5[i * nG + j] = Dij[i][j];
|
|
43931
|
+
}
|
|
43932
|
+
}
|
|
43059
43933
|
}
|
|
43060
|
-
function
|
|
43061
|
-
|
|
43062
|
-
|
|
43063
|
-
|
|
43934
|
+
function mdsModel2(dist5, n, edges) {
|
|
43935
|
+
for (const { tailSeq: i, headSeq: j, len } of edges) {
|
|
43936
|
+
if (i === j) continue;
|
|
43937
|
+
for (const k of [i * n + j, j * n + i]) if (k < dist5.length) dist5[k] = len;
|
|
43938
|
+
}
|
|
43064
43939
|
}
|
|
43065
|
-
|
|
43066
|
-
|
|
43067
|
-
|
|
43068
|
-
|
|
43940
|
+
|
|
43941
|
+
// src/layout/neato/kk.ts
|
|
43942
|
+
var NDIM = 2;
|
|
43943
|
+
var DEFAULT_DAMPING = 0.99;
|
|
43944
|
+
var EPSILON_PER_NODE = 1e-4;
|
|
43945
|
+
var ITERATIONS_PER_NODE = 100;
|
|
43946
|
+
var SPRING_COEFF2 = 1;
|
|
43947
|
+
function atoi(s) {
|
|
43948
|
+
const v = parseInt(s, 10);
|
|
43949
|
+
return Number.isNaN(v) ? 0 : v;
|
|
43069
43950
|
}
|
|
43070
|
-
function
|
|
43071
|
-
const
|
|
43072
|
-
const
|
|
43073
|
-
|
|
43074
|
-
for (
|
|
43075
|
-
for (
|
|
43076
|
-
|
|
43951
|
+
function setEdgeLens(g, nodes) {
|
|
43952
|
+
const out = buildOutEdgeIndex(g);
|
|
43953
|
+
const lens = /* @__PURE__ */ new Map();
|
|
43954
|
+
let total = 0;
|
|
43955
|
+
for (const np of nodes) {
|
|
43956
|
+
for (const ep of out.get(np) ?? []) {
|
|
43957
|
+
const len = lenattr(ep, g);
|
|
43958
|
+
lens.set(ep, len);
|
|
43959
|
+
total += len;
|
|
43077
43960
|
}
|
|
43078
43961
|
}
|
|
43079
|
-
return
|
|
43962
|
+
return { total, lens };
|
|
43963
|
+
}
|
|
43964
|
+
function initialDist(g, total, epsilon) {
|
|
43965
|
+
const str = g.attrs.get("defaultdist");
|
|
43966
|
+
if (str !== void 0 && str !== "") return Math.max(epsilon, parseFloat(str) || 0);
|
|
43967
|
+
const nE = g.edges.length;
|
|
43968
|
+
return fma(total / (nE > 0 ? nE : 1), Math.sqrt(g.nodes.size), 1);
|
|
43969
|
+
}
|
|
43970
|
+
function epsilonOf(g, nV) {
|
|
43971
|
+
const v = parseFloat(g.attrs.get("epsilon") ?? "");
|
|
43972
|
+
return Number.isNaN(v) ? EPSILON_PER_NODE * nV : v;
|
|
43973
|
+
}
|
|
43974
|
+
function neighbours(g, nodes, lens) {
|
|
43975
|
+
const out = buildOutEdgeIndex(g);
|
|
43976
|
+
const inn = /* @__PURE__ */ new Map();
|
|
43977
|
+
for (const e of g.edges) {
|
|
43978
|
+
if (e.head === e.tail) continue;
|
|
43979
|
+
const l = inn.get(e.head);
|
|
43980
|
+
if (l === void 0) inn.set(e.head, [e]);
|
|
43981
|
+
else l.push(e);
|
|
43982
|
+
}
|
|
43983
|
+
return nodes.map((np) => {
|
|
43984
|
+
const ins = (inn.get(np) ?? []).sort((a, b) => a.tail.id - b.tail.id || a.seq - b.seq);
|
|
43985
|
+
const outs = (out.get(np) ?? []).filter((e) => e.head !== e.tail);
|
|
43986
|
+
return [...outs, ...ins].map((e) => ({
|
|
43987
|
+
id: (e.tail === np ? e.head : e.tail).info.id,
|
|
43988
|
+
len: lens.get(e)
|
|
43989
|
+
}));
|
|
43990
|
+
});
|
|
43991
|
+
}
|
|
43992
|
+
function scanGraphMode(g, maxIter) {
|
|
43993
|
+
const nodes = [...g.nodes.values()];
|
|
43994
|
+
const n = nodes.length;
|
|
43995
|
+
nodes.forEach((np, i) => {
|
|
43996
|
+
np.info.id = i;
|
|
43997
|
+
np.info.heapindex = -1;
|
|
43998
|
+
});
|
|
43999
|
+
const epsilon = epsilonOf(g, n);
|
|
44000
|
+
const damp = g.root.attrs.get("Damping");
|
|
44001
|
+
const { total, lens } = setEdgeLens(g, nodes);
|
|
44002
|
+
const ini = initialDist(g, total, epsilon);
|
|
44003
|
+
const st = {
|
|
44004
|
+
n,
|
|
44005
|
+
nodes,
|
|
44006
|
+
dist: new Float64Array(n * n).fill(ini),
|
|
44007
|
+
spring: new Float64Array(n * n).fill(1),
|
|
44008
|
+
sumT: new Float64Array(n * NDIM).fill(1),
|
|
44009
|
+
t: new Float64Array(n * n * NDIM),
|
|
44010
|
+
damping: damp === void 0 ? DEFAULT_DAMPING : parseFloat(damp) || 0,
|
|
44011
|
+
epsilon,
|
|
44012
|
+
maxIter,
|
|
44013
|
+
move: 0
|
|
44014
|
+
};
|
|
44015
|
+
return { st, adj: neighbours(g, nodes, lens), ini, lens };
|
|
43080
44016
|
}
|
|
43081
|
-
function
|
|
43082
|
-
|
|
43083
|
-
|
|
43084
|
-
let maxInLevel = 0;
|
|
43085
|
-
for (let i = 0; i < n; i++) {
|
|
43086
|
-
if (i >= maxInLevel) {
|
|
43087
|
-
level++;
|
|
43088
|
-
maxInLevel = level === numLevels ? n : levels[level];
|
|
43089
|
-
lowerBound = i > 0 ? fr2(place[ordering[i - 1]] + levelsGap) : fr2(-1e9);
|
|
43090
|
-
quicksortPlacef(place, ordering, i, maxInLevel - 1);
|
|
43091
|
-
}
|
|
43092
|
-
const node = ordering[i];
|
|
43093
|
-
if (place[node] < lowerBound) place[node] = lowerBound;
|
|
43094
|
-
}
|
|
44017
|
+
function randompos(np) {
|
|
44018
|
+
np.info.pos[0] = drand48();
|
|
44019
|
+
np.info.pos[1] = drand48();
|
|
43095
44020
|
}
|
|
43096
|
-
function
|
|
43097
|
-
const
|
|
43098
|
-
|
|
43099
|
-
|
|
43100
|
-
for (
|
|
43101
|
-
if (
|
|
43102
|
-
|
|
43103
|
-
maxInLevel = level === e.numLevels ? e.n : e.levels[level];
|
|
43104
|
-
}
|
|
43105
|
-
lev[e.ordering[i]] = level;
|
|
44021
|
+
function initialPositions2(g, st) {
|
|
44022
|
+
const init = checkStart(g, st.n, INIT_RANDOM);
|
|
44023
|
+
if (init === INIT_REGULAR) return;
|
|
44024
|
+
if (init === INIT_SELF) warnStartSelfOnce();
|
|
44025
|
+
for (const np of st.nodes) {
|
|
44026
|
+
if (np.info.posSet === true || np.info.pinned === true) continue;
|
|
44027
|
+
randompos(np);
|
|
43106
44028
|
}
|
|
43107
|
-
return lev;
|
|
43108
44029
|
}
|
|
43109
|
-
function
|
|
43110
|
-
|
|
43111
|
-
|
|
43112
|
-
|
|
43113
|
-
|
|
43114
|
-
let right2;
|
|
43115
|
-
for (right2 = left2 + 1; right2 < e.n; right2++) {
|
|
43116
|
-
if (lev[right2] > lev[right2 - 1]) {
|
|
43117
|
-
targetPlace = fr2(targetPlace + levelsGap);
|
|
43118
|
-
}
|
|
43119
|
-
const node = e.ordering[right2];
|
|
43120
|
-
if (Math.abs(fr2(place[node] - targetPlace)) > BLOCK_EPSILON) break;
|
|
43121
|
-
gap[node] = fr2(place[node] - curPlace);
|
|
44030
|
+
function distvec(p0, p1, del) {
|
|
44031
|
+
let dist5 = 0;
|
|
44032
|
+
for (let k = 0; k < NDIM; k++) {
|
|
44033
|
+
del[k] = p0[k] - p1[k];
|
|
44034
|
+
dist5 = fma(del[k], del[k], dist5);
|
|
43122
44035
|
}
|
|
43123
|
-
return
|
|
44036
|
+
return Math.sqrt(dist5);
|
|
43124
44037
|
}
|
|
43125
|
-
function
|
|
43126
|
-
const
|
|
43127
|
-
|
|
43128
|
-
|
|
43129
|
-
|
|
43130
|
-
|
|
43131
|
-
|
|
43132
|
-
if (j === node) continue;
|
|
43133
|
-
newPlaceI = fmaf(lapNode[j], place[j], newPlaceI);
|
|
44038
|
+
function springFactors(g) {
|
|
44039
|
+
const byEnds = /* @__PURE__ */ new Map();
|
|
44040
|
+
const undirected = g.kind.endsWith("undirected");
|
|
44041
|
+
for (const e of g.edges) {
|
|
44042
|
+
const key = `${e.tail.info.id}:${e.head.info.id}`;
|
|
44043
|
+
if (!byEnds.has(key)) {
|
|
44044
|
+
byEnds.set(key, e.info.factor ?? lateDouble(e.attrs.get("weight"), 1, 1));
|
|
43134
44045
|
}
|
|
43135
|
-
e.fArray1[node] = fr2(fr2(newPlaceI / -lapNode[node]) - e.fArray4[node]);
|
|
43136
|
-
}
|
|
43137
|
-
}
|
|
43138
|
-
function collectWhere(c, from, to, test) {
|
|
43139
|
-
for (let j = from; j < to; j++) {
|
|
43140
|
-
const node = c.e.ordering[j];
|
|
43141
|
-
if (test(c.e.fArray1[node])) c.block.push(node);
|
|
43142
44046
|
}
|
|
44047
|
+
return (a, b) => byEnds.get(`${a.info.id}:${b.info.id}`) ?? (undirected ? byEnds.get(`${b.info.id}:${a.info.id}`) : void 0);
|
|
43143
44048
|
}
|
|
43144
|
-
function
|
|
43145
|
-
const
|
|
43146
|
-
|
|
43147
|
-
|
|
43148
|
-
|
|
43149
|
-
|
|
43150
|
-
|
|
43151
|
-
|
|
43152
|
-
|
|
43153
|
-
|
|
44049
|
+
function fillRow(st, i, del) {
|
|
44050
|
+
const vi = st.nodes[i];
|
|
44051
|
+
for (let j = 0; j < st.n; j++) {
|
|
44052
|
+
if (i === j) continue;
|
|
44053
|
+
const dist5 = distvec(vi.info.pos, st.nodes[j].info.pos, del);
|
|
44054
|
+
for (let k = 0; k < NDIM; k++) {
|
|
44055
|
+
const v = st.spring[i * st.n + j] * (del[k] - st.dist[i * st.n + j] * del[k] / dist5);
|
|
44056
|
+
st.t[(i * st.n + j) * NDIM + k] = v;
|
|
44057
|
+
st.sumT[i * NDIM + k] += v;
|
|
44058
|
+
}
|
|
43154
44059
|
}
|
|
43155
44060
|
}
|
|
43156
|
-
function
|
|
43157
|
-
const {
|
|
43158
|
-
|
|
43159
|
-
let
|
|
43160
|
-
for (let i = 0; i < block.length; i++) {
|
|
43161
|
-
const node = block[i];
|
|
43162
|
-
let toBlockConnectivity = 0;
|
|
43163
|
-
const lapNode = e.A[node];
|
|
44061
|
+
function diffeqModel(g, st) {
|
|
44062
|
+
const { n } = st;
|
|
44063
|
+
const factor = springFactors(g);
|
|
44064
|
+
for (let i = 0; i < n; i++) {
|
|
43164
44065
|
for (let j = 0; j < i; j++) {
|
|
43165
|
-
|
|
44066
|
+
let f = SPRING_COEFF2 / (st.dist[i * n + j] * st.dist[i * n + j]);
|
|
44067
|
+
const w = factor(st.nodes[i], st.nodes[j]);
|
|
44068
|
+
if (w !== void 0) f *= w;
|
|
44069
|
+
st.spring[i * n + j] = f;
|
|
44070
|
+
st.spring[j * n + i] = f;
|
|
43166
44071
|
}
|
|
43167
|
-
toBlockConnectivity = fr2(toBlockConnectivity * 2);
|
|
43168
|
-
const num2 = blockPlaceNumerator(
|
|
43169
|
-
blockDeg,
|
|
43170
|
-
desPlaceBlock,
|
|
43171
|
-
fr2(-lapNode[node] * e.fArray1[node]),
|
|
43172
|
-
toBlockConnectivity,
|
|
43173
|
-
curPlace
|
|
43174
|
-
);
|
|
43175
|
-
desPlaceBlock = fr2(num2 / fr2(fr2(blockDeg - lapNode[node]) + toBlockConnectivity));
|
|
43176
|
-
e.fArray2[i] = desPlaceBlock;
|
|
43177
|
-
blockDeg = fr2(blockDeg + fr2(toBlockConnectivity - lapNode[node]));
|
|
43178
|
-
}
|
|
43179
|
-
if (e.n >= 0 && block.length === e.n) {
|
|
43180
|
-
e.fArray2[e.n - 1] = curPlace;
|
|
43181
44072
|
}
|
|
44073
|
+
st.sumT.fill(0);
|
|
44074
|
+
const del = new Float64Array(NDIM);
|
|
44075
|
+
for (let i = 0; i < n; i++) fillRow(st, i, del);
|
|
43182
44076
|
}
|
|
43183
|
-
function
|
|
43184
|
-
const {
|
|
43185
|
-
|
|
43186
|
-
|
|
43187
|
-
for (let
|
|
43188
|
-
|
|
43189
|
-
|
|
43190
|
-
const
|
|
43191
|
-
for (let
|
|
43192
|
-
|
|
44077
|
+
function updateArrays(st, i) {
|
|
44078
|
+
const { n } = st;
|
|
44079
|
+
const del = new Float64Array(NDIM);
|
|
44080
|
+
const vi = st.nodes[i];
|
|
44081
|
+
for (let k = 0; k < NDIM; k++) st.sumT[i * NDIM + k] = 0;
|
|
44082
|
+
for (let j = 0; j < n; j++) {
|
|
44083
|
+
if (i === j) continue;
|
|
44084
|
+
const dist5 = distvec(vi.info.pos, st.nodes[j].info.pos, del);
|
|
44085
|
+
for (let k = 0; k < NDIM; k++) {
|
|
44086
|
+
const tij = st.spring[i * n + j] * (del[k] - st.dist[i * n + j] * del[k] / dist5);
|
|
44087
|
+
st.t[(i * n + j) * NDIM + k] = tij;
|
|
44088
|
+
st.sumT[i * NDIM + k] += tij;
|
|
44089
|
+
const old = st.t[(j * n + i) * NDIM + k];
|
|
44090
|
+
st.t[(j * n + i) * NDIM + k] = -tij;
|
|
44091
|
+
st.sumT[j * NDIM + k] += -tij - old;
|
|
43193
44092
|
}
|
|
43194
|
-
toBlockConnectivity = fr2(toBlockConnectivity * 2);
|
|
43195
|
-
const num2 = blockPlaceNumerator(
|
|
43196
|
-
blockDeg,
|
|
43197
|
-
desPlaceBlock,
|
|
43198
|
-
fr2(-lapNode[node] * e.fArray1[node]),
|
|
43199
|
-
toBlockConnectivity,
|
|
43200
|
-
curPlace
|
|
43201
|
-
);
|
|
43202
|
-
desPlaceBlock = fr2(num2 / fr2(fr2(blockDeg - lapNode[node]) + toBlockConnectivity));
|
|
43203
|
-
e.fArray3[i] = desPlaceBlock;
|
|
43204
|
-
blockDeg = fr2(blockDeg + fr2(toBlockConnectivity - lapNode[node]));
|
|
43205
|
-
}
|
|
43206
|
-
if (e.n >= 0 && block.length === e.n) {
|
|
43207
|
-
e.fArray3[0] = curPlace;
|
|
43208
44093
|
}
|
|
43209
44094
|
}
|
|
43210
|
-
|
|
43211
|
-
|
|
43212
|
-
|
|
43213
|
-
|
|
43214
|
-
|
|
43215
|
-
|
|
43216
|
-
|
|
43217
|
-
|
|
44095
|
+
function d2e(st, m, M2) {
|
|
44096
|
+
const { n } = st;
|
|
44097
|
+
const vn = st.nodes[m];
|
|
44098
|
+
const t = new Float64Array(NDIM);
|
|
44099
|
+
M2.fill(0);
|
|
44100
|
+
for (let i = 0; i < n; i++) {
|
|
44101
|
+
if (m === i) continue;
|
|
44102
|
+
const vi = st.nodes[i];
|
|
44103
|
+
let sq = 0;
|
|
44104
|
+
for (let k = 0; k < NDIM; k++) {
|
|
44105
|
+
t[k] = vn.info.pos[k] - vi.info.pos[k];
|
|
44106
|
+
sq = fma(t[k], t[k], sq);
|
|
43218
44107
|
}
|
|
43219
|
-
|
|
43220
|
-
|
|
43221
|
-
|
|
43222
|
-
|
|
43223
|
-
|
|
43224
|
-
|
|
43225
|
-
|
|
43226
|
-
let maxMovement = 0;
|
|
43227
|
-
for (let i = 0; i < block.length; i++) {
|
|
43228
|
-
const suffixDesPlace = e.fArray3[i];
|
|
43229
|
-
const prefixDesPlace = i > 0 ? e.fArray2[i - 1] : suffixDesPlace;
|
|
43230
|
-
limitMoves(prefixDesPlace, suffixDesPlace, curPlace);
|
|
43231
|
-
const movement = (block.length - i) * Math.abs(fr2(LIMITED[1] - curPlace)) + i * Math.abs(fr2(LIMITED[0] - curPlace));
|
|
43232
|
-
if (movement > maxMovement) {
|
|
43233
|
-
maxMovement = movement;
|
|
43234
|
-
bestI = i;
|
|
44108
|
+
const scale = 1 / Math.pow(sq, 1.5);
|
|
44109
|
+
const K = st.spring[m * n + i];
|
|
44110
|
+
const D = st.dist[m * n + i];
|
|
44111
|
+
for (let k = 0; k < NDIM; k++) {
|
|
44112
|
+
for (let l = 0; l < k; l++) M2[l * NDIM + k] = fma(K * D * t[k] * t[l], scale, M2[l * NDIM + k]);
|
|
44113
|
+
const inner = fms(D * fms(t[k], t[k], sq), scale, 1);
|
|
44114
|
+
M2[k * NDIM + k] = fma(K, inner, M2[k * NDIM + k]);
|
|
43235
44115
|
}
|
|
43236
44116
|
}
|
|
43237
|
-
|
|
43238
|
-
|
|
43239
|
-
function computeUpperBound(c, right2) {
|
|
43240
|
-
const { e, place, lev, levelsGap, block } = c;
|
|
43241
|
-
if (right2 >= e.n) return BOUND;
|
|
43242
|
-
const lastGap = e.fArray4[block[block.length - 1]];
|
|
43243
|
-
const nextPlace = place[e.ordering[right2]];
|
|
43244
|
-
if (lev[e.ordering[right2]] > lev[e.ordering[right2 - 1]]) {
|
|
43245
|
-
return fr2(fr2(nextPlace - levelsGap) - lastGap);
|
|
44117
|
+
for (let k = 1; k < NDIM; k++) {
|
|
44118
|
+
for (let l = 0; l < k; l++) M2[k * NDIM + l] = M2[l * NDIM + k];
|
|
43246
44119
|
}
|
|
43247
|
-
return fr2(nextPlace - lastGap);
|
|
43248
44120
|
}
|
|
43249
|
-
function
|
|
43250
|
-
|
|
43251
|
-
|
|
43252
|
-
|
|
43253
|
-
|
|
44121
|
+
function chooseNode(st) {
|
|
44122
|
+
if (st.move >= st.maxIter) return -1;
|
|
44123
|
+
let max = 0;
|
|
44124
|
+
let choice = -1;
|
|
44125
|
+
for (let i = 0; i < st.n; i++) {
|
|
44126
|
+
if (st.nodes[i].info.pinned === true) continue;
|
|
44127
|
+
let m = 0;
|
|
44128
|
+
for (let k = 0; k < NDIM; k++) m = fma(st.sumT[i * NDIM + k], st.sumT[i * NDIM + k], m);
|
|
44129
|
+
if (m > max) {
|
|
44130
|
+
choice = i;
|
|
44131
|
+
max = m;
|
|
44132
|
+
}
|
|
43254
44133
|
}
|
|
43255
|
-
return
|
|
44134
|
+
return max < st.epsilon * st.epsilon ? -1 : choice;
|
|
43256
44135
|
}
|
|
43257
|
-
function
|
|
43258
|
-
const
|
|
43259
|
-
|
|
43260
|
-
|
|
43261
|
-
|
|
43262
|
-
|
|
43263
|
-
|
|
43264
|
-
|
|
43265
|
-
|
|
43266
|
-
|
|
43267
|
-
|
|
43268
|
-
}
|
|
43269
|
-
for (let i = bestI; i < block.length; i++) {
|
|
43270
|
-
place[block[i]] = fr2(suffixDesPlace + e.fArray4[block[i]]);
|
|
44136
|
+
function moveNode(st, m) {
|
|
44137
|
+
const a = new Float64Array(NDIM * NDIM);
|
|
44138
|
+
const b = new Float64Array(NDIM);
|
|
44139
|
+
const c = new Float64Array(NDIM);
|
|
44140
|
+
d2e(st, m, a);
|
|
44141
|
+
for (let i = 0; i < NDIM; i++) c[i] = -st.sumT[m * NDIM + i];
|
|
44142
|
+
solve(a, b, c, NDIM);
|
|
44143
|
+
const pos = st.nodes[m].info.pos;
|
|
44144
|
+
for (let i = 0; i < NDIM; i++) {
|
|
44145
|
+
b[i] = fma(2 * (1 - st.damping), drand48(), st.damping) * b[i];
|
|
44146
|
+
pos[i] += b[i];
|
|
43271
44147
|
}
|
|
43272
|
-
|
|
43273
|
-
|
|
43274
|
-
c.converged = c.converged && equals(prefixDesPlace, curPlace) && equals(suffixDesPlace, curPlace);
|
|
44148
|
+
st.move++;
|
|
44149
|
+
updateArrays(st, m);
|
|
43275
44150
|
}
|
|
43276
|
-
function
|
|
43277
|
-
|
|
43278
|
-
|
|
43279
|
-
|
|
43280
|
-
orderBlockByLevels(c, left2, right2, curPlace);
|
|
43281
|
-
computePrefixDesiredPlaces(c, curPlace);
|
|
43282
|
-
computeSuffixDesiredPlaces(c, curPlace);
|
|
43283
|
-
const bestI = findBestSplit(c, curPlace);
|
|
43284
|
-
if (bestI !== NO_SPLIT) {
|
|
43285
|
-
moveSplitBlock(c, bestI, left2, right2, curPlace);
|
|
43286
|
-
} else {
|
|
43287
|
-
c.lowerBound = nextLowerBound(c, right2);
|
|
44151
|
+
function solveModel(g, st) {
|
|
44152
|
+
for (let m = chooseNode(st); m >= 0; m = chooseNode(st)) moveNode(st, m);
|
|
44153
|
+
if (st.move === st.maxIter) {
|
|
44154
|
+
agwarningf(`Max. iterations (${st.maxIter}) reached on graph ${agNameOf(g)}`);
|
|
43288
44155
|
}
|
|
43289
|
-
return right2;
|
|
43290
44156
|
}
|
|
43291
|
-
function
|
|
43292
|
-
const
|
|
43293
|
-
|
|
43294
|
-
|
|
43295
|
-
|
|
43296
|
-
const
|
|
43297
|
-
|
|
43298
|
-
|
|
43299
|
-
|
|
43300
|
-
|
|
43301
|
-
|
|
43302
|
-
|
|
43303
|
-
|
|
43304
|
-
|
|
43305
|
-
|
|
43306
|
-
|
|
43307
|
-
c.converged = true;
|
|
43308
|
-
c.lowerBound = fr2(-BOUND);
|
|
43309
|
-
for (let left2 = 0, right2; left2 < e.n; left2 = right2) {
|
|
43310
|
-
right2 = processBlock(c, left2);
|
|
44157
|
+
function mdsEdges(g, nodes, lens) {
|
|
44158
|
+
const out = buildOutEdgeIndex(g);
|
|
44159
|
+
return nodes.flatMap((v) => (out.get(v) ?? []).map((e) => ({ tailSeq: e.tail.id + 1, headSeq: e.head.id + 1, len: lens.get(e) })));
|
|
44160
|
+
}
|
|
44161
|
+
function kkModel(g, nG, model, run) {
|
|
44162
|
+
const { st, adj, ini, lens } = run;
|
|
44163
|
+
const shortest = () => shortestPath2(newPathState(st.n, st.dist, adj, ini));
|
|
44164
|
+
if (model === MODEL_SUBSET2) {
|
|
44165
|
+
subsetModel(g, nG, st.dist);
|
|
44166
|
+
} else if (model === MODEL_CIRCUIT2) {
|
|
44167
|
+
if (!circuitModel(g, nG, st.dist, lens)) {
|
|
44168
|
+
agwarningf(`graph ${agNameOf(g)} is disconnected. Hence, the circuit model`);
|
|
44169
|
+
agerr("prev", "is undefined. Reverting to the shortest path model.");
|
|
44170
|
+
agerr("prev", "Alternatively, consider running neato using -Gpack=true or decomposing");
|
|
44171
|
+
agerr("prev", "the graph into connected components.");
|
|
44172
|
+
shortest();
|
|
43311
44173
|
}
|
|
43312
|
-
|
|
44174
|
+
} else if (model === MODEL_MDS2) {
|
|
44175
|
+
shortest();
|
|
44176
|
+
mdsModel2(st.dist, st.n, mdsEdges(g, st.nodes, lens));
|
|
44177
|
+
} else {
|
|
44178
|
+
shortest();
|
|
43313
44179
|
}
|
|
43314
44180
|
}
|
|
43315
|
-
function
|
|
43316
|
-
|
|
43317
|
-
|
|
43318
|
-
|
|
43319
|
-
|
|
43320
|
-
|
|
43321
|
-
|
|
43322
|
-
|
|
43323
|
-
|
|
43324
|
-
levels,
|
|
43325
|
-
numLevels
|
|
43326
|
-
};
|
|
44181
|
+
function kkNeato(g, nG, model) {
|
|
44182
|
+
const maxiter = g.attrs.get("maxiter");
|
|
44183
|
+
const maxIter = maxiter !== void 0 ? atoi(maxiter) : ITERATIONS_PER_NODE * g.nodes.size;
|
|
44184
|
+
if (nG < 2 || maxIter < 0) return;
|
|
44185
|
+
const run = scanGraphMode(g, maxIter);
|
|
44186
|
+
kkModel(g, nG, model, run);
|
|
44187
|
+
initialPositions2(g, run.st);
|
|
44188
|
+
diffeqModel(g, run.st);
|
|
44189
|
+
solveModel(g, run.st);
|
|
43327
44190
|
}
|
|
43328
44191
|
|
|
43329
44192
|
// src/layout/neato/conjgrad-mkernel.ts
|
|
@@ -43744,16 +44607,6 @@ function computeApspPacked2(graph, n) {
|
|
|
43744
44607
|
}
|
|
43745
44608
|
return Dij;
|
|
43746
44609
|
}
|
|
43747
|
-
function computeWeightedApspPacked2(graph, n) {
|
|
43748
|
-
const Dij = new Float32Array(n * (n + 1) / 2);
|
|
43749
|
-
const Di = new Float32Array(n);
|
|
43750
|
-
let count = 0;
|
|
43751
|
-
for (let i = 0; i < n; i++) {
|
|
43752
|
-
dijkstra(i, graph, n, Di);
|
|
43753
|
-
for (let j = i; j < n; j++) Dij[count++] = Di[j];
|
|
43754
|
-
}
|
|
43755
|
-
return Dij;
|
|
43756
|
-
}
|
|
43757
44610
|
function hasPos2(n) {
|
|
43758
44611
|
return n.info.posSet === true || n.info.pinned === true;
|
|
43759
44612
|
}
|
|
@@ -43922,6 +44775,109 @@ function stressMajorizationKDMkernel(Dij, n, dCoords, nodes, o) {
|
|
|
43922
44775
|
return iterations;
|
|
43923
44776
|
}
|
|
43924
44777
|
|
|
44778
|
+
// src/layout/neato/stress-models.ts
|
|
44779
|
+
function circuitModel2(graph, nG) {
|
|
44780
|
+
let Dij = new Float32Array(nG * (nG + 1) / 2);
|
|
44781
|
+
const Gm = newArray(nG, nG, 0);
|
|
44782
|
+
const GmInv = newArray(nG, nG, 0);
|
|
44783
|
+
if (graph[0].ewgts.length !== 0) {
|
|
44784
|
+
for (let i = 0; i < nG; i++) {
|
|
44785
|
+
for (let e = 1; e < graph[i].nedges; e++) {
|
|
44786
|
+
const j = graph[i].edges[e];
|
|
44787
|
+
Gm[i][j] = Gm[j][i] = -1 / Math.fround(graph[i].ewgts[e]);
|
|
44788
|
+
}
|
|
44789
|
+
}
|
|
44790
|
+
} else {
|
|
44791
|
+
for (let i = 0; i < nG; i++) {
|
|
44792
|
+
for (let e = 1; e < graph[i].nedges; e++) {
|
|
44793
|
+
const j = graph[i].edges[e];
|
|
44794
|
+
Gm[i][j] = Gm[j][i] = -1;
|
|
44795
|
+
}
|
|
44796
|
+
}
|
|
44797
|
+
}
|
|
44798
|
+
const rv = solveCircuit(nG, Gm, GmInv);
|
|
44799
|
+
if (rv) {
|
|
44800
|
+
circuitDistances2(GmInv, nG, Dij);
|
|
44801
|
+
} else {
|
|
44802
|
+
Dij = null;
|
|
44803
|
+
}
|
|
44804
|
+
return Dij;
|
|
44805
|
+
}
|
|
44806
|
+
function circuitDistances2(GmInv, nG, Dij) {
|
|
44807
|
+
let count = 0;
|
|
44808
|
+
for (let i = 0; i < nG; i++) {
|
|
44809
|
+
for (let j = i; j < nG; j++) {
|
|
44810
|
+
Dij[count++] = i === j ? 0 : GmInv[i][i] + GmInv[j][j] - 2 * GmInv[i][j];
|
|
44811
|
+
}
|
|
44812
|
+
}
|
|
44813
|
+
}
|
|
44814
|
+
function weightGraphKeepingLengths(graph, n, vtxVec) {
|
|
44815
|
+
for (let i = 0; i < n; i++) {
|
|
44816
|
+
const weights = new Array(graph[i].nedges).fill(0);
|
|
44817
|
+
fillNeighborsVecUnweighted(graph, i, vtxVec);
|
|
44818
|
+
const degI = graph[i].nedges - 1;
|
|
44819
|
+
for (let j = 1; j <= degI; j++) {
|
|
44820
|
+
const neighbor2 = graph[i].edges[j];
|
|
44821
|
+
weights[j] = fmaxf(artificialWeight(graph, degI, neighbor2, vtxVec), Math.fround(graph[i].ewgts[j]));
|
|
44822
|
+
}
|
|
44823
|
+
emptyNeighborsVec(graph, i, vtxVec);
|
|
44824
|
+
graph[i].ewgts = weights;
|
|
44825
|
+
}
|
|
44826
|
+
}
|
|
44827
|
+
function weightGraph(graph, n, vtxVec) {
|
|
44828
|
+
for (let i = 0; i < n; i++) {
|
|
44829
|
+
const weights = new Array(graph[i].nedges).fill(0);
|
|
44830
|
+
graph[i].ewgts = weights;
|
|
44831
|
+
fillNeighborsVecUnweighted(graph, i, vtxVec);
|
|
44832
|
+
const degI = graph[i].nedges - 1;
|
|
44833
|
+
for (let j = 1; j <= degI; j++) {
|
|
44834
|
+
const neighbor2 = graph[i].edges[j];
|
|
44835
|
+
weights[j] = artificialWeight(graph, degI, neighbor2, vtxVec);
|
|
44836
|
+
}
|
|
44837
|
+
emptyNeighborsVec(graph, i, vtxVec);
|
|
44838
|
+
}
|
|
44839
|
+
}
|
|
44840
|
+
function computeApspArtificialWeightsPacked(graph, n) {
|
|
44841
|
+
const oldWeights = graph[0].ewgts;
|
|
44842
|
+
const savedWeights = graph.slice(0, n).map((v) => v.ewgts);
|
|
44843
|
+
const vtxVec = new Int32Array(n);
|
|
44844
|
+
let Dij;
|
|
44845
|
+
if (graph[0].ewgts.length !== 0) {
|
|
44846
|
+
weightGraphKeepingLengths(graph, n, vtxVec);
|
|
44847
|
+
Dij = computeWeightedApspPacked(graph, n);
|
|
44848
|
+
} else {
|
|
44849
|
+
weightGraph(graph, n, vtxVec);
|
|
44850
|
+
Dij = computeApspPacked(graph, n);
|
|
44851
|
+
}
|
|
44852
|
+
graph[0].ewgts = [];
|
|
44853
|
+
if (oldWeights.length !== 0) {
|
|
44854
|
+
for (let i = 0; i < n; i++) {
|
|
44855
|
+
graph[i].ewgts = savedWeights[i];
|
|
44856
|
+
}
|
|
44857
|
+
}
|
|
44858
|
+
return Dij;
|
|
44859
|
+
}
|
|
44860
|
+
function modelDistances(graph, n, model) {
|
|
44861
|
+
let Dij = null;
|
|
44862
|
+
if (model === MODEL_SUBSET2) {
|
|
44863
|
+
Dij = computeApspArtificialWeightsPacked(graph, n);
|
|
44864
|
+
} else if (model === MODEL_CIRCUIT2) {
|
|
44865
|
+
Dij = circuitModel2(graph, n);
|
|
44866
|
+
if (Dij === null) {
|
|
44867
|
+
agwarningf("graph is disconnected. Hence, the circuit model");
|
|
44868
|
+
agerr("prev", "is undefined. Reverting to the shortest path model.");
|
|
44869
|
+
}
|
|
44870
|
+
} else if (model === MODEL_MDS2) {
|
|
44871
|
+
Dij = mdsModel(graph, n);
|
|
44872
|
+
}
|
|
44873
|
+
return Dij;
|
|
44874
|
+
}
|
|
44875
|
+
function stressModelDij(graph, n, model) {
|
|
44876
|
+
const Dij = modelDistances(graph, n, model);
|
|
44877
|
+
if (Dij !== null) return Dij;
|
|
44878
|
+
return graph[0].ewgts.length !== 0 ? computeWeightedApspPacked(graph, n) : computeApspPacked(graph, n);
|
|
44879
|
+
}
|
|
44880
|
+
|
|
43925
44881
|
// src/layout/neato/constrained-majorization.ts
|
|
43926
44882
|
var fr6 = Math.fround;
|
|
43927
44883
|
var LOCAL_CONSTR_MAJOR_ITERATIONS = 15;
|
|
@@ -43935,15 +44891,9 @@ var Y_AXIS = 1;
|
|
|
43935
44891
|
function unsupported2(what) {
|
|
43936
44892
|
throw new RenderError(`hierarchical stress majorization: ${what} is not supported yet`, "UNSUPPORTED_FEATURE");
|
|
43937
44893
|
}
|
|
43938
|
-
function modelDistances(graph, n, model) {
|
|
43939
|
-
if (model === MODEL_SUBSET) unsupported2("the subset distance model");
|
|
43940
|
-
if (model === MODEL_CIRCUIT) unsupported2("the circuit distance model");
|
|
43941
|
-
return model === MODEL_MDS2 ? mdsModel(graph, n) : null;
|
|
43942
|
-
}
|
|
43943
44894
|
function unconstrainedMajorization(graph, n, dCoords, nodes, o) {
|
|
43944
44895
|
if (o.maxi < 0) return 0;
|
|
43945
|
-
const
|
|
43946
|
-
const Dij = modelDistances(graph, n, o.model) ?? (weighted ? computeWeightedApspPacked2(graph, n) : computeApspPacked2(graph, n));
|
|
44896
|
+
const Dij = stressModelDij(graph, n, o.model);
|
|
43947
44897
|
if ((o.opts & OPT_SMART_INIT) !== 0 && n > 1) unsupported2("the smart initial layout");
|
|
43948
44898
|
return stressMajorizationKDMkernel(Dij, n, dCoords, nodes, {
|
|
43949
44899
|
dim: o.dim,
|
|
@@ -45014,32 +45964,427 @@ var IncVPSC = class extends VPSC {
|
|
|
45014
45964
|
// src/vpsc/sweepTypes.ts
|
|
45015
45965
|
var EvType = { Open: 0, Close: 1 };
|
|
45016
45966
|
|
|
45967
|
+
// src/util/libcxx-sort.ts
|
|
45968
|
+
var LIMIT = 24;
|
|
45969
|
+
var NINTHER_THRESHOLD = 128;
|
|
45970
|
+
var INCOMPLETE_LIMIT = 8;
|
|
45971
|
+
function bitLog2(n) {
|
|
45972
|
+
return 31 - Math.clz32(n);
|
|
45973
|
+
}
|
|
45974
|
+
var Introsort = class {
|
|
45975
|
+
a;
|
|
45976
|
+
lt;
|
|
45977
|
+
constructor(a, lt) {
|
|
45978
|
+
this.a = a;
|
|
45979
|
+
this.lt = lt;
|
|
45980
|
+
}
|
|
45981
|
+
/** @see __algorithm/iter_swap.h:iter_swap */
|
|
45982
|
+
swap(i, j) {
|
|
45983
|
+
const a = this.a;
|
|
45984
|
+
const t = a[i];
|
|
45985
|
+
a[i] = a[j];
|
|
45986
|
+
a[j] = t;
|
|
45987
|
+
}
|
|
45988
|
+
/** @see __algorithm/sort.h:__sort3 */
|
|
45989
|
+
sort3(x, y, z) {
|
|
45990
|
+
const { a, lt } = this;
|
|
45991
|
+
if (!lt(a[y], a[x])) {
|
|
45992
|
+
if (!lt(a[z], a[y])) return;
|
|
45993
|
+
this.swap(y, z);
|
|
45994
|
+
if (lt(a[y], a[x])) this.swap(x, y);
|
|
45995
|
+
return;
|
|
45996
|
+
}
|
|
45997
|
+
if (lt(a[z], a[y])) {
|
|
45998
|
+
this.swap(x, z);
|
|
45999
|
+
return;
|
|
46000
|
+
}
|
|
46001
|
+
this.swap(x, y);
|
|
46002
|
+
if (lt(a[z], a[y])) this.swap(y, z);
|
|
46003
|
+
}
|
|
46004
|
+
/** @see __algorithm/sort.h:__sort4 */
|
|
46005
|
+
sort4(x1, x2, x3, x4) {
|
|
46006
|
+
const { a, lt } = this;
|
|
46007
|
+
this.sort3(x1, x2, x3);
|
|
46008
|
+
if (lt(a[x4], a[x3])) {
|
|
46009
|
+
this.swap(x3, x4);
|
|
46010
|
+
if (lt(a[x3], a[x2])) {
|
|
46011
|
+
this.swap(x2, x3);
|
|
46012
|
+
if (lt(a[x2], a[x1])) this.swap(x1, x2);
|
|
46013
|
+
}
|
|
46014
|
+
}
|
|
46015
|
+
}
|
|
46016
|
+
/** @see __algorithm/sort.h:__sort5 */
|
|
46017
|
+
sort5(x1, x2, x3, x4, x5) {
|
|
46018
|
+
const { a, lt } = this;
|
|
46019
|
+
this.sort4(x1, x2, x3, x4);
|
|
46020
|
+
if (lt(a[x5], a[x4])) {
|
|
46021
|
+
this.swap(x4, x5);
|
|
46022
|
+
if (lt(a[x4], a[x3])) {
|
|
46023
|
+
this.swap(x3, x4);
|
|
46024
|
+
if (lt(a[x3], a[x2])) {
|
|
46025
|
+
this.swap(x2, x3);
|
|
46026
|
+
if (lt(a[x2], a[x1])) this.swap(x1, x2);
|
|
46027
|
+
}
|
|
46028
|
+
}
|
|
46029
|
+
}
|
|
46030
|
+
}
|
|
46031
|
+
/**
|
|
46032
|
+
* The `switch (__last - __first)` that `__introsort` and `__insertion_sort_incomplete` share
|
|
46033
|
+
* word for word, as one function because of the project's complexity limit.
|
|
46034
|
+
* @returns true when the length was one of the cases, so the range is sorted
|
|
46035
|
+
* @see __algorithm/sort.h:__introsort
|
|
46036
|
+
*/
|
|
46037
|
+
sortSmall(first, last) {
|
|
46038
|
+
const { a, lt } = this;
|
|
46039
|
+
switch (last - first) {
|
|
46040
|
+
case 0:
|
|
46041
|
+
case 1:
|
|
46042
|
+
return true;
|
|
46043
|
+
case 2:
|
|
46044
|
+
if (lt(a[last - 1], a[first])) this.swap(first, last - 1);
|
|
46045
|
+
return true;
|
|
46046
|
+
case 3:
|
|
46047
|
+
this.sort3(first, first + 1, last - 1);
|
|
46048
|
+
return true;
|
|
46049
|
+
case 4:
|
|
46050
|
+
this.sort4(first, first + 1, first + 2, last - 1);
|
|
46051
|
+
return true;
|
|
46052
|
+
case 5:
|
|
46053
|
+
this.sort5(first, first + 1, first + 2, first + 3, last - 1);
|
|
46054
|
+
return true;
|
|
46055
|
+
default:
|
|
46056
|
+
return false;
|
|
46057
|
+
}
|
|
46058
|
+
}
|
|
46059
|
+
/** @see __algorithm/sort.h:__insertion_sort */
|
|
46060
|
+
insertionSort(first, last) {
|
|
46061
|
+
const { a, lt } = this;
|
|
46062
|
+
if (first === last) return;
|
|
46063
|
+
for (let i = first + 1; i !== last; ++i) {
|
|
46064
|
+
let j = i - 1;
|
|
46065
|
+
if (lt(a[i], a[j])) {
|
|
46066
|
+
const t = a[i];
|
|
46067
|
+
let k = j;
|
|
46068
|
+
j = i;
|
|
46069
|
+
do {
|
|
46070
|
+
a[j] = a[k];
|
|
46071
|
+
j = k;
|
|
46072
|
+
} while (j !== first && lt(t, a[--k]));
|
|
46073
|
+
a[j] = t;
|
|
46074
|
+
}
|
|
46075
|
+
}
|
|
46076
|
+
}
|
|
46077
|
+
/**
|
|
46078
|
+
* Assumes that `first - 1` holds an element no element of the range sorts before.
|
|
46079
|
+
* @see __algorithm/sort.h:__insertion_sort_unguarded
|
|
46080
|
+
*/
|
|
46081
|
+
insertionSortUnguarded(first, last) {
|
|
46082
|
+
const { a, lt } = this;
|
|
46083
|
+
if (first === last) return;
|
|
46084
|
+
for (let i = first + 1; i !== last; ++i) {
|
|
46085
|
+
let j = i - 1;
|
|
46086
|
+
if (lt(a[i], a[j])) {
|
|
46087
|
+
const t = a[i];
|
|
46088
|
+
let k = j;
|
|
46089
|
+
j = i;
|
|
46090
|
+
do {
|
|
46091
|
+
a[j] = a[k];
|
|
46092
|
+
j = k;
|
|
46093
|
+
} while (lt(t, a[--k]));
|
|
46094
|
+
a[j] = t;
|
|
46095
|
+
}
|
|
46096
|
+
}
|
|
46097
|
+
}
|
|
46098
|
+
/** @see __algorithm/sort.h:__insertion_sort_incomplete */
|
|
46099
|
+
insertionSortIncomplete(first, last) {
|
|
46100
|
+
const { a, lt } = this;
|
|
46101
|
+
if (this.sortSmall(first, last)) return true;
|
|
46102
|
+
let j = first + 2;
|
|
46103
|
+
this.sort3(first, first + 1, j);
|
|
46104
|
+
let count = 0;
|
|
46105
|
+
for (let i = j + 1; i !== last; ++i) {
|
|
46106
|
+
if (lt(a[i], a[j])) {
|
|
46107
|
+
const t = a[i];
|
|
46108
|
+
let k = j;
|
|
46109
|
+
j = i;
|
|
46110
|
+
do {
|
|
46111
|
+
a[j] = a[k];
|
|
46112
|
+
j = k;
|
|
46113
|
+
} while (j !== first && lt(t, a[--k]));
|
|
46114
|
+
a[j] = t;
|
|
46115
|
+
if (++count === INCOMPLETE_LIMIT) return ++i === last;
|
|
46116
|
+
}
|
|
46117
|
+
j = i;
|
|
46118
|
+
}
|
|
46119
|
+
return true;
|
|
46120
|
+
}
|
|
46121
|
+
/**
|
|
46122
|
+
* `*first` holds the pivot. Elements equivalent to it end up on its right.
|
|
46123
|
+
* @returns the pivot's index, and whether the range was already partitioned
|
|
46124
|
+
* @see __algorithm/sort.h:__partition_with_equals_on_right
|
|
46125
|
+
*/
|
|
46126
|
+
partitionWithEqualsOnRight(first, last) {
|
|
46127
|
+
const { a, lt } = this;
|
|
46128
|
+
const begin = first;
|
|
46129
|
+
const pivot = a[first];
|
|
46130
|
+
do {
|
|
46131
|
+
++first;
|
|
46132
|
+
} while (lt(a[first], pivot));
|
|
46133
|
+
if (begin === first - 1) {
|
|
46134
|
+
while (first < last && !lt(a[--last], pivot)) ;
|
|
46135
|
+
} else {
|
|
46136
|
+
do {
|
|
46137
|
+
--last;
|
|
46138
|
+
} while (!lt(a[last], pivot));
|
|
46139
|
+
}
|
|
46140
|
+
const alreadyPartitioned = first >= last;
|
|
46141
|
+
while (first < last) {
|
|
46142
|
+
this.swap(first, last);
|
|
46143
|
+
do {
|
|
46144
|
+
++first;
|
|
46145
|
+
} while (lt(a[first], pivot));
|
|
46146
|
+
do {
|
|
46147
|
+
--last;
|
|
46148
|
+
} while (!lt(a[last], pivot));
|
|
46149
|
+
}
|
|
46150
|
+
const pivotPos = first - 1;
|
|
46151
|
+
if (begin !== pivotPos) a[begin] = a[pivotPos];
|
|
46152
|
+
a[pivotPos] = pivot;
|
|
46153
|
+
return [pivotPos, alreadyPartitioned];
|
|
46154
|
+
}
|
|
46155
|
+
/**
|
|
46156
|
+
* The opening scan of `__partition_with_equals_on_left`, apart because of the project's
|
|
46157
|
+
* complexity limit.
|
|
46158
|
+
* @returns the first index after `first` that sorts after the pivot, or `last`
|
|
46159
|
+
* @see __algorithm/sort.h:__partition_with_equals_on_left
|
|
46160
|
+
*/
|
|
46161
|
+
firstAfterPivot(first, last, pivot) {
|
|
46162
|
+
const { a, lt } = this;
|
|
46163
|
+
if (lt(pivot, a[last - 1])) {
|
|
46164
|
+
do {
|
|
46165
|
+
++first;
|
|
46166
|
+
} while (!lt(pivot, a[first]));
|
|
46167
|
+
} else {
|
|
46168
|
+
while (++first < last && !lt(pivot, a[first])) ;
|
|
46169
|
+
}
|
|
46170
|
+
return first;
|
|
46171
|
+
}
|
|
46172
|
+
/**
|
|
46173
|
+
* `*first` holds the pivot. Elements equivalent to it end up on its left.
|
|
46174
|
+
* @returns the index after the pivot
|
|
46175
|
+
* @see __algorithm/sort.h:__partition_with_equals_on_left
|
|
46176
|
+
*/
|
|
46177
|
+
partitionWithEqualsOnLeft(first, last) {
|
|
46178
|
+
const { a, lt } = this;
|
|
46179
|
+
const begin = first;
|
|
46180
|
+
const pivot = a[first];
|
|
46181
|
+
first = this.firstAfterPivot(first, last, pivot);
|
|
46182
|
+
if (first < last) {
|
|
46183
|
+
do {
|
|
46184
|
+
--last;
|
|
46185
|
+
} while (lt(pivot, a[last]));
|
|
46186
|
+
}
|
|
46187
|
+
while (first < last) {
|
|
46188
|
+
this.swap(first, last);
|
|
46189
|
+
do {
|
|
46190
|
+
++first;
|
|
46191
|
+
} while (!lt(pivot, a[first]));
|
|
46192
|
+
do {
|
|
46193
|
+
--last;
|
|
46194
|
+
} while (lt(pivot, a[last]));
|
|
46195
|
+
}
|
|
46196
|
+
const pivotPos = first - 1;
|
|
46197
|
+
if (begin !== pivotPos) a[begin] = a[pivotPos];
|
|
46198
|
+
a[pivotPos] = pivot;
|
|
46199
|
+
return first;
|
|
46200
|
+
}
|
|
46201
|
+
/** @see __algorithm/sift_down.h:__sift_down */
|
|
46202
|
+
siftDown(first, len, start) {
|
|
46203
|
+
const { a, lt } = this;
|
|
46204
|
+
let child = start;
|
|
46205
|
+
if (len < 2 || Math.trunc((len - 2) / 2) < child) return;
|
|
46206
|
+
child = 2 * child + 1;
|
|
46207
|
+
if (child + 1 < len && lt(a[first + child], a[first + child + 1])) ++child;
|
|
46208
|
+
if (lt(a[first + child], a[first + start])) return;
|
|
46209
|
+
const top = a[first + start];
|
|
46210
|
+
do {
|
|
46211
|
+
a[first + start] = a[first + child];
|
|
46212
|
+
start = child;
|
|
46213
|
+
if (Math.trunc((len - 2) / 2) < child) break;
|
|
46214
|
+
child = 2 * child + 1;
|
|
46215
|
+
if (child + 1 < len && lt(a[first + child], a[first + child + 1])) ++child;
|
|
46216
|
+
} while (!lt(a[first + child], top));
|
|
46217
|
+
a[first + start] = top;
|
|
46218
|
+
}
|
|
46219
|
+
/** @see __algorithm/sift_down.h:__floyd_sift_down */
|
|
46220
|
+
floydSiftDown(first, len) {
|
|
46221
|
+
const { a, lt } = this;
|
|
46222
|
+
let hole = first;
|
|
46223
|
+
let childI = first;
|
|
46224
|
+
let child = 0;
|
|
46225
|
+
while (true) {
|
|
46226
|
+
childI += child + 1;
|
|
46227
|
+
child = 2 * child + 1;
|
|
46228
|
+
if (child + 1 < len && lt(a[childI], a[childI + 1])) {
|
|
46229
|
+
++childI;
|
|
46230
|
+
++child;
|
|
46231
|
+
}
|
|
46232
|
+
a[hole] = a[childI];
|
|
46233
|
+
hole = childI;
|
|
46234
|
+
if (child > Math.trunc((len - 2) / 2)) return hole;
|
|
46235
|
+
}
|
|
46236
|
+
}
|
|
46237
|
+
/** @see __algorithm/push_heap.h:__sift_up */
|
|
46238
|
+
siftUp(first, last, len) {
|
|
46239
|
+
const { a, lt } = this;
|
|
46240
|
+
if (len > 1) {
|
|
46241
|
+
len = Math.trunc((len - 2) / 2);
|
|
46242
|
+
let ptr = first + len;
|
|
46243
|
+
if (lt(a[ptr], a[--last])) {
|
|
46244
|
+
const t = a[last];
|
|
46245
|
+
do {
|
|
46246
|
+
a[last] = a[ptr];
|
|
46247
|
+
last = ptr;
|
|
46248
|
+
if (len === 0) break;
|
|
46249
|
+
len = Math.trunc((len - 1) / 2);
|
|
46250
|
+
ptr = first + len;
|
|
46251
|
+
} while (lt(a[ptr], t));
|
|
46252
|
+
a[last] = t;
|
|
46253
|
+
}
|
|
46254
|
+
}
|
|
46255
|
+
}
|
|
46256
|
+
/** @see __algorithm/pop_heap.h:__pop_heap */
|
|
46257
|
+
popHeap(first, last, len) {
|
|
46258
|
+
const a = this.a;
|
|
46259
|
+
if (len > 1) {
|
|
46260
|
+
const top = a[first];
|
|
46261
|
+
let hole = this.floydSiftDown(first, len);
|
|
46262
|
+
--last;
|
|
46263
|
+
if (hole === last) {
|
|
46264
|
+
a[hole] = top;
|
|
46265
|
+
} else {
|
|
46266
|
+
a[hole] = a[last];
|
|
46267
|
+
++hole;
|
|
46268
|
+
a[last] = top;
|
|
46269
|
+
this.siftUp(first, hole, hole - first);
|
|
46270
|
+
}
|
|
46271
|
+
}
|
|
46272
|
+
}
|
|
46273
|
+
/** @see __algorithm/make_heap.h:__make_heap */
|
|
46274
|
+
makeHeap(first, last) {
|
|
46275
|
+
const n = last - first;
|
|
46276
|
+
if (n > 1) {
|
|
46277
|
+
for (let start = Math.trunc((n - 2) / 2); start >= 0; --start) {
|
|
46278
|
+
this.siftDown(first, n, start);
|
|
46279
|
+
}
|
|
46280
|
+
}
|
|
46281
|
+
}
|
|
46282
|
+
/** @see __algorithm/sort_heap.h:__sort_heap */
|
|
46283
|
+
sortHeap(first, last) {
|
|
46284
|
+
for (let n = last - first; n > 1; --last, --n) this.popHeap(first, last, n);
|
|
46285
|
+
}
|
|
46286
|
+
/**
|
|
46287
|
+
* `__partial_sort_impl(first, last, last, comp)`, as the depth fallback calls it.
|
|
46288
|
+
* @see __algorithm/partial_sort.h:__partial_sort_impl
|
|
46289
|
+
*/
|
|
46290
|
+
partialSort(first, last) {
|
|
46291
|
+
this.makeHeap(first, last);
|
|
46292
|
+
this.sortHeap(first, last);
|
|
46293
|
+
}
|
|
46294
|
+
/**
|
|
46295
|
+
* Tukey's ninther or the median of 3, leaving the pivot at `first`. Apart from `__introsort`
|
|
46296
|
+
* because of the project's complexity limit.
|
|
46297
|
+
* @see __algorithm/sort.h:__introsort
|
|
46298
|
+
*/
|
|
46299
|
+
selectPivot(first, last, len) {
|
|
46300
|
+
const halfLen = Math.trunc(len / 2);
|
|
46301
|
+
if (len > NINTHER_THRESHOLD) {
|
|
46302
|
+
this.sort3(first, first + halfLen, last - 1);
|
|
46303
|
+
this.sort3(first + 1, first + (halfLen - 1), last - 2);
|
|
46304
|
+
this.sort3(first + 2, first + (halfLen + 1), last - 3);
|
|
46305
|
+
this.sort3(first + (halfLen - 1), first + halfLen, first + (halfLen + 1));
|
|
46306
|
+
this.swap(first, first + halfLen);
|
|
46307
|
+
} else {
|
|
46308
|
+
this.sort3(first + halfLen, first, last - 1);
|
|
46309
|
+
}
|
|
46310
|
+
}
|
|
46311
|
+
/**
|
|
46312
|
+
* `__introsort`'s test for a pivot equal to the highest element on its left. Apart because of
|
|
46313
|
+
* the project's complexity limit.
|
|
46314
|
+
* @see __algorithm/sort.h:__introsort
|
|
46315
|
+
*/
|
|
46316
|
+
pivotEqualsLeftNeighbour(first, leftmost) {
|
|
46317
|
+
return !leftmost && !this.lt(this.a[first - 1], this.a[first]);
|
|
46318
|
+
}
|
|
46319
|
+
/** @see __algorithm/sort.h:__introsort */
|
|
46320
|
+
introsort(first, last, depth, leftmost) {
|
|
46321
|
+
while (true) {
|
|
46322
|
+
const len = last - first;
|
|
46323
|
+
if (this.sortSmall(first, last)) return;
|
|
46324
|
+
if (len < LIMIT) {
|
|
46325
|
+
if (leftmost) this.insertionSort(first, last);
|
|
46326
|
+
else this.insertionSortUnguarded(first, last);
|
|
46327
|
+
return;
|
|
46328
|
+
}
|
|
46329
|
+
if (depth === 0) {
|
|
46330
|
+
this.partialSort(first, last);
|
|
46331
|
+
return;
|
|
46332
|
+
}
|
|
46333
|
+
--depth;
|
|
46334
|
+
this.selectPivot(first, last, len);
|
|
46335
|
+
if (this.pivotEqualsLeftNeighbour(first, leftmost)) {
|
|
46336
|
+
first = this.partitionWithEqualsOnLeft(first, last);
|
|
46337
|
+
continue;
|
|
46338
|
+
}
|
|
46339
|
+
const [i, alreadyPartitioned] = this.partitionWithEqualsOnRight(first, last);
|
|
46340
|
+
if (alreadyPartitioned) {
|
|
46341
|
+
const fs = this.insertionSortIncomplete(first, i);
|
|
46342
|
+
if (this.insertionSortIncomplete(i + 1, last)) {
|
|
46343
|
+
if (fs) return;
|
|
46344
|
+
last = i;
|
|
46345
|
+
continue;
|
|
46346
|
+
}
|
|
46347
|
+
if (fs) {
|
|
46348
|
+
first = i + 1;
|
|
46349
|
+
continue;
|
|
46350
|
+
}
|
|
46351
|
+
}
|
|
46352
|
+
this.introsort(first, i, depth, leftmost);
|
|
46353
|
+
leftmost = false;
|
|
46354
|
+
first = i + 1;
|
|
46355
|
+
}
|
|
46356
|
+
}
|
|
46357
|
+
};
|
|
46358
|
+
function libcxxSort(a, lt) {
|
|
46359
|
+
if (a.length === 0) return;
|
|
46360
|
+
new Introsort(a, lt).introsort(0, a.length, 2 * bitLog2(a.length), true);
|
|
46361
|
+
}
|
|
46362
|
+
|
|
45017
46363
|
// src/vpsc/SweepLine.ts
|
|
45018
|
-
function makeNode(v, r, pos) {
|
|
46364
|
+
function makeNode(v, r, pos, seq2) {
|
|
45019
46365
|
return {
|
|
45020
46366
|
v,
|
|
45021
46367
|
r,
|
|
45022
46368
|
pos,
|
|
46369
|
+
seq: seq2,
|
|
45023
46370
|
firstAbove: null,
|
|
45024
46371
|
firstBelow: null,
|
|
45025
|
-
leftNeighbours:
|
|
45026
|
-
rightNeighbours:
|
|
46372
|
+
leftNeighbours: [],
|
|
46373
|
+
rightNeighbours: []
|
|
45027
46374
|
};
|
|
45028
46375
|
}
|
|
45029
|
-
function compareEventsSameRect(ea, eb) {
|
|
45030
|
-
if (ea.type === EvType.Open && eb.type !== EvType.Open) return -1;
|
|
45031
|
-
return 1;
|
|
45032
|
-
}
|
|
45033
46376
|
function compareEvents(ea, eb) {
|
|
45034
|
-
if (ea.node.r === eb.node.r)
|
|
45035
|
-
|
|
45036
|
-
|
|
45037
|
-
return
|
|
46377
|
+
if (ea.node.r === eb.node.r) {
|
|
46378
|
+
return ea.type === EvType.Open && eb.type !== EvType.Open;
|
|
46379
|
+
}
|
|
46380
|
+
if (ea.pos > eb.pos) return false;
|
|
46381
|
+
if (ea.pos < eb.pos) return true;
|
|
46382
|
+
return false;
|
|
45038
46383
|
}
|
|
45039
46384
|
function nodePosLt(a, b) {
|
|
45040
46385
|
if (a.pos < b.pos) return true;
|
|
45041
46386
|
if (b.pos < a.pos) return false;
|
|
45042
|
-
return a < b;
|
|
46387
|
+
return a.seq < b.seq;
|
|
45043
46388
|
}
|
|
45044
46389
|
function scanlineInsert(sl, node) {
|
|
45045
46390
|
let lo = 0;
|
|
@@ -45049,35 +46394,35 @@ function scanlineInsert(sl, node) {
|
|
|
45049
46394
|
if (nodePosLt(sl[mid], node)) lo = mid + 1;
|
|
45050
46395
|
else hi = mid;
|
|
45051
46396
|
}
|
|
45052
|
-
sl.splice(lo, 0, node);
|
|
46397
|
+
if (sl[lo] !== node) sl.splice(lo, 0, node);
|
|
45053
46398
|
}
|
|
45054
46399
|
function scanlineRemove(sl, node) {
|
|
45055
46400
|
const i = sl.indexOf(node);
|
|
45056
46401
|
if (i !== -1) sl.splice(i, 1);
|
|
45057
46402
|
}
|
|
45058
46403
|
function getLeftNeighbours(sl, v) {
|
|
45059
|
-
const result =
|
|
46404
|
+
const result = [];
|
|
45060
46405
|
const idx = sl.indexOf(v);
|
|
45061
46406
|
for (let i = idx - 1; i >= 0; i--) {
|
|
45062
46407
|
const u = sl[i];
|
|
45063
46408
|
if (u.r.overlapX(v.r) <= 0) {
|
|
45064
|
-
result
|
|
46409
|
+
scanlineInsert(result, u);
|
|
45065
46410
|
return result;
|
|
45066
46411
|
}
|
|
45067
|
-
if (u.r.overlapX(v.r) <= u.r.overlapY(v.r)) result
|
|
46412
|
+
if (u.r.overlapX(v.r) <= u.r.overlapY(v.r)) scanlineInsert(result, u);
|
|
45068
46413
|
}
|
|
45069
46414
|
return result;
|
|
45070
46415
|
}
|
|
45071
46416
|
function getRightNeighbours(sl, v) {
|
|
45072
|
-
const result =
|
|
46417
|
+
const result = [];
|
|
45073
46418
|
const idx = sl.indexOf(v);
|
|
45074
46419
|
for (let i = idx + 1; i < sl.length; i++) {
|
|
45075
46420
|
const u = sl[i];
|
|
45076
46421
|
if (u.r.overlapX(v.r) <= 0) {
|
|
45077
|
-
result
|
|
46422
|
+
scanlineInsert(result, u);
|
|
45078
46423
|
return result;
|
|
45079
46424
|
}
|
|
45080
|
-
if (u.r.overlapX(v.r) <= u.r.overlapY(v.r)) result
|
|
46425
|
+
if (u.r.overlapX(v.r) <= u.r.overlapY(v.r)) scanlineInsert(result, u);
|
|
45081
46426
|
}
|
|
45082
46427
|
return result;
|
|
45083
46428
|
}
|
|
@@ -45086,8 +46431,8 @@ function xOpenNeighbour(sl, v) {
|
|
|
45086
46431
|
const right2 = getRightNeighbours(sl, v);
|
|
45087
46432
|
v.leftNeighbours = left2;
|
|
45088
46433
|
v.rightNeighbours = right2;
|
|
45089
|
-
for (const n of left2) n.rightNeighbours
|
|
45090
|
-
for (const n of right2) n.leftNeighbours
|
|
46434
|
+
for (const n of left2) scanlineInsert(n.rightNeighbours, v);
|
|
46435
|
+
for (const n of right2) scanlineInsert(n.leftNeighbours, v);
|
|
45091
46436
|
}
|
|
45092
46437
|
function openLinkChain(sl, v) {
|
|
45093
46438
|
const idx = sl.indexOf(v);
|
|
@@ -45105,13 +46450,13 @@ function openLinkChain(sl, v) {
|
|
|
45105
46450
|
function xCloseLeft(v, cs) {
|
|
45106
46451
|
for (const u of v.leftNeighbours) {
|
|
45107
46452
|
cs.push(new Constraint(u.v, v.v, (v.r.width() + u.r.width()) / 2));
|
|
45108
|
-
u.rightNeighbours
|
|
46453
|
+
scanlineRemove(u.rightNeighbours, v);
|
|
45109
46454
|
}
|
|
45110
46455
|
}
|
|
45111
46456
|
function xCloseRight(v, cs) {
|
|
45112
46457
|
for (const u of v.rightNeighbours) {
|
|
45113
46458
|
cs.push(new Constraint(v.v, u.v, (v.r.width() + u.r.width()) / 2));
|
|
45114
|
-
u.leftNeighbours
|
|
46459
|
+
scanlineRemove(u.leftNeighbours, v);
|
|
45115
46460
|
}
|
|
45116
46461
|
}
|
|
45117
46462
|
function xCloseNeighbour(v, cs) {
|
|
@@ -45147,7 +46492,7 @@ function buildXEvents(rects, vs) {
|
|
|
45147
46492
|
for (let i = 0; i < rects.length; i++) {
|
|
45148
46493
|
const r = rects[i];
|
|
45149
46494
|
vs[i].desiredPosition = r.getCentreX();
|
|
45150
|
-
const node = makeNode(vs[i], r, r.getCentreX());
|
|
46495
|
+
const node = makeNode(vs[i], r, r.getCentreX(), i);
|
|
45151
46496
|
events.push({ type: EvType.Open, node, pos: r.getMinY() });
|
|
45152
46497
|
events.push({ type: EvType.Close, node, pos: r.getMaxY() });
|
|
45153
46498
|
}
|
|
@@ -45158,7 +46503,7 @@ function buildYEvents(rects, vs) {
|
|
|
45158
46503
|
for (let i = 0; i < rects.length; i++) {
|
|
45159
46504
|
const r = rects[i];
|
|
45160
46505
|
vs[i].desiredPosition = r.getCentreY();
|
|
45161
|
-
const node = makeNode(vs[i], r, r.getCentreY());
|
|
46506
|
+
const node = makeNode(vs[i], r, r.getCentreY(), i);
|
|
45162
46507
|
events.push({ type: EvType.Open, node, pos: r.getMinX() });
|
|
45163
46508
|
events.push({ type: EvType.Close, node, pos: r.getMaxX() });
|
|
45164
46509
|
}
|
|
@@ -45166,7 +46511,7 @@ function buildYEvents(rects, vs) {
|
|
|
45166
46511
|
}
|
|
45167
46512
|
function generateXConstraints(rects, vs, useNeighbourLists) {
|
|
45168
46513
|
const events = buildXEvents(rects, vs);
|
|
45169
|
-
events
|
|
46514
|
+
libcxxSort(events, compareEvents);
|
|
45170
46515
|
const sl = [];
|
|
45171
46516
|
const cs = [];
|
|
45172
46517
|
for (const e of events) {
|
|
@@ -45185,7 +46530,7 @@ function generateXConstraints(rects, vs, useNeighbourLists) {
|
|
|
45185
46530
|
}
|
|
45186
46531
|
function generateYConstraints(rects, vs) {
|
|
45187
46532
|
const events = buildYEvents(rects, vs);
|
|
45188
|
-
events
|
|
46533
|
+
libcxxSort(events, compareEvents);
|
|
45189
46534
|
const sl = [];
|
|
45190
46535
|
const cs = [];
|
|
45191
46536
|
for (const e of events) {
|
|
@@ -45659,251 +47004,6 @@ function deleteCMajEnvVPSC(e) {
|
|
|
45659
47004
|
}
|
|
45660
47005
|
}
|
|
45661
47006
|
|
|
45662
|
-
// src/layout/neato/lu.ts
|
|
45663
|
-
var DOT_VECTOR_TERMS = 8;
|
|
45664
|
-
function newArray(m, n, ival) {
|
|
45665
|
-
const mem = new Float64Array(m * n);
|
|
45666
|
-
const rv = [];
|
|
45667
|
-
for (let i = 0; i < m; i++) {
|
|
45668
|
-
rv.push(mem.subarray(i * n, (i + 1) * n));
|
|
45669
|
-
rv[i].fill(ival);
|
|
45670
|
-
}
|
|
45671
|
-
return rv;
|
|
45672
|
-
}
|
|
45673
|
-
function luScaleRows(lu, a, n, scales) {
|
|
45674
|
-
const m = lu.lu;
|
|
45675
|
-
const ps = lu.ps;
|
|
45676
|
-
for (let i = 0; i < n; i++) {
|
|
45677
|
-
let biggest = 0;
|
|
45678
|
-
for (let j = 0; j < n; j++) biggest = fmaxf(biggest, Math.abs(m[i][j] = a[i][j]));
|
|
45679
|
-
if (biggest > 0) scales[i] = 1 / biggest;
|
|
45680
|
-
else return false;
|
|
45681
|
-
ps[i] = i;
|
|
45682
|
-
}
|
|
45683
|
-
return true;
|
|
45684
|
-
}
|
|
45685
|
-
function luFindPivot(lu, k, n, scales, pivotindex) {
|
|
45686
|
-
const m = lu.lu;
|
|
45687
|
-
const ps = lu.ps;
|
|
45688
|
-
let biggest = 0;
|
|
45689
|
-
for (let i = k; i < n; i++) {
|
|
45690
|
-
const tempf = Math.abs(m[ps[i]][k]) * scales[ps[i]];
|
|
45691
|
-
if (biggest < tempf) {
|
|
45692
|
-
biggest = tempf;
|
|
45693
|
-
pivotindex = i;
|
|
45694
|
-
}
|
|
45695
|
-
}
|
|
45696
|
-
if (biggest <= 0) return -1;
|
|
45697
|
-
return pivotindex;
|
|
45698
|
-
}
|
|
45699
|
-
function luEliminate(lu, k, n) {
|
|
45700
|
-
const m = lu.lu;
|
|
45701
|
-
const ps = lu.ps;
|
|
45702
|
-
const rowK = m[ps[k]];
|
|
45703
|
-
const pivot = rowK[k];
|
|
45704
|
-
for (let i = k + 1; i < n; i++) {
|
|
45705
|
-
const rowI = m[ps[i]];
|
|
45706
|
-
const mult = rowI[k] = rowI[k] / pivot;
|
|
45707
|
-
for (let j = k + 1; j < n; j++) rowI[j] = fma(-mult, rowK[j], rowI[j]);
|
|
45708
|
-
}
|
|
45709
|
-
}
|
|
45710
|
-
function luDecompose(lu, a, n) {
|
|
45711
|
-
lu.lu = newArray(n, n, 0);
|
|
45712
|
-
lu.ps = new Int32Array(n);
|
|
45713
|
-
const scales = new Float64Array(n);
|
|
45714
|
-
if (!luScaleRows(lu, a, n, scales)) {
|
|
45715
|
-
luFree(lu);
|
|
45716
|
-
return 0;
|
|
45717
|
-
}
|
|
45718
|
-
for (let k = 0, pivotindex = 0; k < n - 1; k++) {
|
|
45719
|
-
pivotindex = luFindPivot(lu, k, n, scales, pivotindex);
|
|
45720
|
-
if (pivotindex < 0) {
|
|
45721
|
-
luFree(lu);
|
|
45722
|
-
return 0;
|
|
45723
|
-
}
|
|
45724
|
-
if (pivotindex !== k) {
|
|
45725
|
-
const ps = lu.ps;
|
|
45726
|
-
const t = ps[k];
|
|
45727
|
-
ps[k] = ps[pivotindex];
|
|
45728
|
-
ps[pivotindex] = t;
|
|
45729
|
-
}
|
|
45730
|
-
luEliminate(lu, k, n);
|
|
45731
|
-
}
|
|
45732
|
-
if (lu.lu[lu.ps[n - 1]][n - 1] === 0) {
|
|
45733
|
-
luFree(lu);
|
|
45734
|
-
return 0;
|
|
45735
|
-
}
|
|
45736
|
-
return 1;
|
|
45737
|
-
}
|
|
45738
|
-
function luDot(row, x, from, to) {
|
|
45739
|
-
const vecEnd = from + (to - from) - (to - from) % DOT_VECTOR_TERMS;
|
|
45740
|
-
let dot = 0;
|
|
45741
|
-
let j = from;
|
|
45742
|
-
for (; j < vecEnd; j++) dot += row[j] * x[j];
|
|
45743
|
-
for (; j < to; j++) dot = fma(row[j], x[j], dot);
|
|
45744
|
-
return dot;
|
|
45745
|
-
}
|
|
45746
|
-
function luSolve(lu, x, bi, n) {
|
|
45747
|
-
const m = lu.lu;
|
|
45748
|
-
const ps = lu.ps;
|
|
45749
|
-
for (let i = 0; i < n; i++) {
|
|
45750
|
-
const dot = luDot(m[ps[i]], x, 0, i);
|
|
45751
|
-
x[i] = (ps[i] === bi ? 1 : 0) - dot;
|
|
45752
|
-
}
|
|
45753
|
-
for (let i = n - 1; i >= 0; i--) {
|
|
45754
|
-
const row = m[ps[i]];
|
|
45755
|
-
const dot = luDot(row, x, i + 1, n);
|
|
45756
|
-
x[i] = (x[i] - dot) / row[i];
|
|
45757
|
-
}
|
|
45758
|
-
}
|
|
45759
|
-
function luFree(lu) {
|
|
45760
|
-
if (lu === null) {
|
|
45761
|
-
return;
|
|
45762
|
-
}
|
|
45763
|
-
lu.lu = null;
|
|
45764
|
-
lu.ps = null;
|
|
45765
|
-
}
|
|
45766
|
-
|
|
45767
|
-
// src/layout/neato/matinv.ts
|
|
45768
|
-
function matinv(A3, Ainv, n) {
|
|
45769
|
-
const lu = { lu: null, ps: null };
|
|
45770
|
-
if (luDecompose(lu, A3, n) === 0) return 0;
|
|
45771
|
-
for (let i = 0; i < n; i++) {
|
|
45772
|
-
luSolve(lu, Ainv[i], i, n);
|
|
45773
|
-
}
|
|
45774
|
-
luFree(lu);
|
|
45775
|
-
for (let i = 0; i < n; i++) {
|
|
45776
|
-
for (let j = 0; j < i; j++) {
|
|
45777
|
-
const t = Ainv[i][j];
|
|
45778
|
-
Ainv[i][j] = Ainv[j][i];
|
|
45779
|
-
Ainv[j][i] = t;
|
|
45780
|
-
}
|
|
45781
|
-
}
|
|
45782
|
-
return 1;
|
|
45783
|
-
}
|
|
45784
|
-
|
|
45785
|
-
// src/layout/neato/circuit.ts
|
|
45786
|
-
function solveCircuit(nG, Gm, GmInv) {
|
|
45787
|
-
for (let i = 0; i < nG; i++) {
|
|
45788
|
-
const row = Gm[i];
|
|
45789
|
-
let sum = 0;
|
|
45790
|
-
for (let j = 0; j < nG; j++) {
|
|
45791
|
-
if (i !== j) sum += row[j];
|
|
45792
|
-
}
|
|
45793
|
-
row[i] = -sum;
|
|
45794
|
-
}
|
|
45795
|
-
return matinv(Gm, GmInv, nG - 1);
|
|
45796
|
-
}
|
|
45797
|
-
|
|
45798
|
-
// src/layout/neato/stress-models.ts
|
|
45799
|
-
var SIZE_T_MODULUS = 2 ** 64;
|
|
45800
|
-
function commonNeighbors(graph, u, vVector) {
|
|
45801
|
-
let numSharedNeighbors = 0;
|
|
45802
|
-
for (let j = 1; j < graph[u].nedges; j++) {
|
|
45803
|
-
const neighbor2 = graph[u].edges[j];
|
|
45804
|
-
if (vVector[neighbor2] > 0) {
|
|
45805
|
-
numSharedNeighbors++;
|
|
45806
|
-
}
|
|
45807
|
-
}
|
|
45808
|
-
return numSharedNeighbors;
|
|
45809
|
-
}
|
|
45810
|
-
function fillNeighborsVecUnweighted(graph, vtx, vtxVec) {
|
|
45811
|
-
for (let j = 1; j < graph[vtx].nedges; j++) {
|
|
45812
|
-
vtxVec[graph[vtx].edges[j]] = 1;
|
|
45813
|
-
}
|
|
45814
|
-
}
|
|
45815
|
-
function emptyNeighborsVec(graph, vtx, vtxVec) {
|
|
45816
|
-
for (let j = 1; j < graph[vtx].nedges; j++) {
|
|
45817
|
-
vtxVec[graph[vtx].edges[j]] = 0;
|
|
45818
|
-
}
|
|
45819
|
-
}
|
|
45820
|
-
function circuitModel(graph, nG) {
|
|
45821
|
-
let Dij = new Float32Array(nG * (nG + 1) / 2);
|
|
45822
|
-
const Gm = newArray(nG, nG, 0);
|
|
45823
|
-
const GmInv = newArray(nG, nG, 0);
|
|
45824
|
-
if (graph[0].ewgts.length !== 0) {
|
|
45825
|
-
for (let i = 0; i < nG; i++) {
|
|
45826
|
-
for (let e = 1; e < graph[i].nedges; e++) {
|
|
45827
|
-
const j = graph[i].edges[e];
|
|
45828
|
-
Gm[i][j] = Gm[j][i] = -1 / Math.fround(graph[i].ewgts[e]);
|
|
45829
|
-
}
|
|
45830
|
-
}
|
|
45831
|
-
} else {
|
|
45832
|
-
for (let i = 0; i < nG; i++) {
|
|
45833
|
-
for (let e = 1; e < graph[i].nedges; e++) {
|
|
45834
|
-
const j = graph[i].edges[e];
|
|
45835
|
-
Gm[i][j] = Gm[j][i] = -1;
|
|
45836
|
-
}
|
|
45837
|
-
}
|
|
45838
|
-
}
|
|
45839
|
-
const rv = solveCircuit(nG, Gm, GmInv);
|
|
45840
|
-
if (rv) {
|
|
45841
|
-
circuitDistances(GmInv, nG, Dij);
|
|
45842
|
-
} else {
|
|
45843
|
-
Dij = null;
|
|
45844
|
-
}
|
|
45845
|
-
return Dij;
|
|
45846
|
-
}
|
|
45847
|
-
function circuitDistances(GmInv, nG, Dij) {
|
|
45848
|
-
let count = 0;
|
|
45849
|
-
for (let i = 0; i < nG; i++) {
|
|
45850
|
-
for (let j = i; j < nG; j++) {
|
|
45851
|
-
Dij[count++] = i === j ? 0 : GmInv[i][i] + GmInv[j][j] - 2 * GmInv[i][j];
|
|
45852
|
-
}
|
|
45853
|
-
}
|
|
45854
|
-
}
|
|
45855
|
-
function artificialWeight(graph, degI, neighbor2, vtxVec) {
|
|
45856
|
-
const degJ = graph[neighbor2].nedges - 1;
|
|
45857
|
-
const w = degI + degJ - 2 * commonNeighbors(graph, neighbor2, vtxVec);
|
|
45858
|
-
return Math.fround(w < 0 ? w + SIZE_T_MODULUS : w);
|
|
45859
|
-
}
|
|
45860
|
-
function weightGraphKeepingLengths(graph, n, vtxVec) {
|
|
45861
|
-
for (let i = 0; i < n; i++) {
|
|
45862
|
-
const weights = new Array(graph[i].nedges).fill(0);
|
|
45863
|
-
fillNeighborsVecUnweighted(graph, i, vtxVec);
|
|
45864
|
-
const degI = graph[i].nedges - 1;
|
|
45865
|
-
for (let j = 1; j <= degI; j++) {
|
|
45866
|
-
const neighbor2 = graph[i].edges[j];
|
|
45867
|
-
weights[j] = fmaxf(artificialWeight(graph, degI, neighbor2, vtxVec), Math.fround(graph[i].ewgts[j]));
|
|
45868
|
-
}
|
|
45869
|
-
emptyNeighborsVec(graph, i, vtxVec);
|
|
45870
|
-
graph[i].ewgts = weights;
|
|
45871
|
-
}
|
|
45872
|
-
}
|
|
45873
|
-
function weightGraph(graph, n, vtxVec) {
|
|
45874
|
-
for (let i = 0; i < n; i++) {
|
|
45875
|
-
const weights = new Array(graph[i].nedges).fill(0);
|
|
45876
|
-
graph[i].ewgts = weights;
|
|
45877
|
-
fillNeighborsVecUnweighted(graph, i, vtxVec);
|
|
45878
|
-
const degI = graph[i].nedges - 1;
|
|
45879
|
-
for (let j = 1; j <= degI; j++) {
|
|
45880
|
-
const neighbor2 = graph[i].edges[j];
|
|
45881
|
-
weights[j] = artificialWeight(graph, degI, neighbor2, vtxVec);
|
|
45882
|
-
}
|
|
45883
|
-
emptyNeighborsVec(graph, i, vtxVec);
|
|
45884
|
-
}
|
|
45885
|
-
}
|
|
45886
|
-
function computeApspArtificialWeightsPacked(graph, n) {
|
|
45887
|
-
const oldWeights = graph[0].ewgts;
|
|
45888
|
-
const savedWeights = graph.slice(0, n).map((v) => v.ewgts);
|
|
45889
|
-
const vtxVec = new Int32Array(n);
|
|
45890
|
-
let Dij;
|
|
45891
|
-
if (graph[0].ewgts.length !== 0) {
|
|
45892
|
-
weightGraphKeepingLengths(graph, n, vtxVec);
|
|
45893
|
-
Dij = computeWeightedApspPacked(graph, n);
|
|
45894
|
-
} else {
|
|
45895
|
-
weightGraph(graph, n, vtxVec);
|
|
45896
|
-
Dij = computeApspPacked(graph, n);
|
|
45897
|
-
}
|
|
45898
|
-
graph[0].ewgts = [];
|
|
45899
|
-
if (oldWeights.length !== 0) {
|
|
45900
|
-
for (let i = 0; i < n; i++) {
|
|
45901
|
-
graph[i].ewgts = savedWeights[i];
|
|
45902
|
-
}
|
|
45903
|
-
}
|
|
45904
|
-
return Dij;
|
|
45905
|
-
}
|
|
45906
|
-
|
|
45907
47007
|
// src/layout/neato/stress-cola.ts
|
|
45908
47008
|
var fr9 = Math.fround;
|
|
45909
47009
|
var LOCAL_CONSTR_MAJOR_ITERATIONS2 = 1e3;
|
|
@@ -45927,10 +47027,10 @@ function maxEdgeLength(graph, n) {
|
|
|
45927
47027
|
}
|
|
45928
47028
|
function modelDistances2(graph, n, model) {
|
|
45929
47029
|
let Dij = null;
|
|
45930
|
-
if (model ===
|
|
47030
|
+
if (model === MODEL_SUBSET2) {
|
|
45931
47031
|
Dij = computeApspArtificialWeightsPacked(graph, n);
|
|
45932
|
-
} else if (model ===
|
|
45933
|
-
Dij =
|
|
47032
|
+
} else if (model === MODEL_CIRCUIT2) {
|
|
47033
|
+
Dij = circuitModel2(graph, n);
|
|
45934
47034
|
if (!Dij) {
|
|
45935
47035
|
agwarningf("graph is disconnected. Hence, the circuit model");
|
|
45936
47036
|
agerr("prev", "is undefined. Reverting to the shortest path model.");
|
|
@@ -48410,19 +49510,23 @@ function splineEdges(g) {
|
|
|
48410
49510
|
setState(GVSPLINES);
|
|
48411
49511
|
}
|
|
48412
49512
|
function computeBBFromPos(g) {
|
|
48413
|
-
const bb = {
|
|
48414
|
-
|
|
48415
|
-
|
|
49513
|
+
const bb = { ll: { x: Infinity, y: Infinity }, ur: { x: -Infinity, y: -Infinity } };
|
|
49514
|
+
const expandbp = (x, y) => {
|
|
49515
|
+
bb.ll = { x: Math.min(bb.ll.x, x), y: Math.min(bb.ll.y, y) };
|
|
49516
|
+
bb.ur = { x: Math.max(bb.ur.x, x), y: Math.max(bb.ur.y, y) };
|
|
48416
49517
|
};
|
|
48417
49518
|
for (const n of g.nodes.values()) {
|
|
48418
49519
|
const px = (n.info.pos?.[0] ?? 0) * 72;
|
|
48419
49520
|
const py = (n.info.pos?.[1] ?? 0) * 72;
|
|
48420
49521
|
const sx = (n.info.lw + n.info.rw) / 2;
|
|
48421
49522
|
const sy = n.info.ht / 2;
|
|
48422
|
-
|
|
48423
|
-
|
|
48424
|
-
|
|
48425
|
-
|
|
49523
|
+
expandbp(px - sx, py - sy);
|
|
49524
|
+
expandbp(px + sx, py + sy);
|
|
49525
|
+
}
|
|
49526
|
+
for (const e of g.edges) {
|
|
49527
|
+
for (const bz of e.info.spl?.list ?? []) {
|
|
49528
|
+
for (let j = 0; j < bz.size; j++) expandbp(bz.list[j].x, bz.list[j].y);
|
|
49529
|
+
}
|
|
48426
49530
|
}
|
|
48427
49531
|
if (!Number.isFinite(bb.ll.x)) {
|
|
48428
49532
|
return { ll: { x: 0, y: 0 }, ur: { x: 0, y: 0 } };
|
|
@@ -50727,6 +51831,9 @@ function resolveSeed(g, dflt) {
|
|
|
50727
51831
|
}
|
|
50728
51832
|
function tuneControl(g, ctrl) {
|
|
50729
51833
|
ctrl.randomSeed = resolveSeed(g, ctrl.randomSeed);
|
|
51834
|
+
if (parseStart(aggetGraph(g, "start"), INIT_RANDOM).init !== INIT_RANDOM) {
|
|
51835
|
+
agwarningf("sfdp only supports start=random");
|
|
51836
|
+
}
|
|
50730
51837
|
ctrl.K = lateDouble(aggetGraph(g, "K"), -1, 0);
|
|
50731
51838
|
ctrl.p = -1 * lateDouble(aggetGraph(g, "repulsiveforce"), -AUTOP, 0);
|
|
50732
51839
|
ctrl.multilevels = lateInt(aggetGraph(g, "levels"), INT_MAX2, 0);
|
|
@@ -50749,7 +51856,10 @@ function tuneControl(g, ctrl) {
|
|
|
50749
51856
|
);
|
|
50750
51857
|
}
|
|
50751
51858
|
ctrl.edgeLabelingScheme = lateInt(aggetGraph(g, "label_scheme"), 0, 0);
|
|
50752
|
-
if (ctrl.edgeLabelingScheme > 4)
|
|
51859
|
+
if (ctrl.edgeLabelingScheme > 4) {
|
|
51860
|
+
agwarningf(`label_scheme = ${ctrl.edgeLabelingScheme} > 4 : ignoring`);
|
|
51861
|
+
ctrl.edgeLabelingScheme = 0;
|
|
51862
|
+
}
|
|
50753
51863
|
assertEdgeLabelSchemeSupported(g, ctrl.edgeLabelingScheme);
|
|
50754
51864
|
}
|
|
50755
51865
|
function assertEdgeLabelSchemeSupported(g, scheme) {
|
|
@@ -52928,8 +54038,8 @@ var MODE_IPSEP = 3;
|
|
|
52928
54038
|
var MODE_SGD = 4;
|
|
52929
54039
|
var SGD_ITERATIONS = 30;
|
|
52930
54040
|
var MODEL_SHORTPATH2 = 0;
|
|
52931
|
-
var
|
|
52932
|
-
var
|
|
54041
|
+
var MODEL_CIRCUIT2 = 1;
|
|
54042
|
+
var MODEL_SUBSET2 = 2;
|
|
52933
54043
|
var MODEL_MDS2 = 3;
|
|
52934
54044
|
var DFLT_DIM = 2;
|
|
52935
54045
|
var POINTS_PER_INCH11 = 72;
|
|
@@ -52973,7 +54083,7 @@ function neatoMaxIter(maxiter, mode, n) {
|
|
|
52973
54083
|
}
|
|
52974
54084
|
var levelsGapOf = (g) => lateDouble(g.root.attrs.get("levelsgap"), 0, -Number.MAX_VALUE);
|
|
52975
54085
|
function solveStress(c, vtx, dCoords, nodeList) {
|
|
52976
|
-
const { g, mode, model,
|
|
54086
|
+
const { g, mode, model, opts } = c;
|
|
52977
54087
|
const n = nodeList.length;
|
|
52978
54088
|
const maxi = neatoMaxIter(g.attrs.get("maxiter"), mode, n);
|
|
52979
54089
|
const epsilon = lateDouble(g.attrs.get("epsilon"), 1e-4, 0);
|
|
@@ -52997,7 +54107,7 @@ function solveStress(c, vtx, dCoords, nodeList) {
|
|
|
52997
54107
|
opt
|
|
52998
54108
|
});
|
|
52999
54109
|
}
|
|
53000
|
-
const Dij =
|
|
54110
|
+
const Dij = stressModelDij(vtx, n, model);
|
|
53001
54111
|
return stressMajorizationKDMkernel(Dij, n, dCoords, nodeList, {
|
|
53002
54112
|
dim: DFLT_DIM,
|
|
53003
54113
|
opts,
|
|
@@ -53009,13 +54119,13 @@ function runMajorization(g, mode, model, am) {
|
|
|
53009
54119
|
const nodeList = assignNodeIds2(g);
|
|
53010
54120
|
setEdgeLen(g);
|
|
53011
54121
|
const n = nodeList.length;
|
|
53012
|
-
const haveLen = graphHasLen(g);
|
|
54122
|
+
const haveLen = model !== MODEL_SUBSET2 && graphHasLen(g);
|
|
53013
54123
|
const init = checkStart(g, n, mode === MODE_HIER ? INIT_SELF : INIT_RANDOM);
|
|
53014
54124
|
const opts = checkExp(g) | (init === INIT_SELF ? OPT_SMART_INIT : 0);
|
|
53015
54125
|
const haveDir = mode === MODE_HIER || mode === MODE_IPSEP;
|
|
53016
54126
|
const vtx = makeGraphDataC(g, nodeList, haveLen, haveDir, mode);
|
|
53017
54127
|
const dCoords = [new Float64Array(n), new Float64Array(n)];
|
|
53018
|
-
if (solveStress({ g, mode, model,
|
|
54128
|
+
if (solveStress({ g, mode, model, opts, am }, vtx, dCoords, nodeList) < 0) {
|
|
53019
54129
|
agerr("prev", "layout aborted");
|
|
53020
54130
|
return;
|
|
53021
54131
|
}
|
|
@@ -53025,8 +54135,9 @@ function runMajorization(g, mode, model, am) {
|
|
|
53025
54135
|
}
|
|
53026
54136
|
var NO_ADJUST = { mode: AM_NONE, print: "none", value: 0 };
|
|
53027
54137
|
function solveModel2(g, mode, model, am = NO_ADJUST) {
|
|
53028
|
-
|
|
53029
|
-
|
|
54138
|
+
const nG = g.nodes.size;
|
|
54139
|
+
if (nG < 2 || neatoMaxIter(g.attrs.get("maxiter"), mode, nG) < 0) return;
|
|
54140
|
+
assertSupported(g, mode);
|
|
53030
54141
|
if (mode === MODE_KK) return kkNeato(g, g.nodes.size, model);
|
|
53031
54142
|
if (mode === MODE_SGD) {
|
|
53032
54143
|
if (parseStart(g.root.attrs.get("start"), INIT_RANDOM).init === INIT_REGULAR) checkStart(g);
|
|
@@ -53418,16 +54529,27 @@ function layoutMulti(g, comps, globalRoot, pinfo) {
|
|
|
53418
54529
|
function parseMode(g) {
|
|
53419
54530
|
return neatoMode(g);
|
|
53420
54531
|
}
|
|
53421
|
-
var
|
|
53422
|
-
|
|
53423
|
-
|
|
53424
|
-
|
|
53425
|
-
|
|
53426
|
-
|
|
54532
|
+
var EDGE_LEN_ATTR = "len";
|
|
54533
|
+
function edgeLenDeclared(g) {
|
|
54534
|
+
if (g.edgeDefaults.has(EDGE_LEN_ATTR)) return true;
|
|
54535
|
+
for (const e of g.edges) if (e.attrs.has(EDGE_LEN_ATTR)) return true;
|
|
54536
|
+
for (const sub of g.subgraphs.values()) if (edgeLenDeclared(sub)) return true;
|
|
54537
|
+
return false;
|
|
54538
|
+
}
|
|
53427
54539
|
function parseModel(g) {
|
|
53428
|
-
const
|
|
53429
|
-
if (
|
|
53430
|
-
|
|
54540
|
+
const p = g.attrs.get("model");
|
|
54541
|
+
if (p === void 0 || p === "") return MODEL_SHORTPATH2;
|
|
54542
|
+
if (p === "circuit") return MODEL_CIRCUIT2;
|
|
54543
|
+
if (p === "subset") return MODEL_SUBSET2;
|
|
54544
|
+
if (p === "shortpath") return MODEL_SHORTPATH2;
|
|
54545
|
+
if (p === "mds") {
|
|
54546
|
+
if (edgeLenDeclared(g)) return MODEL_MDS2;
|
|
54547
|
+
agwarningf(`edges in graph ${agNameOf(g.root)} have no len attribute. Hence, the mds model`);
|
|
54548
|
+
agerr("prev", "is inappropriate. Reverting to the shortest path model.");
|
|
54549
|
+
return MODEL_SHORTPATH2;
|
|
54550
|
+
}
|
|
54551
|
+
agwarningf(`Unknown value ${p} for attribute "model" in graph ${agNameOf(g.root)} - ignored`);
|
|
54552
|
+
return MODEL_SHORTPATH2;
|
|
53431
54553
|
}
|
|
53432
54554
|
function maybeRemoveOverlap(g, am) {
|
|
53433
54555
|
removeOverlapWith(g, am);
|
|
@@ -55615,7 +56737,7 @@ function sfdpLayout(g) {
|
|
|
55615
56737
|
let singleComponent = true;
|
|
55616
56738
|
if (g.nodes.size > 0) {
|
|
55617
56739
|
const { ctrl, pad, doAdjust } = resolveControl(g);
|
|
55618
|
-
const comps = ccomps(g
|
|
56740
|
+
const comps = ccomps(g);
|
|
55619
56741
|
singleComponent = comps.length === 1;
|
|
55620
56742
|
if (singleComponent) {
|
|
55621
56743
|
sfdpLayoutComponent(g, ctrl, pad);
|
|
@@ -55697,7 +56819,8 @@ function makeCircState(blockCount) {
|
|
|
55697
56819
|
graphCopyCount: 0,
|
|
55698
56820
|
spanningTreeCount: 0,
|
|
55699
56821
|
minDist: MINDIST2,
|
|
55700
|
-
rootname: ""
|
|
56822
|
+
rootname: "",
|
|
56823
|
+
nRoot: null
|
|
55701
56824
|
};
|
|
55702
56825
|
}
|
|
55703
56826
|
function makeCData(dn) {
|
|
@@ -56215,10 +57338,17 @@ function dfsVisit2(ctx, u, isRoot) {
|
|
|
56215
57338
|
insertBlock(ctx.state.bl, block);
|
|
56216
57339
|
}
|
|
56217
57340
|
}
|
|
56218
|
-
function
|
|
57341
|
+
function findRoot(g, state3) {
|
|
56219
57342
|
let root = null;
|
|
56220
|
-
if (state3.rootname) root = g.
|
|
57343
|
+
if (state3.rootname) root = g.nodes.find((dn) => dn.name === state3.rootname) ?? null;
|
|
57344
|
+
if (!root && state3.nRoot !== null) {
|
|
57345
|
+
root = g.nodes.find((dn) => mapbool(dn.orig.attrs.get("root") ?? state3.nRoot ?? void 0)) ?? null;
|
|
57346
|
+
}
|
|
56221
57347
|
if (!root && g.nodes.length > 0) root = g.nodes[0];
|
|
57348
|
+
return root;
|
|
57349
|
+
}
|
|
57350
|
+
function findBlocks(g, state3, allEdges3) {
|
|
57351
|
+
const root = findRoot(g, state3);
|
|
56222
57352
|
if (!root) return;
|
|
56223
57353
|
const ord = /* @__PURE__ */ new Map();
|
|
56224
57354
|
g.nodes.forEach((dn, i) => ord.set(dn, i));
|
|
@@ -56529,7 +57659,7 @@ function buildDerivedEdges(g, dg) {
|
|
|
56529
57659
|
return edges;
|
|
56530
57660
|
}
|
|
56531
57661
|
function derivedComponents(g, dg, allEdges3) {
|
|
56532
|
-
const comps = ccomps(g
|
|
57662
|
+
const comps = ccomps(g);
|
|
56533
57663
|
return comps.map((sg, i) => {
|
|
56534
57664
|
const nodes = [];
|
|
56535
57665
|
for (const n of sg.nodes.values()) {
|
|
@@ -56555,6 +57685,11 @@ function readMinDist(realg) {
|
|
|
56555
57685
|
const v = parseFloat(realg.attrs.get("mindist") ?? "");
|
|
56556
57686
|
return isNaN(v) || v < 0 ? 1 : v;
|
|
56557
57687
|
}
|
|
57688
|
+
function nodeRootDefault(realg) {
|
|
57689
|
+
const declared = realg.nodeDefaults.get("root");
|
|
57690
|
+
if (declared !== void 0) return declared;
|
|
57691
|
+
return Array.from(realg.nodes.values()).some((n) => n.attrs.has("root")) ? "" : null;
|
|
57692
|
+
}
|
|
56558
57693
|
function circularLayout(sg, realg, blockCount, allEdges3) {
|
|
56559
57694
|
if (sg.nodes.length === 1) {
|
|
56560
57695
|
layoutSingleNode(sg);
|
|
@@ -56563,6 +57698,7 @@ function circularLayout(sg, realg, blockCount, allEdges3) {
|
|
|
56563
57698
|
const state3 = makeCircState(blockCount);
|
|
56564
57699
|
state3.minDist = readMinDist(realg);
|
|
56565
57700
|
state3.rootname = realg.attrs.get("root") ?? "";
|
|
57701
|
+
state3.nRoot = nodeRootDefault(realg);
|
|
56566
57702
|
let root;
|
|
56567
57703
|
if (isOneblock(realg)) root = createOneBlock(sg, state3);
|
|
56568
57704
|
else root = createBlocktree(sg, state3, allEdges3);
|
|
@@ -56653,7 +57789,7 @@ function twopiLayout(g) {
|
|
|
56653
57789
|
const rootAttr = g.attrs.get("root");
|
|
56654
57790
|
const setRoot = rootAttr !== void 0;
|
|
56655
57791
|
const globalRoot = setRoot && rootAttr !== "" ? g.nodes.get(rootAttr) ?? null : null;
|
|
56656
|
-
const comps = ccomps(g
|
|
57792
|
+
const comps = ccomps(g);
|
|
56657
57793
|
if (comps.length === 1) {
|
|
56658
57794
|
layoutSingle(g, comps, globalRoot, setRoot);
|
|
56659
57795
|
} else {
|
|
@@ -57378,7 +58514,7 @@ function svgEndCluster(job) {
|
|
|
57378
58514
|
}
|
|
57379
58515
|
|
|
57380
58516
|
// src/render/svg-edge-split.ts
|
|
57381
|
-
var
|
|
58517
|
+
var DEFAULT_COLOR6 = "black";
|
|
57382
58518
|
var PENWIDTH_NORMAL4 = 1;
|
|
57383
58519
|
var PENWIDTH_THRESHOLD4 = 5e-3;
|
|
57384
58520
|
var EPS3 = 1e-5;
|
|
@@ -57432,7 +58568,7 @@ function emitCurve(list, color, job) {
|
|
|
57432
58568
|
}
|
|
57433
58569
|
function stepSegment(list, s, st, out) {
|
|
57434
58570
|
if (Math.abs(s.t) < EPS3) return;
|
|
57435
|
-
const color = s.color ??
|
|
58571
|
+
const color = s.color ?? DEFAULT_COLOR6;
|
|
57436
58572
|
st.left -= s.t;
|
|
57437
58573
|
st.endColor = color;
|
|
57438
58574
|
if (st.first) {
|
|
@@ -57451,7 +58587,7 @@ function stepSegment(list, s, st, out) {
|
|
|
57451
58587
|
}
|
|
57452
58588
|
}
|
|
57453
58589
|
function splitSplineByColor(list, segs) {
|
|
57454
|
-
const st = { left: 1, first: true, bzR: list, done: false, endColor:
|
|
58590
|
+
const st = { left: 1, first: true, bzR: list, done: false, endColor: DEFAULT_COLOR6 };
|
|
57455
58591
|
const curves = [];
|
|
57456
58592
|
for (const s of segs) {
|
|
57457
58593
|
stepSegment(list, s, st, curves);
|
|
@@ -57466,7 +58602,7 @@ function drawSplitSpline(list, segs, job) {
|
|
|
57466
58602
|
}
|
|
57467
58603
|
function emitSplitEdgePaths(e, job, colorList) {
|
|
57468
58604
|
const segs = parseSegs(colorList, edgeSegsContext(e)).segs;
|
|
57469
|
-
const firstColor2 = segs[0]?.color ??
|
|
58605
|
+
const firstColor2 = segs[0]?.color ?? DEFAULT_COLOR6;
|
|
57470
58606
|
const spl = e.info.spl;
|
|
57471
58607
|
let endColor = firstColor2;
|
|
57472
58608
|
if (spl === void 0) return { firstColor: firstColor2, endColor };
|
|
@@ -58807,7 +59943,7 @@ var DotWriterBase = class {
|
|
|
58807
59943
|
* @see plugin/core/gvrender_core_dot.c:284 xdot_end_cluster */
|
|
58808
59944
|
clusterAttrs(sg) {
|
|
58809
59945
|
const d = this.drawsOf(sg);
|
|
58810
|
-
const parts = this.emitDraws ? [this.drawAttr("_draw_", d?.draw ?? "")] : [];
|
|
59946
|
+
const parts = this.emitDraws || d?.draw ? [this.drawAttr("_draw_", d?.draw ?? "")] : [];
|
|
58811
59947
|
if (d?.ldraw) parts.push(this.drawAttr("_ldraw_", d.ldraw));
|
|
58812
59948
|
if (sg.info.bb) parts.push('bb="' + this.bbStr(sg) + '"');
|
|
58813
59949
|
parts.push(...graphLabelAttrs(sg));
|
|
@@ -58920,8 +60056,8 @@ var DotWriterBase = class {
|
|
|
58920
60056
|
};
|
|
58921
60057
|
|
|
58922
60058
|
// src/render/dot/edge-draw.ts
|
|
58923
|
-
var
|
|
58924
|
-
var
|
|
60059
|
+
var DEFAULT_COLOR7 = "black";
|
|
60060
|
+
var DEFAULT_LINE_STYLE3 = ["solid", "setlinewidth(1)"];
|
|
58925
60061
|
function emitArrowOp(buf, op, fill) {
|
|
58926
60062
|
switch (op.kind) {
|
|
58927
60063
|
case "polygon":
|
|
@@ -58956,9 +60092,9 @@ var EdgeDrawBase = class extends DotWriterBase {
|
|
|
58956
60092
|
*/
|
|
58957
60093
|
attachmentPolyline(pts, pencolor, job) {
|
|
58958
60094
|
const obj = job.obj;
|
|
58959
|
-
gvrenderSetStyle(
|
|
60095
|
+
gvrenderSetStyle(DEFAULT_LINE_STYLE3);
|
|
58960
60096
|
if (obj !== null) {
|
|
58961
|
-
obj.rawStyle = [...
|
|
60097
|
+
obj.rawStyle = [...DEFAULT_LINE_STYLE3];
|
|
58962
60098
|
obj.pen = 3 /* Solid */;
|
|
58963
60099
|
obj.penWidth = 1;
|
|
58964
60100
|
obj.penColor = resolveRenderColor(pencolor.split(":")[0]);
|
|
@@ -59014,7 +60150,7 @@ var EdgeDrawBase = class extends DotWriterBase {
|
|
|
59014
60150
|
*/
|
|
59015
60151
|
emitSplitSpline(bzList, e, colorAttr, edraw, job) {
|
|
59016
60152
|
const segs = parseSegs(colorAttr, edgeSegsContext(e)).segs;
|
|
59017
|
-
const firstColor2 = segs[0]?.color ??
|
|
60153
|
+
const firstColor2 = segs[0]?.color ?? DEFAULT_COLOR7;
|
|
59018
60154
|
let endColor = firstColor2;
|
|
59019
60155
|
for (const bz of bzList) {
|
|
59020
60156
|
if (bz === void 0 || bz.size < 4) continue;
|
|
@@ -59036,7 +60172,7 @@ var EdgeDrawBase = class extends DotWriterBase {
|
|
|
59036
60172
|
const segData = bzList.map(
|
|
59037
60173
|
(bz) => bz !== void 0 && bz.size >= 4 ? buildOffsetLists(bz.list, (2 + numc) / 2) : { offlist: [], tmplist: [] }
|
|
59038
60174
|
);
|
|
59039
|
-
const colors = parseSegsSilent(colorAttr).segs.map((s) => s.color ??
|
|
60175
|
+
const colors = parseSegsSilent(colorAttr).segs.map((s) => s.color ?? DEFAULT_COLOR7);
|
|
59040
60176
|
for (const color of colors) {
|
|
59041
60177
|
const pen = xdotPenColor(resolveRenderColor(color));
|
|
59042
60178
|
for (const sd of segData) {
|
|
@@ -59046,8 +60182,8 @@ var EdgeDrawBase = class extends DotWriterBase {
|
|
|
59046
60182
|
}
|
|
59047
60183
|
}
|
|
59048
60184
|
return {
|
|
59049
|
-
headColor: colors[0] ??
|
|
59050
|
-
tailColor: colors[1] ?? colors[0] ??
|
|
60185
|
+
headColor: colors[0] ?? DEFAULT_COLOR7,
|
|
60186
|
+
tailColor: colors[1] ?? colors[0] ?? DEFAULT_COLOR7
|
|
59051
60187
|
};
|
|
59052
60188
|
}
|
|
59053
60189
|
/** Emit one arrow's primitive ops into `buf` (pen/fill from the edge color).
|
|
@@ -59071,6 +60207,89 @@ var EdgeDrawBase = class extends DotWriterBase {
|
|
|
59071
60207
|
}
|
|
59072
60208
|
};
|
|
59073
60209
|
|
|
60210
|
+
// src/render/dot/write-back.ts
|
|
60211
|
+
var POINTS_PER_INCH14 = 72;
|
|
60212
|
+
function attachNode(n) {
|
|
60213
|
+
const attrs = ownAttrs(n);
|
|
60214
|
+
const info = n.info;
|
|
60215
|
+
attrs.set("pos", gfmt5(info.coord.x) + "," + gfmt5(info.coord.y));
|
|
60216
|
+
attrs.set("height", gfmt5(info.ht / POINTS_PER_INCH14));
|
|
60217
|
+
attrs.set("width", gfmt5((info.lw + info.rw) / POINTS_PER_INCH14));
|
|
60218
|
+
const xlabel = info.xlabel;
|
|
60219
|
+
if (xlabel?.set) attrs.set("xlp", lpStr(xlabel.pos));
|
|
60220
|
+
if (info.shape?.name === "record") {
|
|
60221
|
+
const rects = [];
|
|
60222
|
+
appendRecordRects(n, info.shape_info, rects);
|
|
60223
|
+
attrs.set("rects", rects.join(" "));
|
|
60224
|
+
}
|
|
60225
|
+
}
|
|
60226
|
+
function attachEdge(e) {
|
|
60227
|
+
if (!edgeAttrsAttached(e)) return;
|
|
60228
|
+
const pos = edgePosRaw(e);
|
|
60229
|
+
if (pos === null) return;
|
|
60230
|
+
const attrs = ownAttrs(e);
|
|
60231
|
+
const { label, xlabel, head_label: head, tail_label: tail } = e.info;
|
|
60232
|
+
attrs.set("pos", pos);
|
|
60233
|
+
if (label) attrs.set("lp", lpStr(label.pos));
|
|
60234
|
+
if (xlabel?.set) attrs.set("xlp", lpStr(xlabel.pos));
|
|
60235
|
+
if (head) attrs.set("head_lp", lpStr(head.pos));
|
|
60236
|
+
if (tail) attrs.set("tail_lp", lpStr(tail.pos));
|
|
60237
|
+
}
|
|
60238
|
+
function clustersOf(g) {
|
|
60239
|
+
return (g.info.clust ?? []).slice(0, g.info.n_cluster ?? 0).filter(Boolean);
|
|
60240
|
+
}
|
|
60241
|
+
function recAttachBb(g) {
|
|
60242
|
+
const { ll, ur } = g.info.bb;
|
|
60243
|
+
g.attrs.set("bb", gfmt5(ll.x) + "," + gfmt5(ll.y) + "," + gfmt5(ur.x) + "," + gfmt5(ur.y));
|
|
60244
|
+
const label = g.info.label;
|
|
60245
|
+
if (label && label.text.length > 0) {
|
|
60246
|
+
g.attrs.set("lp", lpStr(label.pos));
|
|
60247
|
+
g.attrs.set("lwidth", gfmt2(label.dimen.x / POINTS_PER_INCH14));
|
|
60248
|
+
g.attrs.set("lheight", gfmt2(label.dimen.y / POINTS_PER_INCH14));
|
|
60249
|
+
}
|
|
60250
|
+
for (const sg of clustersOf(g)) recAttachBb(sg);
|
|
60251
|
+
}
|
|
60252
|
+
function attachAttrs(g) {
|
|
60253
|
+
for (const n of g.nodes.values()) attachNode(n);
|
|
60254
|
+
for (const e of g.edges) attachEdge(e);
|
|
60255
|
+
recAttachBb(g);
|
|
60256
|
+
}
|
|
60257
|
+
function storedDraws(attrs) {
|
|
60258
|
+
return {
|
|
60259
|
+
draw: attrs.get("_draw_"),
|
|
60260
|
+
ldraw: attrs.get("_ldraw_"),
|
|
60261
|
+
hdraw: attrs.get("_hdraw_"),
|
|
60262
|
+
tdraw: attrs.get("_tdraw_"),
|
|
60263
|
+
hldraw: attrs.get("_hldraw_"),
|
|
60264
|
+
tldraw: attrs.get("_tldraw_")
|
|
60265
|
+
};
|
|
60266
|
+
}
|
|
60267
|
+
function attachDraws(attrs, d) {
|
|
60268
|
+
if (d?.draw) attrs.set("_draw_", d.draw);
|
|
60269
|
+
if (d?.ldraw) attrs.set("_ldraw_", d.ldraw);
|
|
60270
|
+
if (d?.hdraw) attrs.set("_hdraw_", d.hdraw);
|
|
60271
|
+
if (d?.tdraw) attrs.set("_tdraw_", d.tdraw);
|
|
60272
|
+
if (d?.hldraw) attrs.set("_hldraw_", d.hldraw);
|
|
60273
|
+
if (d?.tldraw) attrs.set("_tldraw_", d.tldraw);
|
|
60274
|
+
}
|
|
60275
|
+
function attachClusterDraws(g, drawsOf) {
|
|
60276
|
+
for (const sg of clustersOf(g)) {
|
|
60277
|
+
const d = drawsOf(sg);
|
|
60278
|
+
sg.attrs.set("_draw_", d?.draw ?? "");
|
|
60279
|
+
if (d?.ldraw) sg.attrs.set("_ldraw_", d.ldraw);
|
|
60280
|
+
attachClusterDraws(sg, drawsOf);
|
|
60281
|
+
}
|
|
60282
|
+
}
|
|
60283
|
+
function attachXdotAttrs(g, drawsOf) {
|
|
60284
|
+
attachAttrs(g);
|
|
60285
|
+
if (drawsOf === void 0) return;
|
|
60286
|
+
for (const n of g.nodes.values()) attachDraws(ownAttrs(n), drawsOf(n));
|
|
60287
|
+
for (const e of g.edges) attachDraws(ownAttrs(e), drawsOf(e));
|
|
60288
|
+
attachDraws(g.attrs, drawsOf(g));
|
|
60289
|
+
attachClusterDraws(g, drawsOf);
|
|
60290
|
+
g.attrs.set("xdotversion", XDOT_VERSION);
|
|
60291
|
+
}
|
|
60292
|
+
|
|
59074
60293
|
// src/render/dot.ts
|
|
59075
60294
|
var XdotRenderer = class extends EdgeDrawBase {
|
|
59076
60295
|
type = "xdot";
|
|
@@ -59085,10 +60304,10 @@ var XdotRenderer = class extends EdgeDrawBase {
|
|
|
59085
60304
|
* @see plugin/core/gvrender_core_dot.c:404,418,475,482
|
|
59086
60305
|
*/
|
|
59087
60306
|
emitDraws = true;
|
|
59088
|
-
/** Draw strings for `obj
|
|
59089
|
-
* Single gate so the
|
|
60307
|
+
/** Draw strings for `obj`. `-Tdot` computes none, and agwrite prints the ones the
|
|
60308
|
+
* attribute slots already hold. Single gate so the two paths cannot drift. */
|
|
59090
60309
|
drawsOf(obj) {
|
|
59091
|
-
return this.emitDraws ? this.draws.get(obj) :
|
|
60310
|
+
return this.emitDraws ? this.draws.get(obj) : storedDraws(obj.attrs);
|
|
59092
60311
|
}
|
|
59093
60312
|
/** Per-render draw buffers. Indices 8/9 alias 1; 10/11 alias 5. */
|
|
59094
60313
|
bufs = makeXbufs();
|
|
@@ -59107,11 +60326,8 @@ var XdotRenderer = class extends EdgeDrawBase {
|
|
|
59107
60326
|
this.draws = /* @__PURE__ */ new Map();
|
|
59108
60327
|
this.clusters = [];
|
|
59109
60328
|
}
|
|
59110
|
-
/** The
|
|
59111
|
-
*
|
|
59112
|
-
* `-Tjson` reads directly (via agxget) — feeding them to parseXDot avoids the
|
|
59113
|
-
* DOT-text round-trip, which cannot represent draw text containing `"` and so
|
|
59114
|
-
* drops a preceding backslash (a cluster label's `\"` → `"`, id 2239). */
|
|
60329
|
+
/** The last render's draw strings by ORIGINAL object: what `-Tjson` reads via agxget.
|
|
60330
|
+
* The DOT-text round-trip cannot represent draw text containing `"` (id 2239). */
|
|
59115
60331
|
drawStringsByObject() {
|
|
59116
60332
|
return this.draws;
|
|
59117
60333
|
}
|
|
@@ -59124,6 +60340,10 @@ var XdotRenderer = class extends EdgeDrawBase {
|
|
|
59124
60340
|
if (gl) set.ldraw = escBackslash(gl);
|
|
59125
60341
|
}
|
|
59126
60342
|
job.write(this.serialize(g));
|
|
60343
|
+
this.writeBack(g);
|
|
60344
|
+
}
|
|
60345
|
+
writeBack(g) {
|
|
60346
|
+
attachXdotAttrs(g, this.emitDraws ? (o) => this.drawsOf(o) : void 0);
|
|
59127
60347
|
}
|
|
59128
60348
|
/** Emit the canvas background polygon into the GDRAW buffer.
|
|
59129
60349
|
* @see lib/common/emit.c:1476 emit_background */
|
|
@@ -59395,7 +60615,6 @@ var XdotRenderer = class extends EdgeDrawBase {
|
|
|
59395
60615
|
}
|
|
59396
60616
|
return d;
|
|
59397
60617
|
}
|
|
59398
|
-
// --- serialization (agwrite-at-end) ------------------------------------
|
|
59399
60618
|
};
|
|
59400
60619
|
var DotRenderer = class extends XdotRenderer {
|
|
59401
60620
|
type = "dot";
|
|
@@ -59616,370 +60835,6 @@ function createSvgRenderer() {
|
|
|
59616
60835
|
return new SvgRenderer();
|
|
59617
60836
|
}
|
|
59618
60837
|
|
|
59619
|
-
// src/xdot/types.ts
|
|
59620
|
-
var XDOT_PARSE_ERROR = 1;
|
|
59621
|
-
|
|
59622
|
-
// src/xdot/parse.ts
|
|
59623
|
-
var ULONG_MAX = 0xffffffffffffffffn;
|
|
59624
|
-
var XdotParser = class _XdotParser {
|
|
59625
|
-
static isWs(c) {
|
|
59626
|
-
return c === " " || c === " " || c === "\n" || c === "\r";
|
|
59627
|
-
}
|
|
59628
|
-
static skipWs(s, pos) {
|
|
59629
|
-
while (pos < s.length && _XdotParser.isWs(s[pos])) pos++;
|
|
59630
|
-
return pos;
|
|
59631
|
-
}
|
|
59632
|
-
static consumeDigits(s, i) {
|
|
59633
|
-
while (i < s.length && s[i] >= "0" && s[i] <= "9") i++;
|
|
59634
|
-
return i;
|
|
59635
|
-
}
|
|
59636
|
-
static consumeExponent(s, i) {
|
|
59637
|
-
if (i < s.length && (s[i] === "e" || s[i] === "E")) {
|
|
59638
|
-
i++;
|
|
59639
|
-
if (i < s.length && (s[i] === "+" || s[i] === "-")) i++;
|
|
59640
|
-
i = _XdotParser.consumeDigits(s, i);
|
|
59641
|
-
}
|
|
59642
|
-
return i;
|
|
59643
|
-
}
|
|
59644
|
-
static parseReal(s, pos) {
|
|
59645
|
-
let i = _XdotParser.skipWs(s, pos);
|
|
59646
|
-
const start = i;
|
|
59647
|
-
if (i < s.length && (s[i] === "-" || s[i] === "+")) i++;
|
|
59648
|
-
const digStart = i;
|
|
59649
|
-
i = _XdotParser.consumeDigits(s, i);
|
|
59650
|
-
if (i < s.length && s[i] === ".") {
|
|
59651
|
-
i++;
|
|
59652
|
-
i = _XdotParser.consumeDigits(s, i);
|
|
59653
|
-
}
|
|
59654
|
-
i = _XdotParser.consumeExponent(s, i);
|
|
59655
|
-
if (i === start || i === digStart) return null;
|
|
59656
|
-
return { val: parseFloat(s.slice(start, i)), pos: i };
|
|
59657
|
-
}
|
|
59658
|
-
static parseInt_(s, pos) {
|
|
59659
|
-
let i = _XdotParser.skipWs(s, pos);
|
|
59660
|
-
const start = i;
|
|
59661
|
-
if (i < s.length && (s[i] === "-" || s[i] === "+")) i++;
|
|
59662
|
-
const digStart = i;
|
|
59663
|
-
i = _XdotParser.consumeDigits(s, i);
|
|
59664
|
-
if (i === digStart) return null;
|
|
59665
|
-
return { val: parseInt(s.slice(start, i), 10), pos: i };
|
|
59666
|
-
}
|
|
59667
|
-
/**
|
|
59668
|
-
* strtoul(s, &endp, 10) cast to unsigned int: optional sign, a leading "-"
|
|
59669
|
-
* negates modulo 2^64, magnitude overflow saturates to ULONG_MAX, and the
|
|
59670
|
-
* result keeps the low 32 bits.
|
|
59671
|
-
* @see lib/xdot/xdot.c:parseUInt
|
|
59672
|
-
*/
|
|
59673
|
-
static parseUInt_(s, pos) {
|
|
59674
|
-
const i = _XdotParser.skipWs(s, pos);
|
|
59675
|
-
let start = i;
|
|
59676
|
-
const negative = i < s.length && s[i] === "-";
|
|
59677
|
-
if (i < s.length && (s[i] === "-" || s[i] === "+")) start++;
|
|
59678
|
-
const end = _XdotParser.consumeDigits(s, start);
|
|
59679
|
-
if (end === start) return null;
|
|
59680
|
-
const mag = BigInt(s.slice(start, end));
|
|
59681
|
-
const clamped = mag > ULONG_MAX ? ULONG_MAX : mag;
|
|
59682
|
-
const wrapped = negative && mag <= ULONG_MAX ? BigInt.asUintN(64, -clamped) : clamped;
|
|
59683
|
-
return { val: Number(BigInt.asUintN(32, wrapped)), pos: end };
|
|
59684
|
-
}
|
|
59685
|
-
static parseRect(s, pos) {
|
|
59686
|
-
const rx = _XdotParser.parseReal(s, pos);
|
|
59687
|
-
if (!rx) return null;
|
|
59688
|
-
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
59689
|
-
if (!ry) return null;
|
|
59690
|
-
const rw = _XdotParser.parseReal(s, ry.pos);
|
|
59691
|
-
if (!rw) return null;
|
|
59692
|
-
const rh = _XdotParser.parseReal(s, rw.pos);
|
|
59693
|
-
if (!rh) return null;
|
|
59694
|
-
return { val: { x: rx.val, y: ry.val, w: rw.val, h: rh.val }, pos: rh.pos };
|
|
59695
|
-
}
|
|
59696
|
-
static parsePoint(s, pos) {
|
|
59697
|
-
const rx = _XdotParser.parseReal(s, pos);
|
|
59698
|
-
if (!rx) return null;
|
|
59699
|
-
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
59700
|
-
if (!ry) return null;
|
|
59701
|
-
return { val: { x: rx.val, y: ry.val, z: 0 }, pos: ry.pos };
|
|
59702
|
-
}
|
|
59703
|
-
static parsePolyline(s, pos) {
|
|
59704
|
-
const ri = _XdotParser.parseUInt_(s, pos);
|
|
59705
|
-
if (!ri) return null;
|
|
59706
|
-
let cur = ri.pos;
|
|
59707
|
-
const pts = [];
|
|
59708
|
-
for (let i = 0; i < ri.val; i++) {
|
|
59709
|
-
const rp = _XdotParser.parsePoint(s, cur);
|
|
59710
|
-
if (!rp) return null;
|
|
59711
|
-
pts.push(rp.val);
|
|
59712
|
-
cur = rp.pos;
|
|
59713
|
-
}
|
|
59714
|
-
return { val: { pts }, pos: cur };
|
|
59715
|
-
}
|
|
59716
|
-
/** UTF-8 byte length of one code point (mirrors dot.ts utf8Len per char). */
|
|
59717
|
-
static cpByteLen(cp) {
|
|
59718
|
-
if (cp < 128) return 1;
|
|
59719
|
-
if (cp < 2048) return 2;
|
|
59720
|
-
if (cp < 65536) return 3;
|
|
59721
|
-
return 4;
|
|
59722
|
-
}
|
|
59723
|
-
static parseString(s, pos) {
|
|
59724
|
-
const ri = _XdotParser.parseInt_(s, pos);
|
|
59725
|
-
if (!ri || ri.val <= 0) return null;
|
|
59726
|
-
const len = ri.val;
|
|
59727
|
-
let cur = _XdotParser.skipWs(s, ri.pos);
|
|
59728
|
-
if (s[cur] !== "-") return null;
|
|
59729
|
-
cur++;
|
|
59730
|
-
let out = "";
|
|
59731
|
-
let accounted = 0;
|
|
59732
|
-
let j = 0;
|
|
59733
|
-
while (accounted < len) {
|
|
59734
|
-
if (cur + j >= s.length) return null;
|
|
59735
|
-
const ch = s[cur + j];
|
|
59736
|
-
const prev = j > 0 ? s[cur + j - 1] : "";
|
|
59737
|
-
out += ch;
|
|
59738
|
-
if (ch === "\\" && prev !== "\\") {
|
|
59739
|
-
j++;
|
|
59740
|
-
continue;
|
|
59741
|
-
}
|
|
59742
|
-
const cp = s.codePointAt(cur + j);
|
|
59743
|
-
accounted += _XdotParser.cpByteLen(cp);
|
|
59744
|
-
if (cp > 65535) {
|
|
59745
|
-
out += s[cur + j + 1];
|
|
59746
|
-
j++;
|
|
59747
|
-
}
|
|
59748
|
-
j++;
|
|
59749
|
-
}
|
|
59750
|
-
return { val: out, pos: cur + j };
|
|
59751
|
-
}
|
|
59752
|
-
static parseAlign(s, pos) {
|
|
59753
|
-
const ri = _XdotParser.parseInt_(s, pos);
|
|
59754
|
-
if (!ri) return null;
|
|
59755
|
-
const align = ri.val < 0 ? "left" : ri.val > 0 ? "right" : "center";
|
|
59756
|
-
return { val: align, pos: ri.pos };
|
|
59757
|
-
}
|
|
59758
|
-
static parseStops(s, pos, n) {
|
|
59759
|
-
let cur = pos;
|
|
59760
|
-
const stops = [];
|
|
59761
|
-
for (let i = 0; i < n; i++) {
|
|
59762
|
-
const rf = _XdotParser.parseReal(s, cur);
|
|
59763
|
-
if (!rf) return null;
|
|
59764
|
-
const rc = _XdotParser.parseString(s, rf.pos);
|
|
59765
|
-
if (!rc) return null;
|
|
59766
|
-
stops.push({ frac: rf.val, color: rc.val });
|
|
59767
|
-
cur = rc.pos;
|
|
59768
|
-
}
|
|
59769
|
-
return { stops, pos: cur };
|
|
59770
|
-
}
|
|
59771
|
-
static linGradient(s, pos) {
|
|
59772
|
-
const rx0 = _XdotParser.parseReal(s, pos);
|
|
59773
|
-
if (!rx0) return null;
|
|
59774
|
-
const ry0 = _XdotParser.parseReal(s, rx0.pos);
|
|
59775
|
-
if (!ry0) return null;
|
|
59776
|
-
const rx1 = _XdotParser.parseReal(s, ry0.pos);
|
|
59777
|
-
if (!rx1) return null;
|
|
59778
|
-
const ry1 = _XdotParser.parseReal(s, rx1.pos);
|
|
59779
|
-
if (!ry1) return null;
|
|
59780
|
-
const rn = _XdotParser.parseUInt_(s, ry1.pos);
|
|
59781
|
-
if (!rn) return null;
|
|
59782
|
-
const rs = _XdotParser.parseStops(s, rn.pos, rn.val);
|
|
59783
|
-
if (!rs) return null;
|
|
59784
|
-
return { x0: rx0.val, y0: ry0.val, x1: rx1.val, y1: ry1.val, stops: rs.stops };
|
|
59785
|
-
}
|
|
59786
|
-
static radGradient(s, pos) {
|
|
59787
|
-
const rx0 = _XdotParser.parseReal(s, pos);
|
|
59788
|
-
if (!rx0) return null;
|
|
59789
|
-
const ry0 = _XdotParser.parseReal(s, rx0.pos);
|
|
59790
|
-
if (!ry0) return null;
|
|
59791
|
-
const rr0 = _XdotParser.parseReal(s, ry0.pos);
|
|
59792
|
-
if (!rr0) return null;
|
|
59793
|
-
const rx1 = _XdotParser.parseReal(s, rr0.pos);
|
|
59794
|
-
if (!rx1) return null;
|
|
59795
|
-
const ry1 = _XdotParser.parseReal(s, rx1.pos);
|
|
59796
|
-
if (!ry1) return null;
|
|
59797
|
-
const rr1 = _XdotParser.parseReal(s, ry1.pos);
|
|
59798
|
-
if (!rr1) return null;
|
|
59799
|
-
const rn = _XdotParser.parseUInt_(s, rr1.pos);
|
|
59800
|
-
if (!rn) return null;
|
|
59801
|
-
const rs = _XdotParser.parseStops(s, rn.pos, rn.val);
|
|
59802
|
-
if (!rs) return null;
|
|
59803
|
-
return { x0: rx0.val, y0: ry0.val, r0: rr0.val, x1: rx1.val, y1: ry1.val, r1: rr1.val, stops: rs.stops };
|
|
59804
|
-
}
|
|
59805
|
-
static isAlnum(c) {
|
|
59806
|
-
return c >= "a" && c <= "z" || c >= "A" && c <= "Z" || c >= "0" && c <= "9";
|
|
59807
|
-
}
|
|
59808
|
-
static parseXDotColorAt(s, pos) {
|
|
59809
|
-
const c = pos < s.length ? s[pos] : "";
|
|
59810
|
-
if (c === "[") {
|
|
59811
|
-
const g = _XdotParser.linGradient(s, pos + 1);
|
|
59812
|
-
if (!g) return null;
|
|
59813
|
-
return { val: { type: "linear", ling: g }, pos };
|
|
59814
|
-
}
|
|
59815
|
-
if (c === "(") {
|
|
59816
|
-
const g = _XdotParser.radGradient(s, pos + 1);
|
|
59817
|
-
if (!g) return null;
|
|
59818
|
-
return { val: { type: "radial", ring: g }, pos };
|
|
59819
|
-
}
|
|
59820
|
-
if (c === "#" || c === "/" || _XdotParser.isAlnum(c))
|
|
59821
|
-
return { val: { type: "none", clr: s.slice(pos) }, pos };
|
|
59822
|
-
return null;
|
|
59823
|
-
}
|
|
59824
|
-
static parseEllipseOp(ch, s, pos, fns) {
|
|
59825
|
-
const r = _XdotParser.parseRect(s, pos);
|
|
59826
|
-
if (!r) return "error";
|
|
59827
|
-
const op = { kind: ch === "E" ? "filled_ellipse" : "unfilled_ellipse", ellipse: r.val };
|
|
59828
|
-
fns.ellipse?.(op, 0);
|
|
59829
|
-
return { op, pos: r.pos };
|
|
59830
|
-
}
|
|
59831
|
-
static parsePolygonOp(ch, s, pos, fns) {
|
|
59832
|
-
const r = _XdotParser.parsePolyline(s, pos);
|
|
59833
|
-
if (!r) return "error";
|
|
59834
|
-
const op = { kind: ch === "P" ? "filled_polygon" : "unfilled_polygon", polygon: r.val };
|
|
59835
|
-
fns.polygon?.(op, 0);
|
|
59836
|
-
return { op, pos: r.pos };
|
|
59837
|
-
}
|
|
59838
|
-
static parseBezierOp(ch, s, pos, fns) {
|
|
59839
|
-
const r = _XdotParser.parsePolyline(s, pos);
|
|
59840
|
-
if (!r) return "error";
|
|
59841
|
-
const op = { kind: ch === "b" ? "filled_bezier" : "unfilled_bezier", bezier: r.val };
|
|
59842
|
-
fns.bezier?.(op, 0);
|
|
59843
|
-
return { op, pos: r.pos };
|
|
59844
|
-
}
|
|
59845
|
-
static parsePolylineOp(s, pos, fns) {
|
|
59846
|
-
const r = _XdotParser.parsePolyline(s, pos);
|
|
59847
|
-
if (!r) return "error";
|
|
59848
|
-
const op = { kind: "polyline", polyline: r.val };
|
|
59849
|
-
fns.polyline?.(op, 0);
|
|
59850
|
-
return { op, pos: r.pos };
|
|
59851
|
-
}
|
|
59852
|
-
static parseTextOp(s, pos, fns) {
|
|
59853
|
-
const rx = _XdotParser.parseReal(s, pos);
|
|
59854
|
-
if (!rx) return "error";
|
|
59855
|
-
const ry = _XdotParser.parseReal(s, rx.pos);
|
|
59856
|
-
if (!ry) return "error";
|
|
59857
|
-
const ra = _XdotParser.parseAlign(s, ry.pos);
|
|
59858
|
-
if (!ra) return "error";
|
|
59859
|
-
const rw = _XdotParser.parseReal(s, ra.pos);
|
|
59860
|
-
if (!rw) return "error";
|
|
59861
|
-
const rt = _XdotParser.parseString(s, rw.pos);
|
|
59862
|
-
if (!rt) return "error";
|
|
59863
|
-
const text = { x: rx.val, y: ry.val, align: ra.val, width: rw.val, text: rt.val };
|
|
59864
|
-
const op = { kind: "text", text };
|
|
59865
|
-
fns.text?.(op, 0);
|
|
59866
|
-
return { op, pos: rt.pos };
|
|
59867
|
-
}
|
|
59868
|
-
static parseColorOp(ch, s, pos, fns) {
|
|
59869
|
-
const rs = _XdotParser.parseString(s, pos);
|
|
59870
|
-
if (!rs) return "error";
|
|
59871
|
-
const rc = _XdotParser.parseXDotColorAt(rs.val, 0);
|
|
59872
|
-
if (!rc) return "error";
|
|
59873
|
-
const clr = rc.val;
|
|
59874
|
-
if (clr.type === "none") {
|
|
59875
|
-
const op2 = { kind: ch === "C" ? "fill_color" : "pen_color", color: clr.clr };
|
|
59876
|
-
(ch === "C" ? fns.fill_color : fns.pen_color)?.(op2, 0);
|
|
59877
|
-
return { op: op2, pos: rs.pos };
|
|
59878
|
-
}
|
|
59879
|
-
const op = { kind: ch === "C" ? "grad_fill_color" : "grad_pen_color", gradColor: clr };
|
|
59880
|
-
fns.grad_color?.(op, 0);
|
|
59881
|
-
return { op, pos: rs.pos };
|
|
59882
|
-
}
|
|
59883
|
-
static parseFontOp(s, pos, fns) {
|
|
59884
|
-
const rs = _XdotParser.parseReal(s, pos);
|
|
59885
|
-
if (!rs) return "error";
|
|
59886
|
-
const rn = _XdotParser.parseString(s, rs.pos);
|
|
59887
|
-
if (!rn) return "error";
|
|
59888
|
-
const op = { kind: "font", font: { size: rs.val, name: rn.val } };
|
|
59889
|
-
fns.font?.(op, 0);
|
|
59890
|
-
return { op, pos: rn.pos };
|
|
59891
|
-
}
|
|
59892
|
-
static parseStyleOp(s, pos, fns) {
|
|
59893
|
-
const r = _XdotParser.parseString(s, pos);
|
|
59894
|
-
if (!r) return "error";
|
|
59895
|
-
const op = { kind: "style", style: r.val };
|
|
59896
|
-
fns.style?.(op, 0);
|
|
59897
|
-
return { op, pos: r.pos };
|
|
59898
|
-
}
|
|
59899
|
-
static parseImageOp(s, pos, fns) {
|
|
59900
|
-
const rr = _XdotParser.parseRect(s, pos);
|
|
59901
|
-
if (!rr) return "error";
|
|
59902
|
-
const rn = _XdotParser.parseString(s, rr.pos);
|
|
59903
|
-
if (!rn) return "error";
|
|
59904
|
-
const op = { kind: "image", image: { pos: rr.val, name: rn.val } };
|
|
59905
|
-
fns.image?.(op, 0);
|
|
59906
|
-
return { op, pos: rn.pos };
|
|
59907
|
-
}
|
|
59908
|
-
static parseFontcharOp(s, pos, fns) {
|
|
59909
|
-
const r = _XdotParser.parseUInt_(s, pos);
|
|
59910
|
-
if (!r) return "error";
|
|
59911
|
-
const op = { kind: "fontchar", fontchar: r.val };
|
|
59912
|
-
fns.fontchar?.(op, 0);
|
|
59913
|
-
return { op, pos: r.pos };
|
|
59914
|
-
}
|
|
59915
|
-
static parseShapeOp(ch, s, pos, fns) {
|
|
59916
|
-
if (ch === "E" || ch === "e") return _XdotParser.parseEllipseOp(ch, s, pos, fns);
|
|
59917
|
-
if (ch === "P" || ch === "p") return _XdotParser.parsePolygonOp(ch, s, pos, fns);
|
|
59918
|
-
if (ch === "b" || ch === "B") return _XdotParser.parseBezierOp(ch, s, pos, fns);
|
|
59919
|
-
if (ch === "L") return _XdotParser.parsePolylineOp(s, pos, fns);
|
|
59920
|
-
return null;
|
|
59921
|
-
}
|
|
59922
|
-
static parseMetaOp(ch, s, pos, fns) {
|
|
59923
|
-
if (ch === "T") return _XdotParser.parseTextOp(s, pos, fns);
|
|
59924
|
-
if (ch === "C" || ch === "c") return _XdotParser.parseColorOp(ch, s, pos, fns);
|
|
59925
|
-
if (ch === "F") return _XdotParser.parseFontOp(s, pos, fns);
|
|
59926
|
-
if (ch === "S") return _XdotParser.parseStyleOp(s, pos, fns);
|
|
59927
|
-
if (ch === "I") return _XdotParser.parseImageOp(s, pos, fns);
|
|
59928
|
-
if (ch === "t") return _XdotParser.parseFontcharOp(s, pos, fns);
|
|
59929
|
-
if (ch === "\0") return null;
|
|
59930
|
-
return "error";
|
|
59931
|
-
}
|
|
59932
|
-
static parseOp(s, pos, fns) {
|
|
59933
|
-
pos = _XdotParser.skipWs(s, pos);
|
|
59934
|
-
if (pos >= s.length) return null;
|
|
59935
|
-
const ch = s[pos++];
|
|
59936
|
-
const shape = _XdotParser.parseShapeOp(ch, s, pos, fns);
|
|
59937
|
-
if (shape !== null) return shape;
|
|
59938
|
-
return _XdotParser.parseMetaOp(ch, s, pos, fns);
|
|
59939
|
-
}
|
|
59940
|
-
static parseXDotFOn(s, opFns, _sz, x) {
|
|
59941
|
-
if (!s) return x;
|
|
59942
|
-
const result = x ?? { ops: [], flags: 0 };
|
|
59943
|
-
let pos = 0;
|
|
59944
|
-
while (pos < s.length) {
|
|
59945
|
-
const r = _XdotParser.parseOp(s, pos, opFns);
|
|
59946
|
-
if (r === null) break;
|
|
59947
|
-
if (r === "error") {
|
|
59948
|
-
result.flags |= XDOT_PARSE_ERROR;
|
|
59949
|
-
break;
|
|
59950
|
-
}
|
|
59951
|
-
result.ops.push(r.op);
|
|
59952
|
-
pos = r.pos;
|
|
59953
|
-
}
|
|
59954
|
-
return result.ops.length === 0 ? null : result;
|
|
59955
|
-
}
|
|
59956
|
-
static parseXDotF(s, opFns, sz) {
|
|
59957
|
-
return _XdotParser.parseXDotFOn(s, opFns, sz, null);
|
|
59958
|
-
}
|
|
59959
|
-
static parseXDot(s) {
|
|
59960
|
-
return _XdotParser.parseXDotF(s, {}, 0);
|
|
59961
|
-
}
|
|
59962
|
-
static parseXDotColor(s) {
|
|
59963
|
-
const r = _XdotParser.parseXDotColorAt(s, 0);
|
|
59964
|
-
return r ? r.val : null;
|
|
59965
|
-
}
|
|
59966
|
-
};
|
|
59967
|
-
function parseXDot(s) {
|
|
59968
|
-
return XdotParser.parseXDot(s);
|
|
59969
|
-
}
|
|
59970
|
-
|
|
59971
|
-
// src/xdot/misc.ts
|
|
59972
|
-
var SHAPE_LETTER = {
|
|
59973
|
-
filled_ellipse: "E",
|
|
59974
|
-
unfilled_ellipse: "e",
|
|
59975
|
-
filled_polygon: "P",
|
|
59976
|
-
unfilled_polygon: "p",
|
|
59977
|
-
filled_bezier: "b",
|
|
59978
|
-
unfilled_bezier: "B",
|
|
59979
|
-
polyline: "L"
|
|
59980
|
-
};
|
|
59981
|
-
var SHAPE_KINDS = new Set(Object.keys(SHAPE_LETTER));
|
|
59982
|
-
|
|
59983
60838
|
// src/render/json.ts
|
|
59984
60839
|
var XDOT_ATTR_NAMES = /* @__PURE__ */ new Set([
|
|
59985
60840
|
"_draw_",
|
|
@@ -60064,6 +60919,13 @@ function drawStringToOps(val2, isLatin) {
|
|
|
60064
60919
|
if (parsed === null) return [];
|
|
60065
60920
|
return parsed.ops.map((op) => opToJson(op, isLatin));
|
|
60066
60921
|
}
|
|
60922
|
+
var HeldXdotRenderer = class extends XdotRenderer {
|
|
60923
|
+
writeBack() {
|
|
60924
|
+
}
|
|
60925
|
+
attach(g) {
|
|
60926
|
+
super.writeBack(g);
|
|
60927
|
+
}
|
|
60928
|
+
};
|
|
60067
60929
|
function canonicalRootEdges(g) {
|
|
60068
60930
|
const out = [];
|
|
60069
60931
|
const counter = /* @__PURE__ */ new Map();
|
|
@@ -60094,7 +60956,7 @@ function applyDraws(attrs, d) {
|
|
|
60094
60956
|
}
|
|
60095
60957
|
function collectDrawLookup(g) {
|
|
60096
60958
|
let xg;
|
|
60097
|
-
const xr = new
|
|
60959
|
+
const xr = new HeldXdotRenderer();
|
|
60098
60960
|
try {
|
|
60099
60961
|
const ctx = createDefaultContext();
|
|
60100
60962
|
ctx.register(xr);
|
|
@@ -60131,7 +60993,7 @@ function collectDrawLookup(g) {
|
|
|
60131
60993
|
for (const [nm, gn] of g.nodes) applyDraws(node.get(nm), draws.get(gn));
|
|
60132
60994
|
for (const [gc, attrs] of cluster) applyDraws(attrs, draws.get(gc));
|
|
60133
60995
|
for (const [ge, attrs] of edge) applyDraws(attrs, draws.get(ge));
|
|
60134
|
-
return { graph: graphAttrs, node, cluster, edge };
|
|
60996
|
+
return { graph: graphAttrs, node, cluster, edge, attach: () => xr.attach(g) };
|
|
60135
60997
|
}
|
|
60136
60998
|
function isGraphLabelDeclared(g) {
|
|
60137
60999
|
if (g.attrs.has("label")) return true;
|
|
@@ -60141,7 +61003,7 @@ function isGraphLabelDeclared(g) {
|
|
|
60141
61003
|
return false;
|
|
60142
61004
|
}
|
|
60143
61005
|
function graphEffectiveAttrs(g, top) {
|
|
60144
|
-
if (top) return g
|
|
61006
|
+
if (top) return attrsWithoutLayoutBb(g);
|
|
60145
61007
|
const m = new Map(g.graphDefaultsSnapshot ?? []);
|
|
60146
61008
|
for (const [k, v] of g.attrs) m.set(k, v);
|
|
60147
61009
|
return m;
|
|
@@ -60349,15 +61211,9 @@ function buildJson(g, doXDot, preDraws) {
|
|
|
60349
61211
|
const root = buildGraphObject(g, true, ctx);
|
|
60350
61212
|
return JSON.stringify(root, null, 2) + "\n";
|
|
60351
61213
|
}
|
|
60352
|
-
var
|
|
60353
|
-
type = "json0";
|
|
61214
|
+
var JsonRendererBase = class {
|
|
60354
61215
|
/** @see plugin/core/gvplugin_core.c registration table */
|
|
60355
61216
|
quality = 0;
|
|
60356
|
-
beginGraph(_g, _job) {
|
|
60357
|
-
}
|
|
60358
|
-
endGraph(g, job) {
|
|
60359
|
-
job.write(buildJson(g, false));
|
|
60360
|
-
}
|
|
60361
61217
|
beginNode(_n, _job) {
|
|
60362
61218
|
}
|
|
60363
61219
|
endNode(_n, _job) {
|
|
@@ -60377,10 +61233,18 @@ var Json0Renderer = class {
|
|
|
60377
61233
|
polyline(_pts, _job) {
|
|
60378
61234
|
}
|
|
60379
61235
|
};
|
|
60380
|
-
var
|
|
61236
|
+
var Json0Renderer = class extends JsonRendererBase {
|
|
61237
|
+
type = "json0";
|
|
61238
|
+
beginGraph(_g, _job) {
|
|
61239
|
+
}
|
|
61240
|
+
/** C's json_begin_graph runs attach_attrs; buildJson overlays the same values. */
|
|
61241
|
+
endGraph(g, job) {
|
|
61242
|
+
job.write(buildJson(g, false));
|
|
61243
|
+
attachAttrs(g);
|
|
61244
|
+
}
|
|
61245
|
+
};
|
|
61246
|
+
var JsonRenderer = class extends JsonRendererBase {
|
|
60381
61247
|
type = "json";
|
|
60382
|
-
/** @see plugin/core/gvplugin_core.c registration table */
|
|
60383
|
-
quality = 0;
|
|
60384
61248
|
draws;
|
|
60385
61249
|
// set by beginGraph, cleared by endGraph
|
|
60386
61250
|
/** @see plugin/core/gvrender_core_json.c:json_begin_graph */
|
|
@@ -60389,26 +61253,9 @@ var JsonRenderer = class {
|
|
|
60389
61253
|
}
|
|
60390
61254
|
endGraph(g, job) {
|
|
60391
61255
|
job.write(buildJson(g, true, this.draws));
|
|
61256
|
+
this.draws?.attach();
|
|
60392
61257
|
this.draws = void 0;
|
|
60393
61258
|
}
|
|
60394
|
-
beginNode(_n, _job) {
|
|
60395
|
-
}
|
|
60396
|
-
endNode(_n, _job) {
|
|
60397
|
-
}
|
|
60398
|
-
beginEdge(_e, _job) {
|
|
60399
|
-
}
|
|
60400
|
-
endEdge(_e, _job) {
|
|
60401
|
-
}
|
|
60402
|
-
textspan(_pos, _span, _job) {
|
|
60403
|
-
}
|
|
60404
|
-
ellipse(_c, _rx, _ry, _f, _j) {
|
|
60405
|
-
}
|
|
60406
|
-
polygon(_pts, _filled, _job) {
|
|
60407
|
-
}
|
|
60408
|
-
bezier(_pts, _filled, _job) {
|
|
60409
|
-
}
|
|
60410
|
-
polyline(_pts, _job) {
|
|
60411
|
-
}
|
|
60412
61259
|
};
|
|
60413
61260
|
function createJson0Renderer() {
|
|
60414
61261
|
return new Json0Renderer();
|