@yuneta/gobj-ui 7.23.156 → 7.23.158

package/src/c_yui_treedb_graph.js

@@ -80,7 +80,7 @@ import {
 } from "@yuneta/gobj-js";
 
 
-import {attach_clear} from "./yui_inputs.js";
+import {attach_clear, refresh_clear} from "./yui_inputs.js";
 import {register_c_g6_nodes_tree} from "./c_g6_nodes_tree.js";
 import {yui_toolbar, yui_toolbar_icon, YUI_TOOLBAR_ICON_SIZE} from "./yui_toolbar.js";
 import {
@@ -555,8 +555,6 @@ function option_label(name)
             return t("manual");
         case "treedb-tree":
             return t("treedb-tree");
-        case "compact-tree":
-            return t("compact-tree");
         case "radial":
             return t("radial");
         case "dagre":
@@ -984,11 +982,13 @@ function make_toolbar(gobj)
      *  Right: find a node.
      *
      *  A graph of a few hundred records has no other way in: the only way
-     *  to locate one was to read every card. The box highlights every
-     *  match with the same amber the topic focus uses and centres the
-     *  viewport on them, and it SAYS how many it found — a graph that did
-     *  not move looks the same whether nothing matched or the match was
-     *  already on screen.
+     *  to locate one was to read every card. The box lights every match
+     *  ON SCREEN with the same amber the topic focus uses and changes
+     *  nothing else (no unfold, no layout, no camera); Enter centres the
+     *  next lit card, Shift+Enter the previous. It SAYS how many it found,
+     *  and how many more are folded away or in hidden topics — a graph
+     *  with no amber looks the same whether nothing matched or the matches
+     *  are not on screen.
      */
     /*  Materialised, not a spec: attach_clear() hangs the NORM clear (✕)
      *  on a real element.  Clearing dispatches a synthetic `input`, which
@@ -1002,8 +1002,12 @@ function make_toolbar(gobj)
              *  cannot reach it: it needs its own key. */
             placeholder: t('search'),
             'data-i18n-placeholder': 'search',
-            'aria-label': t('search'),
-            'data-i18n-aria-label': 'search'
+            /*  The title is where Enter is told: nothing else on the
+             *  box says it can step through the matches.  */
+            title: t('find on screen'),
+            'data-i18n-title': 'find on screen',
+            'aria-label': t('find on screen'),
+            'data-i18n-aria-label': 'find on screen'
         }, [], {
             /*  Rate-limited, not delayed for effect: a match repaints the
              *  cards it lands on, and on a large treedb the first letter
@@ -1020,6 +1024,24 @@ function make_toolbar(gobj)
                     priv.find_timer = null;
                     gobj_send_event(gobj, "EV_FIND_NODES", {text: text}, gobj);
                 }, 250);
+            },
+            /*  Enter steps through the lit cards. A term still waiting
+             *  on the rate limit is sent first, or Enter would step
+             *  through the matches of the term before it.  */
+            keydown: (evt) => {
+                if(evt.key !== 'Enter' || evt.isComposing) {
+                    return;
+                }
+                evt.preventDefault();
+                evt.stopPropagation();
+                if(priv.find_timer) {
+                    clearTimeout(priv.find_timer);
+                    priv.find_timer = null;
+                    gobj_send_event(
+                        gobj, "EV_FIND_NODES", {text: evt.target.value.trim()}, gobj
+                    );
+                }
+                gobj_send_event(gobj, "EV_FIND_NEXT", {back: evt.shiftKey}, gobj);
             }
         }]);
 
@@ -3190,6 +3212,23 @@ function ac_find_nodes(gobj, event, kw, src)
     return 0;
 }
 
