-
Notifications
You must be signed in to change notification settings - Fork 2
/
arc.js
240 lines (208 loc) · 6.42 KB
/
arc.js
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
/*
** Based on the d3v4 d3.chord() function by Mike Bostock
** Adjusted by Nadieh Bremer - July 2016
** Further modified by Alaleh Azhir
*/
function loom() {
var pi$3 = Math.PI;
var tau$3 = pi$3 * 2;
var max$1 = Math.max;
var padAngle = 0,
sortGroups = null,
sortSubgroups = null,
sortStrings = null,
heightInner = 20,
widthOffsetInner = function() { return x; },
emptyPerc = 0.2,
value = function(d) { return d; },
inner = function(d) { return d.source; },
outer = function(d) { return d.target; };
function loom(data) {
//Nest the data on the outer variable
data = d3.nest().key(outer).entries(data);
var n = data.length,
groupSums = [],
groupIndex = d3.range(n),
subgroupIndex = [],
looms = [],
groups = looms.groups = new Array(n),
subgroups,
numSubGroups,
uniqueInner = looms.innergroups = [],
uniqueCheck = [],
emptyk,
k,
x,
x0,
dx,
i,
j,
l,
m,
s,
v,
sum,
counter,
reverseOrder = false,
approxCenter;
//Loop over the outer groups and sum the values
k = 0;
numSubGroups = 0;
for(i = 0; i < n; i++) {
v = data[i].values.length;
sum = 0;
for(j = 0; j < v; j++) {
sum += value(data[i].values[j]);
}//for j
groupSums.push(sum);
subgroupIndex.push(d3.range(v));
numSubGroups += v;
k += sum;
}//for i
// Sort groups…
if (sortGroups) groupIndex.sort(function(a, b) {
return sortGroups(groupSums[a], groupSums[b]);
});
// Sort subgroups…
if (sortSubgroups) subgroupIndex.forEach(function(d, i) {
d.sort(function(a, b) {
return sortSubgroups( inner(data[i].values[a]), inner(data[i].values[b]) );
});
});
//After which group are we past the center
//TODO: make something for if there is no nice split in two...
l = 0;
for(i = 0; i < n; i++) {
l += groupSums[groupIndex[i]];
if(l > k/2) {
approxCenter = groupIndex[i];
break;
}//if
}//for i
//How much should be added to k to make the empty part emptyPerc big of the total
emptyk = k * emptyPerc / (1 - emptyPerc);
k += emptyk;
// Convert the sum to scaling factor for [0, 2pi].
k = max$1(0, tau$3 - padAngle * n) / k;
dx = k ? padAngle : tau$3 / n;
// Compute the start and end angle for each group and subgroup.
// Note: Opera has a bug reordering object literal properties!
subgroups = new Array(numSubGroups);
x = emptyk * 0.25 * k; //quarter of the empty part //0;
counter = 0;
for(i = 0; i < n; i++) {
var di = groupIndex[i],
outername = data[di].key;
if(approxCenter === di) {
x = x + emptyk * 0.5 * k;
}//if
x0 = x;
//If you've crossed the bottom, reverse the order of the inner strings
if(x > pi$3) reverseOrder = true;
s = subgroupIndex[di].length;
for(j = 0; j < s; j++) {
var dj = reverseOrder ? subgroupIndex[di][(s-1)-j] : subgroupIndex[di][j],
v = value(data[di].values[dj]),
innername = inner(data[di].values[dj]);
a0 = x,
a1 = x += v * k;
subgroups[counter] = {
index: di,
subindex: dj,
startAngle: a0,
endAngle: a1,
value: v,
outername: outername,
innername: innername
};
//Check and save the unique inner names
if( !uniqueCheck[innername] ) {
uniqueCheck[innername] = true;
uniqueInner.push({name: innername});
}//if
counter += 1;
}//for j
groups[di] = {
index: di,
startAngle: x0,
endAngle: x,
value: groupSums[di],
outername: outername
};
x += dx;
}//for i
//Sort the inner groups in the same way as the strings
/*uniqueInner.sort(function(a, b) {
return sortSubgroups( a.name, b.name );
});*/
//Find x and y locations of the inner categories
//TODO: make x depend on length of inner name
m = uniqueInner.length
for(i = 0; i < m; i++) {
uniqueInner[i].x = 0;
uniqueInner[i].y = -m*heightInner/2 + i*heightInner;
uniqueInner[i].offset = widthOffsetInner(uniqueInner[i].name, i, uniqueInner);
}
//Generate bands for each (non-empty) subgroup-subgroup link
counter = 0;
for(i = 0; i < n; i++) {
var di = groupIndex[i];
s = subgroupIndex[di].length;
for(j = 0; j < s; j++) {
var outerGroup = subgroups[counter];
var innerTerm = outerGroup.innername;
//Find the correct inner object based on the name
var innerGroup = searchTerm(innerTerm, "name", uniqueInner);
if (outerGroup.value) {
// console.log("looms");
// console.log(innerGroup);
looms.push({inner: innerGroup, outer: outerGroup});
//console.log(looms);
}//if
counter +=1;
}//for j
}//for i
return sortStrings ? looms.sort(sortStrings) : looms;
};//function loom(matrix)
function searchTerm(term, property, arrayToSearch){
for (var i=0; i < arrayToSearch.length; i++) {
if (arrayToSearch[i][property] === term) {
return arrayToSearch[i];
}//if
}//for i
}//searchTerm
function constant$11(x) {
return function() { return x; };
}//constant$11
loom.padAngle = function(_) {
return arguments.length ? (padAngle = max$1(0, _), loom) : padAngle;
};
loom.inner = function(_) {
return arguments.length ? (inner = _, loom) : inner;
};
loom.outer = function(_) {
return arguments.length ? (outer = _, loom) : outer;
};
loom.value = function(_) {
return arguments.length ? (value = _, loom) : value;
};
loom.heightInner = function(_) {
return arguments.length ? (heightInner = _, loom) : heightInner;
};
loom.widthOffsetInner = function(_) {
return arguments.length ? (widthOffsetInner = typeof _ === "function" ? _ : constant$11(+_), loom) : widthOffsetInner;
};
loom.emptyPerc = function(_) {
return arguments.length ? (emptyPerc = _ < 1 ? max$1(0, _) : max$1(0, _*0.01), loom) : emptyPerc;
};
loom.sortGroups = function(_) {
return arguments.length ? (sortGroups = _, loom) : sortGroups;
};
loom.sortSubgroups = function(_) {
return arguments.length ? (sortSubgroups = _, loom) : sortSubgroups;
};
loom.sortBands = function(_) {
return arguments.length ? (_ == null ? sortBands = null : (sortBands = compareValue(_))._ = _, loom) : sortBands && sortBands._;
};
return loom;
}//loom