Source code

001/*
002 * Copyright (C) 2008 The Guava Authors
003 *
004 * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
005 * in compliance with the License. You may obtain a copy of the License at
006 *
007 * http://www.apache.org/licenses/LICENSE-2.0
008 *
009 * Unless required by applicable law or agreed to in writing, software distributed under the License
010 * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
011 * or implied. See the License for the specific language governing permissions and limitations under
012 * the License.
013 */
014
015package com.google.common.primitives;
016
017import static com.google.common.base.Preconditions.checkArgument;
018import static com.google.common.base.Preconditions.checkElementIndex;
019import static com.google.common.base.Preconditions.checkNotNull;
020import static com.google.common.base.Preconditions.checkPositionIndexes;
021
022import com.google.common.annotations.GwtCompatible;
023import com.google.common.annotations.GwtIncompatible;
024import com.google.common.base.Converter;
025import com.google.errorprone.annotations.InlineMe;
026import java.io.Serializable;
027import java.util.AbstractList;
028import java.util.Arrays;
029import java.util.Collection;
030import java.util.Collections;
031import java.util.Comparator;
032import java.util.List;
033import java.util.RandomAccess;
034import javax.annotation.CheckForNull;
035
036/**
037 * Static utility methods pertaining to {@code short} primitives, that are not already found in
038 * either {@link Short} or {@link Arrays}.
039 *
040 * <p>See the Guava User Guide article on <a
041 * href="https://github.com/google/guava/wiki/PrimitivesExplained">primitive utilities</a>.
042 *
043 * @author Kevin Bourrillion
044 * @since 1.0
045 */
046@GwtCompatible(emulated = true)
047@ElementTypesAreNonnullByDefault
048public final class Shorts extends ShortsMethodsForWeb {
049  private Shorts() {}
050
051  /**
052   * The number of bytes required to represent a primitive {@code short} value.
053   *
054   * <p><b>Java 8+ users:</b> use {@link Short#BYTES} instead.
055   */
056  public static final int BYTES = Short.SIZE / Byte.SIZE;
057
058  /**
059   * The largest power of two that can be represented as a {@code short}.
060   *
061   * @since 10.0
062   */
063  public static final short MAX_POWER_OF_TWO = 1 << (Short.SIZE - 2);
064
065  /**
066   * Returns a hash code for {@code value}; equal to the result of invoking {@code ((Short)
067   * value).hashCode()}.
068   *
069   * <p><b>Java 8+ users:</b> use {@link Short#hashCode(short)} instead.
070   *
071   * @param value a primitive {@code short} value
072   * @return a hash code for the value
073   */
074  public static int hashCode(short value) {
075    return value;
076  }
077
078  /**
079   * Returns the {@code short} value that is equal to {@code value}, if possible.
080   *
081   * @param value any value in the range of the {@code short} type
082   * @return the {@code short} value that equals {@code value}
083   * @throws IllegalArgumentException if {@code value} is greater than {@link Short#MAX_VALUE} or
084   *     less than {@link Short#MIN_VALUE}
085   */
086  public static short checkedCast(long value) {
087    short result = (short) value;
088    checkArgument(result == value, "Out of range: %s", value);
089    return result;
090  }
091
092  /**
093   * Returns the {@code short} nearest in value to {@code value}.
094   *
095   * @param value any {@code long} value
096   * @return the same value cast to {@code short} if it is in the range of the {@code short} type,
097   *     {@link Short#MAX_VALUE} if it is too large, or {@link Short#MIN_VALUE} if it is too small
098   */
099  public static short saturatedCast(long value) {
100    if (value > Short.MAX_VALUE) {
101      return Short.MAX_VALUE;
102    }
103    if (value < Short.MIN_VALUE) {
104      return Short.MIN_VALUE;
105    }
106    return (short) value;
107  }
108
109  /**
110   * Compares the two specified {@code short} values. The sign of the value returned is the same as
111   * that of {@code ((Short) a).compareTo(b)}.
112   *
113   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the
114   * equivalent {@link Short#compare} method instead.
115   *
116   * @param a the first {@code short} to compare
117   * @param b the second {@code short} to compare
118   * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
119   *     greater than {@code b}; or zero if they are equal
120   */
121  @InlineMe(replacement = "Short.compare(a, b)")
122  public static int compare(short a, short b) {
123    return Short.compare(a, b);
124  }
125
126  /**
127   * Returns {@code true} if {@code target} is present as an element anywhere in {@code array}.
128   *
129   * @param array an array of {@code short} values, possibly empty
130   * @param target a primitive {@code short} value
131   * @return {@code true} if {@code array[i] == target} for some value of {@code i}
132   */
133  public static boolean contains(short[] array, short target) {
134    for (short value : array) {
135      if (value == target) {
136        return true;
137      }
138    }
139    return false;
140  }
141
142  /**
143   * Returns the index of the first appearance of the value {@code target} in {@code array}.
144   *
145   * @param array an array of {@code short} values, possibly empty
146   * @param target a primitive {@code short} value
147   * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no
148   *     such index exists.
149   */
150  public static int indexOf(short[] array, short target) {
151    return indexOf(array, target, 0, array.length);
152  }
153
154  // TODO(kevinb): consider making this public
155  private static int indexOf(short[] array, short target, int start, int end) {
156    for (int i = start; i < end; i++) {
157      if (array[i] == target) {
158        return i;
159      }
160    }
161    return -1;
162  }
163
164  /**
165   * Returns the start position of the first occurrence of the specified {@code target} within
166   * {@code array}, or {@code -1} if there is no such occurrence.
167   *
168   * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array,
169   * i, i + target.length)} contains exactly the same elements as {@code target}.
170   *
171   * @param array the array to search for the sequence {@code target}
172   * @param target the array to search for as a sub-sequence of {@code array}
173   */
174  public static int indexOf(short[] array, short[] target) {
175    checkNotNull(array, "array");
176    checkNotNull(target, "target");
177    if (target.length == 0) {
178      return 0;
179    }
180
181    outer:
182    for (int i = 0; i < array.length - target.length + 1; i++) {
183      for (int j = 0; j < target.length; j++) {
184        if (array[i + j] != target[j]) {
185          continue outer;
186        }
187      }
188      return i;
189    }
190    return -1;
191  }
192
193  /**
194   * Returns the index of the last appearance of the value {@code target} in {@code array}.
195   *
196   * @param array an array of {@code short} values, possibly empty
197   * @param target a primitive {@code short} value
198   * @return the greatest index {@code i} for which {@code array[i] == target}, or {@code -1} if no
199   *     such index exists.
200   */
201  public static int lastIndexOf(short[] array, short target) {
202    return lastIndexOf(array, target, 0, array.length);
203  }
204
205  // TODO(kevinb): consider making this public
206  private static int lastIndexOf(short[] array, short target, int start, int end) {
207    for (int i = end - 1; i >= start; i--) {
208      if (array[i] == target) {
209        return i;
210      }
211    }
212    return -1;
213  }
214
215  /**
216   * Returns the least value present in {@code array}.
217   *
218   * @param array a <i>nonempty</i> array of {@code short} values
219   * @return the value present in {@code array} that is less than or equal to every other value in
220   *     the array
221   * @throws IllegalArgumentException if {@code array} is empty
222   */
223  @GwtIncompatible(
224      "Available in GWT! Annotation is to avoid conflict with GWT specialization of base class.")
225  public static short min(short... array) {
226    checkArgument(array.length > 0);
227    short min = array[0];
228    for (int i = 1; i < array.length; i++) {
229      if (array[i] < min) {
230        min = array[i];
231      }
232    }
233    return min;
234  }
235
236  /**
237   * Returns the greatest value present in {@code array}.
238   *
239   * @param array a <i>nonempty</i> array of {@code short} values
240   * @return the value present in {@code array} that is greater than or equal to every other value
241   *     in the array
242   * @throws IllegalArgumentException if {@code array} is empty
243   */
244  @GwtIncompatible(
245      "Available in GWT! Annotation is to avoid conflict with GWT specialization of base class.")
246  public static short max(short... array) {
247    checkArgument(array.length > 0);
248    short max = array[0];
249    for (int i = 1; i < array.length; i++) {
250      if (array[i] > max) {
251        max = array[i];
252      }
253    }
254    return max;
255  }
256
257  /**
258   * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}.
259   *
260   * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned
261   * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
262   * value} is greater than {@code max}, {@code max} is returned.
263   *
264   * @param value the {@code short} value to constrain
265   * @param min the lower bound (inclusive) of the range to constrain {@code value} to
266   * @param max the upper bound (inclusive) of the range to constrain {@code value} to
267   * @throws IllegalArgumentException if {@code min > max}
268   * @since 21.0
269   */
270  public static short constrainToRange(short value, short min, short max) {
271    checkArgument(min <= max, "min (%s) must be less than or equal to max (%s)", min, max);
272    return value < min ? min : value < max ? value : max;
273  }
274
275  /**
276   * Returns the values from each provided array combined into a single array. For example, {@code
277   * concat(new short[] {a, b}, new short[] {}, new short[] {c}} returns the array {@code {a, b,
278   * c}}.
279   *
280   * @param arrays zero or more {@code short} arrays
281   * @return a single array containing all the values from the source arrays, in order
282   */
283  public static short[] concat(short[]... arrays) {
284    int length = 0;
285    for (short[] array : arrays) {
286      length += array.length;
287    }
288    short[] result = new short[length];
289    int pos = 0;
290    for (short[] array : arrays) {
291      System.arraycopy(array, 0, result, pos, array.length);
292      pos += array.length;
293    }
294    return result;
295  }
296
297  /**
298   * Returns a big-endian representation of {@code value} in a 2-element byte array; equivalent to
299   * {@code ByteBuffer.allocate(2).putShort(value).array()}. For example, the input value {@code
300   * (short) 0x1234} would yield the byte array {@code {0x12, 0x34}}.
301   *
302   * <p>If you need to convert and concatenate several values (possibly even of different types),
303   * use a shared {@link java.nio.ByteBuffer} instance, or use {@link
304   * com.google.common.io.ByteStreams#newDataOutput()} to get a growable buffer.
305   */
306  @GwtIncompatible // doesn't work
307  public static byte[] toByteArray(short value) {
308    return new byte[] {(byte) (value >> 8), (byte) value};
309  }
310
311  /**
312   * Returns the {@code short} value whose big-endian representation is stored in the first 2 bytes
313   * of {@code bytes}; equivalent to {@code ByteBuffer.wrap(bytes).getShort()}. For example, the
314   * input byte array {@code {0x54, 0x32}} would yield the {@code short} value {@code 0x5432}.
315   *
316   * <p>Arguably, it's preferable to use {@link java.nio.ByteBuffer}; that library exposes much more
317   * flexibility at little cost in readability.
318   *
319   * @throws IllegalArgumentException if {@code bytes} has fewer than 2 elements
320   */
321  @GwtIncompatible // doesn't work
322  public static short fromByteArray(byte[] bytes) {
323    checkArgument(bytes.length >= BYTES, "array too small: %s < %s", bytes.length, BYTES);
324    return fromBytes(bytes[0], bytes[1]);
325  }
326
327  /**
328   * Returns the {@code short} value whose byte representation is the given 2 bytes, in big-endian
329   * order; equivalent to {@code Shorts.fromByteArray(new byte[] {b1, b2})}.
330   *
331   * @since 7.0
332   */
333  @GwtIncompatible // doesn't work
334  public static short fromBytes(byte b1, byte b2) {
335    return (short) ((b1 << 8) | (b2 & 0xFF));
336  }
337
338  private static final class ShortConverter extends Converter<String, Short>
339      implements Serializable {
340    static final Converter<String, Short> INSTANCE = new ShortConverter();
341
342    @Override
343    protected Short doForward(String value) {
344      return Short.decode(value);
345    }
346
347    @Override
348    protected String doBackward(Short value) {
349      return value.toString();
350    }
351
352    @Override
353    public String toString() {
354      return "Shorts.stringConverter()";
355    }
356
357    private Object readResolve() {
358      return INSTANCE;
359    }
360
361    private static final long serialVersionUID = 1;
362  }
363
364  /**
365   * Returns a serializable converter object that converts between strings and shorts using {@link
366   * Short#decode} and {@link Short#toString()}. The returned converter throws {@link
367   * NumberFormatException} if the input string is invalid.
368   *
369   * <p><b>Warning:</b> please see {@link Short#decode} to understand exactly how strings are
370   * parsed. For example, the string {@code "0123"} is treated as <i>octal</i> and converted to the
371   * value {@code 83}.
372   *
373   * @since 16.0
374   */
375  public static Converter<String, Short> stringConverter() {
376    return ShortConverter.INSTANCE;
377  }
378
379  /**
380   * Returns an array containing the same values as {@code array}, but guaranteed to be of a
381   * specified minimum length. If {@code array} already has a length of at least {@code minLength},
382   * it is returned directly. Otherwise, a new array of size {@code minLength + padding} is
383   * returned, containing the values of {@code array}, and zeroes in the remaining places.
384   *
385   * @param array the source array
386   * @param minLength the minimum length the returned array must guarantee
387   * @param padding an extra amount to "grow" the array by if growth is necessary
388   * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative
389   * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
390   *     minLength}
391   */
392  public static short[] ensureCapacity(short[] array, int minLength, int padding) {
393    checkArgument(minLength >= 0, "Invalid minLength: %s", minLength);
394    checkArgument(padding >= 0, "Invalid padding: %s", padding);
395    return (array.length < minLength) ? Arrays.copyOf(array, minLength + padding) : array;
396  }
397
398  /**
399   * Returns a string containing the supplied {@code short} values separated by {@code separator}.
400   * For example, {@code join("-", (short) 1, (short) 2, (short) 3)} returns the string {@code
401   * "1-2-3"}.
402   *
403   * @param separator the text that should appear between consecutive values in the resulting string
404   *     (but not at the start or end)
405   * @param array an array of {@code short} values, possibly empty
406   */
407  public static String join(String separator, short... array) {
408    checkNotNull(separator);
409    if (array.length == 0) {
410      return "";
411    }
412
413    // For pre-sizing a builder, just get the right order of magnitude
414    StringBuilder builder = new StringBuilder(array.length * 6);
415    builder.append(array[0]);
416    for (int i = 1; i < array.length; i++) {
417      builder.append(separator).append(array[i]);
418    }
419    return builder.toString();
420  }
421
422  /**
423   * Returns a comparator that compares two {@code short} arrays <a
424   * href="http://en.wikipedia.org/wiki/Lexicographical_order">lexicographically</a>. That is, it
425   * compares, using {@link #compare(short, short)}), the first pair of values that follow any
426   * common prefix, or when one array is a prefix of the other, treats the shorter array as the
427   * lesser. For example, {@code [] < [(short) 1] < [(short) 1, (short) 2] < [(short) 2]}.
428   *
429   * <p>The returned comparator is inconsistent with {@link Object#equals(Object)} (since arrays
430   * support only identity equality), but it is consistent with {@link Arrays#equals(short[],
431   * short[])}.
432   *
433   * @since 2.0
434   */
435  public static Comparator<short[]> lexicographicalComparator() {
436    return LexicographicalComparator.INSTANCE;
437  }
438
439  private enum LexicographicalComparator implements Comparator<short[]> {
440    INSTANCE;
441
442    @Override
443    public int compare(short[] left, short[] right) {
444      int minLength = Math.min(left.length, right.length);
445      for (int i = 0; i < minLength; i++) {
446        int result = Short.compare(left[i], right[i]);
447        if (result != 0) {
448          return result;
449        }
450      }
451      return left.length - right.length;
452    }
453
454    @Override
455    public String toString() {
456      return "Shorts.lexicographicalComparator()";
457    }
458  }
459
460  /**
461   * Sorts the elements of {@code array} in descending order.
462   *
463   * @since 23.1
464   */
465  public static void sortDescending(short[] array) {
466    checkNotNull(array);
467    sortDescending(array, 0, array.length);
468  }
469
470  /**
471   * Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
472   * exclusive in descending order.
473   *
474   * @since 23.1
475   */
476  public static void sortDescending(short[] array, int fromIndex, int toIndex) {
477    checkNotNull(array);
478    checkPositionIndexes(fromIndex, toIndex, array.length);
479    Arrays.sort(array, fromIndex, toIndex);
480    reverse(array, fromIndex, toIndex);
481  }
482
483  /**
484   * Reverses the elements of {@code array}. This is equivalent to {@code
485   * Collections.reverse(Shorts.asList(array))}, but is likely to be more efficient.
486   *
487   * @since 23.1
488   */
489  public static void reverse(short[] array) {
490    checkNotNull(array);
491    reverse(array, 0, array.length);
492  }
493
494  /**
495   * Reverses the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
496   * exclusive. This is equivalent to {@code
497   * Collections.reverse(Shorts.asList(array).subList(fromIndex, toIndex))}, but is likely to be
498   * more efficient.
499   *
500   * @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
501   *     {@code toIndex > fromIndex}
502   * @since 23.1
503   */
504  public static void reverse(short[] array, int fromIndex, int toIndex) {
505    checkNotNull(array);
506    checkPositionIndexes(fromIndex, toIndex, array.length);
507    for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
508      short tmp = array[i];
509      array[i] = array[j];
510      array[j] = tmp;
511    }
512  }
513
514  /**
515   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
516   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance
517   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array),
518   * distance)}, but is considerably faster and avoids allocation and garbage collection.
519   *
520   * <p>The provided "distance" may be negative, which will rotate left.
521   *
522   * @since 32.0.0
523   */
524  public static void rotate(short[] array, int distance) {
525    rotate(array, distance, 0, array.length);
526  }
527
528  /**
529   * Performs a right rotation of {@code array} between {@code fromIndex} inclusive and {@code
530   * toIndex} exclusive. This is equivalent to {@code
531   * Collections.rotate(Shorts.asList(array).subList(fromIndex, toIndex), distance)}, but is
532   * considerably faster and avoids allocations and garbage collection.
533   *
534   * <p>The provided "distance" may be negative, which will rotate left.
535   *
536   * @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
537   *     {@code toIndex > fromIndex}
538   * @since 32.0.0
539   */
540  public static void rotate(short[] array, int distance, int fromIndex, int toIndex) {
541    // See Ints.rotate for more details about possible algorithms here.
542    checkNotNull(array);
543    checkPositionIndexes(fromIndex, toIndex, array.length);
544    if (array.length <= 1) {
545      return;
546    }
547
548    int length = toIndex - fromIndex;
549    // Obtain m = (-distance mod length), a non-negative value less than "length". This is how many
550    // places left to rotate.
551    int m = -distance % length;
552    m = (m < 0) ? m + length : m;
553    // The current index of what will become the first element of the rotated section.
554    int newFirstIndex = m + fromIndex;
555    if (newFirstIndex == fromIndex) {
556      return;
557    }
558
559    reverse(array, fromIndex, newFirstIndex);
560    reverse(array, newFirstIndex, toIndex);
561    reverse(array, fromIndex, toIndex);
562  }
563
564  /**
565   * Returns an array containing each value of {@code collection}, converted to a {@code short}
566   * value in the manner of {@link Number#shortValue}.
567   *
568   * <p>Elements are copied from the argument collection as if by {@code collection.toArray()}.
569   * Calling this method is as thread-safe as calling that method.
570   *
571   * @param collection a collection of {@code Number} instances
572   * @return an array containing the same values as {@code collection}, in the same order, converted
573   *     to primitives
574   * @throws NullPointerException if {@code collection} or any of its elements is null
575   * @since 1.0 (parameter was {@code Collection<Short>} before 12.0)
576   */
577  public static short[] toArray(Collection<? extends Number> collection) {
578    if (collection instanceof ShortArrayAsList) {
579      return ((ShortArrayAsList) collection).toShortArray();
580    }
581
582    Object[] boxedArray = collection.toArray();
583    int len = boxedArray.length;
584    short[] array = new short[len];
585    for (int i = 0; i < len; i++) {
586      // checkNotNull for GWT (do not optimize)
587      array[i] = ((Number) checkNotNull(boxedArray[i])).shortValue();
588    }
589    return array;
590  }
591
592  /**
593   * Returns a fixed-size list backed by the specified array, similar to {@link
594   * Arrays#asList(Object[])}. The list supports {@link List#set(int, Object)}, but any attempt to
595   * set a value to {@code null} will result in a {@link NullPointerException}.
596   *
597   * <p>The returned list maintains the values, but not the identities, of {@code Short} objects
598   * written to or read from it. For example, whether {@code list.get(0) == list.get(0)} is true for
599   * the returned list is unspecified.
600   *
601   * <p>The returned list is serializable.
602   *
603   * @param backingArray the array to back the list
604   * @return a list view of the array
605   */
606  public static List<Short> asList(short... backingArray) {
607    if (backingArray.length == 0) {
608      return Collections.emptyList();
609    }
610    return new ShortArrayAsList(backingArray);
611  }
612
613  @GwtCompatible
614  private static class ShortArrayAsList extends AbstractList<Short>
615      implements RandomAccess, Serializable {
616    final short[] array;
617    final int start;
618    final int end;
619
620    ShortArrayAsList(short[] array) {
621      this(array, 0, array.length);
622    }
623
624    ShortArrayAsList(short[] array, int start, int end) {
625      this.array = array;
626      this.start = start;
627      this.end = end;
628    }
629
630    @Override
631    public int size() {
632      return end - start;
633    }
634
635    @Override
636    public boolean isEmpty() {
637      return false;
638    }
639
640    @Override
641    public Short get(int index) {
642      checkElementIndex(index, size());
643      return array[start + index];
644    }
645
646    @Override
647    public boolean contains(@CheckForNull Object target) {
648      // Overridden to prevent a ton of boxing
649      return (target instanceof Short) && Shorts.indexOf(array, (Short) target, start, end) != -1;
650    }
651
652    @Override
653    public int indexOf(@CheckForNull Object target) {
654      // Overridden to prevent a ton of boxing
655      if (target instanceof Short) {
656        int i = Shorts.indexOf(array, (Short) target, start, end);
657        if (i >= 0) {
658          return i - start;
659        }
660      }
661      return -1;
662    }
663
664    @Override
665    public int lastIndexOf(@CheckForNull Object target) {
666      // Overridden to prevent a ton of boxing
667      if (target instanceof Short) {
668        int i = Shorts.lastIndexOf(array, (Short) target, start, end);
669        if (i >= 0) {
670          return i - start;
671        }
672      }
673      return -1;
674    }
675
676    @Override
677    public Short set(int index, Short element) {
678      checkElementIndex(index, size());
679      short oldValue = array[start + index];
680      // checkNotNull for GWT (do not optimize)
681      array[start + index] = checkNotNull(element);
682      return oldValue;
683    }
684
685    @Override
686    public List<Short> subList(int fromIndex, int toIndex) {
687      int size = size();
688      checkPositionIndexes(fromIndex, toIndex, size);
689      if (fromIndex == toIndex) {
690        return Collections.emptyList();
691      }
692      return new ShortArrayAsList(array, start + fromIndex, start + toIndex);
693    }
694
695    @Override
696    public boolean equals(@CheckForNull Object object) {
697      if (object == this) {
698        return true;
699      }
700      if (object instanceof ShortArrayAsList) {
701        ShortArrayAsList that = (ShortArrayAsList) object;
702        int size = size();
703        if (that.size() != size) {
704          return false;
705        }
706        for (int i = 0; i < size; i++) {
707          if (array[start + i] != that.array[that.start + i]) {
708            return false;
709          }
710        }
711        return true;
712      }
713      return super.equals(object);
714    }
715
716    @Override
717    public int hashCode() {
718      int result = 1;
719      for (int i = start; i < end; i++) {
720        result = 31 * result + Shorts.hashCode(array[i]);
721      }
722      return result;
723    }
724
725    @Override
726    public String toString() {
727      StringBuilder builder = new StringBuilder(size() * 6);
728      builder.append('[').append(array[start]);
729      for (int i = start + 1; i < end; i++) {
730        builder.append(", ").append(array[i]);
731      }
732      return builder.append(']').toString();
733    }
734
735    short[] toShortArray() {
736      return Arrays.copyOfRange(array, start, end);
737    }
738
739    private static final long serialVersionUID = 0;
740  }
741}