Lists and Arrays of objects that implement Comparable interface can be sorted automatically by Collections.sort and Arrays.sort respectively. Implementation Comparable is easy. You just have to implement compareTo(Object o). It should return negative integer, zero, or a positive integer as this object is less than, equal to,or greater than the specified object. Here goes an example: public void testListSort(){ Calendar cal = Calendar.getInstance(); cal.set(2010, 10, 1); License msWindows7 = new License("Windows", "7",new Date(cal.getTimeInMillis())); cal.clear(); cal.set(2010, 11, 10); License msWindowsVista = new License("Windows", "Vista", new Date(cal.getTimeInMillis())); cal.clear(); cal.set(2010, 11, 5); License lotusNotes = new License("Notes", "1.1", new Date(cal.getTimeInMillis())); List list = new ArrayList (3); list.add(lotusNotes); ...
"Java talks" is about Java technologies including: Hibernate, JDO, JDBC, Servlet, JSP, Sturts, Web Services, Spring, AWS, Spring Boot, Spark, Scala etc.