Merge branch 'main' into chore/v-mandelbrot-update-deprecated

Author: hanabi1224

.github/lua.sh

@@ -2,7 +2,7 @@
 
 set -euo pipefail
 
-LUA_VERSION="5.4.6"
+LUA_VERSION="5.4.7"
 # https://www.lua.org/ftp/#
 pushd /tmp
 curl -L -R -O http://www.lua.org/ftp/lua-$LUA_VERSION.tar.gz

.github/odin.sh

@@ -2,15 +2,14 @@
 
 set -euo pipefail
 
-VERSION=dev-2024-01
-FILE_NAME=odin-ubuntu-amd64-$VERSION.zip
+VERSION=dev-2024-11
+FILE_NAME=odin-linux-amd64-$VERSION.zip
 sudo apt-get install -y aria2
-mkdir /tmp/odin
+mkdir /tmp/odin || true
 cd /tmp/odin
 aria2c -c -o $FILE_NAME https://github.com/odin-lang/Odin/releases/download/$VERSION/$FILE_NAME
-if test -d ubuntu_artifacts; then sudo rm -rf ubuntu_artifacts; fi
 unzip -o $FILE_NAME
-if test -d ubuntu_artifacts; then ODIN_BIN_PATH=$PWD/ubuntu_artifacts/odin; else ODIN_BIN_PATH=$PWD/odin; fi
-sudo chmod +x $ODIN_BIN_PATH
+tar -xvf dist.tar.gz
+ODIN_BIN_PATH=$(pwd)/$(find */odin)
 sudo ln -sf $ODIN_BIN_PATH /usr/bin/odin
 odin version

.github/workflows/bench.yml

@@ -67,7 +67,7 @@ jobs:
       - run: dotnet --info
       - uses: actions/setup-dotnet@v3
         with:
-          dotnet-version: "8.x"
+          dotnet-version: "9.x"
       - name: Install
         run: |
           echo '# placeholder' > $PROFILE
@@ -254,7 +254,7 @@ jobs:
       - run: lscpu
       - uses: actions/setup-dotnet@v3
         with:
-          dotnet-version: "8.x"
+          dotnet-version: "9.x"
       - name: Install
         run: |
           dotnet --info
@@ -332,7 +332,7 @@ jobs:
           node-version: 18.x
       - uses: pnpm/action-setup@v2
         with:
-          version: 8
+          version: 9
       - uses: actions/download-artifact@v3
         with:
           # Artifact name
@@ -347,8 +347,10 @@ jobs:
           pushd website
           pnpm i
           pnpm content
+          pnpm build
+          pnpm archive-dist
       - name: Site Publish
         if: github.ref == 'refs/heads/main'
         env:
           VERCEL_PUBLISH_TOKEN: ${{ secrets.VERCEL_PUBLISH_TOKEN }}
-        run: vercel website --prod --confirm -t $VERCEL_PUBLISH_TOKEN || echo 'ignore errors'
+        run: vercel website --prod --yes -t $VERCEL_PUBLISH_TOKEN || echo 'ignore errors'

.github/workflows/site.yml

@@ -22,11 +22,11 @@ jobs:
           node-version: 18.x
       - uses: pnpm/action-setup@v2
         with:
-          version: 8
-      - run: pnpm --version
+          version: 9
       - run: vercel --version
       - name: Build
         run: |
           cd website
           pnpm i
           pnpm build
+          pnpm archive-dist

.github/zig.sh

@@ -1,4 +1,4 @@
 #!/usr/bin/sh
 
-sudo snap install zig --classic --edge
+sudo snap install zig --classic --beta
 zig version

bench/algorithm/binarytrees/1.odin

@@ -3,63 +3,63 @@
 package main
 
 import "core:fmt"
-import "core:strconv"
-import "core:os"
 import "core:math"
 import "core:mem"
