Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 105x 105x 105x 105x 105x 1x 1x 168x 168x 1x 1x 6x 6x 1x 1x 226x 226x 1x 1x 763x 635x 635x 763x 763x 1x 1x 278x 278x 278x 220x 220x 278x 1x 1x 559x 559x 3474x 4057x 4057x 3474x 559x 559x 1x 1x 1x 1x 39x 39x 293x 293x 293x 39x 39x 1x 1x 65x 65x 1x 1x 1x 65x 65x 65x 65x 65x 1x 1x 1x 1x 37x 37x 159x 159x 159x 37x 37x 1x 1x 39x 39x 1x 1x 3x 3x 3x 3x 3x 3x 3x 3x 3x 1x 1x 208x 208x 1641x 205x 205x 1641x 208x 208x 1x 1x 208x 208x 1641x 171x 171x 1641x 208x 208x 1x 1x 1x 38x 298x 92x 92x 206x 206x 298x 122x 122x 145x 145x 122x 124x 124x 122x 145x 147x 147x 53x 53x 147x 147x 147x 145x 122x 206x 298x 8x 8x 8x 8x 298x 38x 38x 38x 1x | export enum FLOW_EDGE_TYPE {
true = "true",
false = "false",
undefined = "undefined",
}
export class FlowGraph {
private edges: {[from: string]: {[to: string]: FLOW_EDGE_TYPE}};
private readonly startNode: string;
private readonly endNode: string;
private label: string;
public constructor(counter: number) {
this.edges = {};
this.label = "undefined";
this.startNode = "start#" + counter;
this.endNode = "end#" + counter;
}
public getStart(): string {
return this.startNode;
}
public getLabel(): string {
return this.label;
}
public getEnd(): string {
return this.endNode;
}
public addEdge(from: string, to: string, type: FLOW_EDGE_TYPE) {
if (this.edges[from] === undefined) {
this.edges[from] = {};
}
this.edges[from][to] = type;
}
public removeEdge(from: string, to: string) {
if (this.edges[from] === undefined) {
return;
}
delete this.edges[from][to];
if (Object.keys(this.edges[from]).length === 0) {
delete this.edges[from];
}
}
public listEdges() {
const list: {from: string, to: string, type: FLOW_EDGE_TYPE}[] = [];
for (const from of Object.keys(this.edges)) {
for (const to of Object.keys(this.edges[from])) {
list.push({from, to, type: this.edges[from][to]});
}
}
return list;
}
public listInto(to: string, skipStart = true): string[] {
const ret: string[] = [];
for (const e of this.listEdges()) {
if (skipStart === true && e.from === this.getStart()) {
continue;
}
if (e.to === to) {
ret.push(e.from);
}
}
return ret;
}
public listNodes() {
const set = new Set<string>();
for (const l of this.listEdges()) {
set.add(l.from);
set.add(l.to);
}
return Array.from(set.values());
}
public hasEdges(): boolean {
return Object.keys(this.edges).length > 0;
}
/** return value: end node of to graph */
public addGraph(from: string, to: FlowGraph, type: FLOW_EDGE_TYPE): string {
if (to.hasEdges() === false) {
return from;
}
this.addEdge(from, to.getStart(), type);
to.listEdges().forEach(e => this.addEdge(e.from, e.to, e.type));
return to.getEnd();
}
public toJSON(): string {
return JSON.stringify(this.edges);
}
public toTextEdges(): string {
let graph = "";
for (const l of this.listEdges()) {
const label = l.type === FLOW_EDGE_TYPE.undefined ? "" : ` [label="${l.type}"]`;
graph += `"${l.from}" -> "${l.to}"${label};\n`;
}
return graph.trim();
}
public setLabel(label: string) {
this.label = label;
}
public toDigraph(): string {
return `digraph G {
labelloc="t";
label="${this.label}";
graph [fontname = "helvetica"];
node [fontname = "helvetica", shape="box"];
edge [fontname = "helvetica"];
${this.toTextEdges()}
}`;
}
public listSources(node: string): {name: string, type: FLOW_EDGE_TYPE}[] {
const set: {name: string, type: FLOW_EDGE_TYPE}[] = [];
for (const l of this.listEdges()) {
if (node === l.to) {
set.push({name: l.from, type: l.type});
}
}
return set;
}
public listTargets(node: string): {name: string, type: FLOW_EDGE_TYPE}[] {
const set: {name: string, type: FLOW_EDGE_TYPE}[] = [];
for (const l of this.listEdges()) {
if (node === l.from) {
set.push({name: l.to, type: l.type});
}
}
return set;
}
/** removes all nodes containing "#" that have one in-going and one out-going edge */
public reduce() {
for (const node of this.listNodes()) {
if (node.includes("#") === false) {
continue;
}
const sources = this.listSources(node);
const targets = this.listTargets(node);
if (sources.length > 0 && targets.length > 0) {
// hash node in the middle of the graph
for (const s of sources) {
this.removeEdge(s.name, node);
}
for (const t of targets) {
this.removeEdge(node, t.name);
}
for (const s of sources) {
for (const t of targets) {
let type = FLOW_EDGE_TYPE.undefined;
if (s.type !== FLOW_EDGE_TYPE.undefined) {
type = s.type;
}
if (t.type !== FLOW_EDGE_TYPE.undefined) {
if (type !== FLOW_EDGE_TYPE.undefined) {
throw new Error("reduce: cannot merge, different edge types");
}
type = t.type;
}
this.addEdge(s.name, t.name, type);
}
}
}
if (node.startsWith("end#") && sources.length === 0) {
for (const t of targets) {
this.removeEdge(node, t.name);
}
}
}
return this;
}
} |