public List<LocalDate> top(int n){
  List<LocalDate> top=new ArrayList<>();
  int[] values=data.toIntArray();
  IntArrays.parallelQuickSort(values,ReverseIntComparator.instance());
  for (int i=0; i < n && i < values.length; i++) {
    top.add(PackedLocalDate.asLocalDate(values[i]));
  }
  return top;
}

public List < LocalDate > top ( int n ) { List < LocalDate > top = new ArrayList < > ( ) ; int [ ] values = data . toIntArray ( ) ; IntArrays . parallelQuickSort ( values , ReverseIntComparator . instance ( ) ) ; for ( int i = 0 ; i < n && i < values . length ; i ++ ) { top . add ( PackedLocalDate . asLocalDate ( values [ i ] ) ) ; } return top ; }
returns the largest ( " top " ) n values in the column
