Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 09839517 authored by Shubham Ajmera's avatar Shubham Ajmera Committed by android-build-merger
Browse files

Merge "Track libcore change 135ea6cd4f7ebe2f225351a1928d8a62bce5cb00" into nyc-dev

am: 68b19f27

* commit '68b19f27':
  Track libcore change 135ea6cd4f7ebe2f225351a1928d8a62bce5cb00

Change-Id: Ic7d284eb2a8467e24884fe4fb786127d57951244
parents 6b2e8122 68b19f27
Loading
Loading
Loading
Loading
+4 −0
Original line number Diff line number Diff line
@@ -58042,6 +58042,7 @@ package java.util {
    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);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
  public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set {
@@ -58085,6 +58086,7 @@ package java.util {
    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 void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public synchronized int size();
    method public java.util.Collection<V> values();
  }
@@ -59066,6 +59068,7 @@ package java.util {
    method public java.util.NavigableSet<K> navigableKeySet();
    method public java.util.Map.Entry<K, V> pollFirstEntry();
    method public java.util.Map.Entry<K, V> pollLastEntry();
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public java.util.NavigableMap<K, V> subMap(K, boolean, K, boolean);
    method public java.util.SortedMap<K, V> subMap(K, K);
    method public java.util.NavigableMap<K, V> tailMap(K, boolean);
@@ -59167,6 +59170,7 @@ package java.util {
    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>);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
}
+4 −0
Original line number Diff line number Diff line
@@ -61155,6 +61155,7 @@ package java.util {
    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);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
  public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set {
@@ -61198,6 +61199,7 @@ package java.util {
    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 void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public synchronized int size();
    method public java.util.Collection<V> values();
  }
@@ -62179,6 +62181,7 @@ package java.util {
    method public java.util.NavigableSet<K> navigableKeySet();
    method public java.util.Map.Entry<K, V> pollFirstEntry();
    method public java.util.Map.Entry<K, V> pollLastEntry();
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public java.util.NavigableMap<K, V> subMap(K, boolean, K, boolean);
    method public java.util.SortedMap<K, V> subMap(K, K);
    method public java.util.NavigableMap<K, V> tailMap(K, boolean);
@@ -62280,6 +62283,7 @@ package java.util {
    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>);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
}
+4 −0
Original line number Diff line number Diff line
@@ -58120,6 +58120,7 @@ package java.util {
    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);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
  public class HashSet extends java.util.AbstractSet implements java.lang.Cloneable java.io.Serializable java.util.Set {
@@ -58163,6 +58164,7 @@ package java.util {
    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 void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public synchronized int size();
    method public java.util.Collection<V> values();
  }
@@ -59144,6 +59146,7 @@ package java.util {
    method public java.util.NavigableSet<K> navigableKeySet();
    method public java.util.Map.Entry<K, V> pollFirstEntry();
    method public java.util.Map.Entry<K, V> pollLastEntry();
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
    method public java.util.NavigableMap<K, V> subMap(K, boolean, K, boolean);
    method public java.util.SortedMap<K, V> subMap(K, K);
    method public java.util.NavigableMap<K, V> tailMap(K, boolean);
@@ -59245,6 +59248,7 @@ package java.util {
    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>);
    method public void replaceAll(java.util.function.BiFunction<? super K, ? super V, ? extends V>);
  }
}