Docs: Update Gemini benchmark results

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

@@ -0,0 +1,7 @@
+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;

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

@@ -0,0 +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
+}
+export default findLISLength;

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

@@ -0,0 +1,7 @@
+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;

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

@@ -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;

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

@@ -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 x of nums) tails[bisectLeft(tails, x)] = x
+  return tails.length
+}
+export default findLISLength;

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

@@ -0,0 +1,11 @@
+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
+  }
+  
+  return tails.length
+}
+export default findLISLength;

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

@@ -0,0 +1,9 @@
+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
+}
+export default findLISLength;

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

@@ -0,0 +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
+}
+export default findLISLength;

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

@@ -0,0 +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
+}
+export default findLISLength;

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

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

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

@@ -0,0 +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
+}
+export default findLISLength;

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

@@ -0,0 +1,9 @@
+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
+}
+export default findLISLength;