+import "core:os"
+import "core:strconv"
 
 MIN_DEPTH :: 4
 main :: proc() {
-  n := strconv.parse_int(os.args[1]) or_else 10
-  max_depth := math.max(MIN_DEPTH+2,n)
-  {
-    stretch_depth := max_depth + 1
-    stretch_tree := makeTree(stretch_depth)
-    defer { delete_tree(stretch_tree) }
-    fmt.printf("stretch tree of depth %d\t check: %d\n", stretch_depth, check(stretch_tree) );
-  }
-  long_lived_tree := makeTree(max_depth)
-  defer delete_tree(long_lived_tree)
-  depth:int= MIN_DEPTH;
-  for ;depth <= max_depth; depth += 2 {
-    iterations := 1 << u8(max_depth - depth + MIN_DEPTH)
-    sum: u64 = 0
-    for _ in 0..<iterations {
-      tree := makeTree(depth)
-      defer { delete_tree(tree) }
-      sum += u64(check(tree))
-    }
-    fmt.printf("%d\t trees of depth %d\t check: %d\n", iterations, depth, sum )
-  }
+	#no_bounds_check n := strconv.parse_int(os.args[1]) or_else 10
+	max_depth := math.max(MIN_DEPTH + 2, n)
+	{
+		stretch_depth := max_depth + 1
+		stretch_tree := makeTree(stretch_depth)
+		defer {delete_tree(stretch_tree)}
+		fmt.printf("stretch tree of depth %d\t check: %d\n", stretch_depth, check(stretch_tree))
+	}
+	long_lived_tree := makeTree(max_depth)
+	defer delete_tree(long_lived_tree)
+	depth: int = MIN_DEPTH
+	for ; depth <= max_depth; depth += 2 {
+		iterations := 1 << u8(max_depth - depth + MIN_DEPTH)
+		sum: u64 = 0
+		for _ in 0 ..< iterations {
+			tree := makeTree(depth)
+			defer {delete_tree(tree)}
+			sum += u64(check(tree))
+		}
+		fmt.printf("%d\t trees of depth %d\t check: %d\n", iterations, depth, sum)
+	}
 
-  fmt.printf("long lived tree of depth %d\t check: %d\n", max_depth, check(long_lived_tree))
+	fmt.printf("long lived tree of depth %d\t check: %d\n", max_depth, check(long_lived_tree))
 }
 
 Node :: struct {
-  left,right:^Node,
+	left, right: ^Node,
 }
 
-makeTree::proc(depth:int)->^Node {
-  node := new(Node)
-  if node == nil {
-    fmt.println("alloc error")
-    return node
-  }
-  if depth > 0 {
-    node.left = makeTree(depth-1)
-    node.right = makeTree(depth-1)
-  }
-  return node
+makeTree :: proc(depth: int) -> ^Node {
+	node := new(Node)
+	if node == nil {
+		fmt.println("alloc error")
+		return node
+	}
+	if depth > 0 {
+		node.left = makeTree(depth - 1)
+		node.right = makeTree(depth - 1)
+	}
+	return node
 }
-delete_tree::proc(t:^Node){
-  if t.left != nil {delete_tree(t.left)}
-  if t.right != nil {delete_tree(t.right)}
-  free(t)
+delete_tree :: proc(t: ^Node) {
+	if t.left != nil {delete_tree(t.left)}
+	if t.right != nil {delete_tree(t.right)}
+	free(t)
 }
-check::proc(tree:^Node)->int {
-  sum : int = 1
-  if tree == nil { return 0 }
-  sum += check(tree.left)
-  sum += check(tree.right)
-  return sum
+check :: proc(tree: ^Node) -> int {
+	sum: int = 1
+	if tree == nil {return 0}
+	sum += check(tree.left)
+	sum += check(tree.right)
+	return sum
 }

bench/algorithm/binarytrees/1.v

@@ -22,12 +22,12 @@ fn check(node &Node) int {
 fn create(n int) &Node {
 	if n == 0 {
 		return &Node{
-			left: 0
-			right: 0
+			left:  unsafe { nil }
+			right: unsafe { nil }
 		}
 	}
 	return &Node{
-		left: create(n - 1)
+		left:  create(n - 1)
 		right: create(n - 1)
 	}
 }

bench/algorithm/edigits/1.v

@@ -5,10 +5,8 @@ import strconv
 import math.big
 import math
 
-const (
-	one = big.integer_from_int(1)
-	ten = big.integer_from_int(10)
-)
+const one = big.integer_from_int(1)
+const ten = big.integer_from_int(10)
 
 fn main() {
 	mut n := 27

bench/algorithm/fannkuch-redux/2-m.zig

@@ -114,8 +114,8 @@ fn pfannkuchenStats(first: usize, last: usize, n: u8, res: *Stats) void {
         stats.checksum += @as(i32, @intCast(flips)) * parity;
         perm = nextPermutation(perm, count[0..n]) orelse break;
     }
-    _ = @atomicRmw(u32, &res.max_flips, .Max, stats.max_flips, .SeqCst);
-    _ = @atomicRmw(i32, &res.checksum, .Add, stats.checksum, .SeqCst);
+    _ = @atomicRmw(u32, &res.max_flips, .Max, stats.max_flips, .seq_cst);
+    _ = @atomicRmw(i32, &res.checksum, .Add, stats.checksum, .seq_cst);
 }
 
 pub fn main() !void {

bench/algorithm/fasta/1c.rs

@@ -5,8 +5,6 @@
 // contributed by TeXitoi
 // add compile-time calculation by hanabi1224
 
-#![feature(const_fn_floating_point_arithmetic)]
-
 use std::cmp::min;
 use std::io::{self, BufWriter, Write};