lynchmarkHQ/lynchmark.com
1
0
Fork 0
mirror of https://github.com/lynchmarkHQ/lynchmark.com.git synced 2026-10-19 10:14:51 +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 3256 additions and 1491 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tests/2_convex_hull/outputs_gemini/gemini-3-pro-preview TEMP_0.3.js
+12 -21
View File
@@ -1,27 +1,18 @@
const findConvexHull = async (pts) => {
const { default: _ } = await import('https://cdn.jsdelivr.net/npm/lodash@4.17.21/+esm');
if (!Array.isArray(pts)) throw new Error('Input must be an array');
const u = _.uniqWith(pts, _.isEqual);
if (u.length < 3) return u;
const s = _.sortBy(u, ['x', 'y']);
const k = (a, b, c) => (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
const h = [];
const { default: _ } = await import('https://cdn.jsdelivr.net/npm/lodash@4.17.21/+esm')
const s = _.sortBy(_.uniqWith(pts, _.isEqual), ['x', 'y'])
if (s.length < 3) return s
const h = [], x = (o, a, b) => (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x)
for (const p of s) {
while (h.length >= 2 && k(h[h.length - 2], h[h.length - 1], p) <= 0) h.pop();
h.push(p);
while (h.length >= 2 && x(h[h.length - 2], h[h.length - 1], p) <= 0) h.pop()
h.push(p)
}
const t = h.length + 1;
const t = h.length + 1
for (let i = s.length - 2; i >= 0; i--) {
const p = s[i];
while (h.length >= t && k(h[h.length - 2], h[h.length - 1], p) <= 0) h.pop();
h.push(p);
while (h.length >= t && x(h[h.length - 2], h[h.length - 1], s[i]) <= 0) h.pop()
h.push(s[i])
}
h.pop();
return h;
};
h.pop()
return h
}
export default findConvexHull;