@Test public void test() { final List<Integer> input = Arrays.asList(2, 4, 6, 8, 10, 12, 14, 16, 18, 20); assertEquals(10, input.size()); List<Integer> resEqual = CollectionUtils.truncateRand(input, 10); assertArrayEquals(input.toArray(), resEqual.toArray()); List<Integer> resEqual2 = CollectionUtils.truncateRand(input, 20); assertArrayEquals(input.toArray(), resEqual2.toArray()); Set<Integer> excluded = new HashSet<>(); for (int i = 0; i < 1000; ++i) { List<Integer> resMinusOne = CollectionUtils.truncateRand(input, 9); Set<Integer> resMinusOneSet = new HashSet<>(resMinusOne); assertEquals(resMinusOne.size(), resMinusOneSet.size()); AtomicInteger exclusionCounter = new AtomicInteger(0); input.forEach(x -> { if(!resMinusOneSet.contains(x)) { excluded.add(x); exclusionCounter.getAndIncrement(); } }); assertEquals(1, exclusionCounter.get()); } assertEquals("Someday I'll fail due to the nature of random", 10, excluded.size()); Set<Integer> included = new HashSet<>(); for (int i = 0; i < 1000; ++i) { List<Integer> resOne = CollectionUtils.truncateRand(input, 1); included.add(resOne.get(0)); assertTrue(input.contains(resOne.get(0))); } assertEquals("Someday I'll fail due to the nature of random", 10, included.size()); assertEquals(3, CollectionUtils.truncateRand(input, 3).size()); }
public static <T> List<T> truncateRand(final List<T> items, int limit) { if(limit > items.size()) { return new ArrayList<>(items); } List<T> truncated = new ArrayList<>(limit); LinkedList<Integer> index = new LinkedList<>(); for (int i = 0; i < items.size(); ++i) { index.add(i); } if (limit * 2 < items.size()) { Set<Integer> smallIndex = new HashSet<>(); for (int i = 0; i < limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); smallIndex.add(index.remove(randomNum)); } smallIndex.forEach(i -> truncated.add(items.get(i))); } else { for (int i = 0; i < items.size() - limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); index.remove(randomNum); } index.forEach(i -> truncated.add(items.get(i))); } return truncated; }
CollectionUtils { public static <T> List<T> truncateRand(final List<T> items, int limit) { if(limit > items.size()) { return new ArrayList<>(items); } List<T> truncated = new ArrayList<>(limit); LinkedList<Integer> index = new LinkedList<>(); for (int i = 0; i < items.size(); ++i) { index.add(i); } if (limit * 2 < items.size()) { Set<Integer> smallIndex = new HashSet<>(); for (int i = 0; i < limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); smallIndex.add(index.remove(randomNum)); } smallIndex.forEach(i -> truncated.add(items.get(i))); } else { for (int i = 0; i < items.size() - limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); index.remove(randomNum); } index.forEach(i -> truncated.add(items.get(i))); } return truncated; } }
CollectionUtils { public static <T> List<T> truncateRand(final List<T> items, int limit) { if(limit > items.size()) { return new ArrayList<>(items); } List<T> truncated = new ArrayList<>(limit); LinkedList<Integer> index = new LinkedList<>(); for (int i = 0; i < items.size(); ++i) { index.add(i); } if (limit * 2 < items.size()) { Set<Integer> smallIndex = new HashSet<>(); for (int i = 0; i < limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); smallIndex.add(index.remove(randomNum)); } smallIndex.forEach(i -> truncated.add(items.get(i))); } else { for (int i = 0; i < items.size() - limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); index.remove(randomNum); } index.forEach(i -> truncated.add(items.get(i))); } return truncated; }  }
CollectionUtils { public static <T> List<T> truncateRand(final List<T> items, int limit) { if(limit > items.size()) { return new ArrayList<>(items); } List<T> truncated = new ArrayList<>(limit); LinkedList<Integer> index = new LinkedList<>(); for (int i = 0; i < items.size(); ++i) { index.add(i); } if (limit * 2 < items.size()) { Set<Integer> smallIndex = new HashSet<>(); for (int i = 0; i < limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); smallIndex.add(index.remove(randomNum)); } smallIndex.forEach(i -> truncated.add(items.get(i))); } else { for (int i = 0; i < items.size() - limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); index.remove(randomNum); } index.forEach(i -> truncated.add(items.get(i))); } return truncated; }  static List<T> truncate(final List<T> items, int limit); static List<T> truncateRand(final List<T> items, int limit); }
CollectionUtils { public static <T> List<T> truncateRand(final List<T> items, int limit) { if(limit > items.size()) { return new ArrayList<>(items); } List<T> truncated = new ArrayList<>(limit); LinkedList<Integer> index = new LinkedList<>(); for (int i = 0; i < items.size(); ++i) { index.add(i); } if (limit * 2 < items.size()) { Set<Integer> smallIndex = new HashSet<>(); for (int i = 0; i < limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); smallIndex.add(index.remove(randomNum)); } smallIndex.forEach(i -> truncated.add(items.get(i))); } else { for (int i = 0; i < items.size() - limit; ++i) { int randomNum = ThreadLocalRandom.current().nextInt(0, index.size()); index.remove(randomNum); } index.forEach(i -> truncated.add(items.get(i))); } return truncated; }  static List<T> truncate(final List<T> items, int limit); static List<T> truncateRand(final List<T> items, int limit);  }