C# does. It should only take 30 bytes per node to store the information I need to have. But somehow that turns into 50 bytes. Byte alignment plus class
overhead, I guess.
Matthew Woodcraft wrote:
Michael Williams wrote:
I want to correct that last statement. With about 350M nodes currently
in the tree (~30M of which fit into memory), I am averaging 0.06 disk
reads per tree traversal.
What makes the nodes so big?
-M-
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
