Skip to content

Commit

Permalink
Update @SInCE tags to @SInCE 23.1.
Browse files Browse the repository at this point in the history 
-------------
Created by MOE: https://github.com/google/moe
MOE_MIGRATED_REVID=170234714
  • Loading branch information
@cgdecker
cgdecker committed Sep 27, 2017
1 parent 956f843 commit e3b8c0b
Show file tree
Hide file tree
Showing 38 changed files with 98 additions and 98 deletions.
2 changes: 1 addition & 1 deletion android/guava/src/com/google/common/collect/ImmutableBiMap.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -127,7 +127,7 @@ public static <K, V> Builder<K, V> builder() {
* <p>It is not specified if any performance benefits apply if {@code expectedSize} is close to,
* but not exactly, the number of entries added to the builder.
*
* @since NEXT
* @since 23.1
*/
@Beta
public static <K, V> Builder<K, V> builderWithExpectedSize(int expectedSize) {
Expand Down
2 changes: 1 addition & 1 deletion android/guava/src/com/google/common/collect/ImmutableList.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -651,7 +651,7 @@ public static <E> Builder<E> builder() {
* <p>It is not specified if any performance benefits apply if {@code expectedSize} is close to,
* but not exactly, the number of elements added to the builder.
*
* @since NEXT
* @since 23.1
*/
@Beta
public static <E> Builder<E> builderWithExpectedSize(int expectedSize) {
Expand Down
2 changes: 1 addition & 1 deletion android/guava/src/com/google/common/collect/ImmutableMap.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -154,7 +154,7 @@ public static <K, V> Builder<K, V> builder() {
* <p>It is not specified if any performance benefits apply if {@code expectedSize} is close to,
* but not exactly, the number of entries added to the builder.
*
* @since NEXT
* @since 23.1
*/
@Beta
public static <K, V> Builder<K, V> builderWithExpectedSize(int expectedSize) {
Expand Down
2 changes: 1 addition & 1 deletion android/guava/src/com/google/common/collect/ImmutableSet.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -420,7 +420,7 @@ public static <E> Builder<E> builder() {
* <p>It is not specified if any performance benefits apply if {@code expectedSize} is close to,
* but not exactly, the number of distinct elements added to the builder.
*
* @since NEXT
* @since 23.1
*/
@Beta
public static <E> Builder<E> builderWithExpectedSize(int expectedSize) {
Expand Down
2 changes: 1 addition & 1 deletion android/guava/src/com/google/common/graph/Traverser.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
*
* @author Jens Nyman
* @param <N> Node parameter type
* @since NEXT
* @since 23.1
*/
@Beta
public abstract class Traverser<N> {
Expand Down
4 changes: 2 additions & 2 deletions android/guava/src/com/google/common/primitives/Booleans.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -528,7 +528,7 @@ public static int countTrue(boolean... values) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Booleans.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(boolean[] array) {
checkNotNull(array);
Expand All @@ -543,7 +543,7 @@ public static void reverse(boolean[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
4 changes: 2 additions & 2 deletions android/guava/src/com/google/common/primitives/Bytes.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -372,7 +372,7 @@ byte[] toByteArray() {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Bytes.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(byte[] array) {
checkNotNull(array);
Expand All @@ -387,7 +387,7 @@ public static void reverse(byte[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Chars.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -438,7 +438,7 @@ public static char[] toArray(Collection<Character> collection) {
/**
* Sorts the elements of {@code array} in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(char[] array) {
checkNotNull(array);
Expand All @@ -449,7 +449,7 @@ public static void sortDescending(char[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(char[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -462,7 +462,7 @@ public static void sortDescending(char[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Chars.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(char[] array) {
checkNotNull(array);
Expand All @@ -477,7 +477,7 @@ public static void reverse(char[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Doubles.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -406,7 +406,7 @@ public String toString() {
* <p>Note that this method uses the total order imposed by {@link Double#compare}, which treats
* all NaN values as equal and 0.0 as greater than -0.0.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(double[] array) {
checkNotNull(array);
Expand All @@ -420,7 +420,7 @@ public static void sortDescending(double[] array) {
* <p>Note that this method uses the total order imposed by {@link Double#compare}, which treats
* all NaN values as equal and 0.0 as greater than -0.0.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(double[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -433,7 +433,7 @@ public static void sortDescending(double[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Doubles.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(double[] array) {
checkNotNull(array);
Expand All @@ -448,7 +448,7 @@ public static void reverse(double[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Floats.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -404,7 +404,7 @@ public String toString() {
* <p>Note that this method uses the total order imposed by {@link Float#compare}, which treats
* all NaN values as equal and 0.0 as greater than -0.0.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(float[] array) {
checkNotNull(array);
Expand All @@ -418,7 +418,7 @@ public static void sortDescending(float[] array) {
* <p>Note that this method uses the total order imposed by {@link Float#compare}, which treats
* all NaN values as equal and 0.0 as greater than -0.0.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(float[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -431,7 +431,7 @@ public static void sortDescending(float[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Floats.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(float[] array) {
checkNotNull(array);
Expand All @@ -446,7 +446,7 @@ public static void reverse(float[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Ints.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ public String toString() {
/**
* Sorts the elements of {@code array} in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(int[] array) {
checkNotNull(array);
Expand All @@ -468,7 +468,7 @@ public static void sortDescending(int[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(int[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -481,7 +481,7 @@ public static void sortDescending(int[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Ints.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(int[] array) {
checkNotNull(array);
Expand All @@ -496,7 +496,7 @@ public static void reverse(int[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Longs.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -558,7 +558,7 @@ public String toString() {
/**
* Sorts the elements of {@code array} in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(long[] array) {
checkNotNull(array);
Expand All @@ -569,7 +569,7 @@ public static void sortDescending(long[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(long[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -582,7 +582,7 @@ public static void sortDescending(long[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Longs.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(long[] array) {
checkNotNull(array);
Expand All @@ -597,7 +597,7 @@ public static void reverse(long[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/Shorts.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ public String toString() {
/**
* Sorts the elements of {@code array} in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(short[] array) {
checkNotNull(array);
Expand All @@ -468,7 +468,7 @@ public static void sortDescending(short[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(short[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -481,7 +481,7 @@ public static void sortDescending(short[] array, int fromIndex, int toIndex) {
* Reverses the elements of {@code array}. This is equivalent to {@code
* Collections.reverse(Shorts.asList(array))}, but is likely to be more efficient.
*
* @since NEXT
* @since 23.1
*/
public static void reverse(short[] array) {
checkNotNull(array);
Expand All @@ -496,7 +496,7 @@ public static void reverse(short[] array) {
*
* @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
* {@code toIndex > fromIndex}
* @since NEXT
* @since 23.1
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
4 changes: 2 additions & 2 deletions android/guava/src/com/google/common/primitives/SignedBytes.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -197,7 +197,7 @@ public String toString() {
/**
* Sorts the elements of {@code array} in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(byte[] array) {
checkNotNull(array);
Expand All @@ -208,7 +208,7 @@ public static void sortDescending(byte[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(byte[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/UnsignedBytes.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -455,7 +455,7 @@ private static byte flip(byte b) {
/**
* Sorts the array, treating its elements as unsigned bytes.
*
* @since NEXT
* @since 23.1
*/
public static void sort(byte[] array) {
checkNotNull(array);
Expand All @@ -466,7 +466,7 @@ public static void sort(byte[] array) {
* Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its
* elements as unsigned bytes.
*
* @since NEXT
* @since 23.1
*/
public static void sort(byte[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -484,7 +484,7 @@ public static void sort(byte[] array, int fromIndex, int toIndex) {
* Sorts the elements of {@code array} in descending order, interpreting them as unsigned 8-bit
* integers.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(byte[] array) {
checkNotNull(array);
Expand All @@ -495,7 +495,7 @@ public static void sortDescending(byte[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order, interpreting them as unsigned 8-bit integers.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(byte[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
8 changes: 4 additions & 4 deletions android/guava/src/com/google/common/primitives/UnsignedInts.java
View file
Original file line number Diff line number Diff line change
Expand Up @@ -213,7 +213,7 @@ public String toString() {
/**
* Sorts the array, treating its elements as unsigned 32-bit integers.
*
* @since NEXT
* @since 23.1
*/
public static void sort(int[] array) {
checkNotNull(array);
Expand All @@ -224,7 +224,7 @@ public static void sort(int[] array) {
* Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its
* elements as unsigned 32-bit integers.
*
* @since NEXT
* @since 23.1
*/
public static void sort(int[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand All @@ -242,7 +242,7 @@ public static void sort(int[] array, int fromIndex, int toIndex) {
* Sorts the elements of {@code array} in descending order, interpreting them as unsigned 32-bit
* integers.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(int[] array) {
checkNotNull(array);
Expand All @@ -253,7 +253,7 @@ public static void sortDescending(int[] array) {
* Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
* exclusive in descending order, interpreting them as unsigned 32-bit integers.
*
* @since NEXT
* @since 23.1
*/
public static void sortDescending(int[] array, int fromIndex, int toIndex) {
checkNotNull(array);
Expand Down
Loading

0 comments on commit e3b8c0b

Please sign in to comment.