synchronized Node add(String key, boolean isFolder) { Node result = new Node(key, isFolder); if (children == null) children = new ListMap<String, Node>(key, result); else if (children.size() == HASH_THRESHOLD) { Map<String, Node> old_kids = children; children = Maps.newHashMap(); children.putAll(old_kids); children.put(key, result); } else { children.put(key, result); } return result; }
@Override public boolean isEmpty() { return size() == 0; }
@Override public V put(K key, V value) { V result = get(key); data.add(new Entry<K, V>(key, value)); return result; }