react-digraph

<!doctype html> <html lang="en"> <head> <title>Code coverage report for src/components/edge.js</title> <meta charset="utf-8" /> <link rel="stylesheet" href="../../prettify.css" /> <link rel="stylesheet" href="../../base.css" /> <meta name="viewport" content="width=device-width, initial-scale=1"> <style type='text/css'> .coverage-summary .sorter { background-image: url(../../sort-arrow-sprite.png); } </style> </head> <body> <div class='wrapper'> <div class='pad1'> <h1> <a href="../../index.html">All files</a> / <a href="index.html">src/components</a> edge.js </h1> <div class='clearfix'> <div class='fl pad1y space-right2'> 28.57% Statements 58/203 </div> <div class='fl pad1y space-right2'> 21.57% Branches 33/153 </div> <div class='fl pad1y space-right2'> 59.26% Functions 16/27 </div> <div class='fl pad1y space-right2'> 28.71% Lines 58/202 </div> </div> </div> <div class='status-line low'></div> <pre><table class="coverage"> <tr><td class="line-count quiet">1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510</td><td class="line-coverage quiet">                                                                                                                  23x 23x 23x 23x                       1x           80x     160x     160x                                                                                     161x                                                                                                                                                                                                                                                                                                                                                                                                                                 161x   161x     161x                                                         161x       22x 20x 2x 1x   1x           17x 17x       40x   40x   40x 40x 40x       40x 40x 40x 40x   40x       22x 22x       22x 22x 22x 22x 1x   22x       20x 20x 20x 20x       79x 79x 79x 79x 79x 79x 79x             79x 79x   79x                     79x       19x                         19x 19x 19x       19x                                                        </td><td class="text"><pre class="prettyprint lang-js">// @flow /* Copyright(c) 2018 Uber Technologies, Inc.   Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at   http://www.apache.org/licenses/LICENSE-2.0   Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */   import * as d3 from 'd3'; import * as React from 'react'; import * as lineIntersect from 'line-intersect'; import { intersect, shape } from 'svg-intersections'; import { Point2D, Matrix2D } from 'kld-affine'; import { Intersection } from 'kld-intersections'; import GraphUtils from './graph-util'; import { type INode } from './node';   export type IEdge = { source: string; target: string; type?: string; handleText?: string; [key: string]: any; };   export type ITargetPosition = { x: number, y: number };   type IEdgeProps = { data: IEdge; edgeTypes: any; // TODO: create an edgeTypes interface edgeHandleSize?: number; nodeSize?: number; sourceNode: INode | null; targetNode: INode | ITargetPosition; isSelected: boolean; nodeKey: string; };   class Edge extends React.Component<IEdgeProps> { static defaultProps = { edgeHandleSize: 50, isSelected: false };   static getTheta(pt1: any, pt2: any) { const xComp = (pt2.x || 0) - (pt1.x || 0); const yComp = (pt2.y || 0) - (pt1.y || 0); const theta = Math.atan2(yComp, xComp); return theta; }   static getDegrees (radians: number) { return radians * (180 / Math.PI); }   static getRadians(degrees: number) { return (degrees / 180) * Math.PI; }   static getDistance(pt1: any, pt2: any) { return Math.sqrt(Math.pow(pt2.x - pt1.x, 2) + Math.pow(pt2.y - pt1.y, 2)); }   static lineFunction(srcTrgDataArray: any) { // Provides API for curved lines using .curve() Example: // https://bl.ocks.org/d3indepth/64be9fc39a92ef074034e9a8fb29dcce return d3 .line() .x((d: any) => { return d.x; }) .y((d: any) => { return d.y; })(srcTrgDataArray); }   static getArrowSize() { const defEndArrowElement: any = document.querySelector(`defs>marker>.arrow`); return defEndArrowElement.getBoundingClientRect(); }   static getEdgePathElement(edge: IEdge) { return document.querySelector(`#edge-${edge.source}-${edge.target}-container>.edge-container>.edge>.edge-path`); }   static parsePathToXY(edgePathElement: Element | null) { const response = { source: { x: 0, y: 0 }, target: { x: 0, y: 0 } }; if (edgePathElement) { let d = edgePathElement.getAttribute('d'); d = d && d.replace(/^M/, ''); d = d && d.replace(/L/, ','); let dArr = (d && d.split(',')) || []; dArr = dArr.map(dimension => { return parseFloat(dimension); }); if (dArr.length === 4) { response.source.x = dArr[0]; response.source.y = dArr[1]; response.target.x = dArr[2]; response.target.y = dArr[3]; } } return response; }   static getDefaultIntersectResponse() { return { xOff: 0, yOff: 0, intersect: { type: 'none', point: { x: 0, y: 0 } } }; }   static getRotatedRectIntersect(defSvgRotatedRectElement: any, src: any, trg: any, includesArrow?: boolean = true) { const response = Edge.getDefaultIntersectResponse(); const arrowSize = Edge.getArrowSize(); const clientRect = defSvgRotatedRectElement.getBoundingClientRect();   const widthAttr = defSvgRotatedRectElement.getAttribute('width'); const heightAttr = defSvgRotatedRectElement.getAttribute('height'); const w = widthAttr ? parseFloat(widthAttr) : clientRect.width; const h = heightAttr ? parseFloat(heightAttr) : clientRect.height; const trgX = trg.x || 0; const trgY = trg.y || 0; const srcX = src.x || 0; const srcY = src.y || 0;   const top = trgY - h / 2; const bottom = trgY + h / 2; const left = trgX - w / 2; const right = trgX + w / 2;   const line = shape('line', { x1: srcX, y1: srcY, x2: trgX, y2: trgY });   // define rectangle let rect = { topLeft: new Point2D(left, top), bottomRight: new Point2D(right, bottom) };   // convert rectangle corners to polygon (list of points) let poly = [ rect.topLeft, new Point2D(rect.bottomRight.x, rect.topLeft.y), rect.bottomRight, new Point2D(rect.topLeft.x, rect.bottomRight.y) ];   // find center point of rectangle let center = rect.topLeft.lerp(rect.bottomRight, 0.5);   // get the rotation let transform = defSvgRotatedRectElement.getAttribute('transform'); let rotate = transform ? transform.replace(/(rotate.[0-9]*.)|[^]/g, '$1') : null; let angle = 0; if (rotate) { // get the number rotate = rotate.replace(/^rotate$|$$/g, ''); // define rotation in radians angle = parseFloat(rotate) * Math.PI / 180.0; } // create matrix for rotating around center of rectangle let rotation = Matrix2D.rotationAt(angle, center); // create new rotated polygon const rotatedPoly = poly.map(p => p.transform(rotation));   // find intersections const pathIntersect = Intersection.intersectLinePolygon(line.params[0], line.params[1], rotatedPoly);   if (pathIntersect.points.length > 0) { let arrowWidth = 0; //arrowSize.width; let arrowHeight = 0; //arrowSize.height; const xIntersect = pathIntersect.points[0].x; const yIntersect = pathIntersect.points[0].y; if (xIntersect > left && xIntersect < right && yIntersect > trgY) { // arrow points to the top of the node arrowHeight = arrowSize.height; } else if (xIntersect > left && xIntersect < right && yIntersect < trgY) { // arrow points to the bottom of the node arrowHeight = -arrowSize.height; } else if (yIntersect > top && yIntersect < bottom && xIntersect < trgX) { // arrow points to the left of the node arrowWidth = -arrowSize.width; } else { // arrow points to the right of the node arrowWidth = arrowSize.width; } response.xOff = trgX - xIntersect - (includesArrow ? arrowWidth / 1.25 : 0); response.yOff = trgY - yIntersect - (includesArrow ? arrowHeight / 1.25 : 0); response.intersect = pathIntersect.points[0]; } return response; }   static getPathIntersect(defSvgPathElement: any, src: any, trg: any, includesArrow?: boolean = true) { const response = Edge.getDefaultIntersectResponse(); const arrowSize = Edge.getArrowSize(); // get the rectangular area around path const clientRect = defSvgPathElement.getBoundingClientRect();   const w = clientRect.width; const h = clientRect.height; const trgX = trg.x || 0; const trgY = trg.y || 0; const srcX = src.x || 0; const srcY = src.y || 0;   // calculate the positions of each corner relative to the trg position const top = trgY - h / 2; const left = trgX - w / 2;   // modify the d property to add top and left to the x and y positions let d = defSvgPathElement.getAttribute('d'); if (!/^M/.test(d)) { // doesn't look like what we expect. // TODO: add more use cases than simple moveTo commands return; }   d = d.replace(/^M /, ''); let dArr = d.split(' '); dArr = dArr.map((val, index) => { let isEnd = false; if (/Z$/.test(val)) { val = val.replace(/Z$/, ''); isEnd = true; } // items % 2 are x positions if (index % 2 === 0) { return (parseFloat(val) + left) + (isEnd ? 'Z' : ''); } return (parseFloat(val) + top) + (isEnd ? 'Z' : ''); });   const pathIntersect = intersect( shape('path', { d: 'M ' + dArr.join(' ') }), shape('line', { x1: srcX, y1: srcY, x2: trgX, y2: trgY }) );   if (pathIntersect.points.length > 0) { let arrowWidth = arrowSize.width; let arrowHeight = arrowSize.height; // arrow points to the left of node if (pathIntersect.points[0].x < trgX) { arrowWidth *= -1; } // arrow points at the bottom of node if (pathIntersect.points[0].y < trgY) { arrowHeight *= -1; } response.xOff = trgX - pathIntersect.points[0].x - (includesArrow ? arrowWidth / 1.25 : 0); response.yOff = trgY - pathIntersect.points[0].y - (includesArrow ? arrowHeight / 1.25 : 0); response.intersect = pathIntersect.points[0]; } return response; }   static getCircleIntersect(defSvgCircleElement: any, src: any, trg: any, includesArrow?: boolean = true) { const response = Edge.getDefaultIntersectResponse(); const arrowSize = Edge.getArrowSize(); let arrowWidth = arrowSize.width; let arrowHeight = arrowSize.height; const theta = Edge.getTheta(src, trg); const clientRect = defSvgCircleElement.getBoundingClientRect(); const parentElement = defSvgCircleElement.parentElement; let parentWidth = parentElement.getAttribute('width'); let parentHeight = parentElement.getAttribute('width'); if (parentWidth) { parentWidth = parseFloat(parentWidth); } if (parentHeight) { parentHeight = parseFloat(parentHeight); }   const w = parentWidth ? parentWidth : clientRect.width; const h = parentHeight ? parentHeight : clientRect.height; const trgX = trg.x || 0; const trgY = trg.y || 0; const srcX = src.x || 0; const srcY = src.y || 0; const top = trgY - h / 2; const bottom = trgY + h / 2; const left = trgX - w / 2; const right = trgX + w / 2; // from the center of the node to the perimeter let offX = w / 2; let offY = h / 2;   // Note: even though this is a circle function, we can use ellipse // because all circles are ellipses but not all ellipses are circles. const pathIntersect = intersect( shape('ellipse', { rx: offX + arrowHeight, ry: offY + arrowHeight, cx: trgX - arrowHeight/1.25, cy: trgY - arrowHeight/1.25 }), shape('line', { x1: srcX, y1: srcY, x2: trgX, y2: trgY }) );   if (pathIntersect.points.length > 0) { let arrowWidth = arrowSize.width / 1.25; let arrowHeight = arrowSize.height / 1.25; const xIntersect = pathIntersect.points[0].x; const yIntersect = pathIntersect.points[0].y;   response.xOff = trgX - pathIntersect.points[0].x - (includesArrow ? arrowWidth : 0) response.yOff = trgY - pathIntersect.points[0].y - (includesArrow ? arrowHeight : 0); response.intersect = pathIntersect.points[0]; } return response; }   static calculateOffset(nodeSize: any, src: any, trg: any, nodeKey: string, includesArrow?: boolean = true) { let response = Edge.getDefaultIntersectResponse();   const trgNode = document.querySelector(`#node-${trg[nodeKey]} use.node`);   // the test for trgN