• Per =?UTF-8?B?Tm9yZGzDtnc=?= (3/3) Aug 31 2017 Which allocator is best suited for allocating tree nodes (all of
• Stefan Koch (2/5) Aug 31 2017 Region Allocator.
• Per =?UTF-8?B?Tm9yZGzDtnc=?= (3/8) Sep 01 2017 A region over `Mallocator` or a paged allocator to avoid overhead

Per =?UTF-8?B?Tm9yZGzDtnc=?= <per.nordlow gmail.com> writes:

Which allocator is best suited for allocating tree nodes (all of 
equal size around 40-60 bytes in size) in one shot and then 
delete them all in one go? My use case is parse trees.

Stefan Koch <uplink.coder googlemail.com> writes:

On Thursday, 31 August 2017 at 15:43:05 UTC, Per Nordlöw wrote:
 Which allocator is best suited for allocating tree nodes (all 
 of equal size around 40-60 bytes in size) in one shot and then 
 delete them all in one go? My use case is parse trees.

Region Allocator.

Per =?UTF-8?B?Tm9yZGzDtnc=?= <per.nordlow gmail.com> writes:

On Thursday, 31 August 2017 at 15:55:26 UTC, Stefan Koch wrote:
 On Thursday, 31 August 2017 at 15:43:05 UTC, Per Nordlöw wrote:
 Which allocator is best suited for allocating tree nodes (all 
 of equal size around 40-60 bytes in size) in one shot and then 
 delete them all in one go? My use case is parse trees.

 Region Allocator.

A region over `Mallocator` or a paged allocator to avoid overhead 
in calling `malloc`?