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

Commit 51969bff authored by Przemyslaw Szczepaniak's avatar Przemyslaw Szczepaniak Committed by android-build-merger
Browse files

Merge "Track libcore change e42e99816ad6c0626564aaabcf636e8febc1edc6"

am: ffa1c084

* commit 'ffa1c084':
  Track libcore change e42e99816ad6c0626564aaabcf636e8febc1edc6
parents 00b594e5 ffa1c084
Loading
Loading
Loading
Loading
+10 −0
Original line number Diff line number Diff line
@@ -48555,6 +48555,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();
  }
@@ -52031,6 +52032,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);
@@ -54982,6 +54984,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();
@@ -55545,6 +55548,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 {
@@ -55569,6 +55573,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();
@@ -55587,6 +55592,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 {
@@ -55826,6 +55832,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();
@@ -56287,6 +56294,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);
@@ -56369,6 +56377,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);
@@ -56392,6 +56401,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>);
  }
}
+10 −0
Original line number Diff line number Diff line
@@ -51173,6 +51173,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();
  }
@@ -54649,6 +54650,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);
@@ -57600,6 +57602,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();
@@ -58163,6 +58166,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 {
@@ -58187,6 +58191,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();
@@ -58205,6 +58210,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 {
@@ -58444,6 +58450,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();
@@ -58905,6 +58912,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);
@@ -58987,6 +58995,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);
@@ -59010,6 +59019,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>);
  }
}