LRU Table

LRU(Least Recently Used) table is a simple data structure that is composed of hash table and linked list. The insert, erase, lookup/search can be done naturally in O(1) by its hash-table part. But the best thing is, it can return the least or most recently used data in O(1) by the its linked-list in a least-to-most recently used order. …

Grandpa’s American Dream

My very first memory of my grandpa is that he stepped awkwardly in the hall of my preschool. He picked me up everyday. I lived with my grandparents before going...…

Dancing LED

To make some fun in a snowing night, I built a simple audio reactive LED that can dance(blink) with the music. It’s an easy project for killing time since the...…

Opaque or Transparent Data Type in a Rust Library

This post is synchronized with my gist file. To develop a Rust library that will be used for the external code, the data may be interoperable or non-interoperable. The interoperable data is a data whose underlying memory layout is known and their values can be modified directly by the external code. On the contrary, the non-interoperable data is a data whose underlying memory layout is unknown so their values cannot be changed directly. The underlying values can only be changed when they provide related APIs to do that. …