+/************************************************************
+ *  Enter in the find box: forward the step down to the graph child.
+ ************************************************************/
+function ac_find_next(gobj, event, kw, src)
+{
+    let priv = gobj.priv;
+    if(priv.gobj_nodes_tree) {
+        gobj_send_event(
+            priv.gobj_nodes_tree,
+            "EV_FIND_NEXT",
+            {back: !!(kw && kw.back)},
+            gobj
+        );
+    }
+    return 0;
+}
+
 /************************************************************
  *  One press of the fold stepper (EV_EXPAND_LEVEL /
  *  EV_COLLAPSE_LEVEL): the level moves by one, is SAVED (the
@@ -3309,17 +3348,47 @@ function refresh_find_result(gobj)
     }
 
     let text = t("matches", {count: (kw && kw.matches) || 0});
-    /*  Matches in HIDDEN topics, counted apart: "0" alone reads as
-     *  "does not exist" when it means "is hidden".  */
+    /*  Where Enter stands among the lit cards: "3/12 matches".  */
+    let current = (kw && kw.current) || 0;
+    if(current > 0) {
+        text = `${current}/${text}`;
+    }
+    /*  Matches NOT lit, counted apart: "0" alone reads as "does not
+     *  exist" when it means "is folded away" or "is hidden".  */
+    let extra = [];
+    let folded = (kw && kw.folded_matches) || 0;
+    if(folded > 0) {
+        extra.push(`+${folded} ${t("not shown")}`);
+    }
     let hidden = (kw && kw.hidden_matches) || 0;
     if(hidden > 0) {
-        text += ` (+${hidden} ${t("hidden topics")})`;
+        extra.push(`+${hidden} ${t("hidden topics")}`);
+    }
+    if(extra.length) {
+        text += ` (${extra.join(", ")})`;
     }
     $count.textContent = text;
     $result.classList.remove("is-hidden");
     return 0;
 }
 
+function clear_find_box(gobj)
+{
+    let priv = gobj.priv;
+    if(priv.find_timer) {
+        clearTimeout(priv.find_timer);
+        priv.find_timer = null;
+    }
+    let $container = gobj_read_attr(gobj, "$container");
+    let $input = $container? $container.querySelector(".GRAPH_FIND_INPUT") : null;
+    if($input) {
+        $input.value = "";
+        refresh_clear($input);
+    }
+    priv._find_result = null;
+    refresh_find_result(gobj);
+}
+
 function ac_set_focus_topic(gobj, event, kw, src)
 {
     let priv = gobj.priv;
@@ -3336,6 +3405,13 @@ function ac_set_focus_topic(gobj, event, kw, src)
         }
     }
 
