binary-trees C# aot #2 program

// The Computer Language Benchmarks Game
// https://benchmarksgame-team.pages.debian.net/benchmarksgame/
//
// based Jarkko Miettinen Java #2 and Anthony Lloyd C# 
// contributed by Isaac Gouy

using System;
using System.Threading.Tasks;

class BinaryTrees
{
    const int MinDepth = 4;
    const int NoTasks = 4;

    public static void Main(string[] args)
    {
        int maxDepth = args.Length == 0 ? 10
            : Math.Max(MinDepth + 2, int.Parse(args[0]));

        Console.WriteLine(string.Concat("stretch tree of depth ", maxDepth + 1,
            "\t check: ", (TreeNode.bottomUpTree(maxDepth + 1)).itemCheck()));

        var longLivedTree = TreeNode.bottomUpTree(maxDepth);

        var results = new string[(maxDepth - MinDepth) / 2 + 1];

        for (int i = 0; i < results.Length; i++)
        {
            int depth = i * 2 + MinDepth;
            int n = (1 << maxDepth - depth + MinDepth) / NoTasks;
            var tasks = new Task<int>[NoTasks];
            for (int t = 0; t < tasks.Length; t++)
            {
                tasks[t] = Task.Run(() =>
                {
                    var check = 0;
                    for (int i = n; i > 0; i--)
                        check += (TreeNode.bottomUpTree(depth)).itemCheck();
                    return check;
                });
            }
            var check = tasks[0].Result;
            for (int t = 1; t < tasks.Length; t++)
                check += tasks[t].Result;
            results[i] = string.Concat(n * NoTasks, "\t trees of depth ",
                depth, "\t check: ", check);
        }
        for (int i = 0; i < results.Length; i++)
            Console.WriteLine(results[i]);

        Console.WriteLine(string.Concat("long lived tree of depth ", maxDepth,
            "\t check: ", longLivedTree.itemCheck()));
    }
    
    private class TreeNode
    {
        readonly TreeNode left, right;
        
        internal static TreeNode bottomUpTree(int depth) 
        {
            if (depth > 0) {
                return new TreeNode(
                    bottomUpTree(depth - 1), 
                        bottomUpTree(depth - 1));
            } else {
                return new TreeNode(null,null);
            }
        }        
        
        internal TreeNode(TreeNode left, TreeNode right) 
        {
            this.left = left;
            this.right = right;
        }     

        internal int itemCheck()
        {
            if (left == null) return 1;
            else return 1 + left.itemCheck() + right.itemCheck();
        }
    }   
}
    

NOTES:
64-bit Ubuntu quad core
.NET SDK 8.0.200
Host Version: 8.0.2
Commit: 1381d5ebd2
<ServerGarbageCollection>true
<PublishAot>true



 Thu, 07 Mar 2024 00:03:25 GMT

MAKE:
cp binarytrees.csharpaot-2.csharpaot Program.cs
cp Include/csharpaot/tmp.csproj .
mkdir obj
cp Include/csharpaot/project.assets.json ./obj
/usr/bin/dotnet publish -c Release -r linux-x64 
MSBuild version 17.9.4+90725d08d for .NET
  Determining projects to restore...
  Restored /home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/tmp.csproj (in 2.01 sec).
/home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/Program.cs(66,37): warning CS8625: Cannot convert null literal to non-nullable reference type. [/home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/tmp.csproj]
/home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/Program.cs(66,42): warning CS8625: Cannot convert null literal to non-nullable reference type. [/home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/tmp.csproj]
  tmp -> /home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/bin/Release/net8.0/linux-x64/tmp.dll
  Generating native code
  tmp -> /home/dunham/all-benchmarksgame/benchmarksgame_i53330/binarytrees/tmp/bin/Release/net8.0/linux-x64/publish/

22.18s to complete and log all make actions

COMMAND LINE:
 ./bin/Release/net8.0/linux-x64/publish/tmp 21

PROGRAM OUTPUT:
stretch tree of depth 22	 check: 8388607
2097152	 trees of depth 4	 check: 65011712
524288	 trees of depth 6	 check: 66584576
131072	 trees of depth 8	 check: 66977792
32768	 trees of depth 10	 check: 67076096
8192	 trees of depth 12	 check: 67100672
2048	 trees of depth 14	 check: 67106816
512	 trees of depth 16	 check: 67108352
128	 trees of depth 18	 check: 67108736
32	 trees of depth 20	 check: 67108832
long lived tree of depth 21	 check: 4194303