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 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
tests/2_convex_hull/outputs/google_gemini-2.5-pro TEMP_0.7.js
+15 -15
View File
@@ -1,29 +1,29 @@
async function findConvexHull(points) {
const _ = await import('https://cdn.jsdelivr.net/npm/lodash@4.17.21/lodash.min.js');
const { sortBy, uniqWith, isEqual } = await import('https://cdn.jsdelivr.net/npm/lodash-es@4.17.21/+esm');
const sortedUniquePoints = _.uniqWith(_.sortBy(points, ['x', 'y']), _.isEqual);
if (sortedUniquePoints.length < 3) {
return sortedUniquePoints;
if (points.length < 3) {
return [...points];
}
const crossProduct = (p1, p2, p3) =>
(p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x);
const buildHalfHull = (pts) => {
const hull = [];
for (const p of pts) {
while (hull.length >= 2 && crossProduct(hull.at(-2), hull.at(-1), p) <= 0) {
const sortedPoints = sortBy(points, ['x', 'y']);
const buildHull = (pts) =>
pts.reduce((hull, p) => {
while (hull.length >= 2 && crossProduct(hull[hull.length - 2], hull.at(-1), p) <= 0) {
hull.pop();
}
hull.push(p);
}
return hull;
};
return hull;
}, []);
const lowerHull = buildHalfHull(sortedUniquePoints);
const upperHull = buildHalfHull([...sortedUniquePoints].reverse());
const lowerHull = buildHull(sortedPoints);
const upperHull = buildHull([...sortedPoints].reverse());
return [...upperHull.slice(0, -1), ...lowerHull.slice(0, -1)];
const combinedHull = [...lowerHull, ...upperHull];
return uniqWith(combinedHull, isEqual);
}
export default findConvexHull;