+    /*  A topic focus takes the highlight from the find (the engine
+     *  drops its term), so the box must not go on showing a term
+     *  nothing is lit for.  */
+    if(priv.focus_topic) {
+        clear_find_box(gobj);
+    }
+
     if(priv.gobj_nodes_tree) {
         gobj_send_event(
             priv.gobj_nodes_tree,
@@ -3437,6 +3513,7 @@ function create_gclass(gclass_name)
             ["EV_SET_OPERATION_MODE",       ac_set_operation_mode,      null],
             ["EV_SET_FOCUS_TOPIC",          ac_set_focus_topic,         null],
             ["EV_FIND_NODES",               ac_find_nodes,              null],
+            ["EV_FIND_NEXT",                ac_find_next,               null],
             ["EV_EXPAND_LEVEL",             ac_fold_level_step,         null],
             ["EV_COLLAPSE_LEVEL",           ac_fold_level_step,         null],
             ["EV_SET_NODE_MODE",            ac_set_node_mode,           null],
@@ -3484,6 +3561,7 @@ function create_gclass(gclass_name)
         ["EV_SET_OPERATION_MODE",       0],
         ["EV_SET_FOCUS_TOPIC",          0],
         ["EV_FIND_NODES",               0],
+        ["EV_FIND_NEXT",                0],
         ["EV_EXPAND_LEVEL",             0],
         ["EV_COLLAPSE_LEVEL",           0],
         ["EV_SET_NODE_MODE",            0],

package/src/treedb_elbow.js

@@ -25,25 +25,6 @@
  *        the order the edges were made, so a new edge never moves the
  *        ones already drawn.
  *
- *      - Several forward edges sharing one END: the children of one
- *        card, or the parents of one card (all its fkeys enter by one
- *        point). They are STAGGERED: each turns at its own height in
- *        the channel, so their runs lie side by side instead of on top
- *        of each other. Leaving a card, the one that runs farthest
- *        turns highest; reaching a card, the one that comes from
- *        farthest turns lowest -- the two orders in which the lines of
- *        one end nest without crossing.
- *
- *      - A card in a lower row of a STACK (treedb_layout.js lays a
- *        run of leaf children out as two columns with a corridor
- *        between them): the card above it stands in the way of the
- *        channel, so its edge runs down the corridor in a lane of
- *        its own -- a COMB -- and turns into the gap above its card.
- *
- *      And for CURVED edges (curve_hits, rounded_path): a curve
- *      that would cross another card follows the same way an elbow
- *      would, with round corners, so it reads as a curve.
- *
  *      Written for the top-down reading; left to right is the same
  *      geometry with the axes swapped.
  *
@@ -51,12 +32,9 @@
  *          All Rights Reserved.
  ***********************************************************************/
 
-import {STACK_GAP, STACK_LANE_PAD, STACK_LANE_STEP, STACK_TRUNK_MIN} from "./treedb_layout.js";
-
 export const ELBOW_STEP = 10;      /*  between two lanes  */
 export const ELBOW_JETTY = 16;     /*  straight run out of a port before a detour turns  */
 export const ELBOW_CLEAR = 24;     /*  how far outside the two cards a detour runs  */
-export const ELBOW_STAGGER_PAD = 6;    /*  staggered turns keep this far from the rows  */
 
 /************************************************************
  *  The lane of `id` among `ids`, the edges joining the same two
@@ -76,24 +54,6 @@ export function elbow_lane(ids, id)
     return side * Math.ceil(k / 2);
 }
 
-/************************************************************
- *  The rank of `id` among `items` ([{id, span}]): the forward
- *  edges that share one end with it, each with how far it runs
- *  ACROSS. Farthest first; a tie goes to the edge made first.
- *  Returns {rank, count}.
- ************************************************************/
-export function elbow_rank(items, id)
-{
-    let sorted = items.slice().sort((a, b) => {
-        if(b.span !== a.span) {
-            return b.span - a.span;
-        }
-        return String(a.id).localeCompare(String(b.id), undefined, {numeric: true});
-    });
-    let rank = sorted.findIndex((it) => it.id === id);
-    return {rank: (rank < 0)? 0 : rank, count: sorted.length};
-}
-
 function swap(p)
 {
     return [p[1], p[0]];
@@ -104,154 +64,6 @@ function swap_box(b)
     return {x1: b.y1, y1: b.x1, x2: b.y2, y2: b.x2};
 }
 
-/*  Where a forward edge turns between `lo` and `hi`: the middle, or
- *  its staggered place among the edges sharing one of its ends --
- *  leaving, the farthest highest; arriving, the farthest lowest.  */
-function staggered_turn(lo, hi, st)
-{
-    let mid = (lo + hi) / 2;
-    let group = null;
-    let k = 0;
-    if(st.dep && st.dep.count > 1) {
-        group = st.dep;
-        k = st.dep.rank;
-    } else if(st.arr && st.arr.count > 1) {
-        group = st.arr;
-        k = st.arr.count - 1 - st.arr.rank;
-    }
-    if(group) {
-        let room = Math.max(0, hi - lo - 2 * ELBOW_STAGGER_PAD);
-        let step = Math.min(ELBOW_STEP, room / (group.count - 1));
-        mid = mid - (group.count - 1) * step / 2 + k * step;
-    }
-    return mid;
-}
-
-/************************************************************
- *  The combs of the stacks under one card.
- *
- *  treedb_layout.js lays a run of leaf children out as two columns
- *  with a corridor between them. A card in the first row is reached
- *  from the channel like any other; one in a lower row cannot be --
- *  the card above it stands in the way -- so its edge runs down
- *  the corridor in a LANE of its own and turns into the gap above
- *  its card, which it shares only with the other card of its row,
- *  reached from the other side.
- *
- *      targets     [{id, box}]: the forward edges leaving one card,
- *                  each with the box of the card it reaches
- *      vertical    as in elbow_points; false swaps the boxes
- *
- *  Returns Map id -> {lane, z, top}: the lane, the height of the
- *  gap it turns into, and the top of the stack's first row (where
- *  the channel over the stack ends). Only for a card that stands
- *  under another of the group, within a stack gap and lined up
- *  with it on the corridor side -- what a stack looks like.
- *
- *  Lanes go outermost first, row by row: a line into a higher row
- *  keeps outside the lines going deeper, and none crosses another.
- ************************************************************/
-export function elbow_combs(targets, vertical)
-{
-    let list = vertical? targets : targets.map((it) => ({id: it.id, box: swap_box(it.box)}));
-    let cy = (b) => (b.y1 + b.y2) / 2;
-    let near = (a, b) => Math.abs(a - b) < 1.5;
-
-    let under = [];
-    for(let it of list) {
-        let b = it.box;
-        let above = null;
-        for(let o of list) {
-            let a = o.box;
-            if(o === it || a.y2 > b.y1 || b.y1 - a.y2 > STACK_GAP) {
-                continue;
-            }
-            if(!(near(a.x2, b.x2) || near(a.x1, b.x1))) {
-                continue;
-            }
-            if(!above || a.y2 > above.y2) {
-                above = a;
-            }
-        }
-        if(!above) {
-            continue;
-        }
-        /*  Its column: lined up on the corridor side, which is the
-         *  right edge of the first column and the left edge of the
-         *  second. Two cards of one width line up on both; then the
-         *  card beside it in its row says.  */
-        let side;
-        if(near(above.x2, b.x2) && !near(above.x1, b.x1)) {
-            side = 0;
-        } else if(near(above.x1, b.x1) && !near(above.x2, b.x2)) {
-            side = 1;
-        } else {
-            let left_of_it = list.some((o) => o !== it && near(cy(o.box), cy(b)) &&
-                                               o.box.x2 <= b.x1);
-            side = left_of_it? 1 : 0;
-        }
-        under.push({id: it.id, box: b, above: above, side: side});
-    }
-
-    /*  The corridor of a card: from the first column's edge to the
-     *  second's, read off any row of the stack that has both.  */
-    let corridor = (u) => {
-        if(u.side === 0) {
-            let l = u.box.x2;
-            let col = list.filter((o) => near(o.box.x2, l));
-            let r = Infinity;
-            for(let c of col) {
-                for(let o of list) {
-                    if(o !== c && near(cy(o.box), cy(c.box)) && o.box.x1 >= l - 0.5) {
-                        r = Math.min(r, o.box.x1);
-                    }
-                }
-            }
-            return {l: l, r: isFinite(r)? r : l + STACK_TRUNK_MIN, col: col};
-        }
-        let r = u.box.x1;
-        let col = list.filter((o) => near(o.box.x1, r));
-        let l = -Infinity;
-        for(let c of col) {
-            for(let o of list) {
-                if(o !== c && near(cy(o.box), cy(c.box)) && o.box.x2 <= r + 0.5) {
-                    l = Math.max(l, o.box.x2);
-                }
-            }
-        }
-        return {l: isFinite(l)? l : r - STACK_TRUNK_MIN, r: r, col: col};
-    };
-
-    let groups = new Map();
-    for(let u of under) {
-        let c = corridor(u);
-        u.top = Math.min(...c.col.map((o) => o.box.y1));
-        let key = `${Math.round(c.l)}|${Math.round(c.r)}`;
-        if(!groups.has(key)) {
-            groups.set(key, {l: c.l, r: c.r, left: [], right: []});
-        }
-        groups.get(key)[(u.side === 0)? 'left' : 'right'].push(u);
-    }
-
-    let out = new Map();
-    for(let g of groups.values()) {
-        g.left.sort((a, b) => a.box.y1 - b.box.y1);
-        g.right.sort((a, b) => a.box.y1 - b.box.y1);
-        let n = g.left.length + g.right.length;
-        let room = g.r - g.l - 2 * STACK_LANE_PAD;
-        let step = (n > 1)? Math.max(0, Math.min(STACK_LANE_STEP, room / (n - 1))) : 0;
-        g.left.forEach((u, i) => {
-            out.set(u.id, {lane: g.l + STACK_LANE_PAD + i * step,
-                           z: (u.above.y2 + u.box.y1) / 2, top: u.top});
-        });
-        g.right.forEach((u, j) => {
-            out.set(u.id, {lane: g.r - STACK_LANE_PAD - j * step,
-                           z: (u.above.y2 + u.box.y1) / 2, top: u.top});
-        });
-    }
-    return out;
-}
-
 /************************************************************
  *  The control points of an elbow from the port `s` to the port
  *  `t` ([x, y] each), knowing the boxes of the two cards
@@ -259,39 +71,21 @@ export function elbow_combs(targets, vertical)
  *
  *      vertical    the rows are stacked (top to bottom); false
  *                  when they are side by side (left to right)
- *      stagger     {dep, arr, comb}: the edge's rank among the
- *                  forward edges leaving its source card and among
- *                  those reaching its target card (elbow_rank), and
- *                  its comb when the target is in a lower row of a
- *                  stack (elbow_combs). Absent, the channel is the
- *                  middle.
  ************************************************************/
-export function elbow_points(s, t, box_s, box_t, lane, vertical, stagger)
+export function elbow_points(s, t, box_s, box_t, lane, vertical)
 {
     if(!vertical) {
-        return elbow_points(swap(s), swap(t), swap_box(box_s), swap_box(box_t), lane, true,
-                            stagger).map(swap);
+        return elbow_points(swap(s), swap(t), swap_box(box_s), swap_box(box_t), lane, true)
+            .map(swap);
     }
 
     let shift = lane * ELBOW_STEP;
 
-    /*  Forward: the channel half way between the two cards, each
-     *  edge of a shared end at its own height round it, moved by the
-     *  lane, and kept between the two rows. Into a lower row of a
-     *  stack: along the channel to its corridor lane, down the lane,
-     *  and into the gap above its card.  */
+    /*  Forward: the channel half way down, moved by the lane and
+     *  kept strictly between the two ports.  */
     if(t[1] - s[1] > 2 * ELBOW_STEP) {
-        let st = stagger || {};
-        let lo = Math.max(s[1], box_s.y2);
-        if(st.comb) {
-            let c = st.comb;
-            let turn = staggered_turn(lo, c.top, {dep: st.dep}) + shift;
-            turn = Math.min(Math.max(turn, lo + 4), c.top - 4);
-            return [[s[0], turn], [c.lane, turn], [c.lane, c.z], [t[0], c.z]];
-        }
-        let hi = Math.min(t[1], box_t.y1);
-        let mid = staggered_turn(lo, hi, st) + shift;
-        mid = Math.min(Math.max(mid, lo + 4), hi - 4);
+        let mid = (s[1] + t[1]) / 2 + shift;
+        mid = Math.min(Math.max(mid, s[1] + ELBOW_STEP), t[1] - ELBOW_STEP);
         return [[s[0], mid], [t[0], mid]];
     }
 
@@ -421,12 +215,8 @@ function heap_pop(h)
 /************************************************************
  *  The shortest orthogonal line from `a` to `z` that enters none
  *  of `boxes` (already expanded by the clearance), a turn costing
- *  ROUTE_BEND. The line leaves `a` SIDEWAYS and reaches `z`
- *  SIDEWAYS: the column straight under a port and the one straight
- *  over it belong to the forward edges that share that port, which
- *  run along them to their staggered turns -- a route going down
- *  that column lay on top of them. So a routed line shares only
- *  the stub between the port and `a` (or `z`).
+ *  ROUTE_BEND. The line leaves `a` going down and ends at `z`
+ *  going down, since after `z` it drops into a port.
  *
  *  The grid is SPARSE: only the lines of the boxes' borders and
  *  of the two ends, which is all an orthogonal shortest path ever
@@ -512,10 +302,7 @@ function orth_search(a, z, boxes)
         let k = state >> 2;
         let dir = state & 3;
         if(k === goal) {
-            if(dir >= 2) {
-                continue;       /*  down the port's own column: not allowed  */
-            }
-            let total = cost + ROUTE_BEND;      /*  the turn into the port  */
+            let total = cost + ((dir === 2)? 0 : ROUTE_BEND);
             if(total < found_cost) {
                 found_cost = total;
                 found = state;
@@ -523,9 +310,6 @@ function orth_search(a, z, boxes)
             continue;
         }
         for(let [nk, nd, len] of moves(k)) {
-            if(k === start && nd >= 2) {
-                continue;       /*  out of the port sideways, not down its column  */
-            }
             let c = cost + len + ((nd === dir)? 0 : ROUTE_BEND);
             let ns = nk * 4 + nd;
             if(c < best[ns]) {
@@ -576,21 +360,15 @@ function orth_search(a, z, boxes)
  *  coincide. Nearby cards first; all of them if that finds no way;
  *  the simple elbow if nothing does.
  ************************************************************/
-export function elbow_route(s, t, box_s, box_t, lane, vertical, boxes, stagger)
+export function elbow_route(s, t, box_s, box_t, lane, vertical, boxes)
 {
     let others = boxes || [];
     if(!vertical) {
         return elbow_route(swap(s), swap(t), swap_box(box_s), swap_box(box_t), lane, true,
-                           others.map(swap_box), stagger).map(swap);
+                           others.map(swap_box)).map(swap);
     }
 
-    /*  A comb runs where the layout left room for it: its corridor
-     *  and its gap are empty by construction.  */
-    if(stagger && stagger.comb) {
-        return elbow_points(s, t, box_s, box_t, lane, true, stagger);
-    }
-
-    let simple = elbow_points(s, t, box_s, box_t, lane, true, stagger);
+    let simple = elbow_points(s, t, box_s, box_t, lane, true);
     if(!elbow_path_hits([s, ...simple, t], others, box_s, box_t)) {
         return simple;
     }
@@ -613,112 +391,3 @@ export function elbow_route(s, t, box_s, box_t, lane, vertical, boxes, stagger)
     }
     return route || simple;
 }
-
-/*----------------------------------------------------------------*
- *      CURVED edges that would cross a card
- *----------------------------------------------------------------*/
-export const CURVE_RADIUS = 24;     /*  the corners of a curve that goes round  */
-export const CURVE_STEPS = 16;      /*  samples of each curved stretch  */
-
-/*  Points along a G6 path: the ends of its runs and CURVE_STEPS
- *  samples of each quadratic or cubic stretch.  */
-function path_points(path)
-{
-    let pts = [];
-    let cur = null;
-    for(let c of path) {
-        if(c[0] === 'M' || c[0] === 'L') {
-            cur = [c[1], c[2]];
-            pts.push(cur);
-        } else if(c[0] === 'C' && cur) {
-            let [x0, y0] = cur;
-            for(let k = 1; k <= CURVE_STEPS; k++) {
-                let u = k / CURVE_STEPS;
-                let v = 1 - u;
-                pts.push([
-                    v * v * v * x0 + 3 * v * v * u * c[1] + 3 * v * u * u * c[3] + u * u * u * c[5],
-                    v * v * v * y0 + 3 * v * v * u * c[2] + 3 * v * u * u * c[4] + u * u * u * c[6],
-                ]);
-            }
-            cur = [c[5], c[6]];
-        } else if(c[0] === 'Q' && cur) {
-            let [x0, y0] = cur;
-            for(let k = 1; k <= CURVE_STEPS; k++) {
-                let u = k / CURVE_STEPS;
-                let v = 1 - u;
-                pts.push([
-                    v * v * x0 + 2 * v * u * c[1] + u * u * c[3],
-                    v * v * y0 + 2 * v * u * c[2] + u * u * c[4],
-                ]);
-            }
-            cur = [c[3], c[4]];
-        }
-    }
-    return pts;
-}
-
-/************************************************************
- *  Does the G6 path `path` of a curved edge cross a card other than
- *  its own two? Measured on the curve itself -- the path G6 would
- *  draw, sampled -- and not on the rectangle round it, which took
- *  every card the curve merely passed near: the ports of a row
- *  stick well into the space above it. Its own two cards are left
- *  out: the curve starts and ends on their ports.
- ************************************************************/
-export function curve_hits(path, boxes, box_s, box_t)
-{
-    let pts = path_points(path);
-    if(pts.length < 2) {
-        return false;
-    }
-    let bb = {x1: Infinity, y1: Infinity, x2: -Infinity, y2: -Infinity};
-    for(let p of pts) {
-        bb.x1 = Math.min(bb.x1, p[0]);
-        bb.y1 = Math.min(bb.y1, p[1]);
-        bb.x2 = Math.max(bb.x2, p[0]);
-        bb.y2 = Math.max(bb.y2, p[1]);
-    }
-    for(let b of (boxes || [])) {
-        if(same_box(b, box_s) || same_box(b, box_t) || !box_overlaps(b, box_expand(bb, 1))) {
-            continue;
-        }
-        let inner = box_expand(b, -1);
-        for(let k = 0; k + 1 < pts.length; k++) {
-            if(segment_hits(pts[k], pts[k + 1], inner)) {
-                return true;
-            }
-        }
-    }
-    return false;
-}
-
-/************************************************************
- *  A G6 path (['M'|'L'|'Q', ...]) along `points` with every corner
- *  rounded -- by `radius`, or by half the shorter of its two
- *  segments, so a short run is never overshot. The rounding is the
- *  quadratic G6's own polyline uses.
- ************************************************************/
-export function rounded_path(points, radius)
-{
-    let path = [['M', points[0][0], points[0][1]]];
-    for(let i = 1; i + 1 < points.length; i++) {
-        let a = points[i - 1];
-        let m = points[i];
-        let b = points[i + 1];
-        let len_in = Math.hypot(m[0] - a[0], m[1] - a[1]);
-        let len_out = Math.hypot(b[0] - m[0], b[1] - m[1]);
-        let r = Math.min(radius, len_in / 2, len_out / 2);
-        let collinear = Math.abs((m[0] - a[0]) * (b[1] - m[1]) - (m[1] - a[1]) * (b[0] - m[0])) < 1e-9;
-        if(r <= 0 || collinear) {
-            path.push(['L', m[0], m[1]]);
-            continue;
-        }
-        let p1 = [m[0] - (m[0] - a[0]) / len_in * r, m[1] - (m[1] - a[1]) / len_in * r];
-        let p2 = [m[0] + (b[0] - m[0]) / len_out * r, m[1] + (b[1] - m[1]) / len_out * r];
-        path.push(['L', p1[0], p1[1]]);
-        path.push(['Q', m[0], m[1], p2[0], p2[1]]);
-    }
-    let last = points[points.length - 1];
-    path.push(['L', last[0], last[1]]);
-    return path;
-}