{{ message }}
forked from observablehq/plot
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbin.js
More file actions
259 lines (237 loc) · 9.18 KB
/
Copy pathbin.js
File metadata and controls
259 lines (237 loc) · 9.18 KB
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
import {bin as binner, extent, thresholdFreedmanDiaconis, thresholdScott, thresholdSturges, utcTickInterval} from "d3";
import {valueof, range, identity, maybeLazyChannel, maybeTuple, maybeColor, maybeValue, mid, labelof, isTemporal} from "../mark.js";
import {offset} from "../style.js";
import {basic} from "./basic.js";
import {maybeEvaluator, maybeGroup, maybeOutput, maybeOutputs, maybeReduce, maybeSort, maybeSubgroup, reduceCount, reduceIdentity} from "./group.js";
// Group on {z, fill, stroke}, then optionally on y, then bin x.
export function binX(outputs = {y: "count"}, {inset, insetLeft, insetRight, ...options} = {}) {
let {x, y} = options;
x = maybeBinValue(x, options, identity);
([insetLeft, insetRight] = maybeInset(inset, insetLeft, insetRight));
return binn(x, null, null, y, outputs, {inset, insetLeft, insetRight, ...options});
}
// Group on {z, fill, stroke}, then optionally on x, then bin y.
export function binY(outputs = {x: "count"}, {inset, insetTop, insetBottom, ...options} = {}) {
let {x, y} = options;
y = maybeBinValue(y, options, identity);
([insetTop, insetBottom] = maybeInset(inset, insetTop, insetBottom));
return binn(null, y, x, null, outputs, {inset, insetTop, insetBottom, ...options});
}
// Group on {z, fill, stroke}, then bin on x and y.
export function bin(outputs = {fill: "count"}, {inset, insetTop, insetRight, insetBottom, insetLeft, ...options} = {}) {
const {x, y} = maybeBinValueTuple(options);
([insetTop, insetBottom] = maybeInset(inset, insetTop, insetBottom));
([insetLeft, insetRight] = maybeInset(inset, insetLeft, insetRight));
return binn(x, y, null, null, outputs, {inset, insetTop, insetRight, insetBottom, insetLeft, ...options});
}
function binn(
bx, // optionally bin on x (exclusive with gx)
by, // optionally bin on y (exclusive with gy)
gx, // optionally group on x (exclusive with bx and gy)
gy, // optionally group on y (exclusive with by and gx)
{
data: reduceData = reduceIdentity,
filter = reduceCount, // return only non-empty bins by default
sort,
reverse,
...outputs // output channel definitions
} = {},
inputs = {} // input channels and options
) {
bx = maybeBin(bx);
by = maybeBin(by);
// Compute the outputs.
outputs = maybeOutputs(outputs, inputs);
reduceData = maybeReduce(reduceData, identity);
sort = sort == null ? undefined : maybeOutput("sort", sort, inputs);
filter = filter == null ? undefined : maybeEvaluator("filter", filter, inputs);
// Don’t group on a channel if an output requires it as an input!
if (gx != null && hasOutput(outputs, "x", "x1", "x2")) gx = null;
if (gy != null && hasOutput(outputs, "y", "y1", "y2")) gy = null;
// Produce x1, x2, y1, and y2 output channels as appropriate (when binning).
const [BX1, setBX1] = maybeLazyChannel(bx);
const [BX2, setBX2] = maybeLazyChannel(bx);
const [BY1, setBY1] = maybeLazyChannel(by);
const [BY2, setBY2] = maybeLazyChannel(by);
// Produce x or y output channels as appropriate (when grouping).
const [k, gk] = gx != null ? [gx, "x"] : gy != null ? [gy, "y"] : [];
const [GK, setGK] = maybeLazyChannel(k);
// Greedily materialize the z, fill, and stroke channels (if channels and not
// constants) so that we can reference them for subdividing groups without
// computing them more than once.
const {x, y, z, fill, stroke, ...options} = inputs;
const [GZ, setGZ] = maybeLazyChannel(z);
const [vfill] = maybeColor(fill);
const [vstroke] = maybeColor(stroke);
const [GF = fill, setGF] = maybeLazyChannel(vfill);
const [GS = stroke, setGS] = maybeLazyChannel(vstroke);
return {
..."z" in inputs && {z: GZ || z},
..."fill" in inputs && {fill: GF || fill},
..."stroke" in inputs && {stroke: GS || stroke},
...basic(options, (data, facets) => {
const K = valueof(data, k);
const Z = valueof(data, z);
const F = valueof(data, vfill);
const S = valueof(data, vstroke);
const G = maybeSubgroup(outputs, Z, F, S);
const groupFacets = [];
const groupData = [];
const GK = K && setGK([]);
const GZ = Z && setGZ([]);
const GF = F && setGF([]);
const GS = S && setGS([]);
const BX = bx ? bx(data) : [[,, I => I]];
const BY = by ? by(data) : [[,, I => I]];
const BX1 = bx && setBX1([]);
const BX2 = bx && setBX2([]);
const BY1 = by && setBY1([]);
const BY2 = by && setBY2([]);
let i = 0;
for (const o of outputs) o.initialize(data);
if (sort) sort.initialize(data);
if (filter) filter.initialize(data);
for (const facet of facets) {
const groupFacet = [];
for (const o of outputs) o.scope("facet", facet);
if (sort) sort.scope("facet", facet);
if (filter) filter.scope("facet", facet);
for (const [f, I] of maybeGroup(facet, G)) {
for (const [k, g] of maybeGroup(I, K)) {
for (const [x1, x2, fx] of BX) {
const bb = fx(g);
for (const [y1, y2, fy] of BY) {
const b = fy(bb);
if (filter && !filter.reduce(b)) continue;
groupFacet.push(i++);
groupData.push(reduceData.reduce(b, data));
if (K) GK.push(k);
if (Z) GZ.push(G === Z ? f : Z[b[0]]);
if (F) GF.push(G === F ? f : F[b[0]]);
if (S) GS.push(G === S ? f : S[b[0]]);
if (BX1) BX1.push(x1), BX2.push(x2);
if (BY1) BY1.push(y1), BY2.push(y2);
for (const o of outputs) o.reduce(b);
if (sort) sort.reduce(b);
}
}
}
}
groupFacets.push(groupFacet);
}
maybeSort(groupFacets, sort, reverse);
return {data: groupData, facets: groupFacets};
}),
...BX1 ? {x1: BX1, x2: BX2, x: mid(BX1, BX2)} : {x},
...BY1 ? {y1: BY1, y2: BY2, y: mid(BY1, BY2)} : {y},
...GK && {[gk]: GK},
...Object.fromEntries(outputs.map(({name, output}) => [name, output]))
};
}
function maybeBinValue(value, {cumulative, domain, thresholds} = {}, defaultValue) {
value = {...maybeValue(value)};
if (value.domain === undefined) value.domain = domain;
if (value.cumulative === undefined) value.cumulative = cumulative;
if (value.thresholds === undefined) value.thresholds = thresholds;
if (value.value === undefined) value.value = defaultValue;
value.thresholds = maybeThresholds(value.thresholds);
return value;
}
function maybeBinValueTuple(options = {}) {
let {x, y} = options;
x = maybeBinValue(x, options);
y = maybeBinValue(y, options);
([x.value, y.value] = maybeTuple(x.value, y.value));
return {x, y};
}
function maybeBin(options) {
if (options == null) return;
const {value, cumulative, domain = extent, thresholds} = options;
const bin = data => {
const V = valueof(data, value);
const bin = binner().value(i => V[i]);
if (isTemporal(V)) {
let [min, max] = typeof domain === "function" ? domain(V) : domain;
let t = typeof thresholds === "function" && !isTimeInterval(thresholds) ? thresholds(V, min, max) : thresholds;
if (typeof t === "number") t = utcTickInterval(min, max, t);
if (isTimeInterval(t)) {
if (domain === extent) {
min = t.floor(min);
max = t.ceil(new Date(+max + 1));
}
t = t.range(min, max);
}
bin.thresholds(t).domain([min, max]);
} else {
bin.thresholds(thresholds).domain(domain);
}
let bins = bin(range(data)).map(binset);
if (cumulative) bins = (cumulative < 0 ? bins.reverse() : bins).map(bincumset);
return bins.map(binfilter);
};
bin.label = labelof(value);
return bin;
}
function maybeThresholds(thresholds = thresholdAuto) {
if (typeof thresholds === "string") {
switch (thresholds.toLowerCase()) {
case "freedman-diaconis": return thresholdFreedmanDiaconis;
case "scott": return thresholdScott;
case "sturges": return thresholdSturges;
case "auto": return thresholdAuto;
}
throw new Error("invalid thresholds");
}
return thresholds; // pass array, count, or function to bin.thresholds
}
function thresholdAuto(values, min, max) {
return Math.min(200, thresholdScott(values, min, max));
}
function isTimeInterval(t) {
return t ? typeof t.range === "function" : false;
}
function hasOutput(outputs, ...names) {
for (const {name} of outputs) {
if (names.includes(name)) {
return true;
}
}
return false;
}
function binset(bin) {
return [bin, new Set(bin)];
}
function bincumset([bin], j, bins) {
return [
bin,
{
get size() {
for (let k = 0; k <= j; ++k) {
if (bins[k][1].size) {
return 1; // a non-empty value
}
}
return 0;
},
has(i) {
for (let k = 0; k <= j; ++k) {
if (bins[k][1].has(i)) {
return true;
}
}
return false;
}
}
];
}
function binfilter([{x0, x1}, set]) {
return [x0, x1, set.size ? I => I.filter(set.has, set) : binempty];
}
function binempty() {
return new Uint32Array(0);
}
function maybeInset(inset, inset1, inset2) {
return inset === undefined && inset1 === undefined && inset2 === undefined
? (offset ? [1, 0] : [0.5, 0.5])
: [inset1, inset2];
}
You can’t perform that action at this time.