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

Docs: Update Gemini benchmark results

Browse Source
This commit is contained in:
github-actions[bot]
2025-11-18 22:04:41 +00:00
parent 31a18dd4ee
commit 33b8150958
220 changed files with 3259 additions and 1494 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.1.js
View File

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

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.2.js
View File

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

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.3.js
View File

@@ -1,7 +1,11 @@
const findLISLength = async nums => {
const { bisectLeft } = await import('https://esm.sh/d3-array')
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 n of nums) tails[bisectLeft(tails, n)] = n
for (const n of arr) {
const i = bisectLeft(tails, n)
i < tails.length ? tails[i] = n : tails.push(n)
}
return tails.length
}
export default findLISLength;

2
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.4.js
View File

@@ -1,5 +1,5 @@
const findLISLength = async nums => {
const { bisectLeft } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm')
const { bisectLeft } = await import('https://esm.sh/d3-array')
const tails = []
for (const n of nums) tails[bisectLeft(tails, n)] = n
return tails.length

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.5.js
View File

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

8
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.6.js
View File

@@ -1,11 +1,7 @@
const findLISLength = async (nums) => {
const findLISLength = async nums => {
const { bisectLeft } = await import('https://esm.sh/d3-array')
const tails = []
for (const x of nums) {
tails[bisectLeft(tails, x)] = x
}
for (const n of nums) tails[bisectLeft(tails, n)] = n
return tails.length
}
export default findLISLength;

12
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.7.js
View File

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

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.8.js
View File

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

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_0.9.js
View File

@@ -1,7 +1,7 @@
const findLISLength = async n => {
const { bisectLeft: b } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm')
const t = []
for (const x of n) t[b(t, x)] = x
return t.length
const findLISLength = async a => {
const { bisectLeft: b } = await import('https://esm.sh/d3-array')
const q = []
for (const n of a) q[b(q, n)] = n
return q.length
}
export default findLISLength;

9
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.1.js
View File

@@ -1,7 +1,10 @@
const findLISLength = async a => {
const { bisectLeft: b } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm')
async function findLISLength(a) {
const { bisectLeft: b } = await import('https://cdn.jsdelivr.net/npm/d3-array/+esm')
const t = []
for (const n of a) t[b(t, n)] = n
for (const n of a) {
const i = b(t, n)
i < t.length ? t[i] = n : t.push(n)
}
return t.length
}
export default findLISLength;

7
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.2.js Normal file
View File

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

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.3.js Normal file
View File

@@ -0,0 +1,10 @@
const findLISLength = async a => {
const { bisectLeft: b } = await import('https://esm.sh/d3-array')
const t = []
for (const v of a) {
const i = b(t, v)
i < t.length ? t[i] = v : t.push(v)
}
return t.length
}
export default findLISLength;

10
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.4.js Normal file
View File

@@ -0,0 +1,10 @@
const findLISLength = async (n) => {
const { bisectLeft: b } = await import('https://cdn.jsdelivr.net/npm/d3-array@3/+esm')
const t = []
for (const v of n) {
const i = b(t, v)
i < t.length ? t[i] = v : t.push(v)
}
return t.length
}
export default findLISLength;

7
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.5.js Normal file
View File

@@ -0,0 +1,7 @@
const findLISLength = async (nums) => {
const { bisectLeft: b } = await import('https://esm.sh/d3-array@3');
const t = [];
for (const n of nums) t[b(t, n)] = n;
return t.length;
};
export default findLISLength;

9
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.6.js Normal file
View File

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

7
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.7.js Normal file
View File

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

7
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.8.js Normal file
View File

@@ -0,0 +1,7 @@
const findLISLength = async (n) => {
const { bisectLeft: b } = await import('https://esm.run/d3-array')
const t = []
for (const v of n) t[b(t, v)] = v
return t.length
}
export default findLISLength;

9
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.9.js Normal file
View File

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

12
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_1.js
View File

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

9
tests/3_lis/outputs_gemini/gemini-3-pro-preview TEMP_2.js Normal file
View File

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