{"id":1633,"date":"2019-04-24T20:05:30","date_gmt":"2019-04-25T04:05:30","guid":{"rendered":"http:\/\/wonghoi.humgar.com\/blog\/?p=1633"},"modified":"2019-04-24T20:05:30","modified_gmt":"2019-04-25T04:05:30","slug":"implicit-ways-to-store-data-in-a-program","status":"publish","type":"post","link":"https:\/\/wonghoi.humgar.com\/blog\/2019\/04\/24\/implicit-ways-to-store-data-in-a-program\/","title":{"rendered":"Implicit ways to store data in a program"},"content":{"rendered":"
The most obvious way to store data is in plain data structures such as arrays and queues, or even a hashtable, but don’t forget these implicit ones:<\/p>\n
\n
Call stack<\/strong>. As the name say, it’s a stack data structure. It saves the local variables before making another function call. This is often exploited in recursion to avoid passing around an explicit data structure<\/li>\n
Closures<\/strong>. What closure means is that when you create an anonymous function, the variables involved (other than the arguments) that is saved along (captured) with the function object you created. This can be exploited to make forward iterators or generators<\/a><\/li>\n