ArrayList <WeakReference <Runnable >> - 如何整理好？

Question

两者之间的一个简单问题:我有一个简单的WeakRunnableList.是这样确定把它清理干净(去除死皮参考),或者是有一个更优雅和更快的解决方案.我的WeakRunnableList的完整源代码:

public class WeakRunnableList
{
    private ArrayList<WeakReference<Runnable>> _items = new ArrayList<WeakReference<Runnable>>();

    public void Add(Runnable r)
    {
        _items.add(new WeakReference<Runnable>(r));
    }

    public void Execute()
    {
        ArrayList<WeakReference<Runnable>> remove = new ArrayList<WeakReference<Runnable>>();
        for (WeakReference<Runnable> item : _items)
        {
            Runnable tempCheck = item.get();
            if (tempCheck  == null)
            {
                remove.add(item);
            }
            else
            {
                tempCheck.run();
            }
        }
        _items.removeAll(remove);
    }
}

Answer 1

这是我的看法.WeakHashMap自动删除,所以这应该足够了.请注意Runnable的hashCode/equals语义.

另请参见 WeakHashMap的keySet条目是否永远不为空？ WeakHashMap迭代和垃圾收集

import java.util.WeakHashMap;

public class WeakRunnableList
{
    private WeakHashMap<Runnable, Void> _items = new WeakHashMap<Runnable, Void>();

    public void Add(Runnable r)
    {
        _items.put(r, null);
    }

    public void Execute()
    {
        Iterator<Runnable> iterator = _items.keySet().iterator();
        while (iterator.hasNext()) {
            Runnable runnable = iterator.next();
            if (runnable != null) {
                runnable.run();
                iterator.remove();
            }
        }
    }
}