// adds entries in sorted order
svoid test_compareTreeSetSizes(int n default 1000) {
  test_compareTreeSetSizes(uniquifyAndSort(repF(n, -> randomID(6))));
}
  
svoid test_compareTreeSetSizes(LS data) {  
  print("Entries: " + n2(data));
  long payloadSize = sumOfObjectSizes(data);
  var sorted = sorted(data);
  
  L<Set<S>> sets = ll(
    new TreeSet(data),
    new CompactTreeSet(data),
    new UltraCompactTreeSet(data),
    new MegaCompactTreeSet(data),
    new HyperCompactTreeSet(data));
    
  for (set : sets) {
    assertEquals(toList(set), sorted);
    print(className(set) + " OK, bytes per entry: " + formatDoubleRatio(guessObjectSize(set)-payloadSize, l(data), 4));
  }
}