Docs: Update benchmark results

This commit is contained in:
github-actions[bot]
2025-10-13 18:37:08 +00:00
parent eaf29ad08d
commit af1053eeb0
28 changed files with 558 additions and 20 deletions

View File

@@ -0,0 +1,17 @@
const findLISLength = async (arr) => {
if (!arr?.length) return 0;
const { bisectLeft } = await import('https://cdn.skypack.dev/d3-array');
const tails = [];
for (const num of arr) {
const pos = bisectLeft(tails, num);
tails[pos] = num;
}
return tails.length;
};
export default findLISLength;
export default findLISLength;

View File

@@ -0,0 +1,15 @@
const findLISLength = async (arr) => {
if (!arr?.length) return 0;
const { bisectLeft } = await import('https://cdn.skypack.dev/d3-array');
const tails = [];
for (const num of arr) {
const pos = bisectLeft(tails, num);
tails[pos] = num;
}
return tails.length;
};
export default findLISLength;

View File

@@ -0,0 +1,15 @@
const findLISLength = async (nums) => {
const { bisectLeft } = await import('https://cdn.skypack.dev/d3-array');
if (!nums?.length) return 0;
const tails = [];
for (const num of nums) {
const idx = bisectLeft(tails, num);
tails[idx] = num;
}
return tails.length;
};
export default findLISLength;

View File

@@ -0,0 +1,14 @@
const findLISLength = async (nums) => {
if (!nums?.length) return 0;
const { bisectLeft } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm');
const tails = [];
for (const num of nums) {
tails[bisectLeft(tails, num)] = num;
}
return tails.length;
};
export default findLISLength;

View File

@@ -0,0 +1,13 @@
const findLISLength = async (nums) => {
if (!nums?.length) return 0;
const { bisectLeft } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm');
const tails = [];
for (const num of nums) {
tails[bisectLeft(tails, num)] = num;
}
return tails.length;
};
export default findLISLength;

View File

@@ -0,0 +1,13 @@
const findLISLength = async (nums) => {
if (!Array.isArray(nums) || !nums.length) return 0;
const { bisectLeft } = await import("https://cdn.jsdelivr.net/npm/d3-array");
const tails = [];
for (const num of nums) {
tails[bisectLeft(tails, num)] = num;
}
return tails.length;
};
export default findLISLength;

View File

@@ -0,0 +1,14 @@
const loadBisectLeft=(()=>{let cache;return()=>cache||(cache=import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm').then(({bisectLeft})=>bisectLeft));})();
export async function findLISLength(nums){
if(!Array.isArray(nums)) throw new TypeError('Expected an array');
if(!nums.length) return 0;
const bisectLeft=await loadBisectLeft();
const tails=[];
for(const value of nums){
if(!Number.isFinite(value)) throw new TypeError('Array must contain only finite numbers');
const index=bisectLeft(tails,value,0,tails.length);
tails[index]=value;
}
return tails.length;
}
export default findLISLength;