Hi, > The thing is that we use a linked list to store all of the items in. > Every time a user tries to use an item (get / set / incr etc), the > item will be moved to the beginning of the linked list. Whenever you > try to insert an item in the cache, the first thing we will do is to > look in the tail of the linked list to see if we have any expired > items (we will only look at 50 items). If we don't find any expired > items there, we will try to allocate memory. If the allocation fails, > we will return to the linked list and evict an object from the tail.
thanks for explanation. Cheers, Werner.
