multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-14 00:27:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Docs: Update benchmark results

Browse Source
This commit is contained in:
github-actions[bot]
2025-11-07 22:07:45 +00:00
parent b5f81c6e8a
commit 1687dca49c
42 changed files with 784 additions and 847 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
tests/3_lis/outputs/anthropic_claude-sonnet-4.5 TEMP_0.4.js
View File

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

10
tests/3_lis/outputs/anthropic_claude-sonnet-4.5 TEMP_0.7.js
View File

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

12
tests/3_lis/outputs/anthropic_claude-sonnet-4.5.js
View File

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

18
tests/3_lis/outputs/google_gemini-2.5-pro TEMP_0.7.js
View File

@@ -1,15 +1,15 @@
const findLISLength = async (nums) => {
if (!nums?.length) {
return 0;
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;
}
const { bisectLeft } = await import("https://cdn.jsdelivr.net/npm/d3-array@3");
const tails = nums.reduce((sub, num) => {
sub[bisectLeft(sub, num)] = num;
return sub;
}, []);
return tails.length;
};
export default findLISLength;

22
tests/3_lis/outputs/openai_gpt-5-codex.js
View File

@@ -1,14 +1,14 @@
const findLISLength=async a=>{
if(!Array.isArray(a)) throw new TypeError('Expected an array')
const {bisectLeft:b}=await (findLISLength.m??=import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm'))
const t=[]
for(const v of a){
if(!Number.isFinite(v)) throw new TypeError('Array values must be finite numbers')
const i=b(t,v)
if(i===t.length) t.push(v)
else t[i]=v
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
return t.length;
}
window.findLISLength=findLISLength
export default findLISLength;