Partition { public SortedSet<Integer> copyBlock(int cellIndex) { return new TreeSet<Integer>(this.cells.get(cellIndex)); } Partition();  Partition(Partition other);  Partition(int[][] cellData); static Partition unit(int size); @Override boolean equals(Object o); @Override int hashCode(); int size(); int numberOfElements(); boolean isDiscrete(); Permutation toPermutation(); boolean inOrder(); int getFirstInCell(int cellIndex); SortedSet<Integer> getCell(int cellIndex); Partition splitBefore(int cellIndex, int splitElement); Partition splitAfter(int cellIndex, int splitElement); Permutation setAsPermutation(int upTo); boolean isDiscreteCell(int cellIndex); int getIndexOfFirstNonDiscreteCell(); void addSingletonCell(int element); void removeCell(int index); void addCell(int... elements); void addCell(Collection<Integer> elements); void addToCell(int index, int element); void insertCell(int index, SortedSet<Integer> cell); SortedSet<Integer> copyBlock(int cellIndex); void order(); boolean inSameCell(int elementI, int elementJ); @Override String toString(); static Partition fromString(String strForm);  }
@Test public void copyBlockTest() { int[][] cellData = new int[][]{{0}, {1}, {2}}; Partition p = new Partition(cellData); int cellIndex = 1; SortedSet<Integer> copyCell = p.copyBlock(cellIndex); SortedSet<Integer> refCell = p.getCell(cellIndex); Assert.assertTrue(copyCell != refCell); }