3 ms·
Awesome! Just last month I developed an algorithm to solve performance issues related to traversing a large graph. The algorithm required an array of hundreds
by zanethomas 10y ago
Awesome!
Just last month I developed an algorithm to solve performance issues related to traversing a large graph. The algorithm required an array of hundreds of millions of structs and performance was very important (as one might assume when using a lot of RAM!). Allocating on the native heap worked like a charm!
My solution was too-coupled to the specific problem I was working on, I'll be looking to use Span<T> instead as soon as I have time to convert.