dagjs

<!doctype html> <html lang="en"> <head> <title>Code coverage report for dag.js/index.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">dag.js/</a> index.js </h1> <div class='clearfix'> <div class='fl pad1y space-right2'> 99.48% Statements 192/193 </div> <div class='fl pad1y space-right2'> 91.03% Branches 71/78 </div> <div class='fl pad1y space-right2'> 100% Functions 23/23 </div> <div class='fl pad1y space-right2'> 99.44% Lines 178/179 </div> </div> </div> <div class='status-line high'></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</td><td class="line-coverage quiet">1×       70× 70× 70×       7× 14×       4× 4× 16×   4×       17× 40× 40× 30×   40× 50× 28×       40×   17×       3× 3×       9× 9×       31×                                                                               57× 66× 56× 56×       92×       1×       16×           230× 3×       227× 227× 9×   227× 352× 145×         227×     352×       227× 173×   227× 227× 352× 145×   352× 298×   352×     227×                 229× 229× 295× 295× 2×   293×     293× 67×     227×             230× 1×   295× 229× 227×   2×                   1× 3× 2× 1× 2× 1×               12× 12× 36×   83× 48×       12×                     8× 8× 24× 32× 11× 18× 11×       8×                     2× 1×   1× 1× 2× 2× 2×   1×                     6× 6× 3×   3× 6× 6× 6×   3×                       2× 1×     1× 2× 2× 2×   2× 2× 2×       2×     1×                     25× 2×     23× 30×                     2× 1×     1× 2× 2× 2× 4× 1×         2×     1×                   3× 1×   2×   2× 2× 5× 6× 10× 6×       2×           7× 1×       8× 6× 1×   5× 5× 3×       5× 10× 12× 10× 8×         5× 10× 2× 2×       5×         4×   3×     3× 9×         4×   9× 9× 12× 21× 18×     12×   9× 2×       9× 21× 18× 5×           4× 12× 2× 2×       4×                                                   1×  </td><td class="text"><pre class="prettyprint lang-js">const CycleError = require('./cycle-error');   class Dag { constructor() { this.edges = []; this.tagObjs = {}; this.tagInvertedIndex = {}; }   get T() { return Object.keys(this.tagObjs) .reduce((previous, tag) => previous.concat([tag]), []); }   get E() { const edges = []; Object.keys(this.edges).forEach((to) => { this.edges[to].forEach(edge => edges.push(this.edge(edge.f, to))); }); return edges; }   get V() { const verticies = Object.keys(this.edges).reduce((previous, key) => { Eif (this.edges[key].length > 0) { if (!previous.includes(key)) { previous.push(key); } this.edges[key].forEach((e) => { if (!previous.includes(e.f)) { previous.push(e.f); } }); } return previous; }, []); return verticies; }   get kind() { const tags = this.T; return tags.length; }   get order() { const verticies = this.V; return verticies.length; }   get size() { return Object.keys(this.edges).reduce((previous, key) => previous + this.edges[key].length, 0); } /* recursiveStringify(obj, depth=0) { if (obj == undefined) return; var objKeys = Object.keys(obj); var keyValueArray = new Array(); for (var i = 0; i < objKeys.length; i++) { var keyValueString = '"' + objKeys[i] + '":'; var objValue = obj[objKeys[i]]; keyValueString = (typeof objValue == "string") ? keyValueString = keyValueString + '"' + objValue + '"' : keyValueString = keyValueString + this.recursiveStringify(objValue, depth+1); keyValueArray.push(keyValueString); } let indent = ""; const tab = " "; for(i=0; i<depth; i++) indent += tab; if (Array.isArray(obj)) return tab + "[\n" + indent+ tab + keyValueArray.join("," + "\n" + indent + tab) + "\n" + indent + "]"; else return tab + "{\n" + indent+ tab + keyValueArray.join("," + "\n" + indent + tab) + "\n" + indent + "}"; }   get json() { return this.recursiveStringify(this); }   debug() { console.log(this.json); } */   edge(from, to) { if (this.edges[to] !== undefined) { const edge = this.edges[to].find(e => e.f === from); Eif (edge !== undefined) { return { from: edge.f, to, weight: edge.w, tags: edge.ts.reduce((previous, tagObject) => previous.concat([tagObject.name]), []), }; } } return undefined; }   includes(from, to) { return this.edge(from, to) !== undefined; }     add(from, to, tags, weight) { // test cycle if (this.testCycle(from, to)) { throw new CycleError(); }   // instantiate tags, if not exist let tagArray = tags; if (!Array.isArray(tags)) { tagArray = [tags]; } tagArray.forEach((tag) => { if (!(tag in this.tagObjs)) { this.tagObjs[tag] = { name: tag }; } });   // instantiate an edge const edge = { f: from, w: weight, ts: tagArray.reduce((previous, tag) => previous.concat([this.tagObjs[tag]]), []), };   // register the edge if (this.edges[to] === undefined) { this.edges[to] = []; } this.edges[to].push(edge); tagArray.forEach((tag) => { if (!(tag in this.tagInvertedIndex)) { this.tagInvertedIndex[tag] = {}; } if (!(to in this.tagInvertedIndex[tag])) { this.tagInvertedIndex[tag][to] = []; } this.tagInvertedIndex[tag][to].push(edge); });   return this; }   /** * @param {string} start - starting point of reverse-BFS * @callback hitCondition - condition to stop traversal * @callback callback - task to do for each visit. The visit stopping the traversal is exclusive. */ reverseBFS(start, hitCondition, callback) { const q = [start]; while (q.length > 0) { const visit = q.shift(); if (hitCondition !== undefined && hitCondition(visit)) { return visit; } Iif (callback !== undefined) { callback(visit); } if (this.edges[visit] !== undefined) { this.edges[visit].forEach(e => q.push(e.f)); } } return undefined; }   /** * @return {boolean} true, if (@code{from}, @code{to}) makes a cycle. false, otherwise. */ testCycle(from, to) { if (from === to) { return true; } const hit = this.reverseBFS(from, v => v === to); if (hit === undefined) { return false; } return true; }   // clone /** * Shallow copy * @return new DAG instance which has new arrays (i.e., E, tagObjs, and tagInvertedIndex) but * their elements (i.e., E['a'], ... and tagObjs['friend'], ...). */ clone() { const newDag = new Dag(); Object.keys(this.edges).forEach((key) => { newDag.edges[key] = this.edges[key]; }); Object.keys(this.tagObjs).forEach((tag) => { newDag.tagObjs[tag] = this.tagObjs[tag]; }); Object.keys(this.tagInvertedIndex) .forEach((tag) => { newDag.tagInvertedIndex[tag] = this.tagInvertedIndex[tag]; }); return newDag; }   /** * Deep copy * @return new DAG instance without references from the original pieces, at all. */ deepClone() { const newDag = new Dag(); Object.keys(this.edges).forEach((to) => { this.edges[to].forEach((e) => { // clone the edge const tags = e.ts.reduce((previous, tagObj) => previous.concat([tagObj.name]), []); newDag.add(e.f, to, tags, e.w); }); });   return newDag; }   // neighbouring /** * Edges comes from a vertex * @param {string} from the vertex. * @returns {@type {Dag}} deep cloned edges start at the vertex 'from'. * empty DAG, if the vertex does not exist or there is no edges from it. */ edgesFrom(from) { const dag = new Dag(); Object.keys(this.edges).forEach((key) => { this.edges[key].forEach((e) => { if (e.f === from) { const cloned = { from: e.f, to: key, weight: e.w }; cloned.tags = e.ts.reduce((previous, tagObject) => previous.concat([tagObject.name]), []); dag.add(cloned.from, cloned.to, cloned.tags, cloned.weight); } }); }); return dag; }   /** * Edges go to a vertex * @param {string} to the vertex. * @returns {@type {Dag}} deep cloned edges end at the vertex 'to'. * empty DAG, if the vertex does not exist or there is no edges heading * it. */ edgesTo(to) { if (undefined === this.edges[to]) { return new Dag(); } const dag = new Dag(); this.edges[to].forEach((e) => { const cloned = { from: e.f, to, weight: e.w }; cloned.tags = e.ts.reduce((previous, tagObject) => previous.concat([tagObject.name]), []); dag.add(cloned.from, cloned.to, cloned.tags, cloned.weight); }); return dag; }   /** * sub-DAG whoes edges are around a vertex * @param {string} vertex the vertex. * @returns {Object} deep cloned DAG where all the edges relate with the vertex. * empty DAG, if the vertex does not exist or there is no edges around * it. */ neighbourhood(vertex) { const dag = this.edgesFrom(vertex); if (undefined === this.edges[vertex]) { return dag; } this.edges[vertex].forEach((e) => { const cloned = { from: e.f, to: vertex, weight: e.w }; cloned.tags = e.ts.reduce((previous, tagObject) => previous.concat([tagObject.name]), []); dag.add(cloned.from, cloned.to, cloned.tags, cloned.weight); }); return dag; }   // tag /** * Number of verticies with a tag * It counts the number of verticies connected by edges of the given tag. * In counting, it refers to this.tagInvertedIndex. * @param {string} tag the tag. * @returns {number} the number of verticies by 'tag'. */ tagOrder(tag) { if (!(tag in this.tagInvertedIndex)) { return 0; }   const verticies = Object.keys(this.tagInvertedIndex[tag]).reduce((previous, to) => { Eif (this.tagInvertedIndex[tag][to].length > 0) { Eif (!previous.includes(to)) { previous.push(to); } this.tagInvertedIndex[tag][to].forEach((e) => { Eif (!previous.includes(e.f)) { previous.push(e.f); } }); } return previous; }, []);   return verticies.length; }   /** * Number of edges with a tag * It counts the number of edges filtered by the given tag. * In counting, it refers to this.tagInvertedIndex. * @param {string} tag the tag. * @returns {number} the number of edges by 'tag'. */ tagSize(tag) { if (!(tag in this.tagInvertedIndex)) { return 0; }   return Object.keys(this.tagInvertedIndex[tag]) .reduce((count, to) => count + this.tagInvertedIndex[tag][to].length, 0); }   /** * Number of tags in edges with a tag * It counts the number of tags attached to the edges filtered by the given tag. * In counting, it refers to this.tagInvertedIndex. * @param {string} tag the tag, which is inclusive to the count. * @returns {number} the number of tags in edges by 'tag'. */ tagKind(tag) { if (!(tag in this.tagInvertedIndex)) { return 0; }   const tags = Object.keys(this.tagInvertedIndex[tag]).reduce((previous, to) => { Eif (this.tagInvertedIndex[tag][to].length > 0) { this.tagInvertedIndex[tag][to].forEach((e) => { e.ts.forEach((tagObj) => { if (!previous.includes(tagObj.name)) { previous.push(tagObj.name); } }); }); } return previous; }, [tag]);   return tags.length; }   /** * Break DAG by a tag * @param {string} tag A tag to split this DAG by * @returns {array} A deep-cloned sub-DAG of itself, if there is an edge including 'tag'. * Undefined, otherwise. */ filterByTag(tag) { if (!(tag in this.tagInvertedIndex)) { return undefined; } const filteredEdges = this.tagInvertedIndex[tag];   const filtered = new Dag(); Object.keys(filteredEdges).forEach((to) => { filteredEdges[to].forEach((edge) => { const cloned = { from: edge.f, to, tags: [], weight: undefined }; cloned.tags = edge.ts.reduce((previous, tagObj) => previous.concat([tagObj.name]), []); filtered.add(cloned.from, cloned.to, cloned.tags, cloned.weight); }); });   return filtered; }     // remove removeEdge(from, to) { if (!(to in this.edges)) { return this; }   // arrange edges const targetIndex = this.edges[to].findIndex(e => e.f === from); if (targetIndex === -1) { return this; } const removed = this.edges[to].splice(targetIndex, 1)[0]; if (this.edges[to].length === 0) { delete this.edges[to]; }   // arrange tag index removed.ts.forEach((tagObj) => { this.tagInvertedIndex[tagObj.name][to] = this.tagInvertedIndex[tagObj.name][to].filter(edge => edge.f !== from); if (this.tagInvertedIndex[tagObj.name][to].length === 0) { delete this.tagInvertedIndex[tagObj.name][to]; } });   // remove dangling tags removed.ts.forEach((tagObj) => { if (this.tagSize(tagObj.name) === 0) { delete this.tagObjs[tagObj.name]; delete this.tagInvertedIndex[tagObj.name]; } });   return this; }   removeVertex(vertex) { // remove edges 'to' the verted if (vertex in this.edges) { // arrange edges delete this.edges[vertex];   // arrange tag index Object.keys(this.tagInvertedIndex).forEach((tag) => { delete this.tagInvertedIndex[tag][vertex]; }); }   // remove edges 'from' the vertex Object.keys(this.edges).forEach((to) => { // arrnage edges const tagsToRemove = []; this.edges[to] = this.edges[to].filter((e) => { e.ts.forEach((tagObj) => { if (!tagsToRemove.includes(tagObj.name)) { tagsToRemove.push(tagObj.name); } }); return e.f !== vertex; }); if (this.edges[to].length === 0) { delete this.edges[to]; }   // arrange tag index tagsToRemove.forEach((tag) => { this.tagInvertedIndex[tag][to] = this.tagInvertedIndex[tag][to].filter(e => e.f !== vertex); if (this.tagInvertedIndex[tag][to].length === 0) { delete this.tagInvertedIndex[tag][to]; } }); });   // remove dangling tags Object.keys(this.tagObjs).forEach((tag) => { if (this.tagSize(tag) === 0) { delete this.tagObjs[tag]; delete this.tagInvertedIndex[tag]; } });   return this; }   /* // sorting topologicalSort() { return []; }   // sub-DAG since(from) {return this;} until(to) {return this;}   // line graph lineDag() {return this;}   // edge contractEdge(from, to) {return this;}   // ged //ged(dag, distAlg) {}   // serialize & deserialize */ }   module.exports = Dag;  </pre></td></tr> </table></pre> <div class='push'></div> </div> <div class='footer quiet pad2 space-top1 center small'> Code coverage generated by <a href="http://istanbul-js.org/" target="_blank">istanbul</a> at Tue Jun 12 2018 11:46:56 GMT+0900 (KST) </div> </div> <script src="../prettify.js"></script> <script> window.onload = function () { if (typeof prettyPrint === 'function') { prettyPrint(); } }; </script> <script src="../sorter.js"></script> </body> </html>