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 benchmark results

Browse Source
This commit is contained in:
github-actions[bot]
2025-11-13 21:50:29 +00:00
parent 59752cb111
commit f2ef5831a7
31 changed files with 416 additions and 433 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
tests/2_convex_hull/outputs/google_gemini-2.5-pro.js
View File

@@ -1,27 +1,29 @@
async function findConvexHull(points) {
const { sortBy, uniqWith, isEqual } = await import('https://cdn.jsdelivr.net/npm/lodash-es@4.17.21/lodash.min.js');
const findConvexHull = async (points) => {
const _ = await import('https://cdn.jsdelivr.net/npm/lodash-es@4.17.21/lodash.min.js');
const uniquePoints = uniqWith(points, isEqual);
if (uniquePoints.length < 3) {
return uniquePoints;
const sortedPoints = _.sortBy(_.uniqWith(points, _.isEqual), ['x', 'y']);
if (sortedPoints.length < 3) {
return sortedPoints;
}
const sortedPoints = sortBy(uniquePoints, ['x', 'y']);
const crossProduct = (p1, p2, p3) =>
(p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x);
const buildHull = pts => pts.reduce((hull, p) => {
while (hull.length >= 2 && crossProduct(hull.at(-2), hull.at(-1), p) <= 0) {
hull.pop();
const buildHalfHull = (pointSet) => {
const hull = [];
for (const p of pointSet) {
while (hull.length >= 2 && crossProduct(hull.at(-2), hull.at(-1), p) <= 0) {
hull.pop();
}
hull.push(p);
}
hull.push(p);
return hull;
}, []);
};
const lower = buildHull(sortedPoints);
const upper = buildHull([...sortedPoints].reverse());
const lower = buildHalfHull(sortedPoints);
const upper = buildHalfHull([...sortedPoints].reverse());
return [...lower.slice(0, -1), ...upper.slice(0, -1)];
}
};
export default findConvexHull;