Searched refs:toBeRemoved (Results 1 – 4 of 4) sorted by relevance
308 public boolean removeAll(Relation<K, V> toBeRemoved) { in removeAll() argument310 for (K key : toBeRemoved.keySet()) { in removeAll()312 Set<V> values = toBeRemoved.getAll(key); in removeAll()327 public boolean removeAll(K key, Iterable<V> toBeRemoved) { in removeAll() argument329 for (V value : toBeRemoved) { in removeAll()335 public Set<V> removeAll(Collection<K> toBeRemoved) { in removeAll() argument337 for (K key : toBeRemoved) { in removeAll()
310 public boolean removeAll(Relation<K, V> toBeRemoved) { in removeAll() argument312 for (K key : toBeRemoved.keySet()) { in removeAll()314 Set<V> values = toBeRemoved.getAll(key); in removeAll()329 public boolean removeAll(K key, Iterable<V> toBeRemoved) { in removeAll() argument331 for (V value : toBeRemoved) { in removeAll()337 public Set<V> removeAll(Collection<K> toBeRemoved) { in removeAll() argument339 for (K key : toBeRemoved) { in removeAll()
151 List<String> toBeRemoved = Lists.newArrayList(); in parse() local174 toBeRemoved.add(currentFile); in parse()208 for (String s : toBeRemoved) { in parse()211 toBeRemoved = Lists.newArrayList(); in parse()
257 ArrayList<Node> toBeRemoved = null; in traverse() local265 if (toBeRemoved == null) { in traverse()266 toBeRemoved = new ArrayList<>(); in traverse()269 toBeRemoved.add(callee); in traverse()276 if (toBeRemoved != null) { in traverse()277 numberOfCycles += toBeRemoved.size(); in traverse()278 node.callees.removeAll(toBeRemoved); in traverse()