Linux websever 5.15.0-153-generic #163-Ubuntu SMP Thu Aug 7 16:37:18 UTC 2025 x86_64
Apache/2.4.52 (Ubuntu)
: 192.168.3.70 | : 192.168.1.99
Cant Read [ /etc/named.conf ]
8.1.2-1ubuntu2.23
urlab
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
var /
www /
html /
cqt /
node_modules /
d3-array /
src /
[ HOME SHELL ]
Name
Size
Permission
Action
threshold
[ DIR ]
drwxr-xr-x
array.js
90
B
-rw-r--r--
ascending.js
127
B
-rw-r--r--
bin.js
3.96
KB
-rw-r--r--
bisect.js
337
B
-rw-r--r--
bisector.js
1.53
KB
-rw-r--r--
blur.js
3.99
KB
-rw-r--r--
constant.js
58
B
-rw-r--r--
count.js
424
B
-rw-r--r--
cross.js
872
B
-rw-r--r--
cumsum.js
218
B
-rw-r--r--
descending.js
144
B
-rw-r--r--
deviation.js
164
B
-rw-r--r--
difference.js
250
B
-rw-r--r--
disjoint.js
404
B
-rw-r--r--
every.js
265
B
-rw-r--r--
extent.js
723
B
-rw-r--r--
filter.js
291
B
-rw-r--r--
fsum.js
1.56
KB
-rw-r--r--
greatest.js
675
B
-rw-r--r--
greatestIndex.js
470
B
-rw-r--r--
group.js
1.68
KB
-rw-r--r--
groupSort.js
429
B
-rw-r--r--
identity.js
52
B
-rw-r--r--
index.js
2.99
KB
-rw-r--r--
intersection.js
446
B
-rw-r--r--
least.js
672
B
-rw-r--r--
leastIndex.js
467
B
-rw-r--r--
map.js
310
B
-rw-r--r--
max.js
502
B
-rw-r--r--
maxIndex.js
582
B
-rw-r--r--
mean.js
483
B
-rw-r--r--
median.js
245
B
-rw-r--r--
merge.js
165
B
-rw-r--r--
min.js
502
B
-rw-r--r--
minIndex.js
582
B
-rw-r--r--
mode.js
708
B
-rw-r--r--
nice.js
535
B
-rw-r--r--
number.js
465
B
-rw-r--r--
pairs.js
307
B
-rw-r--r--
permute.js
97
B
-rw-r--r--
quantile.js
1.73
KB
-rw-r--r--
quickselect.js
1.52
KB
-rw-r--r--
range.js
350
B
-rw-r--r--
rank.js
942
B
-rw-r--r--
reduce.js
460
B
-rw-r--r--
reverse.js
183
B
-rw-r--r--
scan.js
178
B
-rw-r--r--
shuffle.js
329
B
-rw-r--r--
some.js
263
B
-rw-r--r--
sort.js
1.22
KB
-rw-r--r--
subset.js
123
B
-rw-r--r--
sum.js
362
B
-rw-r--r--
superset.js
530
B
-rw-r--r--
ticks.js
1.91
KB
-rw-r--r--
transpose.js
369
B
-rw-r--r--
union.js
217
B
-rw-r--r--
variance.js
668
B
-rw-r--r--
zip.js
106
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : bin.js
import {slice} from "./array.js"; import bisect from "./bisect.js"; import constant from "./constant.js"; import extent from "./extent.js"; import identity from "./identity.js"; import nice from "./nice.js"; import ticks, {tickIncrement} from "./ticks.js"; import sturges from "./threshold/sturges.js"; export default function bin() { var value = identity, domain = extent, threshold = sturges; function histogram(data) { if (!Array.isArray(data)) data = Array.from(data); var i, n = data.length, x, step, values = new Array(n); for (i = 0; i < n; ++i) { values[i] = value(data[i], i, data); } var xz = domain(values), x0 = xz[0], x1 = xz[1], tz = threshold(values, x0, x1); // Convert number of thresholds into uniform thresholds, and nice the // default domain accordingly. if (!Array.isArray(tz)) { const max = x1, tn = +tz; if (domain === extent) [x0, x1] = nice(x0, x1, tn); tz = ticks(x0, x1, tn); // If the domain is aligned with the first tick (which it will by // default), then we can use quantization rather than bisection to bin // values, which is substantially faster. if (tz[0] <= x0) step = tickIncrement(x0, x1, tn); // If the last threshold is coincident with the domain’s upper bound, the // last bin will be zero-width. If the default domain is used, and this // last threshold is coincident with the maximum input value, we can // extend the niced upper bound by one tick to ensure uniform bin widths; // otherwise, we simply remove the last threshold. Note that we don’t // coerce values or the domain to numbers, and thus must be careful to // compare order (>=) rather than strict equality (===)! if (tz[tz.length - 1] >= x1) { if (max >= x1 && domain === extent) { const step = tickIncrement(x0, x1, tn); if (isFinite(step)) { if (step > 0) { x1 = (Math.floor(x1 / step) + 1) * step; } else if (step < 0) { x1 = (Math.ceil(x1 * -step) + 1) / -step; } } } else { tz.pop(); } } } // Remove any thresholds outside the domain. // Be careful not to mutate an array owned by the user! var m = tz.length, a = 0, b = m; while (tz[a] <= x0) ++a; while (tz[b - 1] > x1) --b; if (a || b < m) tz = tz.slice(a, b), m = b - a; var bins = new Array(m + 1), bin; // Initialize bins. for (i = 0; i <= m; ++i) { bin = bins[i] = []; bin.x0 = i > 0 ? tz[i - 1] : x0; bin.x1 = i < m ? tz[i] : x1; } // Assign data to bins by value, ignoring any outside the domain. if (isFinite(step)) { if (step > 0) { for (i = 0; i < n; ++i) { if ((x = values[i]) != null && x0 <= x && x <= x1) { bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]); } } } else if (step < 0) { for (i = 0; i < n; ++i) { if ((x = values[i]) != null && x0 <= x && x <= x1) { const j = Math.floor((x0 - x) * step); bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding } } } } else { for (i = 0; i < n; ++i) { if ((x = values[i]) != null && x0 <= x && x <= x1) { bins[bisect(tz, x, 0, m)].push(data[i]); } } } return bins; } histogram.value = function(_) { return arguments.length ? (value = typeof _ === "function" ? _ : constant(_), histogram) : value; }; histogram.domain = function(_) { return arguments.length ? (domain = typeof _ === "function" ? _ : constant([_[0], _[1]]), histogram) : domain; }; histogram.thresholds = function(_) { return arguments.length ? (threshold = typeof _ === "function" ? _ : constant(Array.isArray(_) ? slice.call(_) : _), histogram) : threshold; }; return histogram; }
Close
