|
import {max, tau} from "./math.js"; |
|
|
|
function range(i, j) { |
|
return Array.from({length: j - i}, (_, k) => i + k); |
|
} |
|
|
|
function compareValue(compare) { |
|
return function(a, b) { |
|
return compare( |
|
a.source.value + a.target.value, |
|
b.source.value + b.target.value |
|
); |
|
}; |
|
} |
|
|
|
export default function() { |
|
return chord(false, false); |
|
} |
|
|
|
export function chordTranspose() { |
|
return chord(false, true); |
|
} |
|
|
|
export function chordDirected() { |
|
return chord(true, false); |
|
} |
|
|
|
function chord(directed, transpose) { |
|
var padAngle = 0, |
|
sortGroups = null, |
|
sortSubgroups = null, |
|
sortChords = null; |
|
|
|
function chord(matrix) { |
|
var n = matrix.length, |
|
groupSums = new Array(n), |
|
groupIndex = range(0, n), |
|
chords = new Array(n * n), |
|
groups = new Array(n), |
|
k = 0, dx; |
|
|
|
matrix = Float64Array.from({length: n * n}, transpose |
|
? (_, i) => matrix[i % n][i / n | 0] |
|
: (_, i) => matrix[i / n | 0][i % n]); |
|
|
|
|
|
for (let i = 0; i < n; ++i) { |
|
let x = 0; |
|
for (let j = 0; j < n; ++j) x += matrix[i * n + j] + directed * matrix[j * n + i]; |
|
k += groupSums[i] = x; |
|
} |
|
k = max(0, tau - padAngle * n) / k; |
|
dx = k ? padAngle : tau / n; |
|
|
|
|
|
{ |
|
let x = 0; |
|
if (sortGroups) groupIndex.sort((a, b) => sortGroups(groupSums[a], groupSums[b])); |
|
for (const i of groupIndex) { |
|
const x0 = x; |
|
if (directed) { |
|
const subgroupIndex = range(~n + 1, n).filter(j => j < 0 ? matrix[~j * n + i] : matrix[i * n + j]); |
|
if (sortSubgroups) subgroupIndex.sort((a, b) => sortSubgroups(a < 0 ? -matrix[~a * n + i] : matrix[i * n + a], b < 0 ? -matrix[~b * n + i] : matrix[i * n + b])); |
|
for (const j of subgroupIndex) { |
|
if (j < 0) { |
|
const chord = chords[~j * n + i] || (chords[~j * n + i] = {source: null, target: null}); |
|
chord.target = {index: i, startAngle: x, endAngle: x += matrix[~j * n + i] * k, value: matrix[~j * n + i]}; |
|
} else { |
|
const chord = chords[i * n + j] || (chords[i * n + j] = {source: null, target: null}); |
|
chord.source = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]}; |
|
} |
|
} |
|
groups[i] = {index: i, startAngle: x0, endAngle: x, value: groupSums[i]}; |
|
} else { |
|
const subgroupIndex = range(0, n).filter(j => matrix[i * n + j] || matrix[j * n + i]); |
|
if (sortSubgroups) subgroupIndex.sort((a, b) => sortSubgroups(matrix[i * n + a], matrix[i * n + b])); |
|
for (const j of subgroupIndex) { |
|
let chord; |
|
if (i < j) { |
|
chord = chords[i * n + j] || (chords[i * n + j] = {source: null, target: null}); |
|
chord.source = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]}; |
|
} else { |
|
chord = chords[j * n + i] || (chords[j * n + i] = {source: null, target: null}); |
|
chord.target = {index: i, startAngle: x, endAngle: x += matrix[i * n + j] * k, value: matrix[i * n + j]}; |
|
if (i === j) chord.source = chord.target; |
|
} |
|
if (chord.source && chord.target && chord.source.value < chord.target.value) { |
|
const source = chord.source; |
|
chord.source = chord.target; |
|
chord.target = source; |
|
} |
|
} |
|
groups[i] = {index: i, startAngle: x0, endAngle: x, value: groupSums[i]}; |
|
} |
|
x += dx; |
|
} |
|
} |
|
|
|
|
|
chords = Object.values(chords); |
|
chords.groups = groups; |
|
return sortChords ? chords.sort(sortChords) : chords; |
|
} |
|
|
|
chord.padAngle = function(_) { |
|
return arguments.length ? (padAngle = max(0, _), chord) : padAngle; |
|
}; |
|
|
|
chord.sortGroups = function(_) { |
|
return arguments.length ? (sortGroups = _, chord) : sortGroups; |
|
}; |
|
|
|
chord.sortSubgroups = function(_) { |
|
return arguments.length ? (sortSubgroups = _, chord) : sortSubgroups; |
|
}; |
|
|
|
chord.sortChords = function(_) { |
|
return arguments.length ? (_ == null ? sortChords = null : (sortChords = compareValue(_))._ = _, chord) : sortChords && sortChords._; |
|
}; |
|
|
|
return chord; |
|
} |
|
|