【在 r*******e 的大作中提到】 : Single LinkedList 的一大特点:要想删除一个节点,得找节点的上家,于是就得从头 : 找了。
i*n
27 楼
tell u truth, 180 days is also wrong, each official defines "6 months" by himself, so if you buy ticket on 180 days next time, you will likey cry again.
lol, i knew ion would reply this post when I saw the post initially.
【在 i*n 的大作中提到】 : one more bad example, we can see such thing ecvery week, : why did you purchase ticket at last day? : big loss if leaving 1 week before due?? : : 180
Not exactly If you take a look at how linux kernel implement lru_cache, the lc_element is not only a double linklist node, but also a hlist node http://lxr.free-electrons.com/source/include/linux/lru_cache.h? look up lc_element is based on lc_find which uses classic hashmap lookup
【在 y**********u 的大作中提到】 : Not exactly : If you take a look at how linux kernel implement lru_cache, the lc_element : is not only a double linklist node, but also a hlist node : http://lxr.free-electrons.com/source/include/linux/lru_cache.h? : look up lc_element is based on lc_find which uses classic hashmap lookup
【在 y**********u 的大作中提到】 : kernel paging is another story because linux has page table which everybody : knows : Do kernel paging needs a table? : : element