Android代码-weak-lock-free

This is a miniature implementation of a concurrent, lock-free (as in lock-less) hash map with weak keys where keys respect reference equality. Such a hash map removes entries containing collected keys by either: Inline removal (entries that contain to collected keys are removed as a result of interaction with the map). Implicit concurrent removal (entries that contain collected keys are removed by an external thread). Explicit concurrent removal (explicit interaction with the map's reference qu