nullableReturns.remove(sign); for (String nullableReturnMethodSign : Iterator2Iterable.make(nullableReturns.iterator())) { methodRecords.put( nullableReturnMethodSign,
@Override public Iterator<T> iterator() { if (entries.length == 0) { return EmptyIterator.instance(); } return new ArrayIterator<>(entries); }
public static <T, S extends T> Iterator<S> filter(Iterator<T> iterator, final Class<S> cls) { return new MapIterator<>(new FilterIterator<>(iterator, cls::isInstance), cls::cast); } }
/** * */ public ParanoidHashSet() { super(); hcFreq = HashMapFactory.make(); }
@Override public Iterator<FieldReference> iterateFieldsWritten(CGNode node) { return EmptyIterator.instance(); } };
@SuppressWarnings("unchecked") public ImmutableStack<T> reverse() { T[] tmpEntries = (T[]) new Object[entries.length]; for (int i = entries.length - 1, j = 0; i >= 0; i--, j++) { tmpEntries[j] = entries[i]; } return new ImmutableStack<>(tmpEntries); }
/** * checks if two sets have a non-empty intersection * * @return {@code true} if the sets intersect; {@code false} otherwise */ public static <T> boolean intersecting(final Set<T> s1, final Set<T> s2) { return forSome(s1, s2::contains); }
@Override public Iterator<T> iterator() { if (entries.length == 0) { return EmptyIterator.instance(); } return new ArrayIterator<>(entries); }
public static <T, S extends T> Iterator<S> filter(Iterator<T> iterator, final Class<S> cls) { return new MapIterator<>(new FilterIterator<>(iterator, cls::isInstance), cls::cast); } }
/** * The {@link ExceptionHandlerBasicBlock} subclass will override this. * */ @Override public Iterator<TypeReference> getCaughtExceptionTypes() { return EmptyIterator.instance(); } }
for (ISSABasicBlock succ : Iterator2Iterable.make(pdomTree.getSuccNodes(node))) { nodeQueue.add(succ);
@Override public Iterator<T> iterator() { if (entries.length == 0) { return EmptyIterator.instance(); } return new ArrayIterator<>(entries); }
public static <T, S extends T> Iterator<S> filter(Iterator<T> iterator, final Class<S> cls) { return new MapIterator<>(new FilterIterator<>(iterator, cls::isInstance), cls::cast); } }