Closed kevaundray closed 3 years ago
It might be worthwhile to benchmark the difference in performance for these two structures:
Variation 1:
enum Node { Leaf(Leaf), Hashed(Hashed), Internal(Box), }
Variation2:
Box<[Option<Box>; YOUR_LEN]>
Variation 2 is closer to what the Golang impl is doing since interfaces are Boxed
This has now gone stale, the method chosen in the end was a sparse representation, which works well with permanent key-value stores
It might be worthwhile to benchmark the difference in performance for these two structures:
Variation 1:
enum Node { Leaf(Leaf), Hashed(Hashed), Internal(Box),
}
Variation2:
Box<[Option<Box>; YOUR_LEN]>
Variation 2 is closer to what the Golang impl is doing since interfaces are Boxed