the way the the PT malator malator
that's a good one the way the GBC
allocator works is you have a pointer to
the Sing called an arena and then each
Arena has a set of pointers out to these
things called bins and bins are all kind
of like their own Heap but they're
dependent on size the arena would track
all these bins and you would pull from
this allocator up to 16 bytes of memory
you wanted and like this one's like up
to 64 the one 28 and then anything over
like a certain amount goes into like a
special bin and then if you Alec like
over I think a page it goes right to M
map and then when you free these things
they get put into what's called a free
list which is literally just a list of
the last like n things that have been
freed it's just a singly linked list and
the reason why it exists is because
statistically it's more likely that
you're going to need a chunk of the same
size and have to Alec a different size