Docs: Update benchmark results

This commit is contained in:
github-actions[bot]
2025-11-13 21:24:36 +00:00
parent 63fdb538ff
commit a38ae2d0c5
62 changed files with 532 additions and 1161 deletions

View File

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

View File

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

View File

@@ -1,15 +0,0 @@
const findLISLength = async (nums) => {
const { bisectLeft } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm');
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

@@ -1,15 +0,0 @@
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) {
const i = bisectLeft(tails, num);
tails[i] = num;
}
return tails.length;
};
export default findLISLength;

View File

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

View File

@@ -1,14 +0,0 @@
let l;
const m=()=>l??=import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm').then(({bisectLeft})=>bisectLeft);
export async function findLISLength(a){
if(!Array.isArray(a)) throw new TypeError('Expected array');
const b=await m();
const t=[];
for(const n of a){
if(typeof n!=='number'||!Number.isFinite(n)) throw new TypeError('Expected finite numbers');
const i=b(t,n);
t[i]=n;
}
return t.length;
}
export default findLISLength;

View File

@@ -0,0 +1,9 @@
const m = import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm');
async function findLISLength(nums) {
const { bisectLeft: b } = await m;
const tails = [];
for (const n of nums) tails[b(tails, n)] = n;
return tails.length;
}
export default findLISLength;

View File

@@ -1,12 +0,0 @@
async function findLISLength(a){
if(!a||!a.length)return 0
const{bisectLeft}=await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm')
const t=[]
for(const x of a){
const i=bisectLeft(t,x)
if(i===t.length)t.push(x)
else t[i]=x
}
return t.length
}
export default findLISLength;