mirror of https://github.com/sveltejs/svelte
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
367 lines
7.7 KiB
367 lines
7.7 KiB
import { fastest_test } from '../../utils.js';
|
|
import * as $ from '../../../packages/svelte/src/internal/client/index.js';
|
|
|
|
const COUNT = 1e5;
|
|
|
|
/**
|
|
* @param {number} n
|
|
* @param {any[]} sources
|
|
*/
|
|
function create_data_signals(n, sources) {
|
|
for (let i = 0; i < n; i++) {
|
|
sources[i] = $.state(i);
|
|
}
|
|
return sources;
|
|
}
|
|
|
|
/**
|
|
* @param {number} i
|
|
*/
|
|
function create_computation_0(i) {
|
|
$.derived(() => i);
|
|
}
|
|
|
|
/**
|
|
* @param {any} s1
|
|
*/
|
|
function create_computation_1(s1) {
|
|
$.derived(() => $.get(s1));
|
|
}
|
|
/**
|
|
* @param {any} s1
|
|
* @param {any} s2
|
|
*/
|
|
function create_computation_2(s1, s2) {
|
|
$.derived(() => $.get(s1) + $.get(s2));
|
|
}
|
|
|
|
function create_computation_1000(ss, offset) {
|
|
$.derived(() => {
|
|
let sum = 0;
|
|
for (let i = 0; i < 1000; i++) {
|
|
sum += $.get(ss[offset + i]);
|
|
}
|
|
return sum;
|
|
});
|
|
}
|
|
|
|
/**
|
|
* @param {number} n
|
|
*/
|
|
function create_computations_0to1(n) {
|
|
for (let i = 0; i < n; i++) {
|
|
create_computation_0(i);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* @param {number} n
|
|
* @param {any[]} sources
|
|
*/
|
|
function create_computations_1to1(n, sources) {
|
|
for (let i = 0; i < n; i++) {
|
|
const source = sources[i];
|
|
create_computation_1(source);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* @param {number} n
|
|
* @param {any[]} sources
|
|
*/
|
|
function create_computations_2to1(n, sources) {
|
|
for (let i = 0; i < n; i++) {
|
|
create_computation_2(sources[i * 2], sources[i * 2 + 1]);
|
|
}
|
|
}
|
|
|
|
function create_computation_4(s1, s2, s3, s4) {
|
|
$.derived(() => $.get(s1) + $.get(s2) + $.get(s3) + $.get(s4));
|
|
}
|
|
|
|
function create_computations_1000to1(n, sources) {
|
|
for (let i = 0; i < n; i++) {
|
|
create_computation_1000(sources, i * 1000);
|
|
}
|
|
}
|
|
|
|
function create_computations_1to2(n, sources) {
|
|
for (let i = 0; i < n / 2; i++) {
|
|
const source = sources[i];
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
}
|
|
}
|
|
|
|
function create_computations_1to4(n, sources) {
|
|
for (let i = 0; i < n / 4; i++) {
|
|
const source = sources[i];
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
}
|
|
}
|
|
|
|
function create_computations_1to8(n, sources) {
|
|
for (let i = 0; i < n / 8; i++) {
|
|
const source = sources[i];
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
create_computation_1(source);
|
|
}
|
|
}
|
|
|
|
function create_computations_1to1000(n, sources) {
|
|
for (let i = 0; i < n / 1000; i++) {
|
|
const source = sources[i];
|
|
for (let j = 0; j < 1000; j++) {
|
|
create_computation_1(source);
|
|
}
|
|
}
|
|
}
|
|
|
|
function create_computations_4to1(n, sources) {
|
|
for (let i = 0; i < n; i++) {
|
|
create_computation_4(
|
|
sources[i * 4],
|
|
sources[i * 4 + 1],
|
|
sources[i * 4 + 2],
|
|
sources[i * 4 + 3]
|
|
);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* @param {any} fn
|
|
* @param {number} count
|
|
* @param {number} scount
|
|
*/
|
|
function bench(fn, count, scount) {
|
|
let sources = create_data_signals(scount, []);
|
|
|
|
fn(count, sources);
|
|
}
|
|
|
|
export async function sbench_create_signals() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_data_signals, COUNT, COUNT);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
for (let i = 0; i < 100; i++) {
|
|
bench(create_data_signals, COUNT, COUNT);
|
|
}
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_signals',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_0to1() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_0to1, COUNT, 0);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_0to1, COUNT, 0);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_0to1',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1to1() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1to1, COUNT, COUNT);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1to1, COUNT, COUNT);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1to1',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_2to1() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_2to1, COUNT / 2, COUNT);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_2to1, COUNT / 2, COUNT);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_2to1',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_4to1() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_4to1, COUNT / 4, COUNT);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_4to1, COUNT / 4, COUNT);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_4to1',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1000to1() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1000to1, COUNT / 1000, COUNT);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1000to1, COUNT / 1000, COUNT);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1000to1',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1to2() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1to2, COUNT, COUNT / 2);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1to2, COUNT, COUNT / 2);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1to2',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1to4() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1to4, COUNT, COUNT / 4);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1to4, COUNT, COUNT / 4);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1to4',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1to8() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1to8, COUNT, COUNT / 8);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1to8, COUNT, COUNT / 8);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1to8',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|
|
|
|
export async function sbench_create_1to1000() {
|
|
// Do 3 loops to warm up JIT
|
|
for (let i = 0; i < 3; i++) {
|
|
bench(create_computations_1to1000, COUNT, COUNT / 1000);
|
|
}
|
|
|
|
const { timing } = await fastest_test(10, () => {
|
|
const destroy = $.effect_root(() => {
|
|
for (let i = 0; i < 10; i++) {
|
|
bench(create_computations_1to1000, COUNT, COUNT / 1000);
|
|
}
|
|
});
|
|
destroy();
|
|
});
|
|
|
|
return {
|
|
benchmark: 'sbench_create_1to1000',
|
|
time: timing.time.toFixed(2),
|
|
gc_time: timing.gc_time.toFixed(2)
|
|
};
|
|
}
|