Loading api/current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -55649,6 +55649,7 @@ package java.util { 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>); method public boolean replace(K, V, V); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -55669,6 +55670,9 @@ package java.util { ctor public Hashtable(java.util.Map<? extends K, ? extends V>); method public synchronized void clear(); method public synchronized java.lang.Object clone(); method public synchronized V compute(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized V computeIfAbsent(K, java.util.function.Function<? super K, ? extends V>); method public synchronized V computeIfPresent(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized boolean contains(java.lang.Object); method public synchronized boolean containsKey(java.lang.Object); method public boolean containsValue(java.lang.Object); Loading @@ -55676,13 +55680,19 @@ package java.util { 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 V getOrDefault(java.lang.Object, V); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); method public synchronized java.util.Enumeration<K> keys(); method public synchronized V merge(K, V, java.util.function.BiFunction<? super V, ? super V, ? extends V>); method public synchronized V put(K, V); method public synchronized void putAll(java.util.Map<? extends K, ? extends V>); method public synchronized V putIfAbsent(K, V); method protected void rehash(); method public synchronized V remove(java.lang.Object); method public synchronized boolean remove(java.lang.Object, java.lang.Object); method public synchronized boolean replace(K, V, V); method public synchronized V replace(K, V); method public synchronized int size(); method public java.util.Collection<V> values(); } api/system-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -58267,6 +58267,7 @@ package java.util { 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>); method public boolean replace(K, V, V); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -58287,6 +58288,9 @@ package java.util { ctor public Hashtable(java.util.Map<? extends K, ? extends V>); method public synchronized void clear(); method public synchronized java.lang.Object clone(); method public synchronized V compute(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized V computeIfAbsent(K, java.util.function.Function<? super K, ? extends V>); method public synchronized V computeIfPresent(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized boolean contains(java.lang.Object); method public synchronized boolean containsKey(java.lang.Object); method public boolean containsValue(java.lang.Object); Loading @@ -58294,13 +58298,19 @@ package java.util { 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 V getOrDefault(java.lang.Object, V); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); method public synchronized java.util.Enumeration<K> keys(); method public synchronized V merge(K, V, java.util.function.BiFunction<? super V, ? super V, ? extends V>); method public synchronized V put(K, V); method public synchronized void putAll(java.util.Map<? extends K, ? extends V>); method public synchronized V putIfAbsent(K, V); method protected void rehash(); method public synchronized V remove(java.lang.Object); method public synchronized boolean remove(java.lang.Object, java.lang.Object); method public synchronized boolean replace(K, V, V); method public synchronized V replace(K, V); method public synchronized int size(); method public java.util.Collection<V> values(); } Loading
api/current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -55649,6 +55649,7 @@ package java.util { 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>); method public boolean replace(K, V, V); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -55669,6 +55670,9 @@ package java.util { ctor public Hashtable(java.util.Map<? extends K, ? extends V>); method public synchronized void clear(); method public synchronized java.lang.Object clone(); method public synchronized V compute(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized V computeIfAbsent(K, java.util.function.Function<? super K, ? extends V>); method public synchronized V computeIfPresent(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized boolean contains(java.lang.Object); method public synchronized boolean containsKey(java.lang.Object); method public boolean containsValue(java.lang.Object); Loading @@ -55676,13 +55680,19 @@ package java.util { 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 V getOrDefault(java.lang.Object, V); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); method public synchronized java.util.Enumeration<K> keys(); method public synchronized V merge(K, V, java.util.function.BiFunction<? super V, ? super V, ? extends V>); method public synchronized V put(K, V); method public synchronized void putAll(java.util.Map<? extends K, ? extends V>); method public synchronized V putIfAbsent(K, V); method protected void rehash(); method public synchronized V remove(java.lang.Object); method public synchronized boolean remove(java.lang.Object, java.lang.Object); method public synchronized boolean replace(K, V, V); method public synchronized V replace(K, V); method public synchronized int size(); method public java.util.Collection<V> values(); }
api/system-current.txt +10 −0 Original line number Diff line number Diff line Loading @@ -58267,6 +58267,7 @@ package java.util { 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>); method public boolean replace(K, V, V); } public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set { Loading @@ -58287,6 +58288,9 @@ package java.util { ctor public Hashtable(java.util.Map<? extends K, ? extends V>); method public synchronized void clear(); method public synchronized java.lang.Object clone(); method public synchronized V compute(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized V computeIfAbsent(K, java.util.function.Function<? super K, ? extends V>); method public synchronized V computeIfPresent(K, java.util.function.BiFunction<? super K, ? super V, ? extends V>); method public synchronized boolean contains(java.lang.Object); method public synchronized boolean containsKey(java.lang.Object); method public boolean containsValue(java.lang.Object); Loading @@ -58294,13 +58298,19 @@ package java.util { 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 V getOrDefault(java.lang.Object, V); method public synchronized boolean isEmpty(); method public java.util.Set<K> keySet(); method public synchronized java.util.Enumeration<K> keys(); method public synchronized V merge(K, V, java.util.function.BiFunction<? super V, ? super V, ? extends V>); method public synchronized V put(K, V); method public synchronized void putAll(java.util.Map<? extends K, ? extends V>); method public synchronized V putIfAbsent(K, V); method protected void rehash(); method public synchronized V remove(java.lang.Object); method public synchronized boolean remove(java.lang.Object, java.lang.Object); method public synchronized boolean replace(K, V, V); method public synchronized V replace(K, V); method public synchronized int size(); method public java.util.Collection<V> values(); }