[Optimize] Improve LRU cache's performance

[acelyc111]

Proposed changes

When LRUCache insert and evict a large number of entries, there are
frequently calls of HandleTable::remove(e->key, e->hash), it will
lookup the entry in the hash table. Now that we know the entry to
remove 'e', we can remove it directly from hash table's collision list
if it's a double linked list.
This patch refactor the collision list to double linked list, the simple
benchmark CacheTest.SimpleBenchmark shows that time cost reduced about
18% in my test environment.

Types of changes

What types of changes does your code introduce to Doris?
Put an x in the boxes that apply

• [] Bugfix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• [] Breaking change (fix or feature that would cause existing functionality to not work as expected)
• [] Documentation Update (if none of the other choices apply)
• [] Code refactor (Modify the code structure, format the code, etc...)

Checklist

Put an x in the boxes that apply. You can also fill these out after creating the PR. If you're unsure about any of them, don't hesitate to ask. We're here to help! This is simply a reminder of what we are going to look for before merging your code.

• [] I have create an issue on (Fix #ISSUE), and have described the bug/feature there in detail
• Compiling and unit tests pass locally with my changes
• I have added tests that prove my fix is effective or that my feature works
• [] If this change need a document change, I have updated the document
• [] Any dependent changes have been merged

[morningman]

Could you rebase the master code to see if unit test can run normally?

[acelyc111]

Could you rebase the master code to see if unit test can run normally?

Done

[morningman]

LGTM