BinTrieTree.java 文件源码

public Iterable<Entry<String, T>> entry() {
    return () -> new AbstractIterator<Entry<String, T>>() {
        NodeHolder holder;
        Iterator<String> ite;

        {
            holder = new NodeHolder();
            ite = keys(holder);
        }

        @Override
        protected Entry<String, T> computeNext() {
            if (!ite.hasNext()) {
                return endOfData();
            }
            String key = ite.next();
            if (key != null) {
                return new AbstractMap.SimpleEntry<>(key, (T) holder.node.value);
            }
            return endOfData();
        }
    };
}