Aditya Manthramurthy <******@****.***> 1711669489 -0700

Pengyuan Bian <******@****.***> 1625172474 -0700

Martin Taillefer <******@****.***> 1568244741 -0700

Google Java Core Libraries <******@****.***> 1608076568 -0500

Pengyuan Bian <******@****.***> 1625172474 -0700

Ben Leggett <******@****.***> 1714685380 -0400

Pengyuan Bian <******@****.***> 1625172474 -0700

      // k is really large; just do a straightforward sorted-copy-and-sublist
      ArrayList<E> list = Lists.newArrayList(iterator);
      Collections.sort(list, this);
      if (list.size() > k) {
        list.subList(k, list.size()).clear();
      }
      list.trimToSize();
      return Collections.unmodifiableList(list);
    } else {
      TopKSelector<E> selector = TopKSelector.least(k, this);

      return asList(all).subList(2, elements.length + 2);
    }
  }

  private static Character[] concat(Character[] left, Character[] right) {
    Character[] result = new Character[left.length + right.length];
    System.arraycopy(left, 0, result, 0, left.length);
    System.arraycopy(right, 0, result, left.length, right.length);
    return result;
  }

      return asList(all).subList(2, elements.length + 2);
    }
  }

  private static Double[] concat(Double[] left, Double[] right) {
    Double[] result = new Double[left.length + right.length];
    System.arraycopy(left, 0, result, 0, left.length);
    System.arraycopy(right, 0, result, left.length, right.length);
    return result;
  }