Loading api/current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -50674,6 +50674,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -54149,6 +54150,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -57098,6 +57100,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -57661,6 +57664,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -57685,6 +57689,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -57703,6 +57708,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -57942,6 +57948,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -58403,6 +58410,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -58485,6 +58493,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -58508,6 +58517,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } } api/system-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -53795,6 +53795,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -57270,6 +57271,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -60219,6 +60221,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -60782,6 +60785,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -60806,6 +60810,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -60824,6 +60829,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -61063,6 +61069,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -61524,6 +61531,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -61606,6 +61614,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -61629,6 +61638,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } } api/test-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -50691,6 +50691,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -54166,6 +54167,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -57115,6 +57117,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -57678,6 +57681,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -57702,6 +57706,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -57720,6 +57725,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -57959,6 +57965,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -58420,6 +58427,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -58502,6 +58510,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -58525,6 +58534,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } } Loading
api/current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -50674,6 +50674,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -54149,6 +54150,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -57098,6 +57100,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -57661,6 +57664,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -57685,6 +57689,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -57703,6 +57708,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -57942,6 +57948,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -58403,6 +58410,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -58485,6 +58493,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -58508,6 +58517,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } }
api/system-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -53795,6 +53795,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -57270,6 +57271,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -60219,6 +60221,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -60782,6 +60785,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -60806,6 +60810,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -60824,6 +60829,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -61063,6 +61069,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -61524,6 +61531,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -61606,6 +61614,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -61629,6 +61638,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } }
api/test-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -50691,6 +50691,7 @@ package java.lang { } public abstract interface Iterable { method public default void forEach(java.util.function.Consumer<? super T>); method public abstract java.util.Iterator<T> iterator(); } Loading Loading @@ -54166,6 +54167,7 @@ package java.security { public abstract class Provider extends java.util.Properties { ctor protected Provider(java.lang.String, double, java.lang.String); method public synchronized void forEach(java.util.function.BiConsumer<? super java.lang.Object, ? super java.lang.Object>); method public java.lang.String getInfo(); method public java.lang.String getName(); method public synchronized java.security.Provider.Service getService(java.lang.String, java.lang.String); Loading Loading @@ -57115,6 +57117,7 @@ package java.util { ctor public ArrayList(java.util.Collection<? extends E>); method public java.lang.Object clone(); method public void ensureCapacity(int); method public void forEach(java.util.function.Consumer<? super E>); method public E get(int); method public int size(); method public void trimToSize(); Loading Loading @@ -57678,6 +57681,7 @@ package java.util { ctor public HashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -57702,6 +57706,7 @@ package java.util { method public boolean containsValue(java.lang.Object); method public synchronized java.util.Enumeration<V> elements(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public synchronized void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public synchronized V get(java.lang.Object); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); Loading @@ -57720,6 +57725,7 @@ package java.util { ctor public IdentityHashMap(java.util.Map<? extends K, ? extends V>); method public java.lang.Object clone(); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } public class IllegalFormatCodePointException extends java.util.IllegalFormatException { Loading Loading @@ -57959,6 +57965,7 @@ package java.util { method public abstract boolean containsValue(java.lang.Object); method public abstract java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public abstract boolean equals(java.lang.Object); method public default void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public abstract V get(java.lang.Object); method public abstract int hashCode(); method public abstract boolean isEmpty(); Loading Loading @@ -58420,6 +58427,7 @@ package java.util { method public K firstKey(); method public java.util.Map.Entry<K, V> floorEntry(K); method public K floorKey(K); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); method public java.util.NavigableMap<K, V> headMap(K, boolean); method public java.util.SortedMap<K, V> headMap(K); method public java.util.Map.Entry<K, V> higherEntry(K); Loading Loading @@ -58502,6 +58510,7 @@ package java.util { method public java.util.Enumeration<E> elements(); method public synchronized void ensureCapacity(int); method public synchronized E firstElement(); method public synchronized void forEach(java.util.function.Consumer<? super E>); method public synchronized E get(int); method public synchronized int indexOf(java.lang.Object, int); method public synchronized void insertElementAt(E, int); Loading @@ -58525,6 +58534,7 @@ package java.util { ctor public WeakHashMap(); ctor public WeakHashMap(java.util.Map<? extends K, ? extends V>); method public java.util.Set<java.util.Map.Entry<K, V>> entrySet(); method public void forEach(java.util.function.BiConsumer<? super K, ? super V>); } }