Docs: Update benchmark for google/gemini-3.1-flash-lite-preview

tests/2_convex_hull/outputs/google_gemini-3.1-flash-lite-preview.js

@@ -0,0 +1,25 @@
+async function findConvexHull(pts) {
+  const { sortBy, uniqWith, isEqual } = await import('https://cdn.jsdelivr.net/npm/lodash@4.17.21/+esm');
+  const sorted = sortBy(uniqWith(pts, isEqual), ['x', 'y']);
+
+  const cross = (a, b, c) => (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
+
+  const hull = [];
+  for (const p of sorted) {
+    while (hull.length >= 2 && cross(hull[hull.length - 2], hull[hull.length - 1], p) <= 0) hull.pop();
+    hull.push(p);
+  }
+
+  const lowerLen = hull.length;
+  for (let i = sorted.length - 2; i >= 0; i--) {
+    const p = sorted[i];
+    while (hull.length > lowerLen && cross(hull[hull.length - 2], hull[hull.length - 1], p) <= 0) hull.pop();
+    hull.push(p);
+  }
+
+  hull.pop();
+  return hull;
+}
+export default findConvexHull;
+// Generation time: 1.322s
+// Result: FAIL