One thing I do remember is that, under normal circumstances, lua will not shrink the memory that's already allocated to a table, so you need to make sure that those empty spaces never get allocated in the first place (as opposed to creating all of them, then running back through and setting them al...

Thanks so much, I'll look into these ^_^

Graph data structure, yes, nodes, edges, ect. It would be nice if they came equipped with some algorithms such as Dijkstras, max flow, ect

yeah, sorry I just edited my message lol. I didn't recall seeing that about the function.

collect garbage will perform a full garbage collection run. I don't think it returns info. I did however just find the gcinfo() function. According to some scarce documentation, it returns two arguments: the number of bytes used and the capacity of the collector. That should do it! EDIT: ah! Yes, co...

hmmmm... Actually yeah it should be! At first glance it sounds silly, but since lua tables are not contiguous arrays (but rather hash tables), the amount of memory taken up is determined by how many non-nil entries are in the table. One thing I do remember is that, under normal circumstances, lua wi...

Hey guys! Been lurking on here for a while, but this will be my first post. I'm actually not specifically using LOVE, but I've been finding many of the libraries here very helpful (to the authors of 'inspect' and 'serialize', I use those constantly). I've also been scouting around and experimentatio...