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

Refactor: Remove stale benchmark outputs

Browse Source
This commit is contained in:
github-actions[bot]
2026-02-06 21:01:23 +00:00
parent 3a53d655cd
commit 3385fbc925
99 changed files with 0 additions and 2663 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
tests/3_lis/outputs/anthropic_claude-opus-4.6 TEMP_0.4.js
View File

@@ -1,12 +0,0 @@
async function findLISLength(nums) {
const { bisectLeft } = await import("https://cdn.jsdelivr.net/npm/d3-array/+esm");
const tails = [];
for (const n of nums) {
const i = bisectLeft(tails, n);
i < tails.length ? tails[i] = n : tails.push(n);
}
return tails.length;
}
export default findLISLength;
// Generation time: 3.321s
// Result: PASS

13
tests/3_lis/outputs/anthropic_claude-opus-4.6 TEMP_0.7.js
View File

@@ -1,13 +0,0 @@
async function findLISLength(nums) {
const { bisectLeft } = await import("https://cdn.jsdelivr.net/npm/d3-array/+esm");
const tails = [];
for (const n of nums) {
const i = bisectLeft(tails, n);
if (i === tails.length) tails.push(n);
else tails[i] = n;
}
return tails.length;
}
export default findLISLength;
// Generation time: 2.405s
// Result: PASS

16
tests/3_lis/outputs/google_gemini-3-flash-preview.js
View File

@@ -1,16 +0,0 @@
const findLISLength = async (nums) => {
const { bisectLeft } = await import('https://cdn.skypack.dev/d3-array@3');
const tails = [];
for (const x of nums) {
const i = bisectLeft(tails, x);
tails[i] = x;
}
return tails.length;
};
export default findLISLength;
// Generation time: 13.472s
// Result: PASS

13
tests/3_lis/outputs/minimax_minimax-m2.1.js
View File

@@ -1,13 +0,0 @@
async function findLISLength(arr) {
const { bisectLeft } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm');
const tails = [];
for (const num of arr) {
const idx = bisectLeft(tails, num);
if (idx === tails.length) tails.push(num);
else tails[idx] = num;
}
return tails.length;
}
export default findLISLength;
// Generation time: 4.847s
// Result: PASS

4
tests/3_lis/outputs/minimax_minimax-m2.js
View File

@@ -1,4 +0,0 @@
export default findLISLength;
// Generation time: 10.991s
// Result: FAIL

10
tests/3_lis/outputs/moonshotai_kimi-k2-thinking.js
View File

@@ -1,10 +0,0 @@
export async function findLISLength(a){
const{bisectLeft}=await import('https://esm.sh/d3-array');
if(!Array.isArray(a))return 0;
const t=[];
for(const v of a){const i=bisectLeft(t,v);i===t.length?t.push(v):t[i]=v;}
return t.length;
}
export default findLISLength;
// Generation time: 39.477s
// Result: PASS

12
tests/3_lis/outputs/openai_gpt-5.1-codex-max.js
View File

@@ -1,12 +0,0 @@
async function findLISLength(a){
let {bisectLeft}=await import('https://cdn.jsdelivr.net/npm/d3-array@3')
let t=[]
for(let x of a){
let i=bisectLeft(t,x)
t[i]=x
}
return t.length
}
export default findLISLength;
// Generation time: 8.286s
// Result: FAIL

12
tests/3_lis/outputs/openai_gpt-5.1-codex.js
View File

@@ -1,12 +0,0 @@
async function findLISLength(a){
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)
t[i]=x
}
return t.length
}
export default findLISLength;
// Generation time: 6.704s
// Result: PASS

20
tests/3_lis/outputs/openai_gpt-5.2 EFF_xhigh.js
View File

@@ -1,20 +0,0 @@
const d3ArrayUrl = 'https://cdn.jsdelivr.net/npm/d3-array@3/+esm'
const err = 'Expected an array of numbers'
let d3Array
async function findLISLength(nums) {
if (!Array.isArray(nums)) throw TypeError(err)
d3Array ||= import(d3ArrayUrl)
let { bisectLeft } = await d3Array
let tails = []
for (let x of nums) {
if (typeof x != 'number' || x != x) throw TypeError(err)
tails[bisectLeft(tails, x)] = x
}
return tails.length
}
export default findLISLength;
// Generation time: 227.924s
// Result: PASS