I think the above test begs to differ about the speed
no... that's what the pool pointer is.... you only allocate at the beginning of your program as I did in the modified impixi example.
yep, because BRL's is very general and has more options that slow it down for this type of application.
You also don't remove memory allocation because every time you add another particle on the end of the chain you have to allocate memory for a new instance of a type
no... that's what the pool pointer is.... you only allocate at the beginning of your program as I did in the modified impixi example.
All you've really said is use your own linked list structure instead of BRL's.
yep, because BRL's is very general and has more options that slow it down for this type of application.