RBTreeSortedMap		RBTreeSortedMap
	Compiled from "RBTreeSortedMap.java"		Compiled from "RBTreeSortedMap.java"
	public class com.google.firebase.database.collection.RBTreeSortedMap<K, V> exten ds com.google.firebase.database.collection.ImmutableSortedMap<K, V> {		public class com.google.firebase.database.collection.RBTreeSortedMap<K, V> exten ds com.google.firebase.database.collection.ImmutableSortedMap<K, V> {
	com.google.firebase.database.collection.RBTreeSortedMap(java.util.Comparator<K >);		com.google.firebase.database.collection.RBTreeSortedMap(java.util.Comparator<K >);
			public static <A, B, C> com.google.firebase.database.collection.RBTreeSortedMa p<A, C> buildFrom(java.util.List<A>, java.util.Map<B, C>, com.google.firebase.da tabase.collection.ImmutableSortedMap$Builder$KeyTranslator<A, B>, java.util.Comp arator<A>);
			public static <A, B> com.google.firebase.database.collection.RBTreeSortedMap<A , B> fromMap(java.util.Map<A, B>, java.util.Comparator<A>);
	com.google.firebase.database.collection.LLRBNode<K, V> getRoot();		com.google.firebase.database.collection.LLRBNode<K, V> getRoot();
	public boolean containsKey(K);		public boolean containsKey(K);
	public V get(K);		public V get(K);
	public com.google.firebase.database.collection.ImmutableSortedMap<K, V> remove (K);		public com.google.firebase.database.collection.ImmutableSortedMap<K, V> remove (K);
	public com.google.firebase.database.collection.ImmutableSortedMap<K, V> insert (K, V);		public com.google.firebase.database.collection.ImmutableSortedMap<K, V> insert (K, V);
	public K getMinKey();		public K getMinKey();
	public K getMaxKey();		public K getMaxKey();
	public int size();		public int size();
	public boolean isEmpty();		public boolean isEmpty();
	public void inOrderTraversal(com.google.firebase.database.collection.LLRBNode$ NodeVisitor<K, V>);		public void inOrderTraversal(com.google.firebase.database.collection.LLRBNode$ NodeVisitor<K, V>);
	public java.util.Iterator<java.util.Map$Entry<K, V>> iterator();		public java.util.Iterator<java.util.Map$Entry<K, V>> iterator();
	public java.util.Iterator<java.util.Map$Entry<K, V>> iteratorFrom(K);		public java.util.Iterator<java.util.Map$Entry<K, V>> iteratorFrom(K);
	public java.util.Iterator<java.util.Map$Entry<K, V>> reverseIteratorFrom(K);		public java.util.Iterator<java.util.Map$Entry<K, V>> reverseIteratorFrom(K);
	public java.util.Iterator<java.util.Map$Entry<K, V>> reverseIterator();		public java.util.Iterator<java.util.Map$Entry<K, V>> reverseIterator();
	public K getPredecessorKey(K);		public K getPredecessorKey(K);
	public K getSuccessorKey(K);		public K getSuccessorKey(K);
	public java.util.Comparator<K> getComparator();		public java.util.Comparator<K> getComparator();
	public static <A, B, C> com.google.firebase.database.collection.RBTreeSortedMa p<A, C> buildFrom(java.util.List<A>, java.util.Map<B, C>, com.google.firebase.da tabase.collection.ImmutableSortedMap$Builder$KeyTranslator<A, B>, java.util.Comp arator<A>);
	public static <A, B> com.google.firebase.database.collection.RBTreeSortedMap<A , B> fromMap(java.util.Map<A, B>, java.util.Comparator<A>);
	com.google.firebase.database.collection.RBTreeSortedMap(com.google.firebase.da tabase.collection.LLRBNode, java.util.Comparator, com.google.firebase.database.c ollection.RBTreeSortedMap$1);		com.google.firebase.database.collection.RBTreeSortedMap(com.google.firebase.da tabase.collection.LLRBNode, java.util.Comparator, com.google.firebase.database.c ollection.RBTreeSortedMap$1);
	}		}
End of changes. 2 change blocks.
	2 lines changed or deleted		2 lines changed or added
This html diff was produced by rfcdiff 